./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 3289d67d 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-3289d67-m [2024-11-16 10:49:32,456 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 10:49:32,539 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-16 10:49:32,546 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 10:49:32,549 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 10:49:32,590 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 10:49:32,591 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 10:49:32,591 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 10:49:32,592 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 10:49:32,593 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 10:49:32,594 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 10:49:32,594 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 10:49:32,595 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 10:49:32,595 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 10:49:32,595 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 10:49:32,595 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 10:49:32,596 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 10:49:32,596 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 10:49:32,599 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 10:49:32,599 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 10:49:32,600 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 10:49:32,600 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 10:49:32,604 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 10:49:32,604 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 10:49:32,604 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 10:49:32,605 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 10:49:32,605 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 10:49:32,605 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 10:49:32,605 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 10:49:32,606 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 10:49:32,606 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 10:49:32,606 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 10:49:32,606 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 10:49:32,607 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 10:49:32,607 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 10:49:32,607 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 10:49:32,607 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 10:49:32,608 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 10:49:32,608 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 10:49:32,608 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-16 10:49:32,886 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 10:49:32,909 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 10:49:32,913 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 10:49:32,914 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 10:49:32,915 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 10:49:32,916 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-16 10:49:34,385 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 10:49:34,649 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 10:49:34,652 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-16 10:49:34,667 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51539b13a/312fed18cd3245ba830b6d733744f3b7/FLAG173020ebf [2024-11-16 10:49:34,684 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51539b13a/312fed18cd3245ba830b6d733744f3b7 [2024-11-16 10:49:34,688 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 10:49:34,689 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 10:49:34,693 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 10:49:34,693 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 10:49:34,699 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 10:49:34,700 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:49:34" (1/1) ... [2024-11-16 10:49:34,701 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d784a4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:49:34, skipping insertion in model container [2024-11-16 10:49:34,701 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:49:34" (1/1) ... [2024-11-16 10:49:34,746 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 10:49:34,954 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-16 10:49:35,170 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 10:49:35,181 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 10:49:35,192 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-16 10:49:35,276 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 10:49:35,305 INFO L204 MainTranslator]: Completed translation [2024-11-16 10:49:35,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:49:35 WrapperNode [2024-11-16 10:49:35,306 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 10:49:35,307 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 10:49:35,307 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 10:49:35,307 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 10:49:35,314 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:49:35" (1/1) ... [2024-11-16 10:49:35,342 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:49:35" (1/1) ... [2024-11-16 10:49:35,500 INFO L138 Inliner]: procedures = 18, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1382 [2024-11-16 10:49:35,501 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 10:49:35,501 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 10:49:35,502 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 10:49:35,502 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 10:49:35,513 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:49:35" (1/1) ... [2024-11-16 10:49:35,513 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:49:35" (1/1) ... [2024-11-16 10:49:35,590 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:49:35" (1/1) ... [2024-11-16 10:49:35,687 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-16 10:49:35,687 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:49:35" (1/1) ... [2024-11-16 10:49:35,688 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:49:35" (1/1) ... [2024-11-16 10:49:35,754 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:49:35" (1/1) ... [2024-11-16 10:49:35,767 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:49:35" (1/1) ... [2024-11-16 10:49:35,779 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:49:35" (1/1) ... [2024-11-16 10:49:35,793 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:49:35" (1/1) ... [2024-11-16 10:49:35,813 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 10:49:35,815 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 10:49:35,815 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 10:49:35,815 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 10:49:35,816 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:49:35" (1/1) ... [2024-11-16 10:49:35,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 10:49:35,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 10:49:35,851 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-16 10:49:35,857 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-16 10:49:35,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 10:49:35,904 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 10:49:35,904 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 10:49:35,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 10:49:35,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 10:49:35,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 10:49:36,144 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 10:49:36,146 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 10:49:37,723 INFO L? ?]: Removed 754 outVars from TransFormulas that were not future-live. [2024-11-16 10:49:37,724 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 10:49:37,810 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 10:49:37,812 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 10:49:37,812 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 10:49:37 BoogieIcfgContainer [2024-11-16 10:49:37,812 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 10:49:37,814 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 10:49:37,814 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 10:49:37,817 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 10:49:37,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 10:49:34" (1/3) ... [2024-11-16 10:49:37,818 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10363f05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:49:37, skipping insertion in model container [2024-11-16 10:49:37,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:49:35" (2/3) ... [2024-11-16 10:49:37,819 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10363f05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:49:37, skipping insertion in model container [2024-11-16 10:49:37,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 10:49:37" (3/3) ... [2024-11-16 10:49:37,822 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.circular_pointer_top_w128_d8_e0.c [2024-11-16 10:49:37,837 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 10:49:37,838 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 10:49:37,927 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 10:49:37,933 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;@28e6e2b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 10:49:37,934 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 10:49:37,940 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-16 10:49:37,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-16 10:49:37,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:49:37,959 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-16 10:49:37,961 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:49:37,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:49:37,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1130703786, now seen corresponding path program 1 times [2024-11-16 10:49:37,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:49:37,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999024731] [2024-11-16 10:49:37,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:49:37,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:49:38,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:38,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:49:38,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:38,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 10:49:38,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:38,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 10:49:38,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:38,401 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-16 10:49:38,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:49:38,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999024731] [2024-11-16 10:49:38,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999024731] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:49:38,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:49:38,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 10:49:38,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185024871] [2024-11-16 10:49:38,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:49:38,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 10:49:38,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:49:38,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 10:49:38,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 10:49:38,434 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-16 10:49:38,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:49:38,613 INFO L93 Difference]: Finished difference Result 715 states and 1065 transitions. [2024-11-16 10:49:38,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 10:49:38,616 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-16 10:49:38,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:49:38,629 INFO L225 Difference]: With dead ends: 715 [2024-11-16 10:49:38,629 INFO L226 Difference]: Without dead ends: 390 [2024-11-16 10:49:38,633 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-16 10:49:38,636 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-16 10:49:38,636 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-16 10:49:38,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-11-16 10:49:38,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2024-11-16 10:49:38,686 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-16 10:49:38,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 578 transitions. [2024-11-16 10:49:38,690 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 578 transitions. Word has length 118 [2024-11-16 10:49:38,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:49:38,691 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 578 transitions. [2024-11-16 10:49:38,691 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-16 10:49:38,691 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 578 transitions. [2024-11-16 10:49:38,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-16 10:49:38,694 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:49:38,694 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-16 10:49:38,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 10:49:38,695 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:49:38,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:49:38,695 INFO L85 PathProgramCache]: Analyzing trace with hash 165064281, now seen corresponding path program 1 times [2024-11-16 10:49:38,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:49:38,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142267506] [2024-11-16 10:49:38,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:49:38,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:49:38,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:39,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:49:39,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:39,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 10:49:39,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:39,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 10:49:39,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:39,598 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-16 10:49:39,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:49:39,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142267506] [2024-11-16 10:49:39,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142267506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:49:39,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:49:39,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 10:49:39,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460026531] [2024-11-16 10:49:39,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:49:39,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 10:49:39,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:49:39,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 10:49:39,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 10:49:39,605 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-16 10:49:39,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:49:39,859 INFO L93 Difference]: Finished difference Result 395 states and 583 transitions. [2024-11-16 10:49:39,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:49:39,860 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-16 10:49:39,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:49:39,862 INFO L225 Difference]: With dead ends: 395 [2024-11-16 10:49:39,864 INFO L226 Difference]: Without dead ends: 392 [2024-11-16 10:49:39,865 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-16 10:49:39,867 INFO L432 NwaCegarLoop]: 483 mSDtfsCounter, 0 mSDsluCounter, 961 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-16 10:49:39,867 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-16 10:49:39,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-11-16 10:49:39,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-11-16 10:49:39,883 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-16 10:49:39,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 580 transitions. [2024-11-16 10:49:39,885 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 580 transitions. Word has length 118 [2024-11-16 10:49:39,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:49:39,890 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 580 transitions. [2024-11-16 10:49:39,890 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-16 10:49:39,890 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 580 transitions. [2024-11-16 10:49:39,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-16 10:49:39,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:49:39,892 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-16 10:49:39,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 10:49:39,893 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:49:39,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:49:39,893 INFO L85 PathProgramCache]: Analyzing trace with hash 967079114, now seen corresponding path program 1 times [2024-11-16 10:49:39,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:49:39,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87865110] [2024-11-16 10:49:39,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:49:39,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:49:40,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:40,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:49:40,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:40,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 10:49:40,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:40,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 10:49:40,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:40,359 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-16 10:49:40,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:49:40,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87865110] [2024-11-16 10:49:40,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87865110] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:49:40,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:49:40,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:49:40,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183060353] [2024-11-16 10:49:40,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:49:40,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:49:40,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:49:40,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:49:40,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:49:40,367 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-16 10:49:40,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:49:40,976 INFO L93 Difference]: Finished difference Result 973 states and 1443 transitions. [2024-11-16 10:49:40,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 10:49:40,977 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-16 10:49:40,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:49:40,979 INFO L225 Difference]: With dead ends: 973 [2024-11-16 10:49:40,980 INFO L226 Difference]: Without dead ends: 392 [2024-11-16 10:49:40,981 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-16 10:49:40,982 INFO L432 NwaCegarLoop]: 526 mSDtfsCounter, 1091 mSDsluCounter, 893 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-11-16 10:49:40,983 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.5s Time] [2024-11-16 10:49:40,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-11-16 10:49:40,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-11-16 10:49:40,993 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-16 10:49:40,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 579 transitions. [2024-11-16 10:49:40,995 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 579 transitions. Word has length 119 [2024-11-16 10:49:40,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:49:40,995 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 579 transitions. [2024-11-16 10:49:40,996 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-16 10:49:40,996 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 579 transitions. [2024-11-16 10:49:40,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-16 10:49:40,997 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:49:40,998 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-16 10:49:40,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 10:49:40,998 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:49:40,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:49:41,001 INFO L85 PathProgramCache]: Analyzing trace with hash 806869547, now seen corresponding path program 1 times [2024-11-16 10:49:41,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:49:41,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299330427] [2024-11-16 10:49:41,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:49:41,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:49:41,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:41,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:49:41,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:41,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 10:49:41,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:41,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 10:49:41,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:41,487 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-16 10:49:41,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:49:41,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299330427] [2024-11-16 10:49:41,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299330427] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:49:41,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:49:41,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 10:49:41,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946947982] [2024-11-16 10:49:41,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:49:41,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 10:49:41,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:49:41,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 10:49:41,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 10:49:41,491 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-16 10:49:41,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:49:41,697 INFO L93 Difference]: Finished difference Result 716 states and 1057 transitions. [2024-11-16 10:49:41,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:49:41,698 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-16 10:49:41,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:49:41,700 INFO L225 Difference]: With dead ends: 716 [2024-11-16 10:49:41,700 INFO L226 Difference]: Without dead ends: 394 [2024-11-16 10:49:41,701 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-16 10:49:41,702 INFO L432 NwaCegarLoop]: 482 mSDtfsCounter, 0 mSDsluCounter, 956 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-16 10:49:41,702 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-16 10:49:41,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-16 10:49:41,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2024-11-16 10:49:41,711 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-16 10:49:41,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 581 transitions. [2024-11-16 10:49:41,712 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 581 transitions. Word has length 120 [2024-11-16 10:49:41,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:49:41,713 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 581 transitions. [2024-11-16 10:49:41,713 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-16 10:49:41,714 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 581 transitions. [2024-11-16 10:49:41,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-16 10:49:41,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:49:41,716 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-16 10:49:41,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 10:49:41,717 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:49:41,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:49:41,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1009603939, now seen corresponding path program 1 times [2024-11-16 10:49:41,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:49:41,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416269975] [2024-11-16 10:49:41,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:49:41,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:49:41,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:42,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:49:42,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:42,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 10:49:42,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:42,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 10:49:42,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:42,223 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-16 10:49:42,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:49:42,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416269975] [2024-11-16 10:49:42,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416269975] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:49:42,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:49:42,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 10:49:42,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113730397] [2024-11-16 10:49:42,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:49:42,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 10:49:42,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:49:42,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 10:49:42,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 10:49:42,227 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-16 10:49:42,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:49:42,491 INFO L93 Difference]: Finished difference Result 718 states and 1058 transitions. [2024-11-16 10:49:42,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:49:42,491 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-16 10:49:42,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:49:42,493 INFO L225 Difference]: With dead ends: 718 [2024-11-16 10:49:42,493 INFO L226 Difference]: Without dead ends: 394 [2024-11-16 10:49:42,494 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-16 10:49:42,495 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.2s IncrementalHoareTripleChecker+Time [2024-11-16 10:49:42,500 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.2s Time] [2024-11-16 10:49:42,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-16 10:49:42,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2024-11-16 10:49:42,511 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-16 10:49:42,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 580 transitions. [2024-11-16 10:49:42,513 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 580 transitions. Word has length 121 [2024-11-16 10:49:42,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:49:42,514 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 580 transitions. [2024-11-16 10:49:42,514 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-16 10:49:42,515 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 580 transitions. [2024-11-16 10:49:42,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-16 10:49:42,517 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:49:42,518 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-16 10:49:42,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 10:49:42,519 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:49:42,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:49:42,520 INFO L85 PathProgramCache]: Analyzing trace with hash 531562967, now seen corresponding path program 1 times [2024-11-16 10:49:42,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:49:42,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804972680] [2024-11-16 10:49:42,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:49:42,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:49:42,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:42,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:49:42,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:42,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 10:49:42,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:42,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 10:49:42,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:42,838 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-16 10:49:42,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:49:42,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804972680] [2024-11-16 10:49:42,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804972680] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:49:42,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:49:42,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:49:42,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278212499] [2024-11-16 10:49:42,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:49:42,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:49:42,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:49:42,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:49:42,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:49:42,841 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-16 10:49:43,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:49:43,119 INFO L93 Difference]: Finished difference Result 722 states and 1061 transitions. [2024-11-16 10:49:43,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 10:49:43,119 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-16 10:49:43,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:49:43,121 INFO L225 Difference]: With dead ends: 722 [2024-11-16 10:49:43,121 INFO L226 Difference]: Without dead ends: 394 [2024-11-16 10:49:43,122 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-16 10:49:43,123 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-16 10:49:43,123 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-16 10:49:43,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-16 10:49:43,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2024-11-16 10:49:43,132 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-16 10:49:43,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 579 transitions. [2024-11-16 10:49:43,133 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 579 transitions. Word has length 122 [2024-11-16 10:49:43,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:49:43,134 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 579 transitions. [2024-11-16 10:49:43,134 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-16 10:49:43,134 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 579 transitions. [2024-11-16 10:49:43,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-16 10:49:43,135 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:49:43,136 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-16 10:49:43,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 10:49:43,136 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:49:43,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:49:43,137 INFO L85 PathProgramCache]: Analyzing trace with hash -72278937, now seen corresponding path program 1 times [2024-11-16 10:49:43,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:49:43,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139579558] [2024-11-16 10:49:43,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:49:43,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:49:43,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:43,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:49:43,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:43,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 10:49:43,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:43,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 10:49:43,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:43,446 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-16 10:49:43,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:49:43,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139579558] [2024-11-16 10:49:43,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139579558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:49:43,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:49:43,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:49:43,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479774167] [2024-11-16 10:49:43,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:49:43,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:49:43,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:49:43,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:49:43,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:49:43,450 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-16 10:49:43,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:49:43,698 INFO L93 Difference]: Finished difference Result 718 states and 1054 transitions. [2024-11-16 10:49:43,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:49:43,698 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-16 10:49:43,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:49:43,700 INFO L225 Difference]: With dead ends: 718 [2024-11-16 10:49:43,701 INFO L226 Difference]: Without dead ends: 394 [2024-11-16 10:49:43,701 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-16 10:49:43,702 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-16 10:49:43,702 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-16 10:49:43,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-16 10:49:43,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2024-11-16 10:49:43,711 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-16 10:49:43,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 578 transitions. [2024-11-16 10:49:43,712 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 578 transitions. Word has length 123 [2024-11-16 10:49:43,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:49:43,713 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 578 transitions. [2024-11-16 10:49:43,713 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-16 10:49:43,713 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 578 transitions. [2024-11-16 10:49:43,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-16 10:49:43,714 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:49:43,715 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-16 10:49:43,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 10:49:43,715 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:49:43,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:49:43,715 INFO L85 PathProgramCache]: Analyzing trace with hash -84426446, now seen corresponding path program 1 times [2024-11-16 10:49:43,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:49:43,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028804652] [2024-11-16 10:49:43,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:49:43,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:49:43,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:44,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:49:44,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:44,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 10:49:44,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:44,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 10:49:44,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:44,039 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-16 10:49:44,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:49:44,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028804652] [2024-11-16 10:49:44,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028804652] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:49:44,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:49:44,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:49:44,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507282257] [2024-11-16 10:49:44,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:49:44,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:49:44,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:49:44,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:49:44,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:49:44,043 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-16 10:49:44,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:49:44,302 INFO L93 Difference]: Finished difference Result 718 states and 1052 transitions. [2024-11-16 10:49:44,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:49:44,303 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-16 10:49:44,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:49:44,305 INFO L225 Difference]: With dead ends: 718 [2024-11-16 10:49:44,305 INFO L226 Difference]: Without dead ends: 394 [2024-11-16 10:49:44,306 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-16 10:49:44,307 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-16 10:49:44,307 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-16 10:49:44,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-16 10:49:44,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2024-11-16 10:49:44,318 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-16 10:49:44,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 577 transitions. [2024-11-16 10:49:44,320 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 577 transitions. Word has length 124 [2024-11-16 10:49:44,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:49:44,321 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 577 transitions. [2024-11-16 10:49:44,322 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-16 10:49:44,322 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 577 transitions. [2024-11-16 10:49:44,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-16 10:49:44,324 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:49:44,325 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-16 10:49:44,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 10:49:44,326 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:49:44,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:49:44,327 INFO L85 PathProgramCache]: Analyzing trace with hash -850844761, now seen corresponding path program 1 times [2024-11-16 10:49:44,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:49:44,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110128531] [2024-11-16 10:49:44,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:49:44,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:49:44,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:44,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:49:44,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:44,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 10:49:44,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:44,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 10:49:44,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:44,738 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-16 10:49:44,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:49:44,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110128531] [2024-11-16 10:49:44,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110128531] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:49:44,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:49:44,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 10:49:44,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339027705] [2024-11-16 10:49:44,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:49:44,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 10:49:44,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:49:44,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 10:49:44,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 10:49:44,741 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-16 10:49:44,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:49:44,941 INFO L93 Difference]: Finished difference Result 717 states and 1049 transitions. [2024-11-16 10:49:44,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:49:44,941 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-16 10:49:44,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:49:44,943 INFO L225 Difference]: With dead ends: 717 [2024-11-16 10:49:44,943 INFO L226 Difference]: Without dead ends: 393 [2024-11-16 10:49:44,943 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-16 10:49:44,944 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.2s IncrementalHoareTripleChecker+Time [2024-11-16 10:49:44,944 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.2s Time] [2024-11-16 10:49:44,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-16 10:49:44,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2024-11-16 10:49:44,952 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-16 10:49:44,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 574 transitions. [2024-11-16 10:49:44,954 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 574 transitions. Word has length 125 [2024-11-16 10:49:44,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:49:44,955 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 574 transitions. [2024-11-16 10:49:44,955 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-16 10:49:44,955 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 574 transitions. [2024-11-16 10:49:44,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-16 10:49:44,956 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:49:44,956 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-16 10:49:44,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 10:49:44,957 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:49:44,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:49:44,957 INFO L85 PathProgramCache]: Analyzing trace with hash 175803282, now seen corresponding path program 1 times [2024-11-16 10:49:44,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:49:44,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824488400] [2024-11-16 10:49:44,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:49:44,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:49:45,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:45,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:49:45,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:45,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 10:49:45,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:45,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 10:49:45,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:45,251 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-16 10:49:45,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:49:45,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824488400] [2024-11-16 10:49:45,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824488400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:49:45,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:49:45,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:49:45,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876013269] [2024-11-16 10:49:45,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:49:45,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:49:45,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:49:45,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:49:45,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:49:45,257 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-16 10:49:45,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:49:45,498 INFO L93 Difference]: Finished difference Result 718 states and 1046 transitions. [2024-11-16 10:49:45,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 10:49:45,498 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-16 10:49:45,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:49:45,500 INFO L225 Difference]: With dead ends: 718 [2024-11-16 10:49:45,500 INFO L226 Difference]: Without dead ends: 393 [2024-11-16 10:49:45,501 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-16 10:49:45,501 INFO L432 NwaCegarLoop]: 472 mSDtfsCounter, 484 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-16 10:49:45,502 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-16 10:49:45,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-16 10:49:45,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2024-11-16 10:49:45,510 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-16 10:49:45,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 573 transitions. [2024-11-16 10:49:45,512 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 573 transitions. Word has length 126 [2024-11-16 10:49:45,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:49:45,512 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 573 transitions. [2024-11-16 10:49:45,513 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-16 10:49:45,513 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 573 transitions. [2024-11-16 10:49:45,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-16 10:49:45,514 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:49:45,514 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-16 10:49:45,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 10:49:45,515 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:49:45,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:49:45,515 INFO L85 PathProgramCache]: Analyzing trace with hash 366624428, now seen corresponding path program 1 times [2024-11-16 10:49:45,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:49:45,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375177102] [2024-11-16 10:49:45,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:49:45,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:49:45,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:45,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:49:45,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:45,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 10:49:45,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:45,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 10:49:45,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:45,931 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-16 10:49:45,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:49:45,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375177102] [2024-11-16 10:49:45,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375177102] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:49:45,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:49:45,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 10:49:45,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443333921] [2024-11-16 10:49:45,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:49:45,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 10:49:45,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:49:45,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 10:49:45,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 10:49:45,934 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-16 10:49:46,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:49:46,160 INFO L93 Difference]: Finished difference Result 716 states and 1042 transitions. [2024-11-16 10:49:46,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:49:46,160 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-16 10:49:46,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:49:46,163 INFO L225 Difference]: With dead ends: 716 [2024-11-16 10:49:46,163 INFO L226 Difference]: Without dead ends: 393 [2024-11-16 10:49:46,164 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-16 10:49:46,164 INFO L432 NwaCegarLoop]: 464 mSDtfsCounter, 518 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2024-11-16 10:49:46,165 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.2s Time] [2024-11-16 10:49:46,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-16 10:49:46,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2024-11-16 10:49:46,174 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-16 10:49:46,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 572 transitions. [2024-11-16 10:49:46,175 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 572 transitions. Word has length 127 [2024-11-16 10:49:46,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:49:46,176 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 572 transitions. [2024-11-16 10:49:46,176 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-16 10:49:46,176 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 572 transitions. [2024-11-16 10:49:46,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-16 10:49:46,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:49:46,177 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-16 10:49:46,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 10:49:46,178 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:49:46,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:49:46,178 INFO L85 PathProgramCache]: Analyzing trace with hash 24445107, now seen corresponding path program 1 times [2024-11-16 10:49:46,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:49:46,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418544302] [2024-11-16 10:49:46,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:49:46,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:49:46,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:46,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:49:46,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:46,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-16 10:49:46,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:46,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-16 10:49:46,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:46,611 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-16 10:49:46,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:49:46,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418544302] [2024-11-16 10:49:46,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418544302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:49:46,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:49:46,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 10:49:46,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009514757] [2024-11-16 10:49:46,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:49:46,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 10:49:46,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:49:46,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 10:49:46,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 10:49:46,613 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-16 10:49:46,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:49:46,830 INFO L93 Difference]: Finished difference Result 716 states and 1040 transitions. [2024-11-16 10:49:46,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:49:46,830 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-16 10:49:46,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:49:46,832 INFO L225 Difference]: With dead ends: 716 [2024-11-16 10:49:46,832 INFO L226 Difference]: Without dead ends: 393 [2024-11-16 10:49:46,833 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-16 10:49:46,834 INFO L432 NwaCegarLoop]: 464 mSDtfsCounter, 516 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-16 10:49:46,834 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-16 10:49:46,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-16 10:49:46,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2024-11-16 10:49:46,842 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-16 10:49:46,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 571 transitions. [2024-11-16 10:49:46,844 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 571 transitions. Word has length 128 [2024-11-16 10:49:46,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:49:46,844 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 571 transitions. [2024-11-16 10:49:46,844 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-16 10:49:46,844 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 571 transitions. [2024-11-16 10:49:46,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-16 10:49:46,845 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:49:46,846 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-16 10:49:46,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 10:49:46,846 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:49:46,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:49:46,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1843434888, now seen corresponding path program 1 times [2024-11-16 10:49:46,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:49:46,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220476456] [2024-11-16 10:49:46,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:49:46,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:49:46,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:47,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:49:47,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:47,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-16 10:49:47,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:47,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 10:49:47,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:47,246 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-16 10:49:47,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:49:47,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220476456] [2024-11-16 10:49:47,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220476456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:49:47,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:49:47,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 10:49:47,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557149841] [2024-11-16 10:49:47,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:49:47,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 10:49:47,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:49:47,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 10:49:47,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 10:49:47,250 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-16 10:49:47,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:49:47,453 INFO L93 Difference]: Finished difference Result 716 states and 1038 transitions. [2024-11-16 10:49:47,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:49:47,454 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-16 10:49:47,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:49:47,456 INFO L225 Difference]: With dead ends: 716 [2024-11-16 10:49:47,456 INFO L226 Difference]: Without dead ends: 393 [2024-11-16 10:49:47,457 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-16 10:49:47,457 INFO L432 NwaCegarLoop]: 460 mSDtfsCounter, 476 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-16 10:49:47,458 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-16 10:49:47,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-16 10:49:47,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2024-11-16 10:49:47,466 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-16 10:49:47,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 570 transitions. [2024-11-16 10:49:47,468 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 570 transitions. Word has length 129 [2024-11-16 10:49:47,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:49:47,468 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 570 transitions. [2024-11-16 10:49:47,469 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-16 10:49:47,469 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 570 transitions. [2024-11-16 10:49:47,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-16 10:49:47,470 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:49:47,471 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-16 10:49:47,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 10:49:47,472 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:49:47,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:49:47,472 INFO L85 PathProgramCache]: Analyzing trace with hash -851809868, now seen corresponding path program 1 times [2024-11-16 10:49:47,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:49:47,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167060812] [2024-11-16 10:49:47,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:49:47,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:49:47,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:48,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:49:48,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:48,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-16 10:49:48,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:48,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 10:49:48,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:48,166 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-16 10:49:48,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:49:48,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167060812] [2024-11-16 10:49:48,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167060812] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:49:48,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:49:48,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:49:48,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650966430] [2024-11-16 10:49:48,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:49:48,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:49:48,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:49:48,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:49:48,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:49:48,169 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-16 10:49:48,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:49:48,571 INFO L93 Difference]: Finished difference Result 722 states and 1044 transitions. [2024-11-16 10:49:48,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 10:49:48,572 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-16 10:49:48,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:49:48,575 INFO L225 Difference]: With dead ends: 722 [2024-11-16 10:49:48,575 INFO L226 Difference]: Without dead ends: 397 [2024-11-16 10:49:48,575 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-16 10:49:48,576 INFO L432 NwaCegarLoop]: 469 mSDtfsCounter, 2 mSDsluCounter, 1284 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2024-11-16 10:49:48,576 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.4s Time] [2024-11-16 10:49:48,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-11-16 10:49:48,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 395. [2024-11-16 10:49:48,587 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-16 10:49:48,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 572 transitions. [2024-11-16 10:49:48,589 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 572 transitions. Word has length 130 [2024-11-16 10:49:48,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:49:48,589 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 572 transitions. [2024-11-16 10:49:48,589 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-16 10:49:48,590 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 572 transitions. [2024-11-16 10:49:48,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-16 10:49:48,591 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:49:48,591 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-16 10:49:48,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 10:49:48,592 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:49:48,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:49:48,592 INFO L85 PathProgramCache]: Analyzing trace with hash -738772122, now seen corresponding path program 1 times [2024-11-16 10:49:48,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:49:48,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750498611] [2024-11-16 10:49:48,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:49:48,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:49:48,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:49,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:49:49,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:49,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-16 10:49:49,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:49,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 10:49:49,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:49,088 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-16 10:49:49,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:49:49,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750498611] [2024-11-16 10:49:49,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750498611] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:49:49,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:49:49,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:49:49,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279867913] [2024-11-16 10:49:49,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:49:49,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:49:49,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:49:49,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:49:49,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:49:49,091 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-16 10:49:49,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:49:49,377 INFO L93 Difference]: Finished difference Result 720 states and 1040 transitions. [2024-11-16 10:49:49,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:49:49,377 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-16 10:49:49,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:49:49,379 INFO L225 Difference]: With dead ends: 720 [2024-11-16 10:49:49,379 INFO L226 Difference]: Without dead ends: 395 [2024-11-16 10:49:49,380 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-16 10:49:49,380 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.3s IncrementalHoareTripleChecker+Time [2024-11-16 10:49:49,381 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.3s Time] [2024-11-16 10:49:49,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2024-11-16 10:49:49,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2024-11-16 10:49:49,391 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-16 10:49:49,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 571 transitions. [2024-11-16 10:49:49,392 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 571 transitions. Word has length 131 [2024-11-16 10:49:49,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:49:49,393 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 571 transitions. [2024-11-16 10:49:49,393 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-16 10:49:49,393 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 571 transitions. [2024-11-16 10:49:49,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-16 10:49:49,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:49:49,395 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-16 10:49:49,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-16 10:49:49,396 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:49:49,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:49:49,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1930057447, now seen corresponding path program 1 times [2024-11-16 10:49:49,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:49:49,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393925058] [2024-11-16 10:49:49,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:49:49,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:49:49,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:49,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:49:49,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:49,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-16 10:49:49,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:49,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 10:49:49,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:49,930 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-16 10:49:49,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:49:49,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393925058] [2024-11-16 10:49:49,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393925058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:49:49,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:49:49,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:49:49,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413800477] [2024-11-16 10:49:49,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:49:49,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:49:49,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:49:49,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:49:49,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:49:49,935 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-16 10:49:50,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:49:50,207 INFO L93 Difference]: Finished difference Result 720 states and 1038 transitions. [2024-11-16 10:49:50,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:49:50,209 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-16 10:49:50,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:49:50,211 INFO L225 Difference]: With dead ends: 720 [2024-11-16 10:49:50,211 INFO L226 Difference]: Without dead ends: 395 [2024-11-16 10:49:50,212 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-16 10:49:50,213 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-16 10:49:50,213 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-16 10:49:50,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2024-11-16 10:49:50,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2024-11-16 10:49:50,222 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-16 10:49:50,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 570 transitions. [2024-11-16 10:49:50,224 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 570 transitions. Word has length 132 [2024-11-16 10:49:50,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:49:50,225 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 570 transitions. [2024-11-16 10:49:50,225 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-16 10:49:50,225 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 570 transitions. [2024-11-16 10:49:50,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-16 10:49:50,226 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:49:50,227 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-16 10:49:50,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-16 10:49:50,227 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:49:50,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:49:50,228 INFO L85 PathProgramCache]: Analyzing trace with hash 427142582, now seen corresponding path program 1 times [2024-11-16 10:49:50,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:49:50,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680207011] [2024-11-16 10:49:50,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:49:50,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:49:50,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:50,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:49:50,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:50,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-16 10:49:50,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:50,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 10:49:50,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:50,692 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-16 10:49:50,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:49:50,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680207011] [2024-11-16 10:49:50,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680207011] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:49:50,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:49:50,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:49:50,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89663093] [2024-11-16 10:49:50,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:49:50,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:49:50,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:49:50,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:49:50,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:49:50,696 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-16 10:49:50,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:49:50,960 INFO L93 Difference]: Finished difference Result 720 states and 1036 transitions. [2024-11-16 10:49:50,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:49:50,961 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-16 10:49:50,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:49:50,963 INFO L225 Difference]: With dead ends: 720 [2024-11-16 10:49:50,963 INFO L226 Difference]: Without dead ends: 395 [2024-11-16 10:49:50,964 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-16 10:49:50,964 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.2s IncrementalHoareTripleChecker+Time [2024-11-16 10:49:50,964 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.2s Time] [2024-11-16 10:49:50,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2024-11-16 10:49:50,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2024-11-16 10:49:50,974 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-16 10:49:50,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 569 transitions. [2024-11-16 10:49:50,977 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 569 transitions. Word has length 133 [2024-11-16 10:49:50,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:49:50,977 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 569 transitions. [2024-11-16 10:49:50,977 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-16 10:49:50,978 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 569 transitions. [2024-11-16 10:49:50,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-16 10:49:50,979 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:49:50,979 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-16 10:49:50,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-16 10:49:50,979 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:49:50,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:49:50,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1214820777, now seen corresponding path program 1 times [2024-11-16 10:49:50,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:49:50,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233259861] [2024-11-16 10:49:50,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:49:50,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:49:51,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:51,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:49:51,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:51,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-16 10:49:51,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:51,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 10:49:51,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:51,627 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-16 10:49:51,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:49:51,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233259861] [2024-11-16 10:49:51,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233259861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:49:51,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:49:51,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:49:51,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920159984] [2024-11-16 10:49:51,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:49:51,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:49:51,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:49:51,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:49:51,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:49:51,633 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-16 10:49:51,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:49:51,907 INFO L93 Difference]: Finished difference Result 765 states and 1089 transitions. [2024-11-16 10:49:51,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 10:49:51,908 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-16 10:49:51,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:49:51,910 INFO L225 Difference]: With dead ends: 765 [2024-11-16 10:49:51,910 INFO L226 Difference]: Without dead ends: 440 [2024-11-16 10:49:51,911 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-16 10:49:51,912 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.3s IncrementalHoareTripleChecker+Time [2024-11-16 10:49:51,912 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.3s Time] [2024-11-16 10:49:51,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2024-11-16 10:49:51,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 438. [2024-11-16 10:49:51,922 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-16 10:49:51,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 620 transitions. [2024-11-16 10:49:51,924 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 620 transitions. Word has length 134 [2024-11-16 10:49:51,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:49:51,925 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 620 transitions. [2024-11-16 10:49:51,925 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-16 10:49:51,925 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 620 transitions. [2024-11-16 10:49:51,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-16 10:49:51,927 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:49:51,927 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-16 10:49:51,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-16 10:49:51,927 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:49:51,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:49:51,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1709401434, now seen corresponding path program 1 times [2024-11-16 10:49:51,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:49:51,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495740093] [2024-11-16 10:49:51,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:49:51,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:49:52,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:52,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:49:52,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:52,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-16 10:49:52,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:52,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 10:49:52,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:52,515 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-16 10:49:52,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:49:52,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495740093] [2024-11-16 10:49:52,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495740093] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:49:52,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:49:52,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 10:49:52,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554660994] [2024-11-16 10:49:52,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:49:52,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 10:49:52,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:49:52,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 10:49:52,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 10:49:52,518 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-16 10:49:53,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:49:53,038 INFO L93 Difference]: Finished difference Result 884 states and 1247 transitions. [2024-11-16 10:49:53,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 10:49:53,039 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-16 10:49:53,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:49:53,041 INFO L225 Difference]: With dead ends: 884 [2024-11-16 10:49:53,041 INFO L226 Difference]: Without dead ends: 442 [2024-11-16 10:49:53,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-16 10:49:53,043 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-16 10:49:53,043 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-16 10:49:53,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2024-11-16 10:49:53,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 440. [2024-11-16 10:49:53,053 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-16 10:49:53,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 621 transitions. [2024-11-16 10:49:53,055 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 621 transitions. Word has length 135 [2024-11-16 10:49:53,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:49:53,055 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 621 transitions. [2024-11-16 10:49:53,056 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-16 10:49:53,056 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 621 transitions. [2024-11-16 10:49:53,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-16 10:49:53,057 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:49:53,057 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-16 10:49:53,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-16 10:49:53,058 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:49:53,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:49:53,058 INFO L85 PathProgramCache]: Analyzing trace with hash 442097416, now seen corresponding path program 1 times [2024-11-16 10:49:53,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:49:53,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143484537] [2024-11-16 10:49:53,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:49:53,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:49:53,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:53,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 10:49:53,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:53,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 10:49:53,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:53,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 10:49:53,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:53,838 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-16 10:49:53,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:49:53,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143484537] [2024-11-16 10:49:53,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143484537] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:49:53,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:49:53,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 10:49:53,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929637492] [2024-11-16 10:49:53,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:49:53,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 10:49:53,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:49:53,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 10:49:53,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 10:49:53,842 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-16 10:49:54,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:49:54,219 INFO L93 Difference]: Finished difference Result 976 states and 1357 transitions. [2024-11-16 10:49:54,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 10:49:54,220 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-16 10:49:54,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:49:54,223 INFO L225 Difference]: With dead ends: 976 [2024-11-16 10:49:54,223 INFO L226 Difference]: Without dead ends: 606 [2024-11-16 10:49:54,225 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-16 10:49:54,225 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-16 10:49:54,225 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-16 10:49:54,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2024-11-16 10:49:54,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2024-11-16 10:49:54,243 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-16 10:49:54,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 839 transitions. [2024-11-16 10:49:54,245 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 839 transitions. Word has length 136 [2024-11-16 10:49:54,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:49:54,246 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 839 transitions. [2024-11-16 10:49:54,246 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-16 10:49:54,246 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 839 transitions. [2024-11-16 10:49:54,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2024-11-16 10:49:54,251 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:49:54,252 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-16 10:49:54,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-16 10:49:54,252 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:49:54,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:49:54,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1288056981, now seen corresponding path program 1 times [2024-11-16 10:49:54,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:49:54,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533330571] [2024-11-16 10:49:54,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:49:54,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:49:54,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:54,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 10:49:54,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:54,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 10:49:54,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:54,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 10:49:54,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:54,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2024-11-16 10:49:54,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:54,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-11-16 10:49:54,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:54,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2024-11-16 10:49:54,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:54,955 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-16 10:49:54,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:49:54,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533330571] [2024-11-16 10:49:54,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533330571] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:49:54,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:49:54,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:49:54,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483205108] [2024-11-16 10:49:54,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:49:54,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:49:54,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:49:54,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:49:54,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:49:54,958 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-16 10:49:55,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:49:55,190 INFO L93 Difference]: Finished difference Result 976 states and 1356 transitions. [2024-11-16 10:49:55,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:49:55,191 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-16 10:49:55,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:49:55,194 INFO L225 Difference]: With dead ends: 976 [2024-11-16 10:49:55,195 INFO L226 Difference]: Without dead ends: 606 [2024-11-16 10:49:55,195 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-16 10:49:55,196 INFO L432 NwaCegarLoop]: 443 mSDtfsCounter, 934 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-16 10:49:55,196 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-16 10:49:55,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2024-11-16 10:49:55,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2024-11-16 10:49:55,211 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-16 10:49:55,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 838 transitions. [2024-11-16 10:49:55,214 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 838 transitions. Word has length 325 [2024-11-16 10:49:55,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:49:55,214 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 838 transitions. [2024-11-16 10:49:55,214 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-16 10:49:55,215 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 838 transitions. [2024-11-16 10:49:55,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2024-11-16 10:49:55,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:49:55,219 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-16 10:49:55,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-16 10:49:55,220 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:49:55,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:49:55,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1842590603, now seen corresponding path program 1 times [2024-11-16 10:49:55,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:49:55,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670999906] [2024-11-16 10:49:55,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:49:55,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:49:55,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:55,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 10:49:55,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:55,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 10:49:55,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:55,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 10:49:55,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:55,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2024-11-16 10:49:55,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:55,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-11-16 10:49:55,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:55,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-11-16 10:49:55,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:55,886 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-16 10:49:55,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:49:55,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670999906] [2024-11-16 10:49:55,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670999906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:49:55,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:49:55,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:49:55,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521680513] [2024-11-16 10:49:55,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:49:55,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:49:55,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:49:55,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:49:55,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:49:55,890 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-16 10:49:56,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:49:56,126 INFO L93 Difference]: Finished difference Result 976 states and 1354 transitions. [2024-11-16 10:49:56,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:49:56,127 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-16 10:49:56,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:49:56,129 INFO L225 Difference]: With dead ends: 976 [2024-11-16 10:49:56,129 INFO L226 Difference]: Without dead ends: 606 [2024-11-16 10:49:56,132 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-16 10:49:56,133 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-16 10:49:56,133 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-16 10:49:56,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2024-11-16 10:49:56,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2024-11-16 10:49:56,148 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-16 10:49:56,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 837 transitions. [2024-11-16 10:49:56,150 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 837 transitions. Word has length 326 [2024-11-16 10:49:56,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:49:56,151 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 837 transitions. [2024-11-16 10:49:56,151 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-16 10:49:56,151 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 837 transitions. [2024-11-16 10:49:56,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2024-11-16 10:49:56,155 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:49:56,155 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-16 10:49:56,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-16 10:49:56,155 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:49:56,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:49:56,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1577035716, now seen corresponding path program 1 times [2024-11-16 10:49:56,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:49:56,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039690274] [2024-11-16 10:49:56,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:49:56,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:49:56,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:56,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 10:49:56,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:56,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 10:49:56,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:56,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 10:49:56,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:56,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2024-11-16 10:49:56,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:56,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2024-11-16 10:49:56,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:56,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2024-11-16 10:49:56,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:56,793 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-16 10:49:56,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:49:56,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039690274] [2024-11-16 10:49:56,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039690274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:49:56,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:49:56,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:49:56,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597237874] [2024-11-16 10:49:56,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:49:56,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:49:56,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:49:56,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:49:56,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:49:56,836 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-16 10:49:57,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:49:57,083 INFO L93 Difference]: Finished difference Result 976 states and 1352 transitions. [2024-11-16 10:49:57,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:49:57,083 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-16 10:49:57,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:49:57,086 INFO L225 Difference]: With dead ends: 976 [2024-11-16 10:49:57,086 INFO L226 Difference]: Without dead ends: 606 [2024-11-16 10:49:57,087 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-16 10:49:57,088 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-16 10:49:57,088 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-16 10:49:57,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2024-11-16 10:49:57,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2024-11-16 10:49:57,105 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-16 10:49:57,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 836 transitions. [2024-11-16 10:49:57,108 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 836 transitions. Word has length 327 [2024-11-16 10:49:57,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:49:57,109 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 836 transitions. [2024-11-16 10:49:57,109 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-16 10:49:57,109 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 836 transitions. [2024-11-16 10:49:57,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2024-11-16 10:49:57,114 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:49:57,114 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-16 10:49:57,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-16 10:49:57,115 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:49:57,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:49:57,116 INFO L85 PathProgramCache]: Analyzing trace with hash -322535620, now seen corresponding path program 1 times [2024-11-16 10:49:57,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:49:57,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70106394] [2024-11-16 10:49:57,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:49:57,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:49:57,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:57,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 10:49:57,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:57,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 10:49:57,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:57,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 10:49:57,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:57,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-11-16 10:49:57,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:57,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-11-16 10:49:57,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:57,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2024-11-16 10:49:57,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:57,854 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-16 10:49:57,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:49:57,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70106394] [2024-11-16 10:49:57,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70106394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:49:57,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:49:57,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:49:57,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89238900] [2024-11-16 10:49:57,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:49:57,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:49:57,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:49:57,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:49:57,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:49:57,858 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-16 10:49:58,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:49:58,087 INFO L93 Difference]: Finished difference Result 976 states and 1350 transitions. [2024-11-16 10:49:58,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:49:58,088 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-16 10:49:58,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:49:58,091 INFO L225 Difference]: With dead ends: 976 [2024-11-16 10:49:58,091 INFO L226 Difference]: Without dead ends: 606 [2024-11-16 10:49:58,092 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-16 10:49:58,092 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-16 10:49:58,093 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-16 10:49:58,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2024-11-16 10:49:58,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2024-11-16 10:49:58,107 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-16 10:49:58,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 835 transitions. [2024-11-16 10:49:58,109 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 835 transitions. Word has length 328 [2024-11-16 10:49:58,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:49:58,110 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 835 transitions. [2024-11-16 10:49:58,110 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-16 10:49:58,110 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 835 transitions. [2024-11-16 10:49:58,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2024-11-16 10:49:58,114 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:49:58,115 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-16 10:49:58,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-16 10:49:58,116 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:49:58,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:49:58,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1910821235, now seen corresponding path program 1 times [2024-11-16 10:49:58,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:49:58,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051759017] [2024-11-16 10:49:58,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:49:58,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:49:58,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:58,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 10:49:58,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:58,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 10:49:58,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:58,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 10:49:58,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:58,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-11-16 10:49:58,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:58,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-11-16 10:49:58,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:58,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-11-16 10:49:58,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:58,833 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-16 10:49:58,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:49:58,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051759017] [2024-11-16 10:49:58,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051759017] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:49:58,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:49:58,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:49:58,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807435097] [2024-11-16 10:49:58,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:49:58,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:49:58,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:49:58,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:49:58,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:49:58,837 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-16 10:49:59,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:49:59,051 INFO L93 Difference]: Finished difference Result 976 states and 1348 transitions. [2024-11-16 10:49:59,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:49:59,052 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-16 10:49:59,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:49:59,055 INFO L225 Difference]: With dead ends: 976 [2024-11-16 10:49:59,055 INFO L226 Difference]: Without dead ends: 606 [2024-11-16 10:49:59,056 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-16 10:49:59,056 INFO L432 NwaCegarLoop]: 452 mSDtfsCounter, 474 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2024-11-16 10:49:59,056 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.2s Time] [2024-11-16 10:49:59,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2024-11-16 10:49:59,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2024-11-16 10:49:59,074 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-16 10:49:59,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 834 transitions. [2024-11-16 10:49:59,077 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 834 transitions. Word has length 329 [2024-11-16 10:49:59,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:49:59,078 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 834 transitions. [2024-11-16 10:49:59,079 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-16 10:49:59,079 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 834 transitions. [2024-11-16 10:49:59,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2024-11-16 10:49:59,084 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:49:59,085 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-16 10:49:59,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-16 10:49:59,085 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:49:59,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:49:59,086 INFO L85 PathProgramCache]: Analyzing trace with hash 112832621, now seen corresponding path program 1 times [2024-11-16 10:49:59,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:49:59,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082940288] [2024-11-16 10:49:59,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:49:59,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:49:59,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:59,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 10:49:59,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:59,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 10:49:59,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:59,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 10:49:59,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:59,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2024-11-16 10:49:59,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:59,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-16 10:49:59,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:59,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2024-11-16 10:49:59,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:49:59,811 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-16 10:49:59,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:49:59,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082940288] [2024-11-16 10:49:59,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082940288] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:49:59,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:49:59,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:49:59,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654103197] [2024-11-16 10:49:59,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:49:59,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:49:59,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:49:59,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:49:59,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:49:59,814 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-16 10:50:00,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:00,016 INFO L93 Difference]: Finished difference Result 976 states and 1346 transitions. [2024-11-16 10:50:00,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:50:00,016 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-16 10:50:00,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:00,019 INFO L225 Difference]: With dead ends: 976 [2024-11-16 10:50:00,019 INFO L226 Difference]: Without dead ends: 606 [2024-11-16 10:50:00,020 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-16 10:50:00,021 INFO L432 NwaCegarLoop]: 452 mSDtfsCounter, 466 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.2s IncrementalHoareTripleChecker+Time [2024-11-16 10:50:00,022 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.2s Time] [2024-11-16 10:50:00,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2024-11-16 10:50:00,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2024-11-16 10:50:00,036 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-16 10:50:00,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 833 transitions. [2024-11-16 10:50:00,038 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 833 transitions. Word has length 330 [2024-11-16 10:50:00,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:00,039 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 833 transitions. [2024-11-16 10:50:00,039 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-16 10:50:00,039 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 833 transitions. [2024-11-16 10:50:00,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2024-11-16 10:50:00,041 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:00,041 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-16 10:50:00,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-16 10:50:00,041 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:00,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:00,042 INFO L85 PathProgramCache]: Analyzing trace with hash 374051422, now seen corresponding path program 1 times [2024-11-16 10:50:00,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:00,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760389158] [2024-11-16 10:50:00,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:00,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:00,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:00,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 10:50:00,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:00,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 10:50:00,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:00,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 10:50:00,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:00,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2024-11-16 10:50:00,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:00,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2024-11-16 10:50:00,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:00,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2024-11-16 10:50:00,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:00,772 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-16 10:50:00,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:00,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760389158] [2024-11-16 10:50:00,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760389158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:00,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:00,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:50:00,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968769576] [2024-11-16 10:50:00,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:00,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:50:00,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:00,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:50:00,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:50:00,775 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-16 10:50:01,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:01,172 INFO L93 Difference]: Finished difference Result 976 states and 1344 transitions. [2024-11-16 10:50:01,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:50:01,173 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-16 10:50:01,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:01,175 INFO L225 Difference]: With dead ends: 976 [2024-11-16 10:50:01,175 INFO L226 Difference]: Without dead ends: 606 [2024-11-16 10:50:01,176 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-16 10:50:01,177 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.4s IncrementalHoareTripleChecker+Time [2024-11-16 10:50:01,177 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.4s Time] [2024-11-16 10:50:01,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2024-11-16 10:50:01,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2024-11-16 10:50:01,190 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-16 10:50:01,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 832 transitions. [2024-11-16 10:50:01,192 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 832 transitions. Word has length 331 [2024-11-16 10:50:01,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:01,192 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 832 transitions. [2024-11-16 10:50:01,192 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-16 10:50:01,193 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 832 transitions. [2024-11-16 10:50:01,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2024-11-16 10:50:01,194 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:01,195 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-16 10:50:01,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-16 10:50:01,195 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:01,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:01,195 INFO L85 PathProgramCache]: Analyzing trace with hash 591431454, now seen corresponding path program 1 times [2024-11-16 10:50:01,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:01,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850920125] [2024-11-16 10:50:01,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:01,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:01,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:02,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 10:50:02,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:02,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 10:50:02,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:02,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 10:50:02,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:02,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-11-16 10:50:02,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:02,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2024-11-16 10:50:02,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:02,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2024-11-16 10:50:02,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:02,483 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-16 10:50:02,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:02,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850920125] [2024-11-16 10:50:02,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850920125] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:02,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:02,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 10:50:02,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050964263] [2024-11-16 10:50:02,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:02,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 10:50:02,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:02,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 10:50:02,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 10:50:02,487 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-16 10:50:02,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:02,689 INFO L93 Difference]: Finished difference Result 976 states and 1342 transitions. [2024-11-16 10:50:02,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:50:02,690 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-16 10:50:02,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:02,693 INFO L225 Difference]: With dead ends: 976 [2024-11-16 10:50:02,693 INFO L226 Difference]: Without dead ends: 606 [2024-11-16 10:50:02,693 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-16 10:50:02,694 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.2s IncrementalHoareTripleChecker+Time [2024-11-16 10:50:02,695 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.2s Time] [2024-11-16 10:50:02,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2024-11-16 10:50:02,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2024-11-16 10:50:02,713 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-16 10:50:02,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 831 transitions. [2024-11-16 10:50:02,715 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 831 transitions. Word has length 332 [2024-11-16 10:50:02,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:02,716 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 831 transitions. [2024-11-16 10:50:02,716 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-16 10:50:02,716 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 831 transitions. [2024-11-16 10:50:02,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2024-11-16 10:50:02,720 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:02,720 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-16 10:50:02,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-16 10:50:02,721 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:02,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:02,721 INFO L85 PathProgramCache]: Analyzing trace with hash -2119225673, now seen corresponding path program 1 times [2024-11-16 10:50:02,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:02,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452781802] [2024-11-16 10:50:02,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:02,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:03,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:03,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 10:50:03,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:03,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 10:50:03,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:03,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 10:50:03,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:03,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-11-16 10:50:03,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:03,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2024-11-16 10:50:03,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:03,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2024-11-16 10:50:03,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:03,883 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-16 10:50:03,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:03,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452781802] [2024-11-16 10:50:03,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452781802] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:03,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:03,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:50:03,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011324750] [2024-11-16 10:50:03,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:03,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:50:03,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:03,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:50:03,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:50:03,886 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-16 10:50:04,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:04,150 INFO L93 Difference]: Finished difference Result 976 states and 1340 transitions. [2024-11-16 10:50:04,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:50:04,154 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-16 10:50:04,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:04,157 INFO L225 Difference]: With dead ends: 976 [2024-11-16 10:50:04,160 INFO L226 Difference]: Without dead ends: 606 [2024-11-16 10:50:04,161 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-16 10:50:04,161 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.2s IncrementalHoareTripleChecker+Time [2024-11-16 10:50:04,161 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.2s Time] [2024-11-16 10:50:04,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2024-11-16 10:50:04,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2024-11-16 10:50:04,179 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-16 10:50:04,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 830 transitions. [2024-11-16 10:50:04,181 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 830 transitions. Word has length 333 [2024-11-16 10:50:04,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:04,182 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 830 transitions. [2024-11-16 10:50:04,182 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-16 10:50:04,182 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 830 transitions. [2024-11-16 10:50:04,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2024-11-16 10:50:04,184 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:04,184 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-16 10:50:04,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-16 10:50:04,185 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:04,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:04,185 INFO L85 PathProgramCache]: Analyzing trace with hash -389461580, now seen corresponding path program 1 times [2024-11-16 10:50:04,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:04,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471624066] [2024-11-16 10:50:04,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:04,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:04,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:05,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 10:50:05,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:05,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 10:50:05,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:05,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 10:50:05,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:05,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2024-11-16 10:50:05,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:05,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2024-11-16 10:50:05,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:05,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2024-11-16 10:50:05,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:05,232 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-16 10:50:05,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:05,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471624066] [2024-11-16 10:50:05,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471624066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:05,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:05,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:50:05,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162358887] [2024-11-16 10:50:05,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:05,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:50:05,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:05,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:50:05,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:50:05,235 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-16 10:50:05,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:05,479 INFO L93 Difference]: Finished difference Result 976 states and 1338 transitions. [2024-11-16 10:50:05,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:50:05,480 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-16 10:50:05,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:05,482 INFO L225 Difference]: With dead ends: 976 [2024-11-16 10:50:05,482 INFO L226 Difference]: Without dead ends: 606 [2024-11-16 10:50:05,483 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-16 10:50:05,484 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-16 10:50:05,484 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-16 10:50:05,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2024-11-16 10:50:05,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2024-11-16 10:50:05,496 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-16 10:50:05,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 829 transitions. [2024-11-16 10:50:05,498 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 829 transitions. Word has length 334 [2024-11-16 10:50:05,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:05,498 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 829 transitions. [2024-11-16 10:50:05,498 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-16 10:50:05,499 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 829 transitions. [2024-11-16 10:50:05,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2024-11-16 10:50:05,501 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:05,501 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-16 10:50:05,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-16 10:50:05,501 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:05,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:05,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1452021348, now seen corresponding path program 1 times [2024-11-16 10:50:05,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:05,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769944184] [2024-11-16 10:50:05,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:05,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:05,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:06,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 10:50:06,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:06,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 10:50:06,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:06,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 10:50:06,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:06,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2024-11-16 10:50:06,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:06,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2024-11-16 10:50:06,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:06,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-11-16 10:50:06,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:06,433 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-16 10:50:06,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:06,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769944184] [2024-11-16 10:50:06,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769944184] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:06,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:06,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:50:06,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950306905] [2024-11-16 10:50:06,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:06,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:50:06,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:06,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:50:06,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:50:06,435 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-16 10:50:06,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:06,698 INFO L93 Difference]: Finished difference Result 976 states and 1336 transitions. [2024-11-16 10:50:06,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:50:06,699 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-16 10:50:06,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:06,701 INFO L225 Difference]: With dead ends: 976 [2024-11-16 10:50:06,701 INFO L226 Difference]: Without dead ends: 606 [2024-11-16 10:50:06,702 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-16 10:50:06,703 INFO L432 NwaCegarLoop]: 439 mSDtfsCounter, 451 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-16 10:50:06,703 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-16 10:50:06,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2024-11-16 10:50:06,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2024-11-16 10:50:06,717 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-16 10:50:06,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 828 transitions. [2024-11-16 10:50:06,719 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 828 transitions. Word has length 335 [2024-11-16 10:50:06,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:06,719 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 828 transitions. [2024-11-16 10:50:06,719 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-16 10:50:06,720 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 828 transitions. [2024-11-16 10:50:06,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2024-11-16 10:50:06,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:06,722 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-16 10:50:06,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-16 10:50:06,722 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:06,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:06,723 INFO L85 PathProgramCache]: Analyzing trace with hash -732615663, now seen corresponding path program 1 times [2024-11-16 10:50:06,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:06,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398325345] [2024-11-16 10:50:06,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:06,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:07,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:07,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 10:50:07,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:07,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 10:50:07,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:07,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 10:50:07,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:07,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2024-11-16 10:50:07,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:07,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2024-11-16 10:50:07,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:07,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-11-16 10:50:07,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:07,907 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-16 10:50:07,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:07,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398325345] [2024-11-16 10:50:07,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398325345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:07,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:07,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 10:50:07,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608544099] [2024-11-16 10:50:07,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:07,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 10:50:07,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:07,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 10:50:07,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 10:50:07,910 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-16 10:50:08,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:08,483 INFO L93 Difference]: Finished difference Result 1423 states and 1951 transitions. [2024-11-16 10:50:08,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 10:50:08,484 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-16 10:50:08,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:08,488 INFO L225 Difference]: With dead ends: 1423 [2024-11-16 10:50:08,489 INFO L226 Difference]: Without dead ends: 1053 [2024-11-16 10:50:08,490 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-16 10:50:08,490 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-16 10:50:08,491 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-16 10:50:08,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2024-11-16 10:50:08,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 931. [2024-11-16 10:50:08,516 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-16 10:50:08,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1270 transitions. [2024-11-16 10:50:08,518 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1270 transitions. Word has length 336 [2024-11-16 10:50:08,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:08,518 INFO L471 AbstractCegarLoop]: Abstraction has 931 states and 1270 transitions. [2024-11-16 10:50:08,519 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-16 10:50:08,519 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1270 transitions. [2024-11-16 10:50:08,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2024-11-16 10:50:08,521 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:08,522 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-16 10:50:08,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-16 10:50:08,522 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:08,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:08,522 INFO L85 PathProgramCache]: Analyzing trace with hash -234564701, now seen corresponding path program 1 times [2024-11-16 10:50:08,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:08,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178022859] [2024-11-16 10:50:08,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:08,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:09,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:10,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 10:50:10,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:10,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 10:50:10,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:10,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 10:50:10,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:10,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2024-11-16 10:50:10,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:10,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2024-11-16 10:50:10,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:10,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2024-11-16 10:50:10,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:10,186 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-16 10:50:10,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:10,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178022859] [2024-11-16 10:50:10,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178022859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:10,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:10,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:50:10,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086388729] [2024-11-16 10:50:10,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:10,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:50:10,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:10,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:50:10,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:50:10,189 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-16 10:50:10,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:10,568 INFO L93 Difference]: Finished difference Result 1591 states and 2147 transitions. [2024-11-16 10:50:10,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 10:50:10,569 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-16 10:50:10,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:10,572 INFO L225 Difference]: With dead ends: 1591 [2024-11-16 10:50:10,572 INFO L226 Difference]: Without dead ends: 943 [2024-11-16 10:50:10,573 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-16 10:50:10,574 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.4s IncrementalHoareTripleChecker+Time [2024-11-16 10:50:10,574 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.4s Time] [2024-11-16 10:50:10,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2024-11-16 10:50:10,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 937. [2024-11-16 10:50:10,598 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-16 10:50:10,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1276 transitions. [2024-11-16 10:50:10,600 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1276 transitions. Word has length 337 [2024-11-16 10:50:10,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:10,600 INFO L471 AbstractCegarLoop]: Abstraction has 937 states and 1276 transitions. [2024-11-16 10:50:10,601 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-16 10:50:10,601 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1276 transitions. [2024-11-16 10:50:10,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2024-11-16 10:50:10,603 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:10,603 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-16 10:50:10,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-16 10:50:10,604 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:10,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:10,604 INFO L85 PathProgramCache]: Analyzing trace with hash -2039613949, now seen corresponding path program 1 times [2024-11-16 10:50:10,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:10,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652979395] [2024-11-16 10:50:10,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:10,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:11,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:12,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 10:50:12,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:12,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 10:50:12,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:12,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 10:50:12,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:12,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2024-11-16 10:50:12,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:12,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2024-11-16 10:50:12,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:12,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2024-11-16 10:50:12,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:12,112 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-16 10:50:12,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:12,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652979395] [2024-11-16 10:50:12,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652979395] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:12,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:12,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 10:50:12,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418596079] [2024-11-16 10:50:12,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:12,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 10:50:12,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:12,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 10:50:12,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-16 10:50:12,114 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-16 10:50:12,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:12,557 INFO L93 Difference]: Finished difference Result 1593 states and 2143 transitions. [2024-11-16 10:50:12,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 10:50:12,557 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-16 10:50:12,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:12,561 INFO L225 Difference]: With dead ends: 1593 [2024-11-16 10:50:12,561 INFO L226 Difference]: Without dead ends: 943 [2024-11-16 10:50:12,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-16 10:50:12,563 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-16 10:50:12,563 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-16 10:50:12,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2024-11-16 10:50:12,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 937. [2024-11-16 10:50:12,584 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-16 10:50:12,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1270 transitions. [2024-11-16 10:50:12,586 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1270 transitions. Word has length 337 [2024-11-16 10:50:12,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:12,587 INFO L471 AbstractCegarLoop]: Abstraction has 937 states and 1270 transitions. [2024-11-16 10:50:12,590 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-16 10:50:12,590 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1270 transitions. [2024-11-16 10:50:12,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2024-11-16 10:50:12,596 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:12,596 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-16 10:50:12,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-16 10:50:12,597 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:12,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:12,598 INFO L85 PathProgramCache]: Analyzing trace with hash -941868125, now seen corresponding path program 1 times [2024-11-16 10:50:12,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:12,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916093310] [2024-11-16 10:50:12,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:12,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:13,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:13,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 10:50:13,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:13,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 10:50:13,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:13,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 10:50:13,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:13,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-11-16 10:50:13,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:13,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-11-16 10:50:13,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:13,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2024-11-16 10:50:13,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:13,795 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-16 10:50:13,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:13,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916093310] [2024-11-16 10:50:13,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916093310] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:13,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:13,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 10:50:13,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29976738] [2024-11-16 10:50:13,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:13,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 10:50:13,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:13,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 10:50:13,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-16 10:50:13,799 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-16 10:50:14,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:14,447 INFO L93 Difference]: Finished difference Result 1332 states and 1810 transitions. [2024-11-16 10:50:14,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 10:50:14,447 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-16 10:50:14,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:14,451 INFO L225 Difference]: With dead ends: 1332 [2024-11-16 10:50:14,451 INFO L226 Difference]: Without dead ends: 960 [2024-11-16 10:50:14,452 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-16 10:50:14,452 INFO L432 NwaCegarLoop]: 334 mSDtfsCounter, 760 mSDsluCounter, 986 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2024-11-16 10:50:14,452 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.6s Time] [2024-11-16 10:50:14,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2024-11-16 10:50:14,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 938. [2024-11-16 10:50:14,472 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-16 10:50:14,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1271 transitions. [2024-11-16 10:50:14,474 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1271 transitions. Word has length 339 [2024-11-16 10:50:14,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:14,474 INFO L471 AbstractCegarLoop]: Abstraction has 938 states and 1271 transitions. [2024-11-16 10:50:14,474 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-16 10:50:14,475 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1271 transitions. [2024-11-16 10:50:14,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2024-11-16 10:50:14,477 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:14,477 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-16 10:50:14,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-16 10:50:14,478 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:14,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:14,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1460276707, now seen corresponding path program 1 times [2024-11-16 10:50:14,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:14,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806925218] [2024-11-16 10:50:14,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:14,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:14,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:15,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 10:50:15,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:15,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 10:50:15,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:15,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 10:50:15,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:15,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-11-16 10:50:15,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:15,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-11-16 10:50:15,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:15,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2024-11-16 10:50:15,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:15,722 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-16 10:50:15,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:15,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806925218] [2024-11-16 10:50:15,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806925218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:15,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:15,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 10:50:15,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337819739] [2024-11-16 10:50:15,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:15,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 10:50:15,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:15,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 10:50:15,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-16 10:50:15,724 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-16 10:50:16,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:16,430 INFO L93 Difference]: Finished difference Result 2114 states and 2857 transitions. [2024-11-16 10:50:16,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 10:50:16,431 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-16 10:50:16,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:16,437 INFO L225 Difference]: With dead ends: 2114 [2024-11-16 10:50:16,438 INFO L226 Difference]: Without dead ends: 1626 [2024-11-16 10:50:16,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-16 10:50:16,441 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-16 10:50:16,442 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-16 10:50:16,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2024-11-16 10:50:16,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 1007. [2024-11-16 10:50:16,469 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-16 10:50:16,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1369 transitions. [2024-11-16 10:50:16,470 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1369 transitions. Word has length 339 [2024-11-16 10:50:16,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:16,471 INFO L471 AbstractCegarLoop]: Abstraction has 1007 states and 1369 transitions. [2024-11-16 10:50:16,471 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-16 10:50:16,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1369 transitions. [2024-11-16 10:50:16,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2024-11-16 10:50:16,474 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:16,475 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-16 10:50:16,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-16 10:50:16,475 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:16,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:16,475 INFO L85 PathProgramCache]: Analyzing trace with hash -942292791, now seen corresponding path program 1 times [2024-11-16 10:50:16,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:16,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220888592] [2024-11-16 10:50:16,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:16,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:17,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:17,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 10:50:17,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:17,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 10:50:17,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:17,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 10:50:17,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:17,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2024-11-16 10:50:17,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:17,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2024-11-16 10:50:17,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:17,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2024-11-16 10:50:17,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:17,537 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-16 10:50:17,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:17,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220888592] [2024-11-16 10:50:17,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220888592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:17,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:17,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 10:50:17,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826609547] [2024-11-16 10:50:17,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:17,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 10:50:17,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:17,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 10:50:17,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-16 10:50:17,540 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-16 10:50:18,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:18,123 INFO L93 Difference]: Finished difference Result 1836 states and 2485 transitions. [2024-11-16 10:50:18,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 10:50:18,124 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-16 10:50:18,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:18,129 INFO L225 Difference]: With dead ends: 1836 [2024-11-16 10:50:18,129 INFO L226 Difference]: Without dead ends: 1023 [2024-11-16 10:50:18,131 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-16 10:50:18,131 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-16 10:50:18,131 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-16 10:50:18,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2024-11-16 10:50:18,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 1015. [2024-11-16 10:50:18,196 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-16 10:50:18,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1373 transitions. [2024-11-16 10:50:18,199 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1373 transitions. Word has length 340 [2024-11-16 10:50:18,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:18,199 INFO L471 AbstractCegarLoop]: Abstraction has 1015 states and 1373 transitions. [2024-11-16 10:50:18,200 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-16 10:50:18,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1373 transitions. [2024-11-16 10:50:18,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2024-11-16 10:50:18,204 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:18,204 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-16 10:50:18,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-16 10:50:18,205 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:18,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:18,205 INFO L85 PathProgramCache]: Analyzing trace with hash 652915605, now seen corresponding path program 1 times [2024-11-16 10:50:18,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:18,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638567975] [2024-11-16 10:50:18,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:18,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:18,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:19,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 10:50:19,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:19,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 10:50:19,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:19,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 10:50:19,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:19,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-11-16 10:50:19,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:19,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-11-16 10:50:19,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:19,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2024-11-16 10:50:19,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:19,422 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-16 10:50:19,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:19,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638567975] [2024-11-16 10:50:19,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638567975] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:19,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:19,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 10:50:19,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308031581] [2024-11-16 10:50:19,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:19,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 10:50:19,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:19,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 10:50:19,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 10:50:19,424 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-16 10:50:19,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:19,897 INFO L93 Difference]: Finished difference Result 1886 states and 2538 transitions. [2024-11-16 10:50:19,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 10:50:19,898 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-16 10:50:19,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:19,901 INFO L225 Difference]: With dead ends: 1886 [2024-11-16 10:50:19,901 INFO L226 Difference]: Without dead ends: 1023 [2024-11-16 10:50:19,902 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-16 10:50:19,903 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.4s IncrementalHoareTripleChecker+Time [2024-11-16 10:50:19,903 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.4s Time] [2024-11-16 10:50:19,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2024-11-16 10:50:19,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 1019. [2024-11-16 10:50:19,925 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-16 10:50:19,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1377 transitions. [2024-11-16 10:50:19,927 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1377 transitions. Word has length 342 [2024-11-16 10:50:19,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:19,927 INFO L471 AbstractCegarLoop]: Abstraction has 1019 states and 1377 transitions. [2024-11-16 10:50:19,927 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-16 10:50:19,928 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1377 transitions. [2024-11-16 10:50:19,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2024-11-16 10:50:19,930 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:19,931 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-16 10:50:19,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-16 10:50:19,931 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:19,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:19,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1939911671, now seen corresponding path program 1 times [2024-11-16 10:50:19,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:19,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828353613] [2024-11-16 10:50:19,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:19,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:20,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:22,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 10:50:22,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:22,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 10:50:22,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:22,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 10:50:22,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:22,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-11-16 10:50:22,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:22,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2024-11-16 10:50:22,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:22,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2024-11-16 10:50:22,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:22,119 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-16 10:50:22,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:22,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828353613] [2024-11-16 10:50:22,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828353613] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:22,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:22,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 10:50:22,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209737506] [2024-11-16 10:50:22,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:22,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 10:50:22,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:22,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 10:50:22,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-16 10:50:22,123 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-16 10:50:22,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:22,844 INFO L93 Difference]: Finished difference Result 1855 states and 2493 transitions. [2024-11-16 10:50:22,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 10:50:22,845 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-16 10:50:22,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:22,849 INFO L225 Difference]: With dead ends: 1855 [2024-11-16 10:50:22,849 INFO L226 Difference]: Without dead ends: 1051 [2024-11-16 10:50:22,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-16 10:50:22,851 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-16 10:50:22,851 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-16 10:50:22,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2024-11-16 10:50:22,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 1039. [2024-11-16 10:50:22,872 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-16 10:50:22,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 1039 states and 1401 transitions. [2024-11-16 10:50:22,874 INFO L78 Accepts]: Start accepts. Automaton has 1039 states and 1401 transitions. Word has length 344 [2024-11-16 10:50:22,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:22,875 INFO L471 AbstractCegarLoop]: Abstraction has 1039 states and 1401 transitions. [2024-11-16 10:50:22,875 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-16 10:50:22,875 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 1401 transitions. [2024-11-16 10:50:22,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2024-11-16 10:50:22,878 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:22,878 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-16 10:50:22,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-16 10:50:22,879 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:22,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:22,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1066762919, now seen corresponding path program 1 times [2024-11-16 10:50:22,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:22,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029563707] [2024-11-16 10:50:22,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:22,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:23,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:24,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 10:50:24,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:24,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 10:50:24,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:24,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 10:50:24,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:24,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2024-11-16 10:50:24,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:24,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2024-11-16 10:50:24,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:24,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2024-11-16 10:50:24,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:24,679 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-16 10:50:24,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:24,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029563707] [2024-11-16 10:50:24,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029563707] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 10:50:24,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746176074] [2024-11-16 10:50:24,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:24,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 10:50:24,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 10:50:24,682 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-16 10:50:24,683 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-16 10:50:25,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:25,782 INFO L255 TraceCheckSpWp]: Trace formula consists of 2056 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-16 10:50:25,807 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 10:50:26,711 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-16 10:50:26,711 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 10:50:28,165 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-16 10:50:28,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746176074] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 10:50:28,166 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 10:50:28,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 26 [2024-11-16 10:50:28,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605522518] [2024-11-16 10:50:28,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 10:50:28,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-16 10:50:28,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:28,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-16 10:50:28,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=561, Unknown=0, NotChecked=0, Total=650 [2024-11-16 10:50:28,171 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-16 10:50:30,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:30,211 INFO L93 Difference]: Finished difference Result 1876 states and 2525 transitions. [2024-11-16 10:50:30,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-16 10:50:30,212 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-16 10:50:30,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:30,215 INFO L225 Difference]: With dead ends: 1876 [2024-11-16 10:50:30,215 INFO L226 Difference]: Without dead ends: 1067 [2024-11-16 10:50:30,217 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-16 10:50:30,218 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-16 10:50:30,218 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-16 10:50:30,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2024-11-16 10:50:30,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 1036. [2024-11-16 10:50:30,242 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-16 10:50:30,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1391 transitions. [2024-11-16 10:50:30,244 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1391 transitions. Word has length 346 [2024-11-16 10:50:30,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:30,244 INFO L471 AbstractCegarLoop]: Abstraction has 1036 states and 1391 transitions. [2024-11-16 10:50:30,244 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-16 10:50:30,245 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1391 transitions. [2024-11-16 10:50:30,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2024-11-16 10:50:30,247 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:30,248 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-16 10:50:30,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-16 10:50:30,448 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-16 10:50:30,449 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:30,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:30,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1181279150, now seen corresponding path program 1 times [2024-11-16 10:50:30,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:30,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888793001] [2024-11-16 10:50:30,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:30,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:30,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:30,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 10:50:30,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:30,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 10:50:30,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:30,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 10:50:31,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:31,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-11-16 10:50:31,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:31,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-11-16 10:50:31,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:31,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2024-11-16 10:50:31,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:31,007 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-16 10:50:31,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:31,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888793001] [2024-11-16 10:50:31,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888793001] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:31,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:31,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:50:31,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105765885] [2024-11-16 10:50:31,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:31,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:50:31,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:31,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:50:31,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:50:31,010 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-16 10:50:31,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:31,198 INFO L93 Difference]: Finished difference Result 1709 states and 2299 transitions. [2024-11-16 10:50:31,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 10:50:31,199 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-16 10:50:31,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:31,207 INFO L225 Difference]: With dead ends: 1709 [2024-11-16 10:50:31,211 INFO L226 Difference]: Without dead ends: 1090 [2024-11-16 10:50:31,213 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-16 10:50:31,214 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-16 10:50:31,214 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-16 10:50:31,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2024-11-16 10:50:31,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 1090. [2024-11-16 10:50:31,238 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-16 10:50:31,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 1469 transitions. [2024-11-16 10:50:31,240 INFO L78 Accepts]: Start accepts. Automaton has 1090 states and 1469 transitions. Word has length 350 [2024-11-16 10:50:31,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:31,241 INFO L471 AbstractCegarLoop]: Abstraction has 1090 states and 1469 transitions. [2024-11-16 10:50:31,241 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-16 10:50:31,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1469 transitions. [2024-11-16 10:50:31,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2024-11-16 10:50:31,244 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:31,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, 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-16 10:50:31,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-16 10:50:31,245 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:31,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:31,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1628293583, now seen corresponding path program 1 times [2024-11-16 10:50:31,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:31,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485369272] [2024-11-16 10:50:31,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:31,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:31,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:31,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 10:50:31,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:31,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 10:50:31,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:31,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 10:50:31,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:31,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-11-16 10:50:31,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:31,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-11-16 10:50:31,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:31,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2024-11-16 10:50:31,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:31,840 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-16 10:50:31,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:31,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485369272] [2024-11-16 10:50:31,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485369272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:31,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:31,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 10:50:31,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896339343] [2024-11-16 10:50:31,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:31,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 10:50:31,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:31,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 10:50:31,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 10:50:31,842 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-16 10:50:31,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:31,986 INFO L93 Difference]: Finished difference Result 1861 states and 2493 transitions. [2024-11-16 10:50:31,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:50:31,986 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-16 10:50:31,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:31,989 INFO L225 Difference]: With dead ends: 1861 [2024-11-16 10:50:31,989 INFO L226 Difference]: Without dead ends: 1096 [2024-11-16 10:50:31,990 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-16 10:50:31,991 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.1s IncrementalHoareTripleChecker+Time [2024-11-16 10:50:31,991 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.1s Time] [2024-11-16 10:50:31,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1096 states. [2024-11-16 10:50:32,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1096 to 1096. [2024-11-16 10:50:32,013 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-16 10:50:32,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 1096 states and 1475 transitions. [2024-11-16 10:50:32,015 INFO L78 Accepts]: Start accepts. Automaton has 1096 states and 1475 transitions. Word has length 351 [2024-11-16 10:50:32,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:32,015 INFO L471 AbstractCegarLoop]: Abstraction has 1096 states and 1475 transitions. [2024-11-16 10:50:32,016 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-16 10:50:32,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 1475 transitions. [2024-11-16 10:50:32,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2024-11-16 10:50:32,019 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:32,019 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-16 10:50:32,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-16 10:50:32,020 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:32,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:32,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1150274559, now seen corresponding path program 1 times [2024-11-16 10:50:32,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:32,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535484406] [2024-11-16 10:50:32,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:32,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:32,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:34,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 10:50:34,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:34,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 10:50:34,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:34,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 10:50:34,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:34,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-11-16 10:50:34,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:34,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-11-16 10:50:34,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:34,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2024-11-16 10:50:34,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:34,372 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-16 10:50:34,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:34,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535484406] [2024-11-16 10:50:34,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535484406] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 10:50:34,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476232663] [2024-11-16 10:50:34,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:34,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 10:50:34,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 10:50:34,375 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-16 10:50:34,377 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-16 10:50:35,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:35,697 INFO L255 TraceCheckSpWp]: Trace formula consists of 2065 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-16 10:50:35,708 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 10:50:35,907 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-16 10:50:35,907 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 10:50:35,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476232663] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:35,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 10:50:35,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2024-11-16 10:50:35,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512057740] [2024-11-16 10:50:35,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:35,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 10:50:35,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:35,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 10:50:35,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-16 10:50:35,910 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-16 10:50:36,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:36,489 INFO L93 Difference]: Finished difference Result 2445 states and 3298 transitions. [2024-11-16 10:50:36,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 10:50:36,489 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-16 10:50:36,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:36,494 INFO L225 Difference]: With dead ends: 2445 [2024-11-16 10:50:36,494 INFO L226 Difference]: Without dead ends: 1902 [2024-11-16 10:50:36,496 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-16 10:50:36,496 INFO L432 NwaCegarLoop]: 333 mSDtfsCounter, 1275 mSDsluCounter, 1240 mSDsCounter, 0 mSdLazyCounter, 1057 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-11-16 10:50:36,496 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.5s Time] [2024-11-16 10:50:36,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1902 states. [2024-11-16 10:50:36,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1902 to 1556. [2024-11-16 10:50:36,533 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-16 10:50:36,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2071 transitions. [2024-11-16 10:50:36,535 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2071 transitions. Word has length 351 [2024-11-16 10:50:36,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:36,536 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 2071 transitions. [2024-11-16 10:50:36,536 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-16 10:50:36,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2071 transitions. [2024-11-16 10:50:36,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2024-11-16 10:50:36,540 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:36,540 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-16 10:50:36,568 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-16 10:50:36,740 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-16 10:50:36,741 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:36,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:36,741 INFO L85 PathProgramCache]: Analyzing trace with hash -366077175, now seen corresponding path program 1 times [2024-11-16 10:50:36,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:36,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133225744] [2024-11-16 10:50:36,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:36,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms