./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w32_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_w32_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 5bfb987fcec0e4e87ab47a565086b76b03edc9a60525cd8ee77a0c461c0fdaaa --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 10:50:32,373 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 10:50:32,453 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-16 10:50:32,456 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 10:50:32,457 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 10:50:32,480 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 10:50:32,482 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 10:50:32,483 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 10:50:32,483 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 10:50:32,484 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 10:50:32,485 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 10:50:32,485 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 10:50:32,485 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 10:50:32,486 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 10:50:32,487 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 10:50:32,487 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 10:50:32,488 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 10:50:32,488 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 10:50:32,488 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 10:50:32,488 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 10:50:32,488 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 10:50:32,492 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 10:50:32,492 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 10:50:32,492 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 10:50:32,493 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 10:50:32,493 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 10:50:32,493 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 10:50:32,493 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 10:50:32,493 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 10:50:32,493 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 10:50:32,494 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 10:50:32,494 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 10:50:32,494 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 10:50:32,494 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 10:50:32,495 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 10:50:32,495 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 10:50:32,495 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 10:50:32,495 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 10:50:32,496 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 10:50:32,496 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 -> 5bfb987fcec0e4e87ab47a565086b76b03edc9a60525cd8ee77a0c461c0fdaaa [2024-11-16 10:50:32,717 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 10:50:32,739 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 10:50:32,741 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 10:50:32,743 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 10:50:32,743 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 10:50:32,745 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_w32_d8_e0.c [2024-11-16 10:50:34,149 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 10:50:34,347 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 10:50:34,347 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w32_d8_e0.c [2024-11-16 10:50:34,358 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d3805b85/892a17810cdb4e6f91355d954e426952/FLAG276ad8e04 [2024-11-16 10:50:34,369 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d3805b85/892a17810cdb4e6f91355d954e426952 [2024-11-16 10:50:34,372 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 10:50:34,373 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 10:50:34,374 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 10:50:34,374 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 10:50:34,379 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 10:50:34,380 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:50:34" (1/1) ... [2024-11-16 10:50:34,381 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a0afeb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:50:34, skipping insertion in model container [2024-11-16 10:50:34,381 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:50:34" (1/1) ... [2024-11-16 10:50:34,416 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 10:50:34,576 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_w32_d8_e0.c[1279,1292] [2024-11-16 10:50:34,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 10:50:34,732 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 10:50:34,741 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_w32_d8_e0.c[1279,1292] [2024-11-16 10:50:34,819 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 10:50:34,833 INFO L204 MainTranslator]: Completed translation [2024-11-16 10:50:34,833 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:50:34 WrapperNode [2024-11-16 10:50:34,833 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 10:50:34,834 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 10:50:34,835 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 10:50:34,835 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 10:50:34,841 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:50:34" (1/1) ... [2024-11-16 10:50:34,865 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:50:34" (1/1) ... [2024-11-16 10:50:35,038 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1382 [2024-11-16 10:50:35,039 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 10:50:35,039 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 10:50:35,039 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 10:50:35,039 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 10:50:35,048 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:50:34" (1/1) ... [2024-11-16 10:50:35,048 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:50:34" (1/1) ... [2024-11-16 10:50:35,071 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:50:34" (1/1) ... [2024-11-16 10:50:35,131 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:50:35,132 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:50:34" (1/1) ... [2024-11-16 10:50:35,132 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:50:34" (1/1) ... [2024-11-16 10:50:35,176 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:50:34" (1/1) ... [2024-11-16 10:50:35,187 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:50:34" (1/1) ... [2024-11-16 10:50:35,203 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:50:34" (1/1) ... [2024-11-16 10:50:35,213 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:50:34" (1/1) ... [2024-11-16 10:50:35,242 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 10:50:35,243 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 10:50:35,244 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 10:50:35,244 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 10:50:35,245 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:50:34" (1/1) ... [2024-11-16 10:50:35,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 10:50:35,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 10:50:35,283 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:50:35,287 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:50:35,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 10:50:35,326 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 10:50:35,327 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 10:50:35,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 10:50:35,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 10:50:35,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 10:50:35,519 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 10:50:35,521 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 10:50:36,652 INFO L? ?]: Removed 754 outVars from TransFormulas that were not future-live. [2024-11-16 10:50:36,652 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 10:50:36,710 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 10:50:36,710 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 10:50:36,710 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 10:50:36 BoogieIcfgContainer [2024-11-16 10:50:36,711 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 10:50:36,713 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 10:50:36,713 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 10:50:36,716 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 10:50:36,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 10:50:34" (1/3) ... [2024-11-16 10:50:36,716 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1376d63f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:50:36, skipping insertion in model container [2024-11-16 10:50:36,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:50:34" (2/3) ... [2024-11-16 10:50:36,717 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1376d63f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:50:36, skipping insertion in model container [2024-11-16 10:50:36,717 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 10:50:36" (3/3) ... [2024-11-16 10:50:36,719 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.circular_pointer_top_w32_d8_e0.c [2024-11-16 10:50:36,732 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 10:50:36,732 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 10:50:36,794 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 10:50:36,802 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;@1772b19d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 10:50:36,803 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 10:50:36,808 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:50:36,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-16 10:50:36,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:36,822 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:50:36,823 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:36,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:36,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1130703786, now seen corresponding path program 1 times [2024-11-16 10:50:36,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:36,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51986632] [2024-11-16 10:50:36,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:36,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:36,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:37,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:50:37,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:37,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 10:50:37,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:37,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 10:50:37,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:37,163 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:50:37,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:37,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51986632] [2024-11-16 10:50:37,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51986632] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:37,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:37,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 10:50:37,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315765462] [2024-11-16 10:50:37,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:37,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 10:50:37,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:37,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 10:50:37,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 10:50:37,195 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:50:37,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:37,399 INFO L93 Difference]: Finished difference Result 715 states and 1065 transitions. [2024-11-16 10:50:37,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 10:50:37,401 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:50:37,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:37,413 INFO L225 Difference]: With dead ends: 715 [2024-11-16 10:50:37,413 INFO L226 Difference]: Without dead ends: 390 [2024-11-16 10:50:37,416 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:50:37,419 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.2s IncrementalHoareTripleChecker+Time [2024-11-16 10:50:37,419 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.2s Time] [2024-11-16 10:50:37,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-11-16 10:50:37,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2024-11-16 10:50:37,477 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:50:37,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 578 transitions. [2024-11-16 10:50:37,481 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 578 transitions. Word has length 118 [2024-11-16 10:50:37,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:37,482 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 578 transitions. [2024-11-16 10:50:37,482 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:50:37,482 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 578 transitions. [2024-11-16 10:50:37,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-16 10:50:37,485 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:37,486 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:50:37,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 10:50:37,524 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:37,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:37,526 INFO L85 PathProgramCache]: Analyzing trace with hash 165064281, now seen corresponding path program 1 times [2024-11-16 10:50:37,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:37,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108055874] [2024-11-16 10:50:37,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:37,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:37,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:38,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:50:38,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:38,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 10:50:38,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:38,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 10:50:38,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:38,263 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:50:38,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:38,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108055874] [2024-11-16 10:50:38,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108055874] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:38,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:38,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 10:50:38,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349826091] [2024-11-16 10:50:38,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:38,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 10:50:38,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:38,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 10:50:38,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 10:50:38,270 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:50:38,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:38,466 INFO L93 Difference]: Finished difference Result 395 states and 583 transitions. [2024-11-16 10:50:38,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:50:38,467 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:50:38,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:38,469 INFO L225 Difference]: With dead ends: 395 [2024-11-16 10:50:38,469 INFO L226 Difference]: Without dead ends: 392 [2024-11-16 10:50:38,469 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:50:38,471 INFO L432 NwaCegarLoop]: 483 mSDtfsCounter, 0 mSDsluCounter, 961 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1444 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 10:50:38,472 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:50:38,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-11-16 10:50:38,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-11-16 10:50:38,494 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:50:38,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 580 transitions. [2024-11-16 10:50:38,499 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 580 transitions. Word has length 118 [2024-11-16 10:50:38,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:38,501 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 580 transitions. [2024-11-16 10:50:38,501 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:50:38,501 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 580 transitions. [2024-11-16 10:50:38,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-16 10:50:38,502 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:38,502 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:50:38,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 10:50:38,503 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:38,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:38,505 INFO L85 PathProgramCache]: Analyzing trace with hash 967079114, now seen corresponding path program 1 times [2024-11-16 10:50:38,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:38,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126264088] [2024-11-16 10:50:38,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:38,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:38,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:38,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:50:38,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:38,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 10:50:38,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:38,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 10:50:38,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:38,894 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:50:38,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:38,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126264088] [2024-11-16 10:50:38,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126264088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:38,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:38,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:50:38,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144032189] [2024-11-16 10:50:38,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:38,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:50:38,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:38,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:50:38,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:50:38,901 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:50:39,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:39,406 INFO L93 Difference]: Finished difference Result 973 states and 1443 transitions. [2024-11-16 10:50:39,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 10:50:39,409 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:50:39,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:39,411 INFO L225 Difference]: With dead ends: 973 [2024-11-16 10:50:39,412 INFO L226 Difference]: Without dead ends: 392 [2024-11-16 10:50:39,414 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:50:39,417 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.4s IncrementalHoareTripleChecker+Time [2024-11-16 10:50:39,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1091 Valid, 1419 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 10:50:39,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-11-16 10:50:39,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-11-16 10:50:39,429 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:50:39,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 579 transitions. [2024-11-16 10:50:39,431 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 579 transitions. Word has length 119 [2024-11-16 10:50:39,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:39,431 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 579 transitions. [2024-11-16 10:50:39,432 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:50:39,432 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 579 transitions. [2024-11-16 10:50:39,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-16 10:50:39,435 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:39,435 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:50:39,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 10:50:39,436 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:39,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:39,437 INFO L85 PathProgramCache]: Analyzing trace with hash 806869547, now seen corresponding path program 1 times [2024-11-16 10:50:39,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:39,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233229770] [2024-11-16 10:50:39,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:39,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:39,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:39,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:50:39,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:39,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 10:50:39,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:39,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 10:50:39,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:39,768 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:50:39,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:39,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233229770] [2024-11-16 10:50:39,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233229770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:39,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:39,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 10:50:39,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742488628] [2024-11-16 10:50:39,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:39,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 10:50:39,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:39,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 10:50:39,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 10:50:39,772 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:50:39,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:39,937 INFO L93 Difference]: Finished difference Result 716 states and 1057 transitions. [2024-11-16 10:50:39,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:50:39,937 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:50:39,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:39,939 INFO L225 Difference]: With dead ends: 716 [2024-11-16 10:50:39,939 INFO L226 Difference]: Without dead ends: 394 [2024-11-16 10:50:39,940 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:50:39,941 INFO L432 NwaCegarLoop]: 482 mSDtfsCounter, 0 mSDsluCounter, 956 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1438 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 10:50:39,941 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:50:39,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-16 10:50:39,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2024-11-16 10:50:39,946 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:50:39,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 581 transitions. [2024-11-16 10:50:39,948 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 581 transitions. Word has length 120 [2024-11-16 10:50:39,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:39,948 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 581 transitions. [2024-11-16 10:50:39,948 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:50:39,949 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 581 transitions. [2024-11-16 10:50:39,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-16 10:50:39,950 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:39,950 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:50:39,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 10:50:39,950 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:39,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:39,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1009603939, now seen corresponding path program 1 times [2024-11-16 10:50:39,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:39,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945532697] [2024-11-16 10:50:39,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:39,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:40,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:40,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:50:40,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:40,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 10:50:40,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:40,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 10:50:40,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:40,346 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:50:40,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:40,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945532697] [2024-11-16 10:50:40,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945532697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:40,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:40,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 10:50:40,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204567098] [2024-11-16 10:50:40,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:40,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 10:50:40,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:40,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 10:50:40,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 10:50:40,350 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:50:40,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:40,601 INFO L93 Difference]: Finished difference Result 718 states and 1058 transitions. [2024-11-16 10:50:40,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:50:40,602 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:50:40,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:40,603 INFO L225 Difference]: With dead ends: 718 [2024-11-16 10:50:40,604 INFO L226 Difference]: Without dead ends: 394 [2024-11-16 10:50:40,604 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:50:40,605 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:50:40,605 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:50:40,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-16 10:50:40,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2024-11-16 10:50:40,612 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:50:40,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 580 transitions. [2024-11-16 10:50:40,614 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 580 transitions. Word has length 121 [2024-11-16 10:50:40,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:40,614 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 580 transitions. [2024-11-16 10:50:40,614 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:50:40,615 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 580 transitions. [2024-11-16 10:50:40,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-16 10:50:40,616 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:40,616 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:50:40,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 10:50:40,618 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:40,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:40,619 INFO L85 PathProgramCache]: Analyzing trace with hash 531562967, now seen corresponding path program 1 times [2024-11-16 10:50:40,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:40,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925766932] [2024-11-16 10:50:40,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:40,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:40,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:40,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:50:40,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:40,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 10:50:40,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:40,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 10:50:40,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:40,884 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:50:40,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:40,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925766932] [2024-11-16 10:50:40,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925766932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:40,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:40,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:50:40,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106408382] [2024-11-16 10:50:40,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:40,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:50:40,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:40,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:50:40,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:50:40,887 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:50:41,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:41,125 INFO L93 Difference]: Finished difference Result 722 states and 1061 transitions. [2024-11-16 10:50:41,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 10:50:41,126 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:50:41,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:41,128 INFO L225 Difference]: With dead ends: 722 [2024-11-16 10:50:41,128 INFO L226 Difference]: Without dead ends: 394 [2024-11-16 10:50:41,128 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:50:41,129 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:50:41,129 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:50:41,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-16 10:50:41,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2024-11-16 10:50:41,135 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:50:41,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 579 transitions. [2024-11-16 10:50:41,136 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 579 transitions. Word has length 122 [2024-11-16 10:50:41,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:41,137 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 579 transitions. [2024-11-16 10:50:41,137 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:50:41,137 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 579 transitions. [2024-11-16 10:50:41,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-16 10:50:41,138 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:41,138 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:50:41,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 10:50:41,138 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:41,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:41,139 INFO L85 PathProgramCache]: Analyzing trace with hash -72278937, now seen corresponding path program 1 times [2024-11-16 10:50:41,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:41,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575830749] [2024-11-16 10:50:41,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:41,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:41,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:41,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:50:41,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:41,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 10:50:41,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:41,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 10:50:41,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:41,367 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:50:41,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:41,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575830749] [2024-11-16 10:50:41,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575830749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:41,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:41,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:50:41,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741276459] [2024-11-16 10:50:41,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:41,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:50:41,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:41,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:50:41,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:50:41,369 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:50:41,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:41,580 INFO L93 Difference]: Finished difference Result 718 states and 1054 transitions. [2024-11-16 10:50:41,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:50:41,580 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:50:41,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:41,582 INFO L225 Difference]: With dead ends: 718 [2024-11-16 10:50:41,582 INFO L226 Difference]: Without dead ends: 394 [2024-11-16 10:50:41,583 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:50:41,583 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:50:41,583 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:50:41,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-16 10:50:41,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2024-11-16 10:50:41,589 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:50:41,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 578 transitions. [2024-11-16 10:50:41,590 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 578 transitions. Word has length 123 [2024-11-16 10:50:41,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:41,591 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 578 transitions. [2024-11-16 10:50:41,591 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:50:41,591 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 578 transitions. [2024-11-16 10:50:41,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-16 10:50:41,592 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:41,592 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:50:41,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 10:50:41,592 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:41,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:41,593 INFO L85 PathProgramCache]: Analyzing trace with hash -84426446, now seen corresponding path program 1 times [2024-11-16 10:50:41,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:41,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538560160] [2024-11-16 10:50:41,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:41,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:41,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:41,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:50:41,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:41,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 10:50:41,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:41,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 10:50:41,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:41,833 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:50:41,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:41,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538560160] [2024-11-16 10:50:41,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538560160] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:41,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:41,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:50:41,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244801526] [2024-11-16 10:50:41,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:41,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:50:41,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:41,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:50:41,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:50:41,836 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:50:42,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:42,059 INFO L93 Difference]: Finished difference Result 718 states and 1052 transitions. [2024-11-16 10:50:42,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:50:42,060 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:50:42,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:42,061 INFO L225 Difference]: With dead ends: 718 [2024-11-16 10:50:42,062 INFO L226 Difference]: Without dead ends: 394 [2024-11-16 10:50:42,062 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:50:42,063 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:50:42,063 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:50:42,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-16 10:50:42,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2024-11-16 10:50:42,071 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:50:42,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 577 transitions. [2024-11-16 10:50:42,073 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 577 transitions. Word has length 124 [2024-11-16 10:50:42,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:42,073 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 577 transitions. [2024-11-16 10:50:42,073 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:50:42,074 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 577 transitions. [2024-11-16 10:50:42,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-16 10:50:42,075 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:42,075 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:50:42,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 10:50:42,076 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:42,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:42,076 INFO L85 PathProgramCache]: Analyzing trace with hash -850844761, now seen corresponding path program 1 times [2024-11-16 10:50:42,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:42,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169317728] [2024-11-16 10:50:42,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:42,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:42,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:42,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:50:42,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:42,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 10:50:42,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:42,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 10:50:42,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:42,413 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:50:42,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:42,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169317728] [2024-11-16 10:50:42,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169317728] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:42,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:42,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 10:50:42,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923509969] [2024-11-16 10:50:42,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:42,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 10:50:42,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:42,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 10:50:42,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 10:50:42,415 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:50:42,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:42,576 INFO L93 Difference]: Finished difference Result 718 states and 1050 transitions. [2024-11-16 10:50:42,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:50:42,577 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:50:42,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:42,579 INFO L225 Difference]: With dead ends: 718 [2024-11-16 10:50:42,579 INFO L226 Difference]: Without dead ends: 394 [2024-11-16 10:50:42,579 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:50:42,580 INFO L432 NwaCegarLoop]: 462 mSDtfsCounter, 484 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 10:50:42,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 926 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 10:50:42,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-16 10:50:42,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2024-11-16 10:50:42,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 389 states have (on average 1.4627249357326477) internal successors, (569), 389 states have internal predecessors, (569), 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:50:42,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 575 transitions. [2024-11-16 10:50:42,586 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 575 transitions. Word has length 125 [2024-11-16 10:50:42,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:42,587 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 575 transitions. [2024-11-16 10:50:42,587 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:50:42,587 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 575 transitions. [2024-11-16 10:50:42,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-16 10:50:42,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:42,588 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:50:42,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 10:50:42,588 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:42,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:42,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1240331494, now seen corresponding path program 1 times [2024-11-16 10:50:42,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:42,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478450489] [2024-11-16 10:50:42,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:42,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:42,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:42,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:50:42,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:42,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 10:50:42,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:42,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 10:50:42,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:42,847 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:50:42,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:42,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478450489] [2024-11-16 10:50:42,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478450489] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:42,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:42,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:50:42,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189316992] [2024-11-16 10:50:42,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:42,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:50:42,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:42,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:50:42,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:50:42,849 INFO L87 Difference]: Start difference. First operand 394 states and 575 transitions. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 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:43,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:43,025 INFO L93 Difference]: Finished difference Result 718 states and 1046 transitions. [2024-11-16 10:50:43,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:50:43,026 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 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 127 [2024-11-16 10:50:43,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:43,027 INFO L225 Difference]: With dead ends: 718 [2024-11-16 10:50:43,027 INFO L226 Difference]: Without dead ends: 394 [2024-11-16 10:50:43,028 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:50:43,029 INFO L432 NwaCegarLoop]: 462 mSDtfsCounter, 558 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 933 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 10:50:43,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 933 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 10:50:43,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-16 10:50:43,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2024-11-16 10:50:43,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 389 states have (on average 1.4601542416452442) internal successors, (568), 389 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:50:43,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 574 transitions. [2024-11-16 10:50:43,037 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 574 transitions. Word has length 127 [2024-11-16 10:50:43,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:43,038 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 574 transitions. [2024-11-16 10:50:43,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 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:43,038 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 574 transitions. [2024-11-16 10:50:43,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-16 10:50:43,039 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:43,039 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:50:43,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 10:50:43,040 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:43,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:43,040 INFO L85 PathProgramCache]: Analyzing trace with hash 577757747, now seen corresponding path program 1 times [2024-11-16 10:50:43,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:43,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254153988] [2024-11-16 10:50:43,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:43,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:43,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:43,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:50:43,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:43,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 10:50:43,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:43,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 10:50:43,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:43,362 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:50:43,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:43,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254153988] [2024-11-16 10:50:43,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254153988] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:43,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:43,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 10:50:43,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123102031] [2024-11-16 10:50:43,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:43,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 10:50:43,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:43,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 10:50:43,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 10:50:43,365 INFO L87 Difference]: Start difference. First operand 394 states and 574 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:50:43,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:43,565 INFO L93 Difference]: Finished difference Result 718 states and 1044 transitions. [2024-11-16 10:50:43,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:50:43,566 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:50:43,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:43,568 INFO L225 Difference]: With dead ends: 718 [2024-11-16 10:50:43,568 INFO L226 Difference]: Without dead ends: 394 [2024-11-16 10:50:43,569 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:50:43,569 INFO L432 NwaCegarLoop]: 464 mSDtfsCounter, 519 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 10:50:43,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 930 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 10:50:43,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-16 10:50:43,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2024-11-16 10:50:43,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 389 states have (on average 1.4575835475578407) internal successors, (567), 389 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:50:43,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 573 transitions. [2024-11-16 10:50:43,578 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 573 transitions. Word has length 128 [2024-11-16 10:50:43,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:43,578 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 573 transitions. [2024-11-16 10:50:43,578 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:50:43,578 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 573 transitions. [2024-11-16 10:50:43,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-16 10:50:43,579 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:43,579 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:50:43,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 10:50:43,579 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:43,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:43,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1439866612, now seen corresponding path program 1 times [2024-11-16 10:50:43,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:43,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806684234] [2024-11-16 10:50:43,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:43,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:43,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:43,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:50:43,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:43,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-16 10:50:43,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:43,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-16 10:50:43,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:43,928 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:50:43,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:43,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806684234] [2024-11-16 10:50:43,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806684234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:43,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:43,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 10:50:43,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004049468] [2024-11-16 10:50:43,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:43,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 10:50:43,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:43,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 10:50:43,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 10:50:43,930 INFO L87 Difference]: Start difference. First operand 394 states and 573 transitions. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 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:50:44,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:44,122 INFO L93 Difference]: Finished difference Result 718 states and 1042 transitions. [2024-11-16 10:50:44,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:50:44,122 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), 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 129 [2024-11-16 10:50:44,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:44,124 INFO L225 Difference]: With dead ends: 718 [2024-11-16 10:50:44,124 INFO L226 Difference]: Without dead ends: 394 [2024-11-16 10:50:44,124 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:50:44,125 INFO L432 NwaCegarLoop]: 464 mSDtfsCounter, 517 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 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:50:44,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [519 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:50:44,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-16 10:50:44,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2024-11-16 10:50:44,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 389 states have (on average 1.455012853470437) internal successors, (566), 389 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:50:44,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 572 transitions. [2024-11-16 10:50:44,134 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 572 transitions. Word has length 129 [2024-11-16 10:50:44,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:44,134 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 572 transitions. [2024-11-16 10:50:44,134 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), 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:50:44,134 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 572 transitions. [2024-11-16 10:50:44,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-16 10:50:44,135 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:44,135 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:50:44,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 10:50:44,136 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:44,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:44,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1246117868, now seen corresponding path program 1 times [2024-11-16 10:50:44,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:44,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109224517] [2024-11-16 10:50:44,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:44,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:44,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:44,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:50:44,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:44,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-16 10:50:44,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:44,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 10:50:44,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:44,493 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:50:44,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:44,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109224517] [2024-11-16 10:50:44,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109224517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:44,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:44,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:50:44,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229621433] [2024-11-16 10:50:44,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:44,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:50:44,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:44,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:50:44,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:50:44,495 INFO L87 Difference]: Start difference. First operand 394 states and 572 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:50:44,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:44,713 INFO L93 Difference]: Finished difference Result 718 states and 1040 transitions. [2024-11-16 10:50:44,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:50:44,714 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:50:44,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:44,715 INFO L225 Difference]: With dead ends: 718 [2024-11-16 10:50:44,715 INFO L226 Difference]: Without dead ends: 394 [2024-11-16 10:50:44,716 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:50:44,716 INFO L432 NwaCegarLoop]: 445 mSDtfsCounter, 472 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 10:50:44,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 892 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 10:50:44,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-16 10:50:44,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2024-11-16 10:50:44,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 389 states have (on average 1.4524421593830334) internal successors, (565), 389 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:50:44,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 571 transitions. [2024-11-16 10:50:44,725 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 571 transitions. Word has length 130 [2024-11-16 10:50:44,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:44,725 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 571 transitions. [2024-11-16 10:50:44,726 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:50:44,726 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 571 transitions. [2024-11-16 10:50:44,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-16 10:50:44,727 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:44,727 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:50:44,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 10:50:44,727 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:44,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:44,727 INFO L85 PathProgramCache]: Analyzing trace with hash -711738532, now seen corresponding path program 1 times [2024-11-16 10:50:44,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:44,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069444651] [2024-11-16 10:50:44,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:44,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:44,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:45,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:50:45,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:45,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-16 10:50:45,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:45,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 10:50:45,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:45,306 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:50:45,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:45,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069444651] [2024-11-16 10:50:45,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069444651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:45,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:45,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:50:45,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950582847] [2024-11-16 10:50:45,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:45,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:50:45,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:45,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:50:45,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:50:45,308 INFO L87 Difference]: Start difference. First operand 394 states and 571 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:50:45,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:45,629 INFO L93 Difference]: Finished difference Result 724 states and 1046 transitions. [2024-11-16 10:50:45,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 10:50:45,630 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:50:45,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:45,632 INFO L225 Difference]: With dead ends: 724 [2024-11-16 10:50:45,632 INFO L226 Difference]: Without dead ends: 398 [2024-11-16 10:50:45,633 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:50:45,633 INFO L432 NwaCegarLoop]: 469 mSDtfsCounter, 2 mSDsluCounter, 1284 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1753 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 10:50:45,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1753 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 10:50:45,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2024-11-16 10:50:45,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 396. [2024-11-16 10:50:45,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 391 states have (on average 1.4501278772378516) internal successors, (567), 391 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:50:45,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 573 transitions. [2024-11-16 10:50:45,643 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 573 transitions. Word has length 131 [2024-11-16 10:50:45,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:45,643 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 573 transitions. [2024-11-16 10:50:45,643 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:50:45,643 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 573 transitions. [2024-11-16 10:50:45,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-16 10:50:45,644 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:45,644 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:50:45,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 10:50:45,645 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:45,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:45,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1629532284, now seen corresponding path program 1 times [2024-11-16 10:50:45,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:45,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897287489] [2024-11-16 10:50:45,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:45,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:45,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:46,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:50:46,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:46,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-16 10:50:46,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:46,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 10:50:46,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:46,022 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:50:46,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:46,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897287489] [2024-11-16 10:50:46,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897287489] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:46,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:46,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:50:46,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615482312] [2024-11-16 10:50:46,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:46,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:50:46,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:46,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:50:46,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:50:46,024 INFO L87 Difference]: Start difference. First operand 396 states and 573 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:50:46,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:46,269 INFO L93 Difference]: Finished difference Result 722 states and 1042 transitions. [2024-11-16 10:50:46,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:50:46,269 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:50:46,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:46,271 INFO L225 Difference]: With dead ends: 722 [2024-11-16 10:50:46,271 INFO L226 Difference]: Without dead ends: 396 [2024-11-16 10:50:46,272 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:50:46,272 INFO L432 NwaCegarLoop]: 445 mSDtfsCounter, 467 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 10:50:46,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 899 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 10:50:46,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-11-16 10:50:46,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2024-11-16 10:50:46,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 391 states have (on average 1.4475703324808185) internal successors, (566), 391 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:50:46,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 572 transitions. [2024-11-16 10:50:46,281 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 572 transitions. Word has length 132 [2024-11-16 10:50:46,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:46,281 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 572 transitions. [2024-11-16 10:50:46,281 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:50:46,281 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 572 transitions. [2024-11-16 10:50:46,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-16 10:50:46,282 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:46,282 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:50:46,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-16 10:50:46,283 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:46,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:46,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1114957878, now seen corresponding path program 1 times [2024-11-16 10:50:46,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:46,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876916465] [2024-11-16 10:50:46,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:46,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:46,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:46,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:50:46,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:46,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-16 10:50:46,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:46,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 10:50:46,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:46,626 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:50:46,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:46,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876916465] [2024-11-16 10:50:46,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876916465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:46,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:46,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:50:46,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050269516] [2024-11-16 10:50:46,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:46,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:50:46,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:46,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:50:46,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:50:46,630 INFO L87 Difference]: Start difference. First operand 396 states and 572 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:50:46,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:46,855 INFO L93 Difference]: Finished difference Result 722 states and 1040 transitions. [2024-11-16 10:50:46,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:50:46,857 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:50:46,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:46,858 INFO L225 Difference]: With dead ends: 722 [2024-11-16 10:50:46,859 INFO L226 Difference]: Without dead ends: 396 [2024-11-16 10:50:46,859 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:50:46,860 INFO L432 NwaCegarLoop]: 445 mSDtfsCounter, 924 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 892 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:50:46,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 892 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 10:50:46,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-11-16 10:50:46,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2024-11-16 10:50:46,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 391 states have (on average 1.4450127877237853) internal successors, (565), 391 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:50:46,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 571 transitions. [2024-11-16 10:50:46,869 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 571 transitions. Word has length 133 [2024-11-16 10:50:46,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:46,869 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 571 transitions. [2024-11-16 10:50:46,870 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:50:46,870 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 571 transitions. [2024-11-16 10:50:46,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-16 10:50:46,871 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:46,871 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:50:46,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-16 10:50:46,871 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:46,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:46,872 INFO L85 PathProgramCache]: Analyzing trace with hash -241491764, now seen corresponding path program 1 times [2024-11-16 10:50:46,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:46,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523432601] [2024-11-16 10:50:46,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:46,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:46,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:47,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:50:47,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:47,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-16 10:50:47,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:47,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 10:50:47,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:47,445 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:50:47,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:47,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523432601] [2024-11-16 10:50:47,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523432601] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:47,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:47,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:50:47,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036867756] [2024-11-16 10:50:47,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:47,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:50:47,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:47,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:50:47,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:50:47,447 INFO L87 Difference]: Start difference. First operand 396 states and 571 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:50:47,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:47,677 INFO L93 Difference]: Finished difference Result 768 states and 1095 transitions. [2024-11-16 10:50:47,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 10:50:47,678 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:50:47,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:47,680 INFO L225 Difference]: With dead ends: 768 [2024-11-16 10:50:47,680 INFO L226 Difference]: Without dead ends: 442 [2024-11-16 10:50:47,680 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:50:47,681 INFO L432 NwaCegarLoop]: 467 mSDtfsCounter, 19 mSDsluCounter, 1393 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 1860 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 10:50:47,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 1860 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 10:50:47,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2024-11-16 10:50:47,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 440. [2024-11-16 10:50:47,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 435 states have (on average 1.4206896551724137) internal successors, (618), 435 states have internal predecessors, (618), 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:50:47,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 624 transitions. [2024-11-16 10:50:47,690 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 624 transitions. Word has length 134 [2024-11-16 10:50:47,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:47,691 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 624 transitions. [2024-11-16 10:50:47,691 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:50:47,691 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 624 transitions. [2024-11-16 10:50:47,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-16 10:50:47,692 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:47,692 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:50:47,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-16 10:50:47,692 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:47,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:47,693 INFO L85 PathProgramCache]: Analyzing trace with hash -486614377, now seen corresponding path program 1 times [2024-11-16 10:50:47,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:47,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377545855] [2024-11-16 10:50:47,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:47,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:47,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:48,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:50:48,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:48,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-16 10:50:48,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:48,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 10:50:48,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:48,220 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:50:48,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:48,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377545855] [2024-11-16 10:50:48,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377545855] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:48,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:48,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:50:48,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479684790] [2024-11-16 10:50:48,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:48,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:50:48,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:48,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:50:48,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:50:48,222 INFO L87 Difference]: Start difference. First operand 440 states and 624 transitions. Second operand has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 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:50:48,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:48,659 INFO L93 Difference]: Finished difference Result 814 states and 1150 transitions. [2024-11-16 10:50:48,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 10:50:48,660 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 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:50:48,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:48,662 INFO L225 Difference]: With dead ends: 814 [2024-11-16 10:50:48,662 INFO L226 Difference]: Without dead ends: 444 [2024-11-16 10:50:48,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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:48,663 INFO L432 NwaCegarLoop]: 352 mSDtfsCounter, 482 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 10:50:48,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 1043 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 10:50:48,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2024-11-16 10:50:48,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 442. [2024-11-16 10:50:48,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 437 states have (on average 1.4187643020594967) internal successors, (620), 437 states have internal predecessors, (620), 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:50:48,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 626 transitions. [2024-11-16 10:50:48,675 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 626 transitions. Word has length 135 [2024-11-16 10:50:48,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:48,675 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 626 transitions. [2024-11-16 10:50:48,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 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:50:48,676 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 626 transitions. [2024-11-16 10:50:48,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-16 10:50:48,677 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:48,677 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:50:48,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-16 10:50:48,677 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:48,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:48,678 INFO L85 PathProgramCache]: Analyzing trace with hash -152776430, now seen corresponding path program 1 times [2024-11-16 10:50:48,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:48,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661820334] [2024-11-16 10:50:48,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:48,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:48,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:49,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:50:49,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:49,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-16 10:50:49,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:49,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 10:50:49,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:49,157 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:50:49,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:49,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661820334] [2024-11-16 10:50:49,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661820334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:49,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:49,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 10:50:49,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865872885] [2024-11-16 10:50:49,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:49,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 10:50:49,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:49,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 10:50:49,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 10:50:49,159 INFO L87 Difference]: Start difference. First operand 442 states and 626 transitions. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 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:50:49,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:49,584 INFO L93 Difference]: Finished difference Result 888 states and 1232 transitions. [2024-11-16 10:50:49,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 10:50:49,585 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 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:50:49,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:49,586 INFO L225 Difference]: With dead ends: 888 [2024-11-16 10:50:49,587 INFO L226 Difference]: Without dead ends: 508 [2024-11-16 10:50:49,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-16 10:50:49,588 INFO L432 NwaCegarLoop]: 483 mSDtfsCounter, 40 mSDsluCounter, 1777 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 2260 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 10:50:49,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 2260 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 10:50:49,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2024-11-16 10:50:49,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 442. [2024-11-16 10:50:49,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 437 states have (on average 1.414187643020595) internal successors, (618), 437 states have internal predecessors, (618), 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:50:49,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 624 transitions. [2024-11-16 10:50:49,596 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 624 transitions. Word has length 135 [2024-11-16 10:50:49,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:49,597 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 624 transitions. [2024-11-16 10:50:49,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 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:50:49,597 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 624 transitions. [2024-11-16 10:50:49,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-16 10:50:49,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:49,598 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:50:49,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-16 10:50:49,598 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:49,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:49,598 INFO L85 PathProgramCache]: Analyzing trace with hash -998765163, now seen corresponding path program 1 times [2024-11-16 10:50:49,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:49,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308237686] [2024-11-16 10:50:49,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:49,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:49,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:50,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:50:50,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:50,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-16 10:50:50,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:50,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 10:50:50,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:50,239 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:50:50,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:50,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308237686] [2024-11-16 10:50:50,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308237686] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:50,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:50,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 10:50:50,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767193115] [2024-11-16 10:50:50,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:50,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 10:50:50,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:50,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 10:50:50,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 10:50:50,241 INFO L87 Difference]: Start difference. First operand 442 states and 624 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:50:50,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:50,559 INFO L93 Difference]: Finished difference Result 982 states and 1366 transitions. [2024-11-16 10:50:50,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 10:50:50,560 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:50:50,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:50,562 INFO L225 Difference]: With dead ends: 982 [2024-11-16 10:50:50,562 INFO L226 Difference]: Without dead ends: 610 [2024-11-16 10:50:50,563 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:50:50,564 INFO L432 NwaCegarLoop]: 459 mSDtfsCounter, 857 mSDsluCounter, 1372 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 860 SdHoareTripleChecker+Valid, 1831 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 10:50:50,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [860 Valid, 1831 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 10:50:50,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2024-11-16 10:50:50,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2024-11-16 10:50:50,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 602 states have (on average 1.3837209302325582) internal successors, (833), 602 states have internal predecessors, (833), 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:50,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 845 transitions. [2024-11-16 10:50:50,584 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 845 transitions. Word has length 136 [2024-11-16 10:50:50,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:50,585 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 845 transitions. [2024-11-16 10:50:50,585 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:50:50,585 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 845 transitions. [2024-11-16 10:50:50,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2024-11-16 10:50:50,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:50,589 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:50:50,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-16 10:50:50,589 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:50,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:50,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1615846027, now seen corresponding path program 1 times [2024-11-16 10:50:50,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:50,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73734038] [2024-11-16 10:50:50,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:50,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:50,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:51,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:50:51,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:51,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-16 10:50:51,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:51,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 10:50:51,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:51,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-11-16 10:50:51,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:51,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-11-16 10:50:51,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:51,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2024-11-16 10:50:51,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:51,153 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:51,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:51,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73734038] [2024-11-16 10:50:51,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73734038] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:51,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:51,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:50:51,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600238616] [2024-11-16 10:50:51,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:51,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:50:51,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:51,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:50:51,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:50:51,155 INFO L87 Difference]: Start difference. First operand 610 states and 845 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:50:51,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:51,378 INFO L93 Difference]: Finished difference Result 982 states and 1365 transitions. [2024-11-16 10:50:51,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:50:51,379 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:50:51,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:51,381 INFO L225 Difference]: With dead ends: 982 [2024-11-16 10:50:51,381 INFO L226 Difference]: Without dead ends: 610 [2024-11-16 10:50:51,382 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:51,382 INFO L432 NwaCegarLoop]: 444 mSDtfsCounter, 938 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 941 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 10:50:51,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [941 Valid, 890 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 10:50:51,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2024-11-16 10:50:51,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2024-11-16 10:50:51,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 602 states have (on average 1.3820598006644518) internal successors, (832), 602 states have internal predecessors, (832), 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:51,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 844 transitions. [2024-11-16 10:50:51,396 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 844 transitions. Word has length 325 [2024-11-16 10:50:51,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:51,397 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 844 transitions. [2024-11-16 10:50:51,397 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:50:51,397 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 844 transitions. [2024-11-16 10:50:51,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2024-11-16 10:50:51,400 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:51,400 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:50:51,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-16 10:50:51,401 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:51,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:51,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1945475045, now seen corresponding path program 1 times [2024-11-16 10:50:51,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:51,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421528376] [2024-11-16 10:50:51,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:51,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:51,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:51,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:50:51,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:51,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-16 10:50:51,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:51,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 10:50:51,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:51,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2024-11-16 10:50:51,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:51,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-11-16 10:50:51,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:51,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2024-11-16 10:50:51,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:51,921 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:51,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:51,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421528376] [2024-11-16 10:50:51,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421528376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:51,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:51,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:50:51,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985833197] [2024-11-16 10:50:51,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:51,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:50:51,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:51,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:50:51,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:50:51,924 INFO L87 Difference]: Start difference. First operand 610 states and 844 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:50:52,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:52,119 INFO L93 Difference]: Finished difference Result 982 states and 1363 transitions. [2024-11-16 10:50:52,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:50:52,120 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:50:52,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:52,122 INFO L225 Difference]: With dead ends: 982 [2024-11-16 10:50:52,122 INFO L226 Difference]: Without dead ends: 610 [2024-11-16 10:50:52,123 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:52,124 INFO L432 NwaCegarLoop]: 444 mSDtfsCounter, 922 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 925 SdHoareTripleChecker+Valid, 890 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:50:52,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [925 Valid, 890 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 10:50:52,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2024-11-16 10:50:52,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2024-11-16 10:50:52,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 602 states have (on average 1.3803986710963456) internal successors, (831), 602 states have internal predecessors, (831), 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:52,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 843 transitions. [2024-11-16 10:50:52,136 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 843 transitions. Word has length 326 [2024-11-16 10:50:52,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:52,137 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 843 transitions. [2024-11-16 10:50:52,137 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:50:52,137 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 843 transitions. [2024-11-16 10:50:52,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2024-11-16 10:50:52,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:52,140 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:50:52,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-16 10:50:52,140 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:52,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:52,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1888586396, now seen corresponding path program 1 times [2024-11-16 10:50:52,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:52,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550978282] [2024-11-16 10:50:52,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:52,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:52,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:52,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:50:52,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:52,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-16 10:50:52,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:52,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 10:50:52,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:52,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2024-11-16 10:50:52,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:52,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-11-16 10:50:52,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:52,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-11-16 10:50:52,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:52,720 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:52,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:52,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550978282] [2024-11-16 10:50:52,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550978282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:52,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:52,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:50:52,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74698234] [2024-11-16 10:50:52,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:52,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:50:52,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:52,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:50:52,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:50:52,723 INFO L87 Difference]: Start difference. First operand 610 states and 843 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:50:52,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:52,918 INFO L93 Difference]: Finished difference Result 982 states and 1361 transitions. [2024-11-16 10:50:52,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:50:52,919 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:50:52,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:52,920 INFO L225 Difference]: With dead ends: 982 [2024-11-16 10:50:52,921 INFO L226 Difference]: Without dead ends: 610 [2024-11-16 10:50:52,921 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:52,922 INFO L432 NwaCegarLoop]: 444 mSDtfsCounter, 906 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 890 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:50:52,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [909 Valid, 890 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 10:50:52,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2024-11-16 10:50:52,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2024-11-16 10:50:52,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 602 states have (on average 1.3787375415282392) internal successors, (830), 602 states have internal predecessors, (830), 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:52,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 842 transitions. [2024-11-16 10:50:52,934 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 842 transitions. Word has length 327 [2024-11-16 10:50:52,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:52,935 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 842 transitions. [2024-11-16 10:50:52,935 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:50:52,935 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 842 transitions. [2024-11-16 10:50:52,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2024-11-16 10:50:52,938 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:52,938 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:50:52,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-16 10:50:52,938 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:52,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:52,939 INFO L85 PathProgramCache]: Analyzing trace with hash 13771862, now seen corresponding path program 1 times [2024-11-16 10:50:52,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:52,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811962003] [2024-11-16 10:50:52,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:52,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:53,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:53,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:50:53,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:53,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-16 10:50:53,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:53,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 10:50:53,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:53,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2024-11-16 10:50:53,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:53,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2024-11-16 10:50:53,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:53,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2024-11-16 10:50:53,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:53,434 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:53,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:53,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811962003] [2024-11-16 10:50:53,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811962003] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:53,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:53,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:50:53,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431316180] [2024-11-16 10:50:53,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:53,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:50:53,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:53,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:50:53,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:50:53,437 INFO L87 Difference]: Start difference. First operand 610 states and 842 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:50:53,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:53,619 INFO L93 Difference]: Finished difference Result 982 states and 1359 transitions. [2024-11-16 10:50:53,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:50:53,620 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:50:53,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:53,622 INFO L225 Difference]: With dead ends: 982 [2024-11-16 10:50:53,622 INFO L226 Difference]: Without dead ends: 610 [2024-11-16 10:50:53,622 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:53,623 INFO L432 NwaCegarLoop]: 444 mSDtfsCounter, 491 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 897 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:50:53,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 897 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 10:50:53,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2024-11-16 10:50:53,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2024-11-16 10:50:53,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 602 states have (on average 1.3770764119601329) internal successors, (829), 602 states have internal predecessors, (829), 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:53,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 841 transitions. [2024-11-16 10:50:53,635 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 841 transitions. Word has length 328 [2024-11-16 10:50:53,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:53,635 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 841 transitions. [2024-11-16 10:50:53,635 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:50:53,636 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 841 transitions. [2024-11-16 10:50:53,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2024-11-16 10:50:53,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:53,638 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-16 10:50:53,639 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:53,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:53,639 INFO L85 PathProgramCache]: Analyzing trace with hash 200980525, now seen corresponding path program 1 times [2024-11-16 10:50:53,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:53,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279117942] [2024-11-16 10:50:53,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:53,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:53,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:54,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:50:54,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:54,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-16 10:50:54,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:54,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 10:50:54,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:54,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-11-16 10:50:54,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:54,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-11-16 10:50:54,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:54,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2024-11-16 10:50:54,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:54,172 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:54,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:54,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279117942] [2024-11-16 10:50:54,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279117942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:54,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:54,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:50:54,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13592424] [2024-11-16 10:50:54,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:54,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:50:54,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:54,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:50:54,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:50:54,175 INFO L87 Difference]: Start difference. First operand 610 states and 841 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:50:54,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:54,346 INFO L93 Difference]: Finished difference Result 982 states and 1357 transitions. [2024-11-16 10:50:54,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:50:54,347 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:50:54,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:54,349 INFO L225 Difference]: With dead ends: 982 [2024-11-16 10:50:54,349 INFO L226 Difference]: Without dead ends: 610 [2024-11-16 10:50:54,350 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:54,350 INFO L432 NwaCegarLoop]: 452 mSDtfsCounter, 867 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 10:50:54,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [870 Valid, 906 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 10:50:54,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2024-11-16 10:50:54,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2024-11-16 10:50:54,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 602 states have (on average 1.3754152823920265) internal successors, (828), 602 states have internal predecessors, (828), 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:54,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 840 transitions. [2024-11-16 10:50:54,362 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 840 transitions. Word has length 329 [2024-11-16 10:50:54,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:54,362 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 840 transitions. [2024-11-16 10:50:54,362 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:50:54,362 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 840 transitions. [2024-11-16 10:50:54,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2024-11-16 10:50:54,365 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:54,365 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:50:54,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-16 10:50:54,365 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:54,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:54,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1430382151, now seen corresponding path program 1 times [2024-11-16 10:50:54,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:54,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431182682] [2024-11-16 10:50:54,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:54,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:54,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:54,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:50:54,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:54,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-16 10:50:54,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:54,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 10:50:54,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:54,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-11-16 10:50:54,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:54,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-11-16 10:50:54,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:54,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-11-16 10:50:54,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:54,920 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:54,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:54,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431182682] [2024-11-16 10:50:54,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431182682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:54,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:54,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:50:54,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782058458] [2024-11-16 10:50:54,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:54,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:50:54,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:54,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:50:54,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:50:54,923 INFO L87 Difference]: Start difference. First operand 610 states and 840 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:55,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:55,089 INFO L93 Difference]: Finished difference Result 982 states and 1355 transitions. [2024-11-16 10:50:55,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:50:55,090 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:55,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:55,093 INFO L225 Difference]: With dead ends: 982 [2024-11-16 10:50:55,093 INFO L226 Difference]: Without dead ends: 610 [2024-11-16 10:50:55,094 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:55,094 INFO L432 NwaCegarLoop]: 452 mSDtfsCounter, 468 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 10:50:55,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 913 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 10:50:55,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2024-11-16 10:50:55,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2024-11-16 10:50:55,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 602 states have (on average 1.3737541528239203) internal successors, (827), 602 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:50:55,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 839 transitions. [2024-11-16 10:50:55,114 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 839 transitions. Word has length 330 [2024-11-16 10:50:55,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:55,114 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 839 transitions. [2024-11-16 10:50:55,114 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:55,114 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 839 transitions. [2024-11-16 10:50:55,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2024-11-16 10:50:55,117 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:55,117 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:55,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-16 10:50:55,117 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:55,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:55,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1455381698, now seen corresponding path program 1 times [2024-11-16 10:50:55,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:55,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588225011] [2024-11-16 10:50:55,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:55,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:55,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:55,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:50:55,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:55,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-16 10:50:55,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:55,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 10:50:55,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:55,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2024-11-16 10:50:55,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:55,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-16 10:50:55,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:55,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2024-11-16 10:50:55,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:55,704 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:55,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:55,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588225011] [2024-11-16 10:50:55,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588225011] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:55,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:55,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:50:55,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021660041] [2024-11-16 10:50:55,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:55,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:50:55,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:55,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:50:55,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:50:55,709 INFO L87 Difference]: Start difference. First operand 610 states and 839 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:56,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:56,029 INFO L93 Difference]: Finished difference Result 982 states and 1353 transitions. [2024-11-16 10:50:56,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:50:56,029 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:56,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:56,032 INFO L225 Difference]: With dead ends: 982 [2024-11-16 10:50:56,032 INFO L226 Difference]: Without dead ends: 610 [2024-11-16 10:50:56,033 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:56,033 INFO L432 NwaCegarLoop]: 339 mSDtfsCounter, 828 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 831 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 10:50:56,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [831 Valid, 680 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 10:50:56,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2024-11-16 10:50:56,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2024-11-16 10:50:56,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 602 states have (on average 1.372093023255814) internal successors, (826), 602 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:50:56,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 838 transitions. [2024-11-16 10:50:56,051 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 838 transitions. Word has length 331 [2024-11-16 10:50:56,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:56,052 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 838 transitions. [2024-11-16 10:50:56,052 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:56,052 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 838 transitions. [2024-11-16 10:50:56,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2024-11-16 10:50:56,054 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:56,055 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:56,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-16 10:50:56,055 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:56,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:56,056 INFO L85 PathProgramCache]: Analyzing trace with hash -10216008, now seen corresponding path program 1 times [2024-11-16 10:50:56,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:56,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071496488] [2024-11-16 10:50:56,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:56,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:56,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:57,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:50:57,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:57,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-16 10:50:57,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:57,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 10:50:57,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:57,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2024-11-16 10:50:57,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:57,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2024-11-16 10:50:57,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:57,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2024-11-16 10:50:57,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:57,115 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:57,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:57,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071496488] [2024-11-16 10:50:57,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071496488] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:57,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:57,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 10:50:57,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959498273] [2024-11-16 10:50:57,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:57,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 10:50:57,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:57,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 10:50:57,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 10:50:57,119 INFO L87 Difference]: Start difference. First operand 610 states and 838 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:57,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:57,269 INFO L93 Difference]: Finished difference Result 982 states and 1351 transitions. [2024-11-16 10:50:57,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:50:57,270 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:57,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:57,272 INFO L225 Difference]: With dead ends: 982 [2024-11-16 10:50:57,272 INFO L226 Difference]: Without dead ends: 610 [2024-11-16 10:50:57,272 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:57,273 INFO L432 NwaCegarLoop]: 451 mSDtfsCounter, 382 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 10:50:57,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 904 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 10:50:57,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2024-11-16 10:50:57,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2024-11-16 10:50:57,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 602 states have (on average 1.3704318936877076) internal successors, (825), 602 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:50:57,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 837 transitions. [2024-11-16 10:50:57,289 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 837 transitions. Word has length 332 [2024-11-16 10:50:57,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:57,289 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 837 transitions. [2024-11-16 10:50:57,289 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:57,289 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 837 transitions. [2024-11-16 10:50:57,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2024-11-16 10:50:57,290 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:57,290 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:57,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-16 10:50:57,291 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:57,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:57,291 INFO L85 PathProgramCache]: Analyzing trace with hash 401950292, now seen corresponding path program 1 times [2024-11-16 10:50:57,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:57,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422731988] [2024-11-16 10:50:57,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:57,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:57,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:58,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:50:58,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:58,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-16 10:50:58,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:58,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 10:50:58,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:58,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-11-16 10:50:58,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:58,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2024-11-16 10:50:58,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:58,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2024-11-16 10:50:58,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:58,186 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:58,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:58,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422731988] [2024-11-16 10:50:58,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422731988] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:58,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:58,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:50:58,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610313645] [2024-11-16 10:50:58,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:58,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:50:58,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:58,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:50:58,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:50:58,189 INFO L87 Difference]: Start difference. First operand 610 states and 837 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:58,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:58,395 INFO L93 Difference]: Finished difference Result 982 states and 1349 transitions. [2024-11-16 10:50:58,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:50:58,396 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:58,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:58,397 INFO L225 Difference]: With dead ends: 982 [2024-11-16 10:50:58,398 INFO L226 Difference]: Without dead ends: 610 [2024-11-16 10:50:58,399 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:58,399 INFO L432 NwaCegarLoop]: 440 mSDtfsCounter, 863 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 863 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 10:50:58,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [863 Valid, 882 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 10:50:58,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2024-11-16 10:50:58,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2024-11-16 10:50:58,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 602 states have (on average 1.3687707641196014) internal successors, (824), 602 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:50:58,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 836 transitions. [2024-11-16 10:50:58,412 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 836 transitions. Word has length 333 [2024-11-16 10:50:58,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:58,412 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 836 transitions. [2024-11-16 10:50:58,412 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:58,412 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 836 transitions. [2024-11-16 10:50:58,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2024-11-16 10:50:58,414 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:58,415 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:58,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-16 10:50:58,415 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:58,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:58,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1652332687, now seen corresponding path program 1 times [2024-11-16 10:50:58,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:58,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112612284] [2024-11-16 10:50:58,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:58,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:58,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:59,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:50:59,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:59,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-16 10:50:59,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:59,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 10:50:59,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:59,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-11-16 10:50:59,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:59,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2024-11-16 10:50:59,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:59,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2024-11-16 10:50:59,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:50:59,296 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:59,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:50:59,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112612284] [2024-11-16 10:50:59,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112612284] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:50:59,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:50:59,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:50:59,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288219922] [2024-11-16 10:50:59,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:50:59,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:50:59,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:50:59,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:50:59,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:50:59,298 INFO L87 Difference]: Start difference. First operand 610 states and 836 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:59,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:50:59,499 INFO L93 Difference]: Finished difference Result 982 states and 1347 transitions. [2024-11-16 10:50:59,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:50:59,499 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:59,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:50:59,501 INFO L225 Difference]: With dead ends: 982 [2024-11-16 10:50:59,501 INFO L226 Difference]: Without dead ends: 610 [2024-11-16 10:50:59,502 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:59,502 INFO L432 NwaCegarLoop]: 440 mSDtfsCounter, 853 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 853 SdHoareTripleChecker+Valid, 882 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:59,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [853 Valid, 882 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:59,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2024-11-16 10:50:59,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2024-11-16 10:50:59,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 602 states have (on average 1.367109634551495) internal successors, (823), 602 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:50:59,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 835 transitions. [2024-11-16 10:50:59,513 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 835 transitions. Word has length 334 [2024-11-16 10:50:59,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:50:59,513 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 835 transitions. [2024-11-16 10:50:59,514 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:59,514 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 835 transitions. [2024-11-16 10:50:59,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2024-11-16 10:50:59,515 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:50:59,515 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:59,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-16 10:50:59,516 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:50:59,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:50:59,516 INFO L85 PathProgramCache]: Analyzing trace with hash -311582192, now seen corresponding path program 1 times [2024-11-16 10:50:59,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:50:59,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814058903] [2024-11-16 10:50:59,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:50:59,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:50:59,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:00,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:51:00,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:00,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-16 10:51:00,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:00,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 10:51:00,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:00,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2024-11-16 10:51:00,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:00,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2024-11-16 10:51:00,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:00,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2024-11-16 10:51:00,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:00,385 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:51:00,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:51:00,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814058903] [2024-11-16 10:51:00,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814058903] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:51:00,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:51:00,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:51:00,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786525375] [2024-11-16 10:51:00,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:51:00,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:51:00,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:51:00,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:51:00,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:51:00,388 INFO L87 Difference]: Start difference. First operand 610 states and 835 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:51:00,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:51:00,608 INFO L93 Difference]: Finished difference Result 982 states and 1345 transitions. [2024-11-16 10:51:00,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:51:00,609 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:51:00,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:51:00,612 INFO L225 Difference]: With dead ends: 982 [2024-11-16 10:51:00,612 INFO L226 Difference]: Without dead ends: 610 [2024-11-16 10:51:00,613 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:51:00,613 INFO L432 NwaCegarLoop]: 440 mSDtfsCounter, 453 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 889 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:51:00,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 889 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 10:51:00,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2024-11-16 10:51:00,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2024-11-16 10:51:00,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 602 states have (on average 1.3654485049833887) internal successors, (822), 602 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:51:00,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 834 transitions. [2024-11-16 10:51:00,625 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 834 transitions. Word has length 335 [2024-11-16 10:51:00,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:51:00,626 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 834 transitions. [2024-11-16 10:51:00,626 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:51:00,626 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 834 transitions. [2024-11-16 10:51:00,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2024-11-16 10:51:00,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:51:00,629 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:51:00,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-16 10:51:00,629 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:51:00,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:51:00,630 INFO L85 PathProgramCache]: Analyzing trace with hash -986651692, now seen corresponding path program 1 times [2024-11-16 10:51:00,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:51:00,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890197166] [2024-11-16 10:51:00,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:51:00,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:51:01,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:01,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:51:01,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:01,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-16 10:51:01,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:01,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 10:51:01,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:01,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2024-11-16 10:51:01,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:01,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2024-11-16 10:51:01,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:01,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-11-16 10:51:01,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:01,580 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:51:01,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:51:01,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890197166] [2024-11-16 10:51:01,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890197166] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:51:01,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:51:01,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 10:51:01,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781222846] [2024-11-16 10:51:01,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:51:01,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 10:51:01,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:51:01,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 10:51:01,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 10:51:01,583 INFO L87 Difference]: Start difference. First operand 610 states and 834 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:51:02,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:51:02,176 INFO L93 Difference]: Finished difference Result 1425 states and 1956 transitions. [2024-11-16 10:51:02,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 10:51:02,176 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:51:02,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:51:02,179 INFO L225 Difference]: With dead ends: 1425 [2024-11-16 10:51:02,179 INFO L226 Difference]: Without dead ends: 1053 [2024-11-16 10:51:02,180 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:51:02,180 INFO L432 NwaCegarLoop]: 427 mSDtfsCounter, 350 mSDsluCounter, 1595 mSDsCounter, 0 mSdLazyCounter, 987 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 2022 SdHoareTripleChecker+Invalid, 995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 10:51:02,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 2022 Invalid, 995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 987 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 10:51:02,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2024-11-16 10:51:02,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 937. [2024-11-16 10:51:02,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 926 states have (on average 1.3617710583153348) internal successors, (1261), 926 states have internal predecessors, (1261), 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:51:02,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1279 transitions. [2024-11-16 10:51:02,200 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1279 transitions. Word has length 336 [2024-11-16 10:51:02,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:51:02,200 INFO L471 AbstractCegarLoop]: Abstraction has 937 states and 1279 transitions. [2024-11-16 10:51:02,200 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:51:02,200 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1279 transitions. [2024-11-16 10:51:02,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2024-11-16 10:51:02,203 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:51:02,203 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:51:02,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-16 10:51:02,204 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:51:02,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:51:02,204 INFO L85 PathProgramCache]: Analyzing trace with hash 756457402, now seen corresponding path program 1 times [2024-11-16 10:51:02,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:51:02,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021428904] [2024-11-16 10:51:02,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:51:02,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:51:02,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:03,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:51:03,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:03,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-16 10:51:03,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:03,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 10:51:03,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:03,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2024-11-16 10:51:03,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:03,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2024-11-16 10:51:03,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:03,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-11-16 10:51:03,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:03,253 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:51:03,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:51:03,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021428904] [2024-11-16 10:51:03,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021428904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:51:03,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:51:03,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 10:51:03,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401032934] [2024-11-16 10:51:03,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:51:03,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 10:51:03,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:51:03,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 10:51:03,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-16 10:51:03,256 INFO L87 Difference]: Start difference. First operand 937 states and 1279 transitions. Second operand has 6 states, 6 states have (on average 51.666666666666664) internal successors, (310), 6 states have internal predecessors, (310), 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:51:03,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:51:03,791 INFO L93 Difference]: Finished difference Result 1332 states and 1822 transitions. [2024-11-16 10:51:03,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 10:51:03,791 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 51.666666666666664) internal successors, (310), 6 states have internal predecessors, (310), 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 337 [2024-11-16 10:51:03,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:51:03,794 INFO L225 Difference]: With dead ends: 1332 [2024-11-16 10:51:03,794 INFO L226 Difference]: Without dead ends: 960 [2024-11-16 10:51:03,795 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:51:03,795 INFO L432 NwaCegarLoop]: 336 mSDtfsCounter, 1011 mSDsluCounter, 978 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1014 SdHoareTripleChecker+Valid, 1314 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 10:51:03,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1014 Valid, 1314 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 10:51:03,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2024-11-16 10:51:03,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 938. [2024-11-16 10:51:03,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 938 states, 927 states have (on average 1.3613807982740023) internal successors, (1262), 927 states have internal predecessors, (1262), 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:51:03,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1280 transitions. [2024-11-16 10:51:03,810 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1280 transitions. Word has length 337 [2024-11-16 10:51:03,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:51:03,811 INFO L471 AbstractCegarLoop]: Abstraction has 938 states and 1280 transitions. [2024-11-16 10:51:03,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 51.666666666666664) internal successors, (310), 6 states have internal predecessors, (310), 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:51:03,811 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1280 transitions. [2024-11-16 10:51:03,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2024-11-16 10:51:03,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:51:03,813 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:51:03,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-16 10:51:03,813 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:51:03,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:51:03,813 INFO L85 PathProgramCache]: Analyzing trace with hash -141530312, now seen corresponding path program 1 times [2024-11-16 10:51:03,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:51:03,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539984222] [2024-11-16 10:51:03,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:51:03,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:51:04,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:04,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 10:51:04,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:04,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 10:51:04,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:04,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 10:51:04,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:04,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2024-11-16 10:51:04,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:04,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2024-11-16 10:51:04,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:04,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-11-16 10:51:04,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:04,973 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2024-11-16 10:51:04,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:51:04,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539984222] [2024-11-16 10:51:04,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539984222] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:51:04,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:51:04,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 10:51:04,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635477253] [2024-11-16 10:51:04,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:51:04,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 10:51:04,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:51:04,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 10:51:04,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-16 10:51:04,976 INFO L87 Difference]: Start difference. First operand 938 states and 1280 transitions. Second operand has 8 states, 8 states have (on average 32.375) internal successors, (259), 8 states have internal predecessors, (259), 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:51:05,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:51:05,744 INFO L93 Difference]: Finished difference Result 2116 states and 2879 transitions. [2024-11-16 10:51:05,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 10:51:05,745 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 32.375) internal successors, (259), 8 states have internal predecessors, (259), 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 337 [2024-11-16 10:51:05,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:51:05,750 INFO L225 Difference]: With dead ends: 2116 [2024-11-16 10:51:05,750 INFO L226 Difference]: Without dead ends: 1626 [2024-11-16 10:51:05,752 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:51:05,752 INFO L432 NwaCegarLoop]: 1089 mSDtfsCounter, 782 mSDsluCounter, 5558 mSDsCounter, 0 mSdLazyCounter, 1558 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 6647 SdHoareTripleChecker+Invalid, 1558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 10:51:05,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 6647 Invalid, 1558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1558 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 10:51:05,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2024-11-16 10:51:05,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 1005. [2024-11-16 10:51:05,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1005 states, 991 states have (on average 1.3652875882946518) internal successors, (1353), 991 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:51:05,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 1377 transitions. [2024-11-16 10:51:05,774 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 1377 transitions. Word has length 337 [2024-11-16 10:51:05,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:51:05,775 INFO L471 AbstractCegarLoop]: Abstraction has 1005 states and 1377 transitions. [2024-11-16 10:51:05,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 32.375) internal successors, (259), 8 states have internal predecessors, (259), 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:51:05,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 1377 transitions. [2024-11-16 10:51:05,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2024-11-16 10:51:05,777 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:51:05,777 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, 1] [2024-11-16 10:51:05,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-16 10:51:05,778 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:51:05,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:51:05,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1733080147, now seen corresponding path program 1 times [2024-11-16 10:51:05,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:51:05,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466816569] [2024-11-16 10:51:05,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:51:05,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:51:06,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:06,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:51:06,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:06,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-16 10:51:06,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:06,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 10:51:06,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:06,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2024-11-16 10:51:06,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:06,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2024-11-16 10:51:06,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:06,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2024-11-16 10:51:06,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:06,997 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-11-16 10:51:06,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:51:06,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466816569] [2024-11-16 10:51:06,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466816569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:51:06,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:51:06,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 10:51:06,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436541771] [2024-11-16 10:51:06,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:51:06,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 10:51:06,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:51:06,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 10:51:06,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 10:51:06,999 INFO L87 Difference]: Start difference. First operand 1005 states and 1377 transitions. Second operand has 7 states, 7 states have (on average 39.42857142857143) internal successors, (276), 7 states have internal predecessors, (276), 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:51:07,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:51:07,454 INFO L93 Difference]: Finished difference Result 2016 states and 2758 transitions. [2024-11-16 10:51:07,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 10:51:07,455 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 39.42857142857143) internal successors, (276), 7 states have internal predecessors, (276), 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 338 [2024-11-16 10:51:07,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:51:07,459 INFO L225 Difference]: With dead ends: 2016 [2024-11-16 10:51:07,460 INFO L226 Difference]: Without dead ends: 1021 [2024-11-16 10:51:07,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-16 10:51:07,462 INFO L432 NwaCegarLoop]: 440 mSDtfsCounter, 593 mSDsluCounter, 1651 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 595 SdHoareTripleChecker+Valid, 2091 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 10:51:07,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [595 Valid, 2091 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 10:51:07,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2024-11-16 10:51:07,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 1013. [2024-11-16 10:51:07,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1013 states, 999 states have (on average 1.3583583583583583) internal successors, (1357), 999 states have internal predecessors, (1357), 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:51:07,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 1381 transitions. [2024-11-16 10:51:07,489 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 1381 transitions. Word has length 338 [2024-11-16 10:51:07,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:51:07,489 INFO L471 AbstractCegarLoop]: Abstraction has 1013 states and 1381 transitions. [2024-11-16 10:51:07,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 39.42857142857143) internal successors, (276), 7 states have internal predecessors, (276), 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:51:07,490 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1381 transitions. [2024-11-16 10:51:07,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2024-11-16 10:51:07,493 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:51:07,493 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:51:07,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-16 10:51:07,493 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:51:07,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:51:07,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1628951229, now seen corresponding path program 1 times [2024-11-16 10:51:07,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:51:07,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299844070] [2024-11-16 10:51:07,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:51:07,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:51:08,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:08,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:51:08,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:08,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 10:51:08,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:08,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 10:51:08,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:08,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-11-16 10:51:08,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:08,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2024-11-16 10:51:08,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:08,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2024-11-16 10:51:08,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:08,491 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 82 proven. 3 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-16 10:51:08,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:51:08,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299844070] [2024-11-16 10:51:08,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299844070] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 10:51:08,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918070409] [2024-11-16 10:51:08,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:51:08,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 10:51:08,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 10:51:08,494 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:51:08,495 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:51:09,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:09,312 INFO L255 TraceCheckSpWp]: Trace formula consists of 2046 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-16 10:51:09,333 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 10:51:09,494 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-16 10:51:09,495 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 10:51:09,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918070409] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:51:09,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 10:51:09,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2024-11-16 10:51:09,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35288952] [2024-11-16 10:51:09,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:51:09,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 10:51:09,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:51:09,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 10:51:09,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-16 10:51:09,497 INFO L87 Difference]: Start difference. First operand 1013 states and 1381 transitions. Second operand has 6 states, 6 states have (on average 40.0) internal successors, (240), 6 states have internal predecessors, (240), 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:51:10,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:51:10,027 INFO L93 Difference]: Finished difference Result 1908 states and 2587 transitions. [2024-11-16 10:51:10,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 10:51:10,027 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 40.0) internal successors, (240), 6 states have internal predecessors, (240), 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 340 [2024-11-16 10:51:10,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:51:10,031 INFO L225 Difference]: With dead ends: 1908 [2024-11-16 10:51:10,032 INFO L226 Difference]: Without dead ends: 1029 [2024-11-16 10:51:10,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-16 10:51:10,035 INFO L432 NwaCegarLoop]: 329 mSDtfsCounter, 507 mSDsluCounter, 966 mSDsCounter, 0 mSdLazyCounter, 898 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 1295 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 10:51:10,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 1295 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 898 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 10:51:10,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2024-11-16 10:51:10,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 1025. [2024-11-16 10:51:10,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 1011 states have (on average 1.3501483679525224) internal successors, (1365), 1011 states have internal predecessors, (1365), 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:51:10,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1389 transitions. [2024-11-16 10:51:10,064 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1389 transitions. Word has length 340 [2024-11-16 10:51:10,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:51:10,065 INFO L471 AbstractCegarLoop]: Abstraction has 1025 states and 1389 transitions. [2024-11-16 10:51:10,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 40.0) internal successors, (240), 6 states have internal predecessors, (240), 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:51:10,065 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1389 transitions. [2024-11-16 10:51:10,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2024-11-16 10:51:10,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:51:10,068 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:51:10,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 10:51:10,269 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,SelfDestructingSolverStorable35 [2024-11-16 10:51:10,270 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:51:10,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:51:10,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1299278563, now seen corresponding path program 1 times [2024-11-16 10:51:10,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:51:10,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221673515] [2024-11-16 10:51:10,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:51:10,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:51:10,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:11,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 10:51:11,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:11,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 10:51:11,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:11,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 10:51:11,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:11,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-11-16 10:51:11,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:11,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2024-11-16 10:51:11,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:11,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2024-11-16 10:51:11,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:11,548 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 83 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-16 10:51:11,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:51:11,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221673515] [2024-11-16 10:51:11,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221673515] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 10:51:11,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640081947] [2024-11-16 10:51:11,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:51:11,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 10:51:11,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 10:51:11,553 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:51:11,555 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:51:12,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:12,334 INFO L255 TraceCheckSpWp]: Trace formula consists of 2054 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-16 10:51:12,344 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 10:51:12,562 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-16 10:51:12,562 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 10:51:12,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1640081947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:51:12,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 10:51:12,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2024-11-16 10:51:12,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479165503] [2024-11-16 10:51:12,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:51:12,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 10:51:12,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:51:12,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 10:51:12,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-11-16 10:51:12,564 INFO L87 Difference]: Start difference. First operand 1025 states and 1389 transitions. Second operand has 9 states, 9 states have (on average 29.555555555555557) internal successors, (266), 9 states have internal predecessors, (266), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 10:51:13,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:51:13,287 INFO L93 Difference]: Finished difference Result 1859 states and 2513 transitions. [2024-11-16 10:51:13,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 10:51:13,287 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 29.555555555555557) internal successors, (266), 9 states have internal predecessors, (266), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 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:51:13,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:51:13,290 INFO L225 Difference]: With dead ends: 1859 [2024-11-16 10:51:13,290 INFO L226 Difference]: Without dead ends: 1049 [2024-11-16 10:51:13,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2024-11-16 10:51:13,292 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 498 mSDsluCounter, 1902 mSDsCounter, 0 mSdLazyCounter, 1602 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 2226 SdHoareTripleChecker+Invalid, 1605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 10:51:13,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 2226 Invalid, 1605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1602 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 10:51:13,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2024-11-16 10:51:13,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 1041. [2024-11-16 10:51:13,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1041 states, 1027 states have (on average 1.340798442064265) internal successors, (1377), 1027 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:51:13,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 1401 transitions. [2024-11-16 10:51:13,308 INFO L78 Accepts]: Start accepts. Automaton has 1041 states and 1401 transitions. Word has length 344 [2024-11-16 10:51:13,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:51:13,309 INFO L471 AbstractCegarLoop]: Abstraction has 1041 states and 1401 transitions. [2024-11-16 10:51:13,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 29.555555555555557) internal successors, (266), 9 states have internal predecessors, (266), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 10:51:13,309 INFO L276 IsEmpty]: Start isEmpty. Operand 1041 states and 1401 transitions. [2024-11-16 10:51:13,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2024-11-16 10:51:13,311 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:51:13,311 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:13,330 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:51:13,512 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,SelfDestructingSolverStorable36 [2024-11-16 10:51:13,513 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:51:13,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:51:13,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1234905925, now seen corresponding path program 1 times [2024-11-16 10:51:13,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:51:13,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419185689] [2024-11-16 10:51:13,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:51:13,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:51:13,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:15,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 10:51:15,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:15,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 10:51:15,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:15,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 10:51:15,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:15,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-11-16 10:51:15,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:15,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-11-16 10:51:15,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:15,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2024-11-16 10:51:15,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:15,234 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 4 proven. 86 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-16 10:51:15,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:51:15,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419185689] [2024-11-16 10:51:15,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419185689] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 10:51:15,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274111907] [2024-11-16 10:51:15,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:51:15,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 10:51:15,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 10:51:15,240 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 10:51:15,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-16 10:51:16,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:16,201 INFO L255 TraceCheckSpWp]: Trace formula consists of 2064 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-16 10:51:16,210 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 10:51:16,386 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:51:16,386 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 10:51:16,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274111907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:51:16,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 10:51:16,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2024-11-16 10:51:16,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230110919] [2024-11-16 10:51:16,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:51:16,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 10:51:16,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:51:16,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 10:51:16,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2024-11-16 10:51:16,388 INFO L87 Difference]: Start difference. First operand 1041 states and 1401 transitions. Second operand has 8 states, 8 states have (on average 40.375) internal successors, (323), 8 states have internal predecessors, (323), 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:51:16,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:51:16,977 INFO L93 Difference]: Finished difference Result 2335 states and 3150 transitions. [2024-11-16 10:51:16,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 10:51:16,978 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 40.375) internal successors, (323), 8 states have internal predecessors, (323), 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 350 [2024-11-16 10:51:16,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:51:16,982 INFO L225 Difference]: With dead ends: 2335 [2024-11-16 10:51:16,982 INFO L226 Difference]: Without dead ends: 1811 [2024-11-16 10:51:16,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2024-11-16 10:51:16,984 INFO L432 NwaCegarLoop]: 334 mSDtfsCounter, 933 mSDsluCounter, 1660 mSDsCounter, 0 mSdLazyCounter, 1320 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 939 SdHoareTripleChecker+Valid, 1994 SdHoareTripleChecker+Invalid, 1320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 10:51:16,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [939 Valid, 1994 Invalid, 1320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1320 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 10:51:16,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2024-11-16 10:51:17,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1465. [2024-11-16 10:51:17,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1465 states, 1442 states have (on average 1.3224687933425798) internal successors, (1907), 1442 states have internal predecessors, (1907), 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:51:17,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1465 states to 1465 states and 1949 transitions. [2024-11-16 10:51:17,029 INFO L78 Accepts]: Start accepts. Automaton has 1465 states and 1949 transitions. Word has length 350 [2024-11-16 10:51:17,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:51:17,029 INFO L471 AbstractCegarLoop]: Abstraction has 1465 states and 1949 transitions. [2024-11-16 10:51:17,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 40.375) internal successors, (323), 8 states have internal predecessors, (323), 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:51:17,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1465 states and 1949 transitions. [2024-11-16 10:51:17,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2024-11-16 10:51:17,037 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:51:17,037 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:51:17,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-16 10:51:17,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 10:51:17,240 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:51:17,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:51:17,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1581028378, now seen corresponding path program 1 times [2024-11-16 10:51:17,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:51:17,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938273916] [2024-11-16 10:51:17,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:51:17,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:51:17,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:17,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 10:51:17,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:17,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 10:51:17,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:17,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 10:51:17,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:17,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-11-16 10:51:17,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:17,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-11-16 10:51:17,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:17,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2024-11-16 10:51:17,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:17,903 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2024-11-16 10:51:17,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:51:17,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938273916] [2024-11-16 10:51:17,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938273916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:51:17,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:51:17,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:51:17,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016948781] [2024-11-16 10:51:17,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:51:17,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:51:17,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:51:17,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:51:17,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:51:17,906 INFO L87 Difference]: Start difference. First operand 1465 states and 1949 transitions. Second operand has 5 states, 5 states have (on average 57.2) internal successors, (286), 5 states have internal predecessors, (286), 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:51:18,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:51:18,085 INFO L93 Difference]: Finished difference Result 2269 states and 3027 transitions. [2024-11-16 10:51:18,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 10:51:18,087 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 57.2) internal successors, (286), 5 states have internal predecessors, (286), 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 350 [2024-11-16 10:51:18,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:51:18,091 INFO L225 Difference]: With dead ends: 2269 [2024-11-16 10:51:18,092 INFO L226 Difference]: Without dead ends: 1555 [2024-11-16 10:51:18,095 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:51:18,096 INFO L432 NwaCegarLoop]: 454 mSDtfsCounter, 16 mSDsluCounter, 1352 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 1806 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 10:51:18,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 1806 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 10:51:18,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1555 states. [2024-11-16 10:51:18,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1555 to 1555. [2024-11-16 10:51:18,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1555 states, 1532 states have (on average 1.3296344647519582) internal successors, (2037), 1532 states have internal predecessors, (2037), 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:51:18,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 2079 transitions. [2024-11-16 10:51:18,125 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 2079 transitions. Word has length 350 [2024-11-16 10:51:18,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:51:18,125 INFO L471 AbstractCegarLoop]: Abstraction has 1555 states and 2079 transitions. [2024-11-16 10:51:18,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.2) internal successors, (286), 5 states have internal predecessors, (286), 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:51:18,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 2079 transitions. [2024-11-16 10:51:18,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2024-11-16 10:51:18,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:51:18,128 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:51:18,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-16 10:51:18,129 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:51:18,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:51:18,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1485458157, now seen corresponding path program 1 times [2024-11-16 10:51:18,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:51:18,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655975009] [2024-11-16 10:51:18,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:51:18,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:51:18,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:18,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 10:51:18,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:18,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 10:51:18,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:18,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 10:51:18,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:18,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-16 10:51:18,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:18,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-11-16 10:51:18,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:18,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-11-16 10:51:18,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:18,697 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-11-16 10:51:18,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:51:18,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655975009] [2024-11-16 10:51:18,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655975009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:51:18,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:51:18,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 10:51:18,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659920043] [2024-11-16 10:51:18,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:51:18,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 10:51:18,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:51:18,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 10:51:18,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 10:51:18,699 INFO L87 Difference]: Start difference. First operand 1555 states and 2079 transitions. Second operand has 4 states, 4 states have (on average 69.5) internal successors, (278), 4 states have internal predecessors, (278), 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:51:18,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:51:18,842 INFO L93 Difference]: Finished difference Result 2553 states and 3389 transitions. [2024-11-16 10:51:18,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:51:18,843 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 69.5) internal successors, (278), 4 states have internal predecessors, (278), 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 351 [2024-11-16 10:51:18,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:51:18,847 INFO L225 Difference]: With dead ends: 2553 [2024-11-16 10:51:18,847 INFO L226 Difference]: Without dead ends: 1565 [2024-11-16 10:51:18,848 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:51:18,848 INFO L432 NwaCegarLoop]: 455 mSDtfsCounter, 0 mSDsluCounter, 902 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1357 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.1s IncrementalHoareTripleChecker+Time [2024-11-16 10:51:18,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1357 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 10:51:18,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1565 states. [2024-11-16 10:51:18,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1565 to 1565. [2024-11-16 10:51:18,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1565 states, 1542 states have (on average 1.327496757457847) internal successors, (2047), 1542 states have internal predecessors, (2047), 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:51:18,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 2089 transitions. [2024-11-16 10:51:18,877 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 2089 transitions. Word has length 351 [2024-11-16 10:51:18,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:51:18,878 INFO L471 AbstractCegarLoop]: Abstraction has 1565 states and 2089 transitions. [2024-11-16 10:51:18,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.5) internal successors, (278), 4 states have internal predecessors, (278), 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:51:18,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 2089 transitions. [2024-11-16 10:51:18,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2024-11-16 10:51:18,881 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:51:18,881 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:51:18,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-16 10:51:18,882 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:51:18,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:51:18,882 INFO L85 PathProgramCache]: Analyzing trace with hash 642641978, now seen corresponding path program 1 times [2024-11-16 10:51:18,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:51:18,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812174389] [2024-11-16 10:51:18,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:51:18,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:51:19,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:20,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 10:51:20,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:20,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 10:51:20,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:20,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 10:51:20,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:20,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-16 10:51:20,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:20,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-11-16 10:51:20,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:20,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-11-16 10:51:20,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:20,743 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-16 10:51:20,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:51:20,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812174389] [2024-11-16 10:51:20,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812174389] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:51:20,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:51:20,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 10:51:20,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490297232] [2024-11-16 10:51:20,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:51:20,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 10:51:20,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:51:20,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 10:51:20,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-16 10:51:20,746 INFO L87 Difference]: Start difference. First operand 1565 states and 2089 transitions. Second operand has 10 states, 10 states have (on average 27.8) internal successors, (278), 10 states have internal predecessors, (278), 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:51:21,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:51:21,586 INFO L93 Difference]: Finished difference Result 2874 states and 3830 transitions. [2024-11-16 10:51:21,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 10:51:21,586 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 27.8) internal successors, (278), 10 states have internal predecessors, (278), 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 351 [2024-11-16 10:51:21,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:51:21,594 INFO L225 Difference]: With dead ends: 2874 [2024-11-16 10:51:21,594 INFO L226 Difference]: Without dead ends: 2093 [2024-11-16 10:51:21,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-11-16 10:51:21,597 INFO L432 NwaCegarLoop]: 687 mSDtfsCounter, 1275 mSDsluCounter, 4003 mSDsCounter, 0 mSdLazyCounter, 1438 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1280 SdHoareTripleChecker+Valid, 4690 SdHoareTripleChecker+Invalid, 1440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 10:51:21,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1280 Valid, 4690 Invalid, 1440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1438 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 10:51:21,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2093 states. [2024-11-16 10:51:21,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2093 to 1657. [2024-11-16 10:51:21,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1657 states, 1630 states have (on average 1.325766871165644) internal successors, (2161), 1630 states have internal predecessors, (2161), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-16 10:51:21,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1657 states to 1657 states and 2211 transitions. [2024-11-16 10:51:21,649 INFO L78 Accepts]: Start accepts. Automaton has 1657 states and 2211 transitions. Word has length 351 [2024-11-16 10:51:21,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:51:21,649 INFO L471 AbstractCegarLoop]: Abstraction has 1657 states and 2211 transitions. [2024-11-16 10:51:21,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 27.8) internal successors, (278), 10 states have internal predecessors, (278), 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:51:21,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 2211 transitions. [2024-11-16 10:51:21,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2024-11-16 10:51:21,653 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:51:21,654 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:51:21,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-16 10:51:21,654 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:51:21,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:51:21,654 INFO L85 PathProgramCache]: Analyzing trace with hash 464904645, now seen corresponding path program 1 times [2024-11-16 10:51:21,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:51:21,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10385510] [2024-11-16 10:51:21,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:51:21,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:51:22,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:24,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 10:51:24,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:24,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 10:51:24,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:24,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 10:51:24,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:24,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-16 10:51:24,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:24,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-11-16 10:51:24,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:24,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-11-16 10:51:24,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:24,021 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 54 proven. 17 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-11-16 10:51:24,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:51:24,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10385510] [2024-11-16 10:51:24,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10385510] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 10:51:24,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425868908] [2024-11-16 10:51:24,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:51:24,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 10:51:24,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 10:51:24,024 INFO L229 MonitoredProcess]: Starting monitored process 5 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:51:24,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-16 10:51:25,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:25,126 INFO L255 TraceCheckSpWp]: Trace formula consists of 2065 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-16 10:51:25,139 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 10:51:25,340 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 82 proven. 6 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-16 10:51:25,340 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 10:51:25,629 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-16 10:51:25,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425868908] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-16 10:51:25,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-16 10:51:25,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11, 8] total 22 [2024-11-16 10:51:25,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170601650] [2024-11-16 10:51:25,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:51:25,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 10:51:25,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:51:25,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 10:51:25,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2024-11-16 10:51:25,632 INFO L87 Difference]: Start difference. First operand 1657 states and 2211 transitions. Second operand has 7 states, 7 states have (on average 46.285714285714285) internal successors, (324), 7 states have internal predecessors, (324), 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:51:26,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:51:26,165 INFO L93 Difference]: Finished difference Result 2457 states and 3296 transitions. [2024-11-16 10:51:26,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 10:51:26,166 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 46.285714285714285) internal successors, (324), 7 states have internal predecessors, (324), 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 351 [2024-11-16 10:51:26,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:51:26,170 INFO L225 Difference]: With dead ends: 2457 [2024-11-16 10:51:26,170 INFO L226 Difference]: Without dead ends: 2056 [2024-11-16 10:51:26,172 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 726 GetRequests, 703 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552 [2024-11-16 10:51:26,172 INFO L432 NwaCegarLoop]: 807 mSDtfsCounter, 355 mSDsluCounter, 3660 mSDsCounter, 0 mSdLazyCounter, 988 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 4467 SdHoareTripleChecker+Invalid, 989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 10:51:26,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 4467 Invalid, 989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 988 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 10:51:26,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2056 states. [2024-11-16 10:51:26,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2056 to 1852. [2024-11-16 10:51:26,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1852 states, 1822 states have (on average 1.3210757409440175) internal successors, (2407), 1822 states have internal predecessors, (2407), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 10:51:26,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1852 states to 1852 states and 2463 transitions. [2024-11-16 10:51:26,231 INFO L78 Accepts]: Start accepts. Automaton has 1852 states and 2463 transitions. Word has length 351 [2024-11-16 10:51:26,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:51:26,232 INFO L471 AbstractCegarLoop]: Abstraction has 1852 states and 2463 transitions. [2024-11-16 10:51:26,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 46.285714285714285) internal successors, (324), 7 states have internal predecessors, (324), 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:51:26,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1852 states and 2463 transitions. [2024-11-16 10:51:26,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2024-11-16 10:51:26,238 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:51:26,238 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:51:26,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-16 10:51:26,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 10:51:26,439 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:51:26,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:51:26,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1597397120, now seen corresponding path program 1 times [2024-11-16 10:51:26,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:51:26,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091921535] [2024-11-16 10:51:26,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:51:26,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:51:26,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:27,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 10:51:27,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:27,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 10:51:27,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:27,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 10:51:27,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:27,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2024-11-16 10:51:27,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:27,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2024-11-16 10:51:27,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:27,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2024-11-16 10:51:27,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:27,977 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-16 10:51:27,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:51:27,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091921535] [2024-11-16 10:51:27,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091921535] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:51:27,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:51:27,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 10:51:27,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700846116] [2024-11-16 10:51:27,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:51:27,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 10:51:27,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:51:27,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 10:51:27,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-16 10:51:27,979 INFO L87 Difference]: Start difference. First operand 1852 states and 2463 transitions. Second operand has 8 states, 8 states have (on average 40.625) internal successors, (325), 8 states have internal predecessors, (325), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-16 10:51:28,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:51:28,323 INFO L93 Difference]: Finished difference Result 2794 states and 3745 transitions. [2024-11-16 10:51:28,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 10:51:28,323 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 40.625) internal successors, (325), 8 states have internal predecessors, (325), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 352 [2024-11-16 10:51:28,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:51:28,326 INFO L225 Difference]: With dead ends: 2794 [2024-11-16 10:51:28,327 INFO L226 Difference]: Without dead ends: 2198 [2024-11-16 10:51:28,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-16 10:51:28,331 INFO L432 NwaCegarLoop]: 446 mSDtfsCounter, 745 mSDsluCounter, 1766 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 2212 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 10:51:28,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [748 Valid, 2212 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 10:51:28,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2198 states. [2024-11-16 10:51:28,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2198 to 2195. [2024-11-16 10:51:28,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2195 states, 2165 states have (on average 1.3344110854503464) internal successors, (2889), 2165 states have internal predecessors, (2889), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 10:51:28,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2195 states to 2195 states and 2945 transitions. [2024-11-16 10:51:28,384 INFO L78 Accepts]: Start accepts. Automaton has 2195 states and 2945 transitions. Word has length 352 [2024-11-16 10:51:28,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:51:28,385 INFO L471 AbstractCegarLoop]: Abstraction has 2195 states and 2945 transitions. [2024-11-16 10:51:28,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 40.625) internal successors, (325), 8 states have internal predecessors, (325), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-16 10:51:28,386 INFO L276 IsEmpty]: Start isEmpty. Operand 2195 states and 2945 transitions. [2024-11-16 10:51:28,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2024-11-16 10:51:28,390 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:51:28,390 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:51:28,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-16 10:51:28,391 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:51:28,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:51:28,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1141268206, now seen corresponding path program 1 times [2024-11-16 10:51:28,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:51:28,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111849125] [2024-11-16 10:51:28,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:51:28,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:51:29,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:30,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 10:51:30,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:30,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 10:51:30,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:30,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 10:51:30,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:30,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-16 10:51:30,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:30,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-11-16 10:51:30,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:30,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-11-16 10:51:30,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:30,669 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2024-11-16 10:51:30,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:51:30,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111849125] [2024-11-16 10:51:30,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111849125] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:51:30,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:51:30,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 10:51:30,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266680491] [2024-11-16 10:51:30,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:51:30,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 10:51:30,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:51:30,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 10:51:30,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-16 10:51:30,671 INFO L87 Difference]: Start difference. First operand 2195 states and 2945 transitions. Second operand has 9 states, 9 states have (on average 31.22222222222222) internal successors, (281), 9 states have internal predecessors, (281), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-16 10:51:31,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:51:31,729 INFO L93 Difference]: Finished difference Result 5343 states and 7113 transitions. [2024-11-16 10:51:31,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 10:51:31,730 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 31.22222222222222) internal successors, (281), 9 states have internal predecessors, (281), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 352 [2024-11-16 10:51:31,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:51:31,735 INFO L225 Difference]: With dead ends: 5343 [2024-11-16 10:51:31,736 INFO L226 Difference]: Without dead ends: 3847 [2024-11-16 10:51:31,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2024-11-16 10:51:31,739 INFO L432 NwaCegarLoop]: 509 mSDtfsCounter, 1345 mSDsluCounter, 2310 mSDsCounter, 0 mSdLazyCounter, 2127 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1346 SdHoareTripleChecker+Valid, 2819 SdHoareTripleChecker+Invalid, 2133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-16 10:51:31,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1346 Valid, 2819 Invalid, 2133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2127 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-16 10:51:31,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3847 states. [2024-11-16 10:51:31,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3847 to 2557. [2024-11-16 10:51:31,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2557 states, 2517 states have (on average 1.3353198251887168) internal successors, (3361), 2517 states have internal predecessors, (3361), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-16 10:51:31,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2557 states to 2557 states and 3437 transitions. [2024-11-16 10:51:31,788 INFO L78 Accepts]: Start accepts. Automaton has 2557 states and 3437 transitions. Word has length 352 [2024-11-16 10:51:31,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:51:31,788 INFO L471 AbstractCegarLoop]: Abstraction has 2557 states and 3437 transitions. [2024-11-16 10:51:31,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 31.22222222222222) internal successors, (281), 9 states have internal predecessors, (281), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-16 10:51:31,789 INFO L276 IsEmpty]: Start isEmpty. Operand 2557 states and 3437 transitions. [2024-11-16 10:51:31,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2024-11-16 10:51:31,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:51:31,793 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:51:31,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-16 10:51:31,793 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:51:31,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:51:31,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1062090638, now seen corresponding path program 1 times [2024-11-16 10:51:31,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:51:31,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340656525] [2024-11-16 10:51:31,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:51:31,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:51:32,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:36,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 10:51:36,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:36,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 10:51:36,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:36,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 10:51:36,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:36,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-16 10:51:36,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:36,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-11-16 10:51:36,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:36,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-11-16 10:51:36,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:36,712 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 51 proven. 38 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-16 10:51:36,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:51:36,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340656525] [2024-11-16 10:51:36,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340656525] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 10:51:36,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924291838] [2024-11-16 10:51:36,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:51:36,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 10:51:36,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 10:51:36,714 INFO L229 MonitoredProcess]: Starting monitored process 6 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:51:36,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-16 10:51:37,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:37,860 INFO L255 TraceCheckSpWp]: Trace formula consists of 2066 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-16 10:51:37,865 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 10:51:37,929 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-11-16 10:51:37,930 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 10:51:37,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924291838] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:51:37,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 10:51:37,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [18] total 22 [2024-11-16 10:51:37,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781150910] [2024-11-16 10:51:37,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:51:37,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 10:51:37,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:51:37,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 10:51:37,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2024-11-16 10:51:37,932 INFO L87 Difference]: Start difference. First operand 2557 states and 3437 transitions. Second operand has 6 states, 5 states have (on average 53.6) internal successors, (268), 6 states have internal predecessors, (268), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-16 10:51:38,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:51:38,184 INFO L93 Difference]: Finished difference Result 4739 states and 6362 transitions. [2024-11-16 10:51:38,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 10:51:38,185 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 53.6) internal successors, (268), 6 states have internal predecessors, (268), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 352 [2024-11-16 10:51:38,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:51:38,189 INFO L225 Difference]: With dead ends: 4739 [2024-11-16 10:51:38,189 INFO L226 Difference]: Without dead ends: 2557 [2024-11-16 10:51:38,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 361 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2024-11-16 10:51:38,192 INFO L432 NwaCegarLoop]: 454 mSDtfsCounter, 0 mSDsluCounter, 1798 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2252 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 10:51:38,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2252 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 10:51:38,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2557 states. [2024-11-16 10:51:38,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2557 to 2557. [2024-11-16 10:51:38,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2557 states, 2517 states have (on average 1.33134684147795) internal successors, (3351), 2517 states have internal predecessors, (3351), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-16 10:51:38,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2557 states to 2557 states and 3427 transitions. [2024-11-16 10:51:38,234 INFO L78 Accepts]: Start accepts. Automaton has 2557 states and 3427 transitions. Word has length 352 [2024-11-16 10:51:38,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:51:38,234 INFO L471 AbstractCegarLoop]: Abstraction has 2557 states and 3427 transitions. [2024-11-16 10:51:38,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 53.6) internal successors, (268), 6 states have internal predecessors, (268), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-16 10:51:38,235 INFO L276 IsEmpty]: Start isEmpty. Operand 2557 states and 3427 transitions. [2024-11-16 10:51:38,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2024-11-16 10:51:38,239 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:51:38,239 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:51:38,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-16 10:51:38,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2024-11-16 10:51:38,441 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:51:38,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:51:38,441 INFO L85 PathProgramCache]: Analyzing trace with hash -367765801, now seen corresponding path program 1 times [2024-11-16 10:51:38,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:51:38,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612227589] [2024-11-16 10:51:38,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:51:38,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:51:38,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:39,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 10:51:39,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:39,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-16 10:51:39,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:39,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 10:51:39,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:39,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-16 10:51:39,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:39,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-11-16 10:51:39,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:39,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-11-16 10:51:39,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:39,426 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-11-16 10:51:39,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:51:39,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612227589] [2024-11-16 10:51:39,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612227589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:51:39,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:51:39,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 10:51:39,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123020973] [2024-11-16 10:51:39,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:51:39,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 10:51:39,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:51:39,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 10:51:39,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 10:51:39,427 INFO L87 Difference]: Start difference. First operand 2557 states and 3427 transitions. Second operand has 6 states, 6 states have (on average 46.5) internal successors, (279), 6 states have internal predecessors, (279), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)