./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w128_d8_e0.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w128_d8_e0.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash cc215c1310f8b4d8a3ef1501261e91ba08e9c5718658396972a4e0020f5cf43f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 01:54:34,884 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 01:54:34,941 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-10 01:54:34,945 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 01:54:34,946 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 01:54:34,981 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 01:54:34,982 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 01:54:34,982 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 01:54:34,983 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 01:54:34,984 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 01:54:34,985 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 01:54:34,985 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 01:54:34,985 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 01:54:34,986 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 01:54:34,987 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 01:54:34,987 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 01:54:34,987 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 01:54:34,988 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 01:54:34,988 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 01:54:34,988 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 01:54:34,988 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 01:54:34,988 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 01:54:34,991 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 01:54:34,992 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 01:54:34,992 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 01:54:34,992 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 01:54:34,992 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 01:54:34,992 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 01:54:34,992 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 01:54:34,993 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 01:54:34,993 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 01:54:34,993 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 01:54:34,993 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 01:54:34,993 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 01:54:34,993 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 01:54:34,993 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 01:54:34,994 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 01:54:34,994 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 01:54:34,994 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 01:54:34,994 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cc215c1310f8b4d8a3ef1501261e91ba08e9c5718658396972a4e0020f5cf43f [2024-11-10 01:54:35,190 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 01:54:35,207 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 01:54:35,210 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 01:54:35,211 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 01:54:35,211 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 01:54:35,212 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w128_d8_e0.c [2024-11-10 01:54:36,645 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 01:54:36,898 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 01:54:36,899 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w128_d8_e0.c [2024-11-10 01:54:36,910 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ad5b93a2/3728c13457484d03b701ceef9d82f041/FLAG8b2190483 [2024-11-10 01:54:36,924 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ad5b93a2/3728c13457484d03b701ceef9d82f041 [2024-11-10 01:54:36,927 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 01:54:36,929 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 01:54:36,930 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 01:54:36,930 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 01:54:36,935 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 01:54:36,938 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:54:36" (1/1) ... [2024-11-10 01:54:36,939 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@762cd2a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:54:36, skipping insertion in model container [2024-11-10 01:54:36,939 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:54:36" (1/1) ... [2024-11-10 01:54:36,987 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 01:54:37,187 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w128_d8_e0.c[1334,1347] [2024-11-10 01:54:37,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 01:54:37,316 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 01:54:37,324 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w128_d8_e0.c[1334,1347] [2024-11-10 01:54:37,387 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 01:54:37,403 INFO L204 MainTranslator]: Completed translation [2024-11-10 01:54:37,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:54:37 WrapperNode [2024-11-10 01:54:37,404 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 01:54:37,405 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 01:54:37,405 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 01:54:37,405 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 01:54:37,410 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:54:37" (1/1) ... [2024-11-10 01:54:37,465 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:54:37" (1/1) ... [2024-11-10 01:54:37,776 INFO L138 Inliner]: procedures = 18, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1382 [2024-11-10 01:54:37,776 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 01:54:37,777 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 01:54:37,777 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 01:54:37,777 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 01:54:37,795 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:54:37" (1/1) ... [2024-11-10 01:54:37,795 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:54:37" (1/1) ... [2024-11-10 01:54:37,831 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:54:37" (1/1) ... [2024-11-10 01:54:37,883 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 01:54:37,887 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:54:37" (1/1) ... [2024-11-10 01:54:37,887 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:54:37" (1/1) ... [2024-11-10 01:54:37,921 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:54:37" (1/1) ... [2024-11-10 01:54:37,928 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:54:37" (1/1) ... [2024-11-10 01:54:37,938 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:54:37" (1/1) ... [2024-11-10 01:54:37,948 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:54:37" (1/1) ... [2024-11-10 01:54:37,963 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 01:54:37,965 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 01:54:37,965 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 01:54:37,965 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 01:54:37,965 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:54:37" (1/1) ... [2024-11-10 01:54:37,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 01:54:37,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 01:54:37,995 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 01:54:37,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 01:54:38,030 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 01:54:38,031 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 01:54:38,031 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 01:54:38,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 01:54:38,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 01:54:38,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 01:54:38,190 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 01:54:38,192 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 01:54:39,200 INFO L? ?]: Removed 754 outVars from TransFormulas that were not future-live. [2024-11-10 01:54:39,201 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 01:54:39,263 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 01:54:39,265 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 01:54:39,265 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 01:54:39 BoogieIcfgContainer [2024-11-10 01:54:39,265 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 01:54:39,268 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 01:54:39,268 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 01:54:39,271 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 01:54:39,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 01:54:36" (1/3) ... [2024-11-10 01:54:39,271 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f2ba151 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:54:39, skipping insertion in model container [2024-11-10 01:54:39,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:54:37" (2/3) ... [2024-11-10 01:54:39,272 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f2ba151 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:54:39, skipping insertion in model container [2024-11-10 01:54:39,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 01:54:39" (3/3) ... [2024-11-10 01:54:39,274 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.circular_pointer_top_w128_d8_e0.c [2024-11-10 01:54:39,286 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 01:54:39,286 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 01:54:39,351 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 01:54:39,358 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;@3cef8a35, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 01:54:39,359 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 01:54:39,365 INFO L276 IsEmpty]: Start isEmpty. Operand has 395 states, 389 states have (on average 1.4884318766066837) internal successors, (579), 390 states have internal predecessors, (579), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:54:39,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-10 01:54:39,380 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:54:39,381 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:54:39,383 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:54:39,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:54:39,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1130703786, now seen corresponding path program 1 times [2024-11-10 01:54:39,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:54:39,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583138254] [2024-11-10 01:54:39,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:54:39,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:54:39,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:39,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:54:39,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:39,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 01:54:39,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:39,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 01:54:39,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:39,756 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:54:39,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:54:39,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583138254] [2024-11-10 01:54:39,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583138254] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:54:39,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:54:39,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 01:54:39,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420935980] [2024-11-10 01:54:39,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:54:39,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 01:54:39,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:54:39,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 01:54:39,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 01:54:39,789 INFO L87 Difference]: Start difference. First operand has 395 states, 389 states have (on average 1.4884318766066837) internal successors, (579), 390 states have internal predecessors, (579), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 53.0) internal successors, (106), 2 states have internal predecessors, (106), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 01:54:39,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:54:39,954 INFO L93 Difference]: Finished difference Result 715 states and 1065 transitions. [2024-11-10 01:54:39,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 01:54:39,961 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 53.0) internal successors, (106), 2 states have internal predecessors, (106), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 118 [2024-11-10 01:54:39,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:54:39,987 INFO L225 Difference]: With dead ends: 715 [2024-11-10 01:54:39,987 INFO L226 Difference]: Without dead ends: 390 [2024-11-10 01:54:39,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 01:54:39,995 INFO L432 NwaCegarLoop]: 485 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:54:39,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 485 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:54:40,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-11-10 01:54:40,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2024-11-10 01:54:40,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 385 states have (on average 1.4857142857142858) internal successors, (572), 385 states have internal predecessors, (572), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:54:40,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 578 transitions. [2024-11-10 01:54:40,048 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 578 transitions. Word has length 118 [2024-11-10 01:54:40,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:54:40,049 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 578 transitions. [2024-11-10 01:54:40,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 53.0) internal successors, (106), 2 states have internal predecessors, (106), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 01:54:40,049 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 578 transitions. [2024-11-10 01:54:40,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-10 01:54:40,053 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:54:40,056 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:54:40,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 01:54:40,057 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:54:40,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:54:40,058 INFO L85 PathProgramCache]: Analyzing trace with hash 165064281, now seen corresponding path program 1 times [2024-11-10 01:54:40,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:54:40,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130168913] [2024-11-10 01:54:40,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:54:40,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:54:40,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:40,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:54:40,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:40,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 01:54:40,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:40,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 01:54:40,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:40,762 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:54:40,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:54:40,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130168913] [2024-11-10 01:54:40,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130168913] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:54:40,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:54:40,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:54:40,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371288997] [2024-11-10 01:54:40,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:54:40,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:54:40,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:54:40,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:54:40,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:54:40,767 INFO L87 Difference]: Start difference. First operand 390 states and 578 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:54:40,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:54:40,948 INFO L93 Difference]: Finished difference Result 395 states and 583 transitions. [2024-11-10 01:54:40,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:54:40,948 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 118 [2024-11-10 01:54:40,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:54:40,950 INFO L225 Difference]: With dead ends: 395 [2024-11-10 01:54:40,950 INFO L226 Difference]: Without dead ends: 392 [2024-11-10 01:54:40,951 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:54:40,952 INFO L432 NwaCegarLoop]: 483 mSDtfsCounter, 0 mSDsluCounter, 961 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1444 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:54:40,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1444 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:54:40,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-11-10 01:54:40,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-11-10 01:54:40,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.483204134366925) internal successors, (574), 387 states have internal predecessors, (574), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:54:40,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 580 transitions. [2024-11-10 01:54:40,963 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 580 transitions. Word has length 118 [2024-11-10 01:54:40,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:54:40,964 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 580 transitions. [2024-11-10 01:54:40,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:54:40,964 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 580 transitions. [2024-11-10 01:54:40,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-10 01:54:40,966 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:54:40,966 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:54:40,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 01:54:40,966 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:54:40,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:54:40,967 INFO L85 PathProgramCache]: Analyzing trace with hash 967079114, now seen corresponding path program 1 times [2024-11-10 01:54:40,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:54:40,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752181577] [2024-11-10 01:54:40,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:54:40,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:54:41,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:41,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:54:41,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:41,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 01:54:41,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:41,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 01:54:41,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:41,250 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:54:41,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:54:41,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752181577] [2024-11-10 01:54:41,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752181577] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:54:41,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:54:41,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:54:41,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268276797] [2024-11-10 01:54:41,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:54:41,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:54:41,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:54:41,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:54:41,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:54:41,252 INFO L87 Difference]: Start difference. First operand 392 states and 580 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:54:41,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:54:41,741 INFO L93 Difference]: Finished difference Result 973 states and 1443 transitions. [2024-11-10 01:54:41,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 01:54:41,742 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 119 [2024-11-10 01:54:41,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:54:41,744 INFO L225 Difference]: With dead ends: 973 [2024-11-10 01:54:41,744 INFO L226 Difference]: Without dead ends: 392 [2024-11-10 01:54:41,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 01:54:41,746 INFO L432 NwaCegarLoop]: 526 mSDtfsCounter, 1091 mSDsluCounter, 893 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1091 SdHoareTripleChecker+Valid, 1419 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 01:54:41,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1091 Valid, 1419 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 01:54:41,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-11-10 01:54:41,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-11-10 01:54:41,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4806201550387597) internal successors, (573), 387 states have internal predecessors, (573), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:54:41,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 579 transitions. [2024-11-10 01:54:41,760 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 579 transitions. Word has length 119 [2024-11-10 01:54:41,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:54:41,761 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 579 transitions. [2024-11-10 01:54:41,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:54:41,761 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 579 transitions. [2024-11-10 01:54:41,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-10 01:54:41,762 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:54:41,762 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:54:41,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 01:54:41,763 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:54:41,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:54:41,763 INFO L85 PathProgramCache]: Analyzing trace with hash 806869547, now seen corresponding path program 1 times [2024-11-10 01:54:41,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:54:41,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708752850] [2024-11-10 01:54:41,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:54:41,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:54:41,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:42,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:54:42,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:42,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 01:54:42,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:42,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 01:54:42,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:42,043 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:54:42,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:54:42,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708752850] [2024-11-10 01:54:42,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708752850] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:54:42,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:54:42,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:54:42,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352381239] [2024-11-10 01:54:42,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:54:42,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:54:42,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:54:42,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:54:42,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:54:42,045 INFO L87 Difference]: Start difference. First operand 392 states and 579 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:54:42,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:54:42,227 INFO L93 Difference]: Finished difference Result 716 states and 1057 transitions. [2024-11-10 01:54:42,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:54:42,228 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 120 [2024-11-10 01:54:42,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:54:42,229 INFO L225 Difference]: With dead ends: 716 [2024-11-10 01:54:42,230 INFO L226 Difference]: Without dead ends: 394 [2024-11-10 01:54:42,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:54:42,231 INFO L432 NwaCegarLoop]: 482 mSDtfsCounter, 0 mSDsluCounter, 956 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1438 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:54:42,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1438 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:54:42,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-10 01:54:42,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2024-11-10 01:54:42,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 389 states have (on average 1.4781491002570695) internal successors, (575), 389 states have internal predecessors, (575), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:54:42,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 581 transitions. [2024-11-10 01:54:42,239 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 581 transitions. Word has length 120 [2024-11-10 01:54:42,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:54:42,240 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 581 transitions. [2024-11-10 01:54:42,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:54:42,240 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 581 transitions. [2024-11-10 01:54:42,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-10 01:54:42,241 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:54:42,241 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:54:42,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 01:54:42,242 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:54:42,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:54:42,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1009603939, now seen corresponding path program 1 times [2024-11-10 01:54:42,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:54:42,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248439074] [2024-11-10 01:54:42,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:54:42,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:54:42,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:42,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:54:42,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:42,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 01:54:42,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:42,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 01:54:42,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:42,830 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:54:42,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:54:42,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248439074] [2024-11-10 01:54:42,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248439074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:54:42,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:54:42,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:54:42,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604070459] [2024-11-10 01:54:42,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:54:42,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:54:42,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:54:42,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:54:42,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:54:42,833 INFO L87 Difference]: Start difference. First operand 394 states and 581 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:54:43,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:54:43,194 INFO L93 Difference]: Finished difference Result 718 states and 1058 transitions. [2024-11-10 01:54:43,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:54:43,197 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 121 [2024-11-10 01:54:43,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:54:43,200 INFO L225 Difference]: With dead ends: 718 [2024-11-10 01:54:43,200 INFO L226 Difference]: Without dead ends: 394 [2024-11-10 01:54:43,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:54:43,204 INFO L432 NwaCegarLoop]: 450 mSDtfsCounter, 481 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 01:54:43,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 902 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 01:54:43,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-10 01:54:43,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2024-11-10 01:54:43,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 389 states have (on average 1.4755784061696657) internal successors, (574), 389 states have internal predecessors, (574), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:54:43,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 580 transitions. [2024-11-10 01:54:43,233 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 580 transitions. Word has length 121 [2024-11-10 01:54:43,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:54:43,233 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 580 transitions. [2024-11-10 01:54:43,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:54:43,234 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 580 transitions. [2024-11-10 01:54:43,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-10 01:54:43,236 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:54:43,238 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:54:43,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 01:54:43,238 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:54:43,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:54:43,239 INFO L85 PathProgramCache]: Analyzing trace with hash 531562967, now seen corresponding path program 1 times [2024-11-10 01:54:43,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:54:43,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224727195] [2024-11-10 01:54:43,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:54:43,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:54:43,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:43,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:54:43,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:43,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 01:54:43,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:43,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 01:54:43,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:43,576 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:54:43,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:54:43,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224727195] [2024-11-10 01:54:43,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224727195] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:54:43,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:54:43,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:54:43,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554009865] [2024-11-10 01:54:43,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:54:43,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:54:43,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:54:43,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:54:43,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:54:43,578 INFO L87 Difference]: Start difference. First operand 394 states and 580 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:54:43,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:54:43,802 INFO L93 Difference]: Finished difference Result 722 states and 1061 transitions. [2024-11-10 01:54:43,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 01:54:43,802 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 122 [2024-11-10 01:54:43,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:54:43,803 INFO L225 Difference]: With dead ends: 722 [2024-11-10 01:54:43,804 INFO L226 Difference]: Without dead ends: 394 [2024-11-10 01:54:43,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 01:54:43,805 INFO L432 NwaCegarLoop]: 476 mSDtfsCounter, 488 mSDsluCounter, 930 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 1406 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:54:43,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 1406 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:54:43,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-10 01:54:43,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2024-11-10 01:54:43,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 389 states have (on average 1.4730077120822622) internal successors, (573), 389 states have internal predecessors, (573), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:54:43,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 579 transitions. [2024-11-10 01:54:43,814 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 579 transitions. Word has length 122 [2024-11-10 01:54:43,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:54:43,815 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 579 transitions. [2024-11-10 01:54:43,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:54:43,815 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 579 transitions. [2024-11-10 01:54:43,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-10 01:54:43,816 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:54:43,816 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:54:43,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 01:54:43,816 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:54:43,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:54:43,817 INFO L85 PathProgramCache]: Analyzing trace with hash -72278937, now seen corresponding path program 1 times [2024-11-10 01:54:43,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:54:43,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909568888] [2024-11-10 01:54:43,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:54:43,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:54:43,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:44,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:54:44,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:44,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 01:54:44,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:44,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 01:54:44,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:44,083 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:54:44,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:54:44,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909568888] [2024-11-10 01:54:44,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909568888] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:54:44,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:54:44,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:54:44,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985997348] [2024-11-10 01:54:44,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:54:44,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:54:44,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:54:44,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:54:44,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:54:44,086 INFO L87 Difference]: Start difference. First operand 394 states and 579 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:54:44,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:54:44,288 INFO L93 Difference]: Finished difference Result 718 states and 1054 transitions. [2024-11-10 01:54:44,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:54:44,289 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 123 [2024-11-10 01:54:44,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:54:44,290 INFO L225 Difference]: With dead ends: 718 [2024-11-10 01:54:44,291 INFO L226 Difference]: Without dead ends: 394 [2024-11-10 01:54:44,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 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-11-10 01:54:44,297 INFO L432 NwaCegarLoop]: 450 mSDtfsCounter, 1041 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1044 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:54:44,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1044 Valid, 902 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:54:44,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-10 01:54:44,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2024-11-10 01:54:44,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 389 states have (on average 1.4704370179948587) internal successors, (572), 389 states have internal predecessors, (572), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:54:44,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 578 transitions. [2024-11-10 01:54:44,304 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 578 transitions. Word has length 123 [2024-11-10 01:54:44,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:54:44,304 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 578 transitions. [2024-11-10 01:54:44,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:54:44,305 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 578 transitions. [2024-11-10 01:54:44,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-10 01:54:44,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:54:44,306 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:54:44,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 01:54:44,311 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:54:44,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:54:44,312 INFO L85 PathProgramCache]: Analyzing trace with hash -84426446, now seen corresponding path program 1 times [2024-11-10 01:54:44,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:54:44,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322029714] [2024-11-10 01:54:44,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:54:44,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:54:44,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:44,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:54:44,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:44,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 01:54:44,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:44,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 01:54:44,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:44,523 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:54:44,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:54:44,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322029714] [2024-11-10 01:54:44,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322029714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:54:44,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:54:44,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:54:44,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763352458] [2024-11-10 01:54:44,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:54:44,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:54:44,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:54:44,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:54:44,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:54:44,525 INFO L87 Difference]: Start difference. First operand 394 states and 578 transitions. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:54:44,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:54:44,730 INFO L93 Difference]: Finished difference Result 718 states and 1052 transitions. [2024-11-10 01:54:44,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:54:44,731 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 124 [2024-11-10 01:54:44,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:54:44,733 INFO L225 Difference]: With dead ends: 718 [2024-11-10 01:54:44,733 INFO L226 Difference]: Without dead ends: 394 [2024-11-10 01:54:44,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 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-11-10 01:54:44,734 INFO L432 NwaCegarLoop]: 450 mSDtfsCounter, 1027 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1030 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:54:44,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1030 Valid, 902 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:54:44,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-10 01:54:44,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2024-11-10 01:54:44,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 389 states have (on average 1.467866323907455) internal successors, (571), 389 states have internal predecessors, (571), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:54:44,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 577 transitions. [2024-11-10 01:54:44,741 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 577 transitions. Word has length 124 [2024-11-10 01:54:44,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:54:44,741 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 577 transitions. [2024-11-10 01:54:44,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:54:44,741 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 577 transitions. [2024-11-10 01:54:44,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-10 01:54:44,742 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:54:44,742 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:54:44,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 01:54:44,743 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:54:44,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:54:44,743 INFO L85 PathProgramCache]: Analyzing trace with hash -850844761, now seen corresponding path program 1 times [2024-11-10 01:54:44,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:54:44,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397203843] [2024-11-10 01:54:44,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:54:44,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:54:44,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:45,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:54:45,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:45,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 01:54:45,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:45,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 01:54:45,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:45,063 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:54:45,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:54:45,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397203843] [2024-11-10 01:54:45,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397203843] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:54:45,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:54:45,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:54:45,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180198722] [2024-11-10 01:54:45,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:54:45,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:54:45,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:54:45,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:54:45,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:54:45,065 INFO L87 Difference]: Start difference. First operand 394 states and 577 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:54:45,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:54:45,224 INFO L93 Difference]: Finished difference Result 717 states and 1049 transitions. [2024-11-10 01:54:45,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:54:45,224 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 125 [2024-11-10 01:54:45,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:54:45,226 INFO L225 Difference]: With dead ends: 717 [2024-11-10 01:54:45,226 INFO L226 Difference]: Without dead ends: 393 [2024-11-10 01:54:45,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:54:45,227 INFO L432 NwaCegarLoop]: 462 mSDtfsCounter, 480 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:54:45,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 926 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:54:45,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-10 01:54:45,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2024-11-10 01:54:45,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 388 states have (on average 1.4639175257731958) internal successors, (568), 388 states have internal predecessors, (568), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:54:45,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 574 transitions. [2024-11-10 01:54:45,233 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 574 transitions. Word has length 125 [2024-11-10 01:54:45,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:54:45,233 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 574 transitions. [2024-11-10 01:54:45,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:54:45,234 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 574 transitions. [2024-11-10 01:54:45,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-10 01:54:45,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:54:45,234 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:54:45,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 01:54:45,235 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:54:45,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:54:45,235 INFO L85 PathProgramCache]: Analyzing trace with hash 175803282, now seen corresponding path program 1 times [2024-11-10 01:54:45,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:54:45,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355779572] [2024-11-10 01:54:45,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:54:45,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:54:45,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:45,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:54:45,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:45,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 01:54:45,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:45,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 01:54:45,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:45,466 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:54:45,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:54:45,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355779572] [2024-11-10 01:54:45,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355779572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:54:45,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:54:45,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:54:45,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706718090] [2024-11-10 01:54:45,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:54:45,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:54:45,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:54:45,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:54:45,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:54:45,468 INFO L87 Difference]: Start difference. First operand 393 states and 574 transitions. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:54:45,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:54:45,655 INFO L93 Difference]: Finished difference Result 718 states and 1046 transitions. [2024-11-10 01:54:45,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 01:54:45,656 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 126 [2024-11-10 01:54:45,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:54:45,657 INFO L225 Difference]: With dead ends: 718 [2024-11-10 01:54:45,657 INFO L226 Difference]: Without dead ends: 393 [2024-11-10 01:54:45,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 01:54:45,658 INFO L432 NwaCegarLoop]: 472 mSDtfsCounter, 484 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 1410 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:54:45,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 1410 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:54:45,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-10 01:54:45,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2024-11-10 01:54:45,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 388 states have (on average 1.461340206185567) internal successors, (567), 388 states have internal predecessors, (567), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:54:45,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 573 transitions. [2024-11-10 01:54:45,665 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 573 transitions. Word has length 126 [2024-11-10 01:54:45,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:54:45,665 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 573 transitions. [2024-11-10 01:54:45,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:54:45,665 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 573 transitions. [2024-11-10 01:54:45,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-10 01:54:45,666 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:54:45,666 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:54:45,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 01:54:45,667 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:54:45,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:54:45,667 INFO L85 PathProgramCache]: Analyzing trace with hash 366624428, now seen corresponding path program 1 times [2024-11-10 01:54:45,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:54:45,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681460304] [2024-11-10 01:54:45,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:54:45,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:54:45,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:45,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:54:45,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:45,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 01:54:45,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:45,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 01:54:45,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:45,945 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:54:45,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:54:45,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681460304] [2024-11-10 01:54:45,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681460304] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:54:45,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:54:45,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:54:45,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324939546] [2024-11-10 01:54:45,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:54:45,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:54:45,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:54:45,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:54:45,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:54:45,947 INFO L87 Difference]: Start difference. First operand 393 states and 573 transitions. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 01:54:46,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:54:46,116 INFO L93 Difference]: Finished difference Result 716 states and 1042 transitions. [2024-11-10 01:54:46,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:54:46,116 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 127 [2024-11-10 01:54:46,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:54:46,118 INFO L225 Difference]: With dead ends: 716 [2024-11-10 01:54:46,118 INFO L226 Difference]: Without dead ends: 393 [2024-11-10 01:54:46,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:54:46,119 INFO L432 NwaCegarLoop]: 464 mSDtfsCounter, 518 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:54:46,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 930 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:54:46,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-10 01:54:46,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2024-11-10 01:54:46,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 388 states have (on average 1.458762886597938) internal successors, (566), 388 states have internal predecessors, (566), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:54:46,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 572 transitions. [2024-11-10 01:54:46,125 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 572 transitions. Word has length 127 [2024-11-10 01:54:46,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:54:46,126 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 572 transitions. [2024-11-10 01:54:46,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 01:54:46,126 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 572 transitions. [2024-11-10 01:54:46,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-10 01:54:46,126 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:54:46,127 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:54:46,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 01:54:46,127 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:54:46,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:54:46,127 INFO L85 PathProgramCache]: Analyzing trace with hash 24445107, now seen corresponding path program 1 times [2024-11-10 01:54:46,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:54:46,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504318749] [2024-11-10 01:54:46,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:54:46,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:54:46,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:46,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:54:46,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:46,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-10 01:54:46,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:46,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-10 01:54:46,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:46,549 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:54:46,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:54:46,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504318749] [2024-11-10 01:54:46,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504318749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:54:46,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:54:46,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:54:46,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662798764] [2024-11-10 01:54:46,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:54:46,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:54:46,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:54:46,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:54:46,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:54:46,551 INFO L87 Difference]: Start difference. First operand 393 states and 572 transitions. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 01:54:46,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:54:46,727 INFO L93 Difference]: Finished difference Result 716 states and 1040 transitions. [2024-11-10 01:54:46,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:54:46,728 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 128 [2024-11-10 01:54:46,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:54:46,730 INFO L225 Difference]: With dead ends: 716 [2024-11-10 01:54:46,730 INFO L226 Difference]: Without dead ends: 393 [2024-11-10 01:54:46,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:54:46,731 INFO L432 NwaCegarLoop]: 464 mSDtfsCounter, 516 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:54:46,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 930 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:54:46,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-10 01:54:46,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2024-11-10 01:54:46,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 388 states have (on average 1.4561855670103092) internal successors, (565), 388 states have internal predecessors, (565), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:54:46,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 571 transitions. [2024-11-10 01:54:46,739 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 571 transitions. Word has length 128 [2024-11-10 01:54:46,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:54:46,739 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 571 transitions. [2024-11-10 01:54:46,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 01:54:46,739 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 571 transitions. [2024-11-10 01:54:46,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-10 01:54:46,740 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:54:46,740 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:54:46,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 01:54:46,741 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:54:46,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:54:46,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1843434888, now seen corresponding path program 1 times [2024-11-10 01:54:46,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:54:46,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190747470] [2024-11-10 01:54:46,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:54:46,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:54:46,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:47,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:54:47,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:47,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:54:47,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:47,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 01:54:47,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:47,076 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:54:47,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:54:47,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190747470] [2024-11-10 01:54:47,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190747470] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:54:47,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:54:47,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:54:47,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917124750] [2024-11-10 01:54:47,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:54:47,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:54:47,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:54:47,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:54:47,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:54:47,079 INFO L87 Difference]: Start difference. First operand 393 states and 571 transitions. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:54:47,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:54:47,295 INFO L93 Difference]: Finished difference Result 716 states and 1038 transitions. [2024-11-10 01:54:47,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:54:47,296 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 129 [2024-11-10 01:54:47,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:54:47,297 INFO L225 Difference]: With dead ends: 716 [2024-11-10 01:54:47,297 INFO L226 Difference]: Without dead ends: 393 [2024-11-10 01:54:47,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:54:47,302 INFO L432 NwaCegarLoop]: 460 mSDtfsCounter, 476 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:54:47,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 922 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:54:47,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-10 01:54:47,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2024-11-10 01:54:47,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 388 states have (on average 1.4536082474226804) internal successors, (564), 388 states have internal predecessors, (564), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:54:47,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 570 transitions. [2024-11-10 01:54:47,314 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 570 transitions. Word has length 129 [2024-11-10 01:54:47,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:54:47,314 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 570 transitions. [2024-11-10 01:54:47,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:54:47,314 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 570 transitions. [2024-11-10 01:54:47,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-10 01:54:47,315 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:54:47,315 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:54:47,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 01:54:47,319 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:54:47,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:54:47,320 INFO L85 PathProgramCache]: Analyzing trace with hash -851809868, now seen corresponding path program 1 times [2024-11-10 01:54:47,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:54:47,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032713260] [2024-11-10 01:54:47,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:54:47,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:54:47,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:47,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:54:47,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:47,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:54:47,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:47,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 01:54:47,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:47,837 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:54:47,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:54:47,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032713260] [2024-11-10 01:54:47,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032713260] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:54:47,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:54:47,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:54:47,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292378665] [2024-11-10 01:54:47,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:54:47,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:54:47,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:54:47,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:54:47,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:54:47,839 INFO L87 Difference]: Start difference. First operand 393 states and 570 transitions. Second operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:54:48,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:54:48,184 INFO L93 Difference]: Finished difference Result 722 states and 1044 transitions. [2024-11-10 01:54:48,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 01:54:48,186 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 130 [2024-11-10 01:54:48,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:54:48,188 INFO L225 Difference]: With dead ends: 722 [2024-11-10 01:54:48,188 INFO L226 Difference]: Without dead ends: 397 [2024-11-10 01:54:48,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:54:48,189 INFO L432 NwaCegarLoop]: 469 mSDtfsCounter, 2 mSDsluCounter, 1284 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1753 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 01:54:48,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1753 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 01:54:48,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-11-10 01:54:48,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 395. [2024-11-10 01:54:48,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 390 states have (on average 1.4512820512820512) internal successors, (566), 390 states have internal predecessors, (566), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:54:48,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 572 transitions. [2024-11-10 01:54:48,198 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 572 transitions. Word has length 130 [2024-11-10 01:54:48,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:54:48,198 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 572 transitions. [2024-11-10 01:54:48,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:54:48,198 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 572 transitions. [2024-11-10 01:54:48,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-10 01:54:48,199 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:54:48,200 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:54:48,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 01:54:48,201 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:54:48,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:54:48,201 INFO L85 PathProgramCache]: Analyzing trace with hash -738772122, now seen corresponding path program 1 times [2024-11-10 01:54:48,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:54:48,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582111855] [2024-11-10 01:54:48,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:54:48,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:54:48,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:48,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:54:48,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:48,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:54:48,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:48,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 01:54:48,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:48,590 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:54:48,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:54:48,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582111855] [2024-11-10 01:54:48,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582111855] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:54:48,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:54:48,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:54:48,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901757441] [2024-11-10 01:54:48,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:54:48,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:54:48,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:54:48,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:54:48,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:54:48,593 INFO L87 Difference]: Start difference. First operand 395 states and 572 transitions. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:54:48,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:54:48,800 INFO L93 Difference]: Finished difference Result 720 states and 1040 transitions. [2024-11-10 01:54:48,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:54:48,801 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 131 [2024-11-10 01:54:48,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:54:48,802 INFO L225 Difference]: With dead ends: 720 [2024-11-10 01:54:48,802 INFO L226 Difference]: Without dead ends: 395 [2024-11-10 01:54:48,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:54:48,805 INFO L432 NwaCegarLoop]: 444 mSDtfsCounter, 469 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:54:48,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 890 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:54:48,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2024-11-10 01:54:48,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2024-11-10 01:54:48,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 390 states have (on average 1.4487179487179487) internal successors, (565), 390 states have internal predecessors, (565), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:54:48,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 571 transitions. [2024-11-10 01:54:48,816 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 571 transitions. Word has length 131 [2024-11-10 01:54:48,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:54:48,816 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 571 transitions. [2024-11-10 01:54:48,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:54:48,816 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 571 transitions. [2024-11-10 01:54:48,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-10 01:54:48,817 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:54:48,818 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:54:48,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 01:54:48,818 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:54:48,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:54:48,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1930057447, now seen corresponding path program 1 times [2024-11-10 01:54:48,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:54:48,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943449543] [2024-11-10 01:54:48,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:54:48,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:54:48,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:49,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:54:49,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:49,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:54:49,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:49,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 01:54:49,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:49,290 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:54:49,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:54:49,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943449543] [2024-11-10 01:54:49,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943449543] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:54:49,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:54:49,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:54:49,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143714866] [2024-11-10 01:54:49,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:54:49,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:54:49,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:54:49,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:54:49,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:54:49,293 INFO L87 Difference]: Start difference. First operand 395 states and 571 transitions. Second operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:54:49,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:54:49,556 INFO L93 Difference]: Finished difference Result 720 states and 1038 transitions. [2024-11-10 01:54:49,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:54:49,557 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 132 [2024-11-10 01:54:49,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:54:49,558 INFO L225 Difference]: With dead ends: 720 [2024-11-10 01:54:49,559 INFO L226 Difference]: Without dead ends: 395 [2024-11-10 01:54:49,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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-11-10 01:54:49,560 INFO L432 NwaCegarLoop]: 444 mSDtfsCounter, 926 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 926 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:54:49,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [926 Valid, 890 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:54:49,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2024-11-10 01:54:49,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2024-11-10 01:54:49,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 390 states have (on average 1.4461538461538461) internal successors, (564), 390 states have internal predecessors, (564), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:54:49,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 570 transitions. [2024-11-10 01:54:49,570 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 570 transitions. Word has length 132 [2024-11-10 01:54:49,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:54:49,571 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 570 transitions. [2024-11-10 01:54:49,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:54:49,571 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 570 transitions. [2024-11-10 01:54:49,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-10 01:54:49,572 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:54:49,572 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:54:49,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 01:54:49,573 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:54:49,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:54:49,573 INFO L85 PathProgramCache]: Analyzing trace with hash 427142582, now seen corresponding path program 1 times [2024-11-10 01:54:49,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:54:49,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116313148] [2024-11-10 01:54:49,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:54:49,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:54:49,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:49,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:54:49,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:49,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:54:49,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:49,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 01:54:49,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:49,970 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:54:49,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:54:49,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116313148] [2024-11-10 01:54:49,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116313148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:54:49,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:54:49,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:54:49,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556165898] [2024-11-10 01:54:49,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:54:49,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:54:49,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:54:49,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:54:49,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:54:49,972 INFO L87 Difference]: Start difference. First operand 395 states and 570 transitions. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:54:50,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:54:50,286 INFO L93 Difference]: Finished difference Result 720 states and 1036 transitions. [2024-11-10 01:54:50,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:54:50,286 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 133 [2024-11-10 01:54:50,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:54:50,288 INFO L225 Difference]: With dead ends: 720 [2024-11-10 01:54:50,289 INFO L226 Difference]: Without dead ends: 395 [2024-11-10 01:54:50,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:54:50,290 INFO L432 NwaCegarLoop]: 444 mSDtfsCounter, 464 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 01:54:50,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 897 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 01:54:50,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2024-11-10 01:54:50,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2024-11-10 01:54:50,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 390 states have (on average 1.4435897435897436) internal successors, (563), 390 states have internal predecessors, (563), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:54:50,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 569 transitions. [2024-11-10 01:54:50,308 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 569 transitions. Word has length 133 [2024-11-10 01:54:50,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:54:50,309 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 569 transitions. [2024-11-10 01:54:50,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:54:50,310 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 569 transitions. [2024-11-10 01:54:50,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-10 01:54:50,311 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:54:50,311 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:54:50,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 01:54:50,312 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:54:50,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:54:50,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1214820777, now seen corresponding path program 1 times [2024-11-10 01:54:50,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:54:50,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441267374] [2024-11-10 01:54:50,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:54:50,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:54:50,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:51,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:54:51,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:51,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:54:51,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:51,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 01:54:51,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:51,152 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:54:51,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:54:51,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441267374] [2024-11-10 01:54:51,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441267374] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:54:51,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:54:51,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:54:51,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580421911] [2024-11-10 01:54:51,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:54:51,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:54:51,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:54:51,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:54:51,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:54:51,155 INFO L87 Difference]: Start difference. First operand 395 states and 569 transitions. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:54:51,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:54:51,423 INFO L93 Difference]: Finished difference Result 765 states and 1089 transitions. [2024-11-10 01:54:51,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 01:54:51,424 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 134 [2024-11-10 01:54:51,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:54:51,425 INFO L225 Difference]: With dead ends: 765 [2024-11-10 01:54:51,426 INFO L226 Difference]: Without dead ends: 440 [2024-11-10 01:54:51,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:54:51,427 INFO L432 NwaCegarLoop]: 466 mSDtfsCounter, 17 mSDsluCounter, 1390 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1856 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:54:51,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1856 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:54:51,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2024-11-10 01:54:51,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 438. [2024-11-10 01:54:51,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 433 states have (on average 1.418013856812933) internal successors, (614), 433 states have internal predecessors, (614), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:54:51,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 620 transitions. [2024-11-10 01:54:51,437 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 620 transitions. Word has length 134 [2024-11-10 01:54:51,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:54:51,438 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 620 transitions. [2024-11-10 01:54:51,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:54:51,438 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 620 transitions. [2024-11-10 01:54:51,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-10 01:54:51,439 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:54:51,440 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:54:51,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 01:54:51,440 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:54:51,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:54:51,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1709401434, now seen corresponding path program 1 times [2024-11-10 01:54:51,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:54:51,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354781711] [2024-11-10 01:54:51,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:54:51,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:54:51,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:51,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:54:51,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:51,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:54:51,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:51,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 01:54:51,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:51,941 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:54:51,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:54:51,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354781711] [2024-11-10 01:54:51,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354781711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:54:51,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:54:51,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 01:54:51,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068460628] [2024-11-10 01:54:51,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:54:51,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 01:54:51,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:54:51,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 01:54:51,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 01:54:51,945 INFO L87 Difference]: Start difference. First operand 438 states and 620 transitions. Second operand has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 7 states have internal predecessors, (123), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:54:52,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:54:52,462 INFO L93 Difference]: Finished difference Result 884 states and 1247 transitions. [2024-11-10 01:54:52,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 01:54:52,462 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 7 states have internal predecessors, (123), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 135 [2024-11-10 01:54:52,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:54:52,464 INFO L225 Difference]: With dead ends: 884 [2024-11-10 01:54:52,464 INFO L226 Difference]: Without dead ends: 442 [2024-11-10 01:54:52,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-10 01:54:52,465 INFO L432 NwaCegarLoop]: 449 mSDtfsCounter, 645 mSDsluCounter, 1687 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 648 SdHoareTripleChecker+Valid, 2136 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 01:54:52,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [648 Valid, 2136 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 01:54:52,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2024-11-10 01:54:52,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 440. [2024-11-10 01:54:52,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 435 states have (on average 1.4137931034482758) internal successors, (615), 435 states have internal predecessors, (615), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:54:52,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 621 transitions. [2024-11-10 01:54:52,478 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 621 transitions. Word has length 135 [2024-11-10 01:54:52,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:54:52,478 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 621 transitions. [2024-11-10 01:54:52,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 7 states have internal predecessors, (123), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:54:52,479 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 621 transitions. [2024-11-10 01:54:52,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-10 01:54:52,480 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:54:52,480 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:54:52,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 01:54:52,480 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:54:52,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:54:52,481 INFO L85 PathProgramCache]: Analyzing trace with hash 442097416, now seen corresponding path program 1 times [2024-11-10 01:54:52,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:54:52,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022924131] [2024-11-10 01:54:52,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:54:52,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:54:52,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:53,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 01:54:53,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:53,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 01:54:53,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:53,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 01:54:53,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:53,212 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:54:53,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:54:53,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022924131] [2024-11-10 01:54:53,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022924131] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:54:53,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:54:53,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 01:54:53,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123757367] [2024-11-10 01:54:53,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:54:53,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 01:54:53,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:54:53,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 01:54:53,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:54:53,214 INFO L87 Difference]: Start difference. First operand 440 states and 621 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:54:53,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:54:53,613 INFO L93 Difference]: Finished difference Result 976 states and 1357 transitions. [2024-11-10 01:54:53,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 01:54:53,614 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 136 [2024-11-10 01:54:53,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:54:53,617 INFO L225 Difference]: With dead ends: 976 [2024-11-10 01:54:53,617 INFO L226 Difference]: Without dead ends: 606 [2024-11-10 01:54:53,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:54:53,618 INFO L432 NwaCegarLoop]: 458 mSDtfsCounter, 850 mSDsluCounter, 1369 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 853 SdHoareTripleChecker+Valid, 1827 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 01:54:53,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [853 Valid, 1827 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 01:54:53,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2024-11-10 01:54:53,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2024-11-10 01:54:53,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 598 states have (on average 1.382943143812709) internal successors, (827), 598 states have internal predecessors, (827), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 01:54:53,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 839 transitions. [2024-11-10 01:54:53,635 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 839 transitions. Word has length 136 [2024-11-10 01:54:53,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:54:53,636 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 839 transitions. [2024-11-10 01:54:53,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:54:53,636 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 839 transitions. [2024-11-10 01:54:53,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2024-11-10 01:54:53,640 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:54:53,640 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:54:53,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 01:54:53,641 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:54:53,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:54:53,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1288056981, now seen corresponding path program 1 times [2024-11-10 01:54:53,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:54:53,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185680505] [2024-11-10 01:54:53,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:54:53,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:54:53,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:54,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 01:54:54,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:54,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 01:54:54,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:54,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 01:54:54,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:54,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2024-11-10 01:54:54,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:54,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-11-10 01:54:54,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:54,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2024-11-10 01:54:54,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:54,218 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:54:54,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:54:54,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185680505] [2024-11-10 01:54:54,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185680505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:54:54,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:54:54,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:54:54,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651920543] [2024-11-10 01:54:54,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:54:54,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:54:54,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:54:54,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:54:54,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:54:54,222 INFO L87 Difference]: Start difference. First operand 606 states and 839 transitions. Second operand has 5 states, 5 states have (on average 59.6) internal successors, (298), 5 states have internal predecessors, (298), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:54:54,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:54:54,400 INFO L93 Difference]: Finished difference Result 976 states and 1356 transitions. [2024-11-10 01:54:54,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:54:54,401 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 59.6) internal successors, (298), 5 states have internal predecessors, (298), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 325 [2024-11-10 01:54:54,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:54:54,404 INFO L225 Difference]: With dead ends: 976 [2024-11-10 01:54:54,404 INFO L226 Difference]: Without dead ends: 606 [2024-11-10 01:54:54,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 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-11-10 01:54:54,405 INFO L432 NwaCegarLoop]: 443 mSDtfsCounter, 934 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 937 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:54:54,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [937 Valid, 888 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:54:54,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2024-11-10 01:54:54,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2024-11-10 01:54:54,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 598 states have (on average 1.3812709030100334) internal successors, (826), 598 states have internal predecessors, (826), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 01:54:54,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 838 transitions. [2024-11-10 01:54:54,418 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 838 transitions. Word has length 325 [2024-11-10 01:54:54,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:54:54,419 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 838 transitions. [2024-11-10 01:54:54,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 59.6) internal successors, (298), 5 states have internal predecessors, (298), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:54:54,419 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 838 transitions. [2024-11-10 01:54:54,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2024-11-10 01:54:54,421 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:54:54,422 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:54:54,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 01:54:54,422 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:54:54,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:54:54,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1842590603, now seen corresponding path program 1 times [2024-11-10 01:54:54,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:54:54,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805197789] [2024-11-10 01:54:54,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:54:54,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:54:54,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:54,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 01:54:54,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:54,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 01:54:54,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:54,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 01:54:54,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:54,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2024-11-10 01:54:54,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:54,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-11-10 01:54:54,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:54,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-11-10 01:54:54,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:54,991 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:54:54,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:54:54,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805197789] [2024-11-10 01:54:54,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805197789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:54:54,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:54:54,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:54:54,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49203884] [2024-11-10 01:54:54,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:54:54,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:54:54,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:54:54,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:54:54,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:54:54,995 INFO L87 Difference]: Start difference. First operand 606 states and 838 transitions. Second operand has 5 states, 5 states have (on average 59.8) internal successors, (299), 5 states have internal predecessors, (299), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:54:55,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:54:55,217 INFO L93 Difference]: Finished difference Result 976 states and 1354 transitions. [2024-11-10 01:54:55,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:54:55,218 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 59.8) internal successors, (299), 5 states have internal predecessors, (299), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 326 [2024-11-10 01:54:55,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:54:55,222 INFO L225 Difference]: With dead ends: 976 [2024-11-10 01:54:55,222 INFO L226 Difference]: Without dead ends: 606 [2024-11-10 01:54:55,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 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-11-10 01:54:55,223 INFO L432 NwaCegarLoop]: 443 mSDtfsCounter, 505 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:54:55,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 895 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:54:55,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2024-11-10 01:54:55,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2024-11-10 01:54:55,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 598 states have (on average 1.379598662207358) internal successors, (825), 598 states have internal predecessors, (825), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 01:54:55,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 837 transitions. [2024-11-10 01:54:55,240 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 837 transitions. Word has length 326 [2024-11-10 01:54:55,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:54:55,241 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 837 transitions. [2024-11-10 01:54:55,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 59.8) internal successors, (299), 5 states have internal predecessors, (299), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:54:55,241 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 837 transitions. [2024-11-10 01:54:55,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2024-11-10 01:54:55,245 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:54:55,245 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:54:55,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-10 01:54:55,246 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:54:55,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:54:55,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1577035716, now seen corresponding path program 1 times [2024-11-10 01:54:55,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:54:55,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941504671] [2024-11-10 01:54:55,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:54:55,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:54:55,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:56,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 01:54:56,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:56,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 01:54:56,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:56,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 01:54:56,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:56,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2024-11-10 01:54:56,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:56,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2024-11-10 01:54:56,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:56,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2024-11-10 01:54:56,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:56,029 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:54:56,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:54:56,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941504671] [2024-11-10 01:54:56,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941504671] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:54:56,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:54:56,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:54:56,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188595338] [2024-11-10 01:54:56,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:54:56,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:54:56,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:54:56,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:54:56,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:54:56,034 INFO L87 Difference]: Start difference. First operand 606 states and 837 transitions. Second operand has 5 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:54:56,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:54:56,306 INFO L93 Difference]: Finished difference Result 976 states and 1352 transitions. [2024-11-10 01:54:56,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:54:56,307 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 327 [2024-11-10 01:54:56,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:54:56,310 INFO L225 Difference]: With dead ends: 976 [2024-11-10 01:54:56,310 INFO L226 Difference]: Without dead ends: 606 [2024-11-10 01:54:56,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 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-11-10 01:54:56,312 INFO L432 NwaCegarLoop]: 443 mSDtfsCounter, 902 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 905 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:54:56,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [905 Valid, 888 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:54:56,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2024-11-10 01:54:56,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2024-11-10 01:54:56,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 598 states have (on average 1.3779264214046822) internal successors, (824), 598 states have internal predecessors, (824), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 01:54:56,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 836 transitions. [2024-11-10 01:54:56,335 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 836 transitions. Word has length 327 [2024-11-10 01:54:56,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:54:56,335 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 836 transitions. [2024-11-10 01:54:56,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:54:56,336 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 836 transitions. [2024-11-10 01:54:56,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2024-11-10 01:54:56,340 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:54:56,341 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:54:56,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-10 01:54:56,341 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:54:56,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:54:56,342 INFO L85 PathProgramCache]: Analyzing trace with hash -322535620, now seen corresponding path program 1 times [2024-11-10 01:54:56,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:54:56,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269495606] [2024-11-10 01:54:56,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:54:56,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:54:56,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:57,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 01:54:57,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:57,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 01:54:57,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:57,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 01:54:57,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:57,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-11-10 01:54:57,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:57,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-11-10 01:54:57,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:57,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2024-11-10 01:54:57,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:57,122 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:54:57,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:54:57,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269495606] [2024-11-10 01:54:57,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269495606] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:54:57,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:54:57,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:54:57,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677534026] [2024-11-10 01:54:57,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:54:57,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:54:57,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:54:57,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:54:57,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:54:57,126 INFO L87 Difference]: Start difference. First operand 606 states and 836 transitions. Second operand has 5 states, 5 states have (on average 60.2) internal successors, (301), 5 states have internal predecessors, (301), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:54:57,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:54:57,342 INFO L93 Difference]: Finished difference Result 976 states and 1350 transitions. [2024-11-10 01:54:57,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:54:57,343 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.2) internal successors, (301), 5 states have internal predecessors, (301), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 328 [2024-11-10 01:54:57,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:54:57,346 INFO L225 Difference]: With dead ends: 976 [2024-11-10 01:54:57,346 INFO L226 Difference]: Without dead ends: 606 [2024-11-10 01:54:57,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 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-11-10 01:54:57,348 INFO L432 NwaCegarLoop]: 443 mSDtfsCounter, 886 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 889 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:54:57,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [889 Valid, 888 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:54:57,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2024-11-10 01:54:57,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2024-11-10 01:54:57,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 598 states have (on average 1.3762541806020068) internal successors, (823), 598 states have internal predecessors, (823), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 01:54:57,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 835 transitions. [2024-11-10 01:54:57,364 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 835 transitions. Word has length 328 [2024-11-10 01:54:57,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:54:57,364 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 835 transitions. [2024-11-10 01:54:57,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.2) internal successors, (301), 5 states have internal predecessors, (301), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:54:57,365 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 835 transitions. [2024-11-10 01:54:57,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2024-11-10 01:54:57,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:54:57,368 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:54:57,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-10 01:54:57,369 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:54:57,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:54:57,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1910821235, now seen corresponding path program 1 times [2024-11-10 01:54:57,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:54:57,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664027526] [2024-11-10 01:54:57,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:54:57,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:54:57,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:58,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 01:54:58,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:58,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 01:54:58,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:58,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 01:54:58,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:58,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-11-10 01:54:58,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:58,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-11-10 01:54:58,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:58,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-11-10 01:54:58,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:58,021 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:54:58,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:54:58,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664027526] [2024-11-10 01:54:58,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664027526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:54:58,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:54:58,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:54:58,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302106686] [2024-11-10 01:54:58,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:54:58,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:54:58,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:54:58,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:54:58,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:54:58,024 INFO L87 Difference]: Start difference. First operand 606 states and 835 transitions. Second operand has 5 states, 5 states have (on average 60.4) internal successors, (302), 5 states have internal predecessors, (302), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:54:58,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:54:58,189 INFO L93 Difference]: Finished difference Result 976 states and 1348 transitions. [2024-11-10 01:54:58,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:54:58,189 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.4) internal successors, (302), 5 states have internal predecessors, (302), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 329 [2024-11-10 01:54:58,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:54:58,191 INFO L225 Difference]: With dead ends: 976 [2024-11-10 01:54:58,191 INFO L226 Difference]: Without dead ends: 606 [2024-11-10 01:54:58,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 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-11-10 01:54:58,192 INFO L432 NwaCegarLoop]: 452 mSDtfsCounter, 474 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:54:58,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 913 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:54:58,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2024-11-10 01:54:58,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2024-11-10 01:54:58,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 598 states have (on average 1.374581939799331) internal successors, (822), 598 states have internal predecessors, (822), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 01:54:58,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 834 transitions. [2024-11-10 01:54:58,211 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 834 transitions. Word has length 329 [2024-11-10 01:54:58,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:54:58,211 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 834 transitions. [2024-11-10 01:54:58,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.4) internal successors, (302), 5 states have internal predecessors, (302), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:54:58,212 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 834 transitions. [2024-11-10 01:54:58,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2024-11-10 01:54:58,217 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:54:58,217 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:54:58,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-10 01:54:58,218 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:54:58,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:54:58,218 INFO L85 PathProgramCache]: Analyzing trace with hash 112832621, now seen corresponding path program 1 times [2024-11-10 01:54:58,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:54:58,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397114252] [2024-11-10 01:54:58,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:54:58,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:54:58,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:58,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 01:54:58,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:58,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 01:54:58,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:58,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 01:54:58,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:58,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2024-11-10 01:54:58,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:58,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-10 01:54:58,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:58,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2024-11-10 01:54:58,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:58,887 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:54:58,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:54:58,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397114252] [2024-11-10 01:54:58,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397114252] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:54:58,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:54:58,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:54:58,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795294340] [2024-11-10 01:54:58,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:54:58,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:54:58,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:54:58,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:54:58,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:54:58,889 INFO L87 Difference]: Start difference. First operand 606 states and 834 transitions. Second operand has 5 states, 5 states have (on average 60.6) internal successors, (303), 5 states have internal predecessors, (303), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:54:59,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:54:59,241 INFO L93 Difference]: Finished difference Result 976 states and 1346 transitions. [2024-11-10 01:54:59,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:54:59,242 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.6) internal successors, (303), 5 states have internal predecessors, (303), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 330 [2024-11-10 01:54:59,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:54:59,244 INFO L225 Difference]: With dead ends: 976 [2024-11-10 01:54:59,244 INFO L226 Difference]: Without dead ends: 606 [2024-11-10 01:54:59,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 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-11-10 01:54:59,245 INFO L432 NwaCegarLoop]: 452 mSDtfsCounter, 466 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 01:54:59,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 913 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 01:54:59,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2024-11-10 01:54:59,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2024-11-10 01:54:59,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 598 states have (on average 1.3729096989966556) internal successors, (821), 598 states have internal predecessors, (821), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 01:54:59,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 833 transitions. [2024-11-10 01:54:59,258 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 833 transitions. Word has length 330 [2024-11-10 01:54:59,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:54:59,259 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 833 transitions. [2024-11-10 01:54:59,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.6) internal successors, (303), 5 states have internal predecessors, (303), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:54:59,259 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 833 transitions. [2024-11-10 01:54:59,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2024-11-10 01:54:59,260 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:54:59,260 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:54:59,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-10 01:54:59,260 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:54:59,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:54:59,261 INFO L85 PathProgramCache]: Analyzing trace with hash 374051422, now seen corresponding path program 1 times [2024-11-10 01:54:59,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:54:59,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374379250] [2024-11-10 01:54:59,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:54:59,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:54:59,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:59,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 01:54:59,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:59,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 01:54:59,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:59,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 01:54:59,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:59,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2024-11-10 01:54:59,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:59,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2024-11-10 01:54:59,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:59,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2024-11-10 01:54:59,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:54:59,863 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:54:59,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:54:59,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374379250] [2024-11-10 01:54:59,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374379250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:54:59,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:54:59,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:54:59,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78422602] [2024-11-10 01:54:59,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:54:59,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:54:59,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:54:59,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:54:59,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:54:59,866 INFO L87 Difference]: Start difference. First operand 606 states and 833 transitions. Second operand has 5 states, 5 states have (on average 60.8) internal successors, (304), 5 states have internal predecessors, (304), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:55:00,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:00,215 INFO L93 Difference]: Finished difference Result 976 states and 1344 transitions. [2024-11-10 01:55:00,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:55:00,216 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.8) internal successors, (304), 5 states have internal predecessors, (304), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 331 [2024-11-10 01:55:00,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:00,218 INFO L225 Difference]: With dead ends: 976 [2024-11-10 01:55:00,218 INFO L226 Difference]: Without dead ends: 606 [2024-11-10 01:55:00,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 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-11-10 01:55:00,219 INFO L432 NwaCegarLoop]: 337 mSDtfsCounter, 787 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 787 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:00,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [787 Valid, 676 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 01:55:00,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2024-11-10 01:55:00,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2024-11-10 01:55:00,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 598 states have (on average 1.37123745819398) internal successors, (820), 598 states have internal predecessors, (820), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 01:55:00,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 832 transitions. [2024-11-10 01:55:00,229 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 832 transitions. Word has length 331 [2024-11-10 01:55:00,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:00,229 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 832 transitions. [2024-11-10 01:55:00,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.8) internal successors, (304), 5 states have internal predecessors, (304), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:55:00,229 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 832 transitions. [2024-11-10 01:55:00,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2024-11-10 01:55:00,231 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:00,231 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:00,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-10 01:55:00,231 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:00,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:00,232 INFO L85 PathProgramCache]: Analyzing trace with hash 591431454, now seen corresponding path program 1 times [2024-11-10 01:55:00,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:00,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332330775] [2024-11-10 01:55:00,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:00,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:00,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:01,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 01:55:01,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:01,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 01:55:01,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:01,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 01:55:01,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:01,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-11-10 01:55:01,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:01,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2024-11-10 01:55:01,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:01,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2024-11-10 01:55:01,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:01,148 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:55:01,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:01,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332330775] [2024-11-10 01:55:01,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332330775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:01,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:01,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:55:01,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034079000] [2024-11-10 01:55:01,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:01,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:55:01,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:01,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:55:01,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:55:01,151 INFO L87 Difference]: Start difference. First operand 606 states and 832 transitions. Second operand has 4 states, 4 states have (on average 76.25) internal successors, (305), 4 states have internal predecessors, (305), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:55:01,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:01,303 INFO L93 Difference]: Finished difference Result 976 states and 1342 transitions. [2024-11-10 01:55:01,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:55:01,304 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 76.25) internal successors, (305), 4 states have internal predecessors, (305), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 332 [2024-11-10 01:55:01,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:01,306 INFO L225 Difference]: With dead ends: 976 [2024-11-10 01:55:01,306 INFO L226 Difference]: Without dead ends: 606 [2024-11-10 01:55:01,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:55:01,307 INFO L432 NwaCegarLoop]: 451 mSDtfsCounter, 380 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:01,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 904 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:55:01,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2024-11-10 01:55:01,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2024-11-10 01:55:01,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 598 states have (on average 1.3695652173913044) internal successors, (819), 598 states have internal predecessors, (819), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 01:55:01,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 831 transitions. [2024-11-10 01:55:01,319 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 831 transitions. Word has length 332 [2024-11-10 01:55:01,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:01,320 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 831 transitions. [2024-11-10 01:55:01,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 76.25) internal successors, (305), 4 states have internal predecessors, (305), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:55:01,320 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 831 transitions. [2024-11-10 01:55:01,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2024-11-10 01:55:01,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:01,321 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:01,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-10 01:55:01,322 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:01,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:01,322 INFO L85 PathProgramCache]: Analyzing trace with hash -2119225673, now seen corresponding path program 1 times [2024-11-10 01:55:01,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:01,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684917867] [2024-11-10 01:55:01,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:01,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:01,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:02,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 01:55:02,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:02,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 01:55:02,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:02,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 01:55:02,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:02,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-11-10 01:55:02,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:02,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2024-11-10 01:55:02,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:02,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2024-11-10 01:55:02,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:02,562 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:55:02,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:02,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684917867] [2024-11-10 01:55:02,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684917867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:02,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:02,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:55:02,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381201172] [2024-11-10 01:55:02,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:02,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:55:02,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:02,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:55:02,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:55:02,566 INFO L87 Difference]: Start difference. First operand 606 states and 831 transitions. Second operand has 5 states, 5 states have (on average 61.2) internal successors, (306), 5 states have internal predecessors, (306), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:55:02,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:02,877 INFO L93 Difference]: Finished difference Result 976 states and 1340 transitions. [2024-11-10 01:55:02,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:55:02,878 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 61.2) internal successors, (306), 5 states have internal predecessors, (306), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 333 [2024-11-10 01:55:02,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:02,879 INFO L225 Difference]: With dead ends: 976 [2024-11-10 01:55:02,879 INFO L226 Difference]: Without dead ends: 606 [2024-11-10 01:55:02,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:55:02,880 INFO L432 NwaCegarLoop]: 439 mSDtfsCounter, 859 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:02,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 880 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 01:55:02,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2024-11-10 01:55:02,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2024-11-10 01:55:02,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 598 states have (on average 1.3678929765886287) internal successors, (818), 598 states have internal predecessors, (818), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 01:55:02,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 830 transitions. [2024-11-10 01:55:02,890 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 830 transitions. Word has length 333 [2024-11-10 01:55:02,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:02,890 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 830 transitions. [2024-11-10 01:55:02,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 61.2) internal successors, (306), 5 states have internal predecessors, (306), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:55:02,890 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 830 transitions. [2024-11-10 01:55:02,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2024-11-10 01:55:02,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:02,892 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:02,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-10 01:55:02,892 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:02,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:02,892 INFO L85 PathProgramCache]: Analyzing trace with hash -389461580, now seen corresponding path program 1 times [2024-11-10 01:55:02,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:02,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223961120] [2024-11-10 01:55:02,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:02,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:03,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:03,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 01:55:03,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:03,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 01:55:03,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:03,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 01:55:03,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:03,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2024-11-10 01:55:03,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:03,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2024-11-10 01:55:03,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:03,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2024-11-10 01:55:03,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:03,682 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:55:03,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:03,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223961120] [2024-11-10 01:55:03,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223961120] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:03,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:03,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:55:03,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449563493] [2024-11-10 01:55:03,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:03,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:55:03,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:03,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:55:03,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:55:03,684 INFO L87 Difference]: Start difference. First operand 606 states and 830 transitions. Second operand has 5 states, 5 states have (on average 61.4) internal successors, (307), 5 states have internal predecessors, (307), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:55:03,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:03,917 INFO L93 Difference]: Finished difference Result 976 states and 1338 transitions. [2024-11-10 01:55:03,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:55:03,918 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 61.4) internal successors, (307), 5 states have internal predecessors, (307), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 334 [2024-11-10 01:55:03,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:03,920 INFO L225 Difference]: With dead ends: 976 [2024-11-10 01:55:03,921 INFO L226 Difference]: Without dead ends: 606 [2024-11-10 01:55:03,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 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-11-10 01:55:03,923 INFO L432 NwaCegarLoop]: 439 mSDtfsCounter, 849 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:03,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [849 Valid, 880 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:55:03,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2024-11-10 01:55:03,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2024-11-10 01:55:03,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 598 states have (on average 1.3662207357859533) internal successors, (817), 598 states have internal predecessors, (817), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 01:55:03,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 829 transitions. [2024-11-10 01:55:03,938 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 829 transitions. Word has length 334 [2024-11-10 01:55:03,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:03,938 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 829 transitions. [2024-11-10 01:55:03,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 61.4) internal successors, (307), 5 states have internal predecessors, (307), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:55:03,939 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 829 transitions. [2024-11-10 01:55:03,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2024-11-10 01:55:03,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:03,941 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:03,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-10 01:55:03,941 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:03,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:03,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1452021348, now seen corresponding path program 1 times [2024-11-10 01:55:03,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:03,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288305357] [2024-11-10 01:55:03,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:03,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:04,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:04,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 01:55:04,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:04,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 01:55:04,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:04,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 01:55:04,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:04,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2024-11-10 01:55:04,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:04,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2024-11-10 01:55:04,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:04,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-11-10 01:55:04,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:04,752 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:55:04,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:04,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288305357] [2024-11-10 01:55:04,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288305357] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:04,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:04,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:55:04,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318713717] [2024-11-10 01:55:04,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:04,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:55:04,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:04,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:55:04,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:55:04,756 INFO L87 Difference]: Start difference. First operand 606 states and 829 transitions. Second operand has 5 states, 5 states have (on average 61.6) internal successors, (308), 5 states have internal predecessors, (308), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:55:04,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:04,952 INFO L93 Difference]: Finished difference Result 976 states and 1336 transitions. [2024-11-10 01:55:04,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:55:04,953 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 61.6) internal successors, (308), 5 states have internal predecessors, (308), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 335 [2024-11-10 01:55:04,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:04,958 INFO L225 Difference]: With dead ends: 976 [2024-11-10 01:55:04,958 INFO L226 Difference]: Without dead ends: 606 [2024-11-10 01:55:04,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 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-11-10 01:55:04,959 INFO L432 NwaCegarLoop]: 439 mSDtfsCounter, 451 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:04,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 887 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:55:04,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2024-11-10 01:55:04,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2024-11-10 01:55:04,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 598 states have (on average 1.3645484949832776) internal successors, (816), 598 states have internal predecessors, (816), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 01:55:04,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 828 transitions. [2024-11-10 01:55:04,975 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 828 transitions. Word has length 335 [2024-11-10 01:55:04,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:04,975 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 828 transitions. [2024-11-10 01:55:04,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 61.6) internal successors, (308), 5 states have internal predecessors, (308), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:55:04,975 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 828 transitions. [2024-11-10 01:55:04,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2024-11-10 01:55:04,978 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:04,978 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:04,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-10 01:55:04,979 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:04,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:04,979 INFO L85 PathProgramCache]: Analyzing trace with hash -732615663, now seen corresponding path program 1 times [2024-11-10 01:55:04,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:04,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069514973] [2024-11-10 01:55:04,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:04,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:05,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:06,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 01:55:06,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:06,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 01:55:06,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:06,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 01:55:06,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:06,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2024-11-10 01:55:06,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:06,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2024-11-10 01:55:06,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:06,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-11-10 01:55:06,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:06,091 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:55:06,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:06,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069514973] [2024-11-10 01:55:06,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069514973] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:06,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:06,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 01:55:06,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490619489] [2024-11-10 01:55:06,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:06,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 01:55:06,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:06,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 01:55:06,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:55:06,094 INFO L87 Difference]: Start difference. First operand 606 states and 828 transitions. Second operand has 6 states, 6 states have (on average 51.5) internal successors, (309), 6 states have internal predecessors, (309), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:55:06,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:06,632 INFO L93 Difference]: Finished difference Result 1423 states and 1951 transitions. [2024-11-10 01:55:06,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 01:55:06,632 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 51.5) internal successors, (309), 6 states have internal predecessors, (309), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 336 [2024-11-10 01:55:06,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:06,635 INFO L225 Difference]: With dead ends: 1423 [2024-11-10 01:55:06,635 INFO L226 Difference]: Without dead ends: 1053 [2024-11-10 01:55:06,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 01:55:06,636 INFO L432 NwaCegarLoop]: 385 mSDtfsCounter, 587 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 1650 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:06,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 1650 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 01:55:06,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2024-11-10 01:55:06,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 931. [2024-11-10 01:55:06,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 931 states, 920 states have (on average 1.3608695652173912) internal successors, (1252), 920 states have internal predecessors, (1252), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 01:55:06,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1270 transitions. [2024-11-10 01:55:06,650 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1270 transitions. Word has length 336 [2024-11-10 01:55:06,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:06,650 INFO L471 AbstractCegarLoop]: Abstraction has 931 states and 1270 transitions. [2024-11-10 01:55:06,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 51.5) internal successors, (309), 6 states have internal predecessors, (309), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:55:06,650 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1270 transitions. [2024-11-10 01:55:06,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2024-11-10 01:55:06,652 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:06,652 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:06,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-10 01:55:06,653 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:06,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:06,653 INFO L85 PathProgramCache]: Analyzing trace with hash -234564701, now seen corresponding path program 1 times [2024-11-10 01:55:06,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:06,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222955286] [2024-11-10 01:55:06,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:06,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:07,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:08,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 01:55:08,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:08,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 01:55:08,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:08,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 01:55:08,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:08,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2024-11-10 01:55:08,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:08,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2024-11-10 01:55:08,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:08,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2024-11-10 01:55:08,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:08,043 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-11-10 01:55:08,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:08,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222955286] [2024-11-10 01:55:08,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222955286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:08,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:08,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:55:08,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391986650] [2024-11-10 01:55:08,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:08,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:55:08,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:08,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:55:08,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:55:08,045 INFO L87 Difference]: Start difference. First operand 931 states and 1270 transitions. Second operand has 5 states, 5 states have (on average 53.8) internal successors, (269), 5 states have internal predecessors, (269), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:08,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:08,408 INFO L93 Difference]: Finished difference Result 1591 states and 2147 transitions. [2024-11-10 01:55:08,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 01:55:08,409 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 53.8) internal successors, (269), 5 states have internal predecessors, (269), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 337 [2024-11-10 01:55:08,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:08,414 INFO L225 Difference]: With dead ends: 1591 [2024-11-10 01:55:08,414 INFO L226 Difference]: Without dead ends: 943 [2024-11-10 01:55:08,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:55:08,416 INFO L432 NwaCegarLoop]: 340 mSDtfsCounter, 323 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:08,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 1000 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 01:55:08,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2024-11-10 01:55:08,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 937. [2024-11-10 01:55:08,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 926 states have (on average 1.3585313174946003) internal successors, (1258), 926 states have internal predecessors, (1258), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 01:55:08,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1276 transitions. [2024-11-10 01:55:08,434 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1276 transitions. Word has length 337 [2024-11-10 01:55:08,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:08,435 INFO L471 AbstractCegarLoop]: Abstraction has 937 states and 1276 transitions. [2024-11-10 01:55:08,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 53.8) internal successors, (269), 5 states have internal predecessors, (269), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:08,435 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1276 transitions. [2024-11-10 01:55:08,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2024-11-10 01:55:08,437 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:08,438 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:08,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-10 01:55:08,438 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:08,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:08,438 INFO L85 PathProgramCache]: Analyzing trace with hash -2039613949, now seen corresponding path program 1 times [2024-11-10 01:55:08,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:08,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565679440] [2024-11-10 01:55:08,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:08,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:08,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:09,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 01:55:09,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:09,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 01:55:09,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:09,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 01:55:09,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:09,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2024-11-10 01:55:09,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:09,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2024-11-10 01:55:09,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:09,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2024-11-10 01:55:09,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:09,859 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-11-10 01:55:09,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:09,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565679440] [2024-11-10 01:55:09,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565679440] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:09,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:09,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 01:55:09,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136903094] [2024-11-10 01:55:09,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:09,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 01:55:09,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:09,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 01:55:09,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:55:09,862 INFO L87 Difference]: Start difference. First operand 937 states and 1276 transitions. Second operand has 6 states, 6 states have (on average 46.166666666666664) internal successors, (277), 6 states have internal predecessors, (277), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-10 01:55:10,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:10,297 INFO L93 Difference]: Finished difference Result 1593 states and 2143 transitions. [2024-11-10 01:55:10,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 01:55:10,298 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 46.166666666666664) internal successors, (277), 6 states have internal predecessors, (277), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 337 [2024-11-10 01:55:10,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:10,302 INFO L225 Difference]: With dead ends: 1593 [2024-11-10 01:55:10,302 INFO L226 Difference]: Without dead ends: 943 [2024-11-10 01:55:10,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 01:55:10,304 INFO L432 NwaCegarLoop]: 331 mSDtfsCounter, 1008 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1009 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:10,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1009 Valid, 980 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 01:55:10,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2024-11-10 01:55:10,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 937. [2024-11-10 01:55:10,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 926 states have (on average 1.3520518358531317) internal successors, (1252), 926 states have internal predecessors, (1252), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 01:55:10,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1270 transitions. [2024-11-10 01:55:10,338 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1270 transitions. Word has length 337 [2024-11-10 01:55:10,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:10,341 INFO L471 AbstractCegarLoop]: Abstraction has 937 states and 1270 transitions. [2024-11-10 01:55:10,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 46.166666666666664) internal successors, (277), 6 states have internal predecessors, (277), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-10 01:55:10,342 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1270 transitions. [2024-11-10 01:55:10,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2024-11-10 01:55:10,344 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:10,345 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:10,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-10 01:55:10,345 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:10,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:10,345 INFO L85 PathProgramCache]: Analyzing trace with hash -941868125, now seen corresponding path program 1 times [2024-11-10 01:55:10,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:10,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776136817] [2024-11-10 01:55:10,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:10,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:10,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:11,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 01:55:11,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:11,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 01:55:11,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:11,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 01:55:11,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:11,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-11-10 01:55:11,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:11,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-11-10 01:55:11,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:11,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2024-11-10 01:55:11,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:11,520 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:55:11,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:11,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776136817] [2024-11-10 01:55:11,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776136817] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:11,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:11,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 01:55:11,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401755699] [2024-11-10 01:55:11,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:11,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 01:55:11,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:11,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 01:55:11,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:55:11,522 INFO L87 Difference]: Start difference. First operand 937 states and 1270 transitions. Second operand has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:55:12,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:12,054 INFO L93 Difference]: Finished difference Result 1332 states and 1810 transitions. [2024-11-10 01:55:12,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 01:55:12,055 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 339 [2024-11-10 01:55:12,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:12,058 INFO L225 Difference]: With dead ends: 1332 [2024-11-10 01:55:12,058 INFO L226 Difference]: Without dead ends: 960 [2024-11-10 01:55:12,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 01:55:12,059 INFO L432 NwaCegarLoop]: 334 mSDtfsCounter, 760 mSDsluCounter, 986 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 1320 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:12,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [763 Valid, 1320 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 01:55:12,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2024-11-10 01:55:12,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 938. [2024-11-10 01:55:12,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 938 states, 927 states have (on average 1.3516720604099244) internal successors, (1253), 927 states have internal predecessors, (1253), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 01:55:12,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1271 transitions. [2024-11-10 01:55:12,075 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1271 transitions. Word has length 339 [2024-11-10 01:55:12,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:12,075 INFO L471 AbstractCegarLoop]: Abstraction has 938 states and 1271 transitions. [2024-11-10 01:55:12,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:55:12,076 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1271 transitions. [2024-11-10 01:55:12,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2024-11-10 01:55:12,077 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:12,077 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:12,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-10 01:55:12,078 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:12,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:12,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1460276707, now seen corresponding path program 1 times [2024-11-10 01:55:12,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:12,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024222934] [2024-11-10 01:55:12,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:12,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:12,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:13,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 01:55:13,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:13,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 01:55:13,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:13,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 01:55:13,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:13,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-11-10 01:55:13,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:13,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-11-10 01:55:13,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:13,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2024-11-10 01:55:13,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:13,353 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2024-11-10 01:55:13,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:13,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024222934] [2024-11-10 01:55:13,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024222934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:13,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:13,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 01:55:13,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590167842] [2024-11-10 01:55:13,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:13,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 01:55:13,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:13,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 01:55:13,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 01:55:13,359 INFO L87 Difference]: Start difference. First operand 938 states and 1271 transitions. Second operand has 8 states, 8 states have (on average 32.625) internal successors, (261), 8 states have internal predecessors, (261), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:55:14,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:14,063 INFO L93 Difference]: Finished difference Result 2114 states and 2857 transitions. [2024-11-10 01:55:14,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 01:55:14,064 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 32.625) internal successors, (261), 8 states have internal predecessors, (261), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 339 [2024-11-10 01:55:14,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:14,070 INFO L225 Difference]: With dead ends: 2114 [2024-11-10 01:55:14,070 INFO L226 Difference]: Without dead ends: 1626 [2024-11-10 01:55:14,072 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:55:14,073 INFO L432 NwaCegarLoop]: 1061 mSDtfsCounter, 775 mSDsluCounter, 4997 mSDsCounter, 0 mSdLazyCounter, 1401 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 778 SdHoareTripleChecker+Valid, 6058 SdHoareTripleChecker+Invalid, 1401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:14,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [778 Valid, 6058 Invalid, 1401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1401 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 01:55:14,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2024-11-10 01:55:14,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 1007. [2024-11-10 01:55:14,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1007 states, 993 states have (on average 1.3544813695871099) internal successors, (1345), 993 states have internal predecessors, (1345), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 01:55:14,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1369 transitions. [2024-11-10 01:55:14,103 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1369 transitions. Word has length 339 [2024-11-10 01:55:14,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:14,103 INFO L471 AbstractCegarLoop]: Abstraction has 1007 states and 1369 transitions. [2024-11-10 01:55:14,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 32.625) internal successors, (261), 8 states have internal predecessors, (261), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:55:14,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1369 transitions. [2024-11-10 01:55:14,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2024-11-10 01:55:14,106 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:14,107 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:14,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-10 01:55:14,108 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:14,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:14,108 INFO L85 PathProgramCache]: Analyzing trace with hash -942292791, now seen corresponding path program 1 times [2024-11-10 01:55:14,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:14,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029901103] [2024-11-10 01:55:14,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:14,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:14,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:14,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 01:55:14,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:14,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 01:55:14,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:14,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 01:55:14,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:14,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2024-11-10 01:55:14,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:14,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2024-11-10 01:55:14,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:14,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2024-11-10 01:55:14,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:14,995 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-11-10 01:55:14,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:14,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029901103] [2024-11-10 01:55:14,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029901103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:14,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:14,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 01:55:14,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531412065] [2024-11-10 01:55:14,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:14,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 01:55:14,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:14,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 01:55:14,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 01:55:14,999 INFO L87 Difference]: Start difference. First operand 1007 states and 1369 transitions. Second operand has 7 states, 7 states have (on average 36.0) internal successors, (252), 7 states have internal predecessors, (252), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 01:55:15,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:15,529 INFO L93 Difference]: Finished difference Result 1836 states and 2485 transitions. [2024-11-10 01:55:15,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 01:55:15,530 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 36.0) internal successors, (252), 7 states have internal predecessors, (252), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 340 [2024-11-10 01:55:15,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:15,533 INFO L225 Difference]: With dead ends: 1836 [2024-11-10 01:55:15,533 INFO L226 Difference]: Without dead ends: 1023 [2024-11-10 01:55:15,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-10 01:55:15,538 INFO L432 NwaCegarLoop]: 328 mSDtfsCounter, 1033 mSDsluCounter, 977 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1035 SdHoareTripleChecker+Valid, 1305 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:15,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1035 Valid, 1305 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 894 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 01:55:15,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2024-11-10 01:55:15,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 1015. [2024-11-10 01:55:15,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1015 states, 1001 states have (on average 1.3476523476523476) internal successors, (1349), 1001 states have internal predecessors, (1349), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 01:55:15,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1373 transitions. [2024-11-10 01:55:15,555 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1373 transitions. Word has length 340 [2024-11-10 01:55:15,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:15,555 INFO L471 AbstractCegarLoop]: Abstraction has 1015 states and 1373 transitions. [2024-11-10 01:55:15,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.0) internal successors, (252), 7 states have internal predecessors, (252), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 01:55:15,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1373 transitions. [2024-11-10 01:55:15,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2024-11-10 01:55:15,557 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:15,557 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:15,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-10 01:55:15,558 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:15,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:15,558 INFO L85 PathProgramCache]: Analyzing trace with hash 652915605, now seen corresponding path program 1 times [2024-11-10 01:55:15,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:15,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265179310] [2024-11-10 01:55:15,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:15,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:16,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:16,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 01:55:16,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:16,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 01:55:16,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:16,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 01:55:16,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:16,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-11-10 01:55:16,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:16,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-11-10 01:55:16,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:16,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2024-11-10 01:55:16,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:16,688 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-10 01:55:16,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:16,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265179310] [2024-11-10 01:55:16,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265179310] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:16,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:16,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 01:55:16,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835216899] [2024-11-10 01:55:16,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:16,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 01:55:16,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:16,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 01:55:16,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:55:16,692 INFO L87 Difference]: Start difference. First operand 1015 states and 1373 transitions. Second operand has 6 states, 6 states have (on average 40.333333333333336) internal successors, (242), 6 states have internal predecessors, (242), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:17,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:17,195 INFO L93 Difference]: Finished difference Result 1886 states and 2538 transitions. [2024-11-10 01:55:17,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 01:55:17,195 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 40.333333333333336) internal successors, (242), 6 states have internal predecessors, (242), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 342 [2024-11-10 01:55:17,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:17,198 INFO L225 Difference]: With dead ends: 1886 [2024-11-10 01:55:17,198 INFO L226 Difference]: Without dead ends: 1023 [2024-11-10 01:55:17,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:55:17,201 INFO L432 NwaCegarLoop]: 328 mSDtfsCounter, 509 mSDsluCounter, 977 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 1305 SdHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:17,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 1305 Invalid, 894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 894 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 01:55:17,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2024-11-10 01:55:17,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 1019. [2024-11-10 01:55:17,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1019 states, 1005 states have (on average 1.346268656716418) internal successors, (1353), 1005 states have internal predecessors, (1353), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 01:55:17,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1377 transitions. [2024-11-10 01:55:17,226 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1377 transitions. Word has length 342 [2024-11-10 01:55:17,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:17,227 INFO L471 AbstractCegarLoop]: Abstraction has 1019 states and 1377 transitions. [2024-11-10 01:55:17,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 40.333333333333336) internal successors, (242), 6 states have internal predecessors, (242), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:17,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1377 transitions. [2024-11-10 01:55:17,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2024-11-10 01:55:17,229 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:17,229 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:17,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-10 01:55:17,230 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:17,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:17,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1939911671, now seen corresponding path program 1 times [2024-11-10 01:55:17,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:17,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837250802] [2024-11-10 01:55:17,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:17,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:17,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:19,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 01:55:19,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:19,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 01:55:19,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:19,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 01:55:19,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:19,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-11-10 01:55:19,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:19,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2024-11-10 01:55:19,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:19,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2024-11-10 01:55:19,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:19,350 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-10 01:55:19,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:19,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837250802] [2024-11-10 01:55:19,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837250802] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:19,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:19,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 01:55:19,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024167281] [2024-11-10 01:55:19,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:19,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 01:55:19,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:19,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 01:55:19,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-10 01:55:19,352 INFO L87 Difference]: Start difference. First operand 1019 states and 1377 transitions. Second operand has 8 states, 8 states have (on average 38.0) internal successors, (304), 8 states have internal predecessors, (304), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-10 01:55:20,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:20,119 INFO L93 Difference]: Finished difference Result 1855 states and 2493 transitions. [2024-11-10 01:55:20,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 01:55:20,120 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 38.0) internal successors, (304), 8 states have internal predecessors, (304), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 344 [2024-11-10 01:55:20,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:20,123 INFO L225 Difference]: With dead ends: 1855 [2024-11-10 01:55:20,123 INFO L226 Difference]: Without dead ends: 1051 [2024-11-10 01:55:20,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-10 01:55:20,126 INFO L432 NwaCegarLoop]: 332 mSDtfsCounter, 322 mSDsluCounter, 1615 mSDsCounter, 0 mSdLazyCounter, 1321 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 1947 SdHoareTripleChecker+Invalid, 1322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:20,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 1947 Invalid, 1322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1321 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 01:55:20,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2024-11-10 01:55:20,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 1039. [2024-11-10 01:55:20,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1039 states, 1025 states have (on average 1.3434146341463415) internal successors, (1377), 1025 states have internal predecessors, (1377), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 01:55:20,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 1039 states and 1401 transitions. [2024-11-10 01:55:20,148 INFO L78 Accepts]: Start accepts. Automaton has 1039 states and 1401 transitions. Word has length 344 [2024-11-10 01:55:20,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:20,149 INFO L471 AbstractCegarLoop]: Abstraction has 1039 states and 1401 transitions. [2024-11-10 01:55:20,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 38.0) internal successors, (304), 8 states have internal predecessors, (304), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-10 01:55:20,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 1401 transitions. [2024-11-10 01:55:20,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2024-11-10 01:55:20,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:20,152 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:20,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-10 01:55:20,152 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:20,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:20,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1066762919, now seen corresponding path program 1 times [2024-11-10 01:55:20,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:20,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712750195] [2024-11-10 01:55:20,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:20,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:20,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:22,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 01:55:22,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:22,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 01:55:22,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:22,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 01:55:22,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:22,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2024-11-10 01:55:22,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:22,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2024-11-10 01:55:22,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:22,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2024-11-10 01:55:22,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:22,183 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 4 proven. 84 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:55:22,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:22,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712750195] [2024-11-10 01:55:22,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712750195] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 01:55:22,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16288152] [2024-11-10 01:55:22,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:22,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 01:55:22,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 01:55:22,186 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 01:55:22,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 01:55:23,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:23,607 INFO L255 TraceCheckSpWp]: Trace formula consists of 2056 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-10 01:55:23,629 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 01:55:24,472 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 81 proven. 3 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-10 01:55:24,474 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 01:55:25,596 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 74 proven. 3 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-11-10 01:55:25,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16288152] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 01:55:25,597 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 01:55:25,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 26 [2024-11-10 01:55:25,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545694507] [2024-11-10 01:55:25,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 01:55:25,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-10 01:55:25,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:25,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-10 01:55:25,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=561, Unknown=0, NotChecked=0, Total=650 [2024-11-10 01:55:25,600 INFO L87 Difference]: Start difference. First operand 1039 states and 1401 transitions. Second operand has 26 states, 26 states have (on average 32.88461538461539) internal successors, (855), 26 states have internal predecessors, (855), 6 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2024-11-10 01:55:27,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:27,604 INFO L93 Difference]: Finished difference Result 1876 states and 2525 transitions. [2024-11-10 01:55:27,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-10 01:55:27,605 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 32.88461538461539) internal successors, (855), 26 states have internal predecessors, (855), 6 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) Word has length 346 [2024-11-10 01:55:27,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:27,609 INFO L225 Difference]: With dead ends: 1876 [2024-11-10 01:55:27,609 INFO L226 Difference]: Without dead ends: 1067 [2024-11-10 01:55:27,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 737 GetRequests, 691 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=367, Invalid=1889, Unknown=0, NotChecked=0, Total=2256 [2024-11-10 01:55:27,614 INFO L432 NwaCegarLoop]: 404 mSDtfsCounter, 1415 mSDsluCounter, 4597 mSDsCounter, 0 mSdLazyCounter, 3926 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1415 SdHoareTripleChecker+Valid, 5001 SdHoareTripleChecker+Invalid, 3931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 3926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:27,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1415 Valid, 5001 Invalid, 3931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 3926 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-10 01:55:27,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2024-11-10 01:55:27,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 1036. [2024-11-10 01:55:27,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1036 states, 1022 states have (on average 1.337573385518591) internal successors, (1367), 1022 states have internal predecessors, (1367), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 01:55:27,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1391 transitions. [2024-11-10 01:55:27,635 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1391 transitions. Word has length 346 [2024-11-10 01:55:27,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:27,635 INFO L471 AbstractCegarLoop]: Abstraction has 1036 states and 1391 transitions. [2024-11-10 01:55:27,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 32.88461538461539) internal successors, (855), 26 states have internal predecessors, (855), 6 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2024-11-10 01:55:27,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1391 transitions. [2024-11-10 01:55:27,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2024-11-10 01:55:27,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:27,638 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:27,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 01:55:27,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2024-11-10 01:55:27,843 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:27,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:27,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1181279150, now seen corresponding path program 1 times [2024-11-10 01:55:27,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:27,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734693305] [2024-11-10 01:55:27,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:27,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:27,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:28,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 01:55:28,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:28,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 01:55:28,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:28,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 01:55:28,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:28,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-11-10 01:55:28,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:28,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-11-10 01:55:28,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:28,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2024-11-10 01:55:28,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:28,459 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-11-10 01:55:28,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:28,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734693305] [2024-11-10 01:55:28,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734693305] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:28,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:28,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:55:28,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386116693] [2024-11-10 01:55:28,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:28,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:55:28,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:28,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:55:28,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:55:28,462 INFO L87 Difference]: Start difference. First operand 1036 states and 1391 transitions. Second operand has 5 states, 5 states have (on average 57.8) internal successors, (289), 5 states have internal predecessors, (289), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:28,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:28,653 INFO L93 Difference]: Finished difference Result 1709 states and 2299 transitions. [2024-11-10 01:55:28,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 01:55:28,653 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 57.8) internal successors, (289), 5 states have internal predecessors, (289), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 350 [2024-11-10 01:55:28,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:28,662 INFO L225 Difference]: With dead ends: 1709 [2024-11-10 01:55:28,663 INFO L226 Difference]: Without dead ends: 1090 [2024-11-10 01:55:28,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:55:28,664 INFO L432 NwaCegarLoop]: 453 mSDtfsCounter, 16 mSDsluCounter, 1349 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 1802 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:28,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 1802 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:55:28,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2024-11-10 01:55:28,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 1090. [2024-11-10 01:55:28,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1090 states, 1076 states have (on average 1.3429368029739777) internal successors, (1445), 1076 states have internal predecessors, (1445), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 01:55:28,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 1469 transitions. [2024-11-10 01:55:28,696 INFO L78 Accepts]: Start accepts. Automaton has 1090 states and 1469 transitions. Word has length 350 [2024-11-10 01:55:28,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:28,697 INFO L471 AbstractCegarLoop]: Abstraction has 1090 states and 1469 transitions. [2024-11-10 01:55:28,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.8) internal successors, (289), 5 states have internal predecessors, (289), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:28,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1469 transitions. [2024-11-10 01:55:28,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2024-11-10 01:55:28,700 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:28,700 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:28,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-10 01:55:28,701 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:28,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:28,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1628293583, now seen corresponding path program 1 times [2024-11-10 01:55:28,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:28,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107145872] [2024-11-10 01:55:28,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:28,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:28,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:29,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 01:55:29,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:29,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 01:55:29,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:29,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 01:55:29,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:29,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-11-10 01:55:29,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:29,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-11-10 01:55:29,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:29,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2024-11-10 01:55:29,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:29,508 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-11-10 01:55:29,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:29,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107145872] [2024-11-10 01:55:29,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107145872] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:29,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:29,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:55:29,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644308513] [2024-11-10 01:55:29,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:29,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:55:29,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:29,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:55:29,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:55:29,511 INFO L87 Difference]: Start difference. First operand 1090 states and 1469 transitions. Second operand has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:29,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:29,687 INFO L93 Difference]: Finished difference Result 1861 states and 2493 transitions. [2024-11-10 01:55:29,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:55:29,688 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 351 [2024-11-10 01:55:29,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:29,695 INFO L225 Difference]: With dead ends: 1861 [2024-11-10 01:55:29,696 INFO L226 Difference]: Without dead ends: 1096 [2024-11-10 01:55:29,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:55:29,698 INFO L432 NwaCegarLoop]: 454 mSDtfsCounter, 0 mSDsluCounter, 900 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1354 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:29,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1354 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:55:29,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1096 states. [2024-11-10 01:55:29,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1096 to 1096. [2024-11-10 01:55:29,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1096 states, 1082 states have (on average 1.3410351201478743) internal successors, (1451), 1082 states have internal predecessors, (1451), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 01:55:29,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 1096 states and 1475 transitions. [2024-11-10 01:55:29,723 INFO L78 Accepts]: Start accepts. Automaton has 1096 states and 1475 transitions. Word has length 351 [2024-11-10 01:55:29,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:29,723 INFO L471 AbstractCegarLoop]: Abstraction has 1096 states and 1475 transitions. [2024-11-10 01:55:29,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:29,723 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 1475 transitions. [2024-11-10 01:55:29,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2024-11-10 01:55:29,726 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:29,726 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:29,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-10 01:55:29,726 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:29,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:29,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1150274559, now seen corresponding path program 1 times [2024-11-10 01:55:29,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:29,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433725774] [2024-11-10 01:55:29,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:29,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:30,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:32,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 01:55:32,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:32,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 01:55:32,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:32,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 01:55:32,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:32,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-11-10 01:55:32,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:32,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-11-10 01:55:32,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:32,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2024-11-10 01:55:32,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:32,130 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 54 proven. 17 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-11-10 01:55:32,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:32,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433725774] [2024-11-10 01:55:32,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433725774] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 01:55:32,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945436445] [2024-11-10 01:55:32,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:32,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 01:55:32,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 01:55:32,132 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 01:55:32,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 01:55:33,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:33,362 INFO L255 TraceCheckSpWp]: Trace formula consists of 2065 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-10 01:55:33,369 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 01:55:33,565 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-10 01:55:33,565 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 01:55:33,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945436445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:33,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 01:55:33,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2024-11-10 01:55:33,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382900855] [2024-11-10 01:55:33,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:33,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 01:55:33,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:33,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 01:55:33,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-10 01:55:33,569 INFO L87 Difference]: Start difference. First operand 1096 states and 1475 transitions. Second operand has 8 states, 8 states have (on average 40.5) internal successors, (324), 8 states have internal predecessors, (324), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:55:34,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:34,212 INFO L93 Difference]: Finished difference Result 2445 states and 3298 transitions. [2024-11-10 01:55:34,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 01:55:34,213 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 40.5) internal successors, (324), 8 states have internal predecessors, (324), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 351 [2024-11-10 01:55:34,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:34,216 INFO L225 Difference]: With dead ends: 2445 [2024-11-10 01:55:34,217 INFO L226 Difference]: Without dead ends: 1902 [2024-11-10 01:55:34,222 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2024-11-10 01:55:34,222 INFO L432 NwaCegarLoop]: 333 mSDtfsCounter, 1275 mSDsluCounter, 1240 mSDsCounter, 0 mSdLazyCounter, 1057 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1281 SdHoareTripleChecker+Valid, 1573 SdHoareTripleChecker+Invalid, 1057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:34,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1281 Valid, 1573 Invalid, 1057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1057 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 01:55:34,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1902 states. [2024-11-10 01:55:34,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1902 to 1556. [2024-11-10 01:55:34,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1533 states have (on average 1.3235485975212002) internal successors, (2029), 1533 states have internal predecessors, (2029), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-10 01:55:34,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2071 transitions. [2024-11-10 01:55:34,256 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2071 transitions. Word has length 351 [2024-11-10 01:55:34,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:34,257 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 2071 transitions. [2024-11-10 01:55:34,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 40.5) internal successors, (324), 8 states have internal predecessors, (324), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:55:34,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2071 transitions. [2024-11-10 01:55:34,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2024-11-10 01:55:34,260 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:34,260 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:34,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 01:55:34,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2024-11-10 01:55:34,465 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:34,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:34,466 INFO L85 PathProgramCache]: Analyzing trace with hash -366077175, now seen corresponding path program 1 times [2024-11-10 01:55:34,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:34,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871746638] [2024-11-10 01:55:34,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:34,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:35,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:36,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 01:55:36,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:36,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 01:55:36,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:36,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 01:55:36,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:36,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-10 01:55:36,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:36,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-11-10 01:55:36,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:36,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-11-10 01:55:36,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:36,928 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-11-10 01:55:36,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:36,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871746638] [2024-11-10 01:55:36,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871746638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:36,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:36,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 01:55:36,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097104514] [2024-11-10 01:55:36,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:36,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 01:55:36,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:36,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 01:55:36,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-10 01:55:36,935 INFO L87 Difference]: Start difference. First operand 1556 states and 2071 transitions. Second operand has 10 states, 10 states have (on average 27.7) internal successors, (277), 10 states have internal predecessors, (277), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-10 01:55:38,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:38,007 INFO L93 Difference]: Finished difference Result 2858 states and 3796 transitions. [2024-11-10 01:55:38,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 01:55:38,007 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 27.7) internal successors, (277), 10 states have internal predecessors, (277), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 352 [2024-11-10 01:55:38,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:38,022 INFO L225 Difference]: With dead ends: 2858 [2024-11-10 01:55:38,023 INFO L226 Difference]: Without dead ends: 2080 [2024-11-10 01:55:38,024 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2024-11-10 01:55:38,025 INFO L432 NwaCegarLoop]: 682 mSDtfsCounter, 1674 mSDsluCounter, 3963 mSDsCounter, 0 mSdLazyCounter, 1438 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1679 SdHoareTripleChecker+Valid, 4645 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:38,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1679 Valid, 4645 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1438 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-10 01:55:38,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2080 states. [2024-11-10 01:55:38,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2080 to 1648. [2024-11-10 01:55:38,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1648 states, 1621 states have (on average 1.3220234423195558) internal successors, (2143), 1621 states have internal predecessors, (2143), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-10 01:55:38,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 2193 transitions. [2024-11-10 01:55:38,108 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 2193 transitions. Word has length 352 [2024-11-10 01:55:38,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:38,112 INFO L471 AbstractCegarLoop]: Abstraction has 1648 states and 2193 transitions. [2024-11-10 01:55:38,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 27.7) internal successors, (277), 10 states have internal predecessors, (277), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-10 01:55:38,113 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2193 transitions. [2024-11-10 01:55:38,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2024-11-10 01:55:38,121 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:38,121 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:38,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-10 01:55:38,121 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:38,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:38,122 INFO L85 PathProgramCache]: Analyzing trace with hash 709465630, now seen corresponding path program 1 times [2024-11-10 01:55:38,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:38,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75338145] [2024-11-10 01:55:38,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:38,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:39,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:42,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 01:55:42,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:42,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 01:55:42,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:42,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 01:55:42,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:42,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-10 01:55:42,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:42,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-11-10 01:55:42,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:42,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-11-10 01:55:42,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:42,348 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2024-11-10 01:55:42,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:42,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75338145] [2024-11-10 01:55:42,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75338145] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:42,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:42,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 01:55:42,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729835356] [2024-11-10 01:55:42,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:42,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 01:55:42,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:42,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 01:55:42,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-10 01:55:42,351 INFO L87 Difference]: Start difference. First operand 1648 states and 2193 transitions. Second operand has 11 states, 11 states have (on average 25.545454545454547) internal successors, (281), 11 states have internal predecessors, (281), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-10 01:55:44,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:44,301 INFO L93 Difference]: Finished difference Result 5171 states and 6819 transitions. [2024-11-10 01:55:44,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 01:55:44,301 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 25.545454545454547) internal successors, (281), 11 states have internal predecessors, (281), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 352 [2024-11-10 01:55:44,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:44,307 INFO L225 Difference]: With dead ends: 5171 [2024-11-10 01:55:44,307 INFO L226 Difference]: Without dead ends: 4222 [2024-11-10 01:55:44,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2024-11-10 01:55:44,309 INFO L432 NwaCegarLoop]: 565 mSDtfsCounter, 1357 mSDsluCounter, 3758 mSDsCounter, 0 mSdLazyCounter, 2914 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1364 SdHoareTripleChecker+Valid, 4323 SdHoareTripleChecker+Invalid, 2929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:44,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1364 Valid, 4323 Invalid, 2929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2914 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-10 01:55:44,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4222 states. [2024-11-10 01:55:44,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4222 to 2316. [2024-11-10 01:55:44,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2316 states, 2265 states have (on average 1.3245033112582782) internal successors, (3000), 2265 states have internal predecessors, (3000), 49 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2024-11-10 01:55:44,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2316 states to 2316 states and 3098 transitions. [2024-11-10 01:55:44,367 INFO L78 Accepts]: Start accepts. Automaton has 2316 states and 3098 transitions. Word has length 352 [2024-11-10 01:55:44,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:44,367 INFO L471 AbstractCegarLoop]: Abstraction has 2316 states and 3098 transitions. [2024-11-10 01:55:44,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 25.545454545454547) internal successors, (281), 11 states have internal predecessors, (281), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-10 01:55:44,367 INFO L276 IsEmpty]: Start isEmpty. Operand 2316 states and 3098 transitions. [2024-11-10 01:55:44,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2024-11-10 01:55:44,371 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:44,371 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:44,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-10 01:55:44,372 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:44,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:44,372 INFO L85 PathProgramCache]: Analyzing trace with hash -598084237, now seen corresponding path program 1 times [2024-11-10 01:55:44,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:44,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059039092] [2024-11-10 01:55:44,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:44,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:45,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:46,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 01:55:46,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:46,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 01:55:46,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:46,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 01:55:46,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:46,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-10 01:55:46,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:46,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-11-10 01:55:46,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:46,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-11-10 01:55:46,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:46,822 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 55 proven. 15 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-11-10 01:55:46,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:46,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059039092] [2024-11-10 01:55:46,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059039092] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 01:55:46,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748205854] [2024-11-10 01:55:46,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:46,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 01:55:46,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 01:55:46,825 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 01:55:46,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 01:55:48,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:48,161 INFO L255 TraceCheckSpWp]: Trace formula consists of 2066 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-10 01:55:48,166 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 01:55:48,206 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-10 01:55:48,206 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 01:55:48,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748205854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:48,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 01:55:48,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2024-11-10 01:55:48,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738473932] [2024-11-10 01:55:48,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:48,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 01:55:48,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:48,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 01:55:48,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-11-10 01:55:48,208 INFO L87 Difference]: Start difference. First operand 2316 states and 3098 transitions. Second operand has 6 states, 5 states have (on average 54.4) internal successors, (272), 6 states have internal predecessors, (272), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-10 01:55:48,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:48,561 INFO L93 Difference]: Finished difference Result 3835 states and 5112 transitions. [2024-11-10 01:55:48,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 01:55:48,562 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 54.4) internal successors, (272), 6 states have internal predecessors, (272), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 352 [2024-11-10 01:55:48,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:48,568 INFO L225 Difference]: With dead ends: 3835 [2024-11-10 01:55:48,568 INFO L226 Difference]: Without dead ends: 2316 [2024-11-10 01:55:48,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-11-10 01:55:48,571 INFO L432 NwaCegarLoop]: 453 mSDtfsCounter, 0 mSDsluCounter, 1794 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2247 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:48,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2247 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 01:55:48,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2316 states. [2024-11-10 01:55:48,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2316 to 2230. [2024-11-10 01:55:48,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2230 states, 2181 states have (on average 1.3154516276937185) internal successors, (2869), 2181 states have internal predecessors, (2869), 47 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-10 01:55:48,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2230 states to 2230 states and 2963 transitions. [2024-11-10 01:55:48,657 INFO L78 Accepts]: Start accepts. Automaton has 2230 states and 2963 transitions. Word has length 352 [2024-11-10 01:55:48,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:48,658 INFO L471 AbstractCegarLoop]: Abstraction has 2230 states and 2963 transitions. [2024-11-10 01:55:48,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 54.4) internal successors, (272), 6 states have internal predecessors, (272), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-10 01:55:48,658 INFO L276 IsEmpty]: Start isEmpty. Operand 2230 states and 2963 transitions. [2024-11-10 01:55:48,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2024-11-10 01:55:48,661 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:48,661 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:48,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 01:55:48,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 01:55:48,869 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:48,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:48,869 INFO L85 PathProgramCache]: Analyzing trace with hash -2057028192, now seen corresponding path program 1 times [2024-11-10 01:55:48,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:48,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501046868] [2024-11-10 01:55:48,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:48,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:49,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:50,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 01:55:50,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:50,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-10 01:55:50,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:50,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 01:55:50,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:50,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-10 01:55:50,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:50,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-11-10 01:55:50,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:50,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-11-10 01:55:50,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:50,138 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-11-10 01:55:50,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:50,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501046868] [2024-11-10 01:55:50,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501046868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:50,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:50,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 01:55:50,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428554437] [2024-11-10 01:55:50,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:50,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 01:55:50,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:50,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 01:55:50,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:55:50,141 INFO L87 Difference]: Start difference. First operand 2230 states and 2963 transitions. Second operand has 6 states, 6 states have (on average 46.5) internal successors, (279), 6 states have internal predecessors, (279), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:55:50,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:50,599 INFO L93 Difference]: Finished difference Result 4853 states and 6425 transitions. [2024-11-10 01:55:50,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 01:55:50,599 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 46.5) internal successors, (279), 6 states have internal predecessors, (279), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 352 [2024-11-10 01:55:50,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:50,608 INFO L225 Difference]: With dead ends: 4853 [2024-11-10 01:55:50,608 INFO L226 Difference]: Without dead ends: 3808 [2024-11-10 01:55:50,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 01:55:50,614 INFO L432 NwaCegarLoop]: 729 mSDtfsCounter, 361 mSDsluCounter, 2624 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 3353 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:50,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 3353 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 01:55:50,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3808 states. [2024-11-10 01:55:50,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3808 to 3150. [2024-11-10 01:55:50,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3150 states, 3057 states have (on average 1.310107948969578) internal successors, (4005), 3057 states have internal predecessors, (4005), 91 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91) [2024-11-10 01:55:50,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3150 states to 3150 states and 4187 transitions. [2024-11-10 01:55:50,708 INFO L78 Accepts]: Start accepts. Automaton has 3150 states and 4187 transitions. Word has length 352 [2024-11-10 01:55:50,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:50,708 INFO L471 AbstractCegarLoop]: Abstraction has 3150 states and 4187 transitions. [2024-11-10 01:55:50,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 46.5) internal successors, (279), 6 states have internal predecessors, (279), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:55:50,709 INFO L276 IsEmpty]: Start isEmpty. Operand 3150 states and 4187 transitions. [2024-11-10 01:55:50,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2024-11-10 01:55:50,714 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:50,714 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:50,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-11-10 01:55:50,714 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:50,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:50,715 INFO L85 PathProgramCache]: Analyzing trace with hash -503028272, now seen corresponding path program 1 times [2024-11-10 01:55:50,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:50,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157181212] [2024-11-10 01:55:50,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:50,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:51,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:52,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 01:55:52,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:52,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-10 01:55:52,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:52,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 01:55:52,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:52,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-10 01:55:52,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:52,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-11-10 01:55:52,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:52,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-11-10 01:55:52,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:52,059 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:55:52,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:52,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157181212] [2024-11-10 01:55:52,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157181212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:52,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:52,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 01:55:52,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106109862] [2024-11-10 01:55:52,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:52,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 01:55:52,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:52,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 01:55:52,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-10 01:55:52,062 INFO L87 Difference]: Start difference. First operand 3150 states and 4187 transitions. Second operand has 8 states, 8 states have (on average 40.625) internal successors, (325), 8 states have internal predecessors, (325), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)