./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d16_e0.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d16_e0.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 222be94abfdbb514b1917b4bfb3a2a13389b64e1e049c782003790d790f6753f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 05:56:11,340 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 05:56:11,406 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-11 05:56:11,414 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 05:56:11,415 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 05:56:11,441 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 05:56:11,442 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 05:56:11,442 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 05:56:11,443 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 05:56:11,443 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 05:56:11,444 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 05:56:11,444 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 05:56:11,445 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 05:56:11,445 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 05:56:11,445 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 05:56:11,446 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 05:56:11,446 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 05:56:11,447 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 05:56:11,447 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 05:56:11,447 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 05:56:11,449 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 05:56:11,450 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 05:56:11,450 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 05:56:11,454 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 05:56:11,454 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 05:56:11,455 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 05:56:11,455 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 05:56:11,455 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 05:56:11,455 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 05:56:11,456 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:56:11,456 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 05:56:11,456 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 05:56:11,456 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 05:56:11,456 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 05:56:11,457 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 05:56:11,457 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 05:56:11,457 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 05:56:11,458 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 05:56:11,459 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 05:56:11,459 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-clean/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-clean/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 -> 222be94abfdbb514b1917b4bfb3a2a13389b64e1e049c782003790d790f6753f [2024-10-11 05:56:11,761 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 05:56:11,790 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 05:56:11,793 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 05:56:11,795 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 05:56:11,795 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 05:56:11,797 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d16_e0.c [2024-10-11 05:56:13,234 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 05:56:13,514 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 05:56:13,514 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d16_e0.c [2024-10-11 05:56:13,527 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c3ff09f63/65db6ffe76654065bde6947719a4c267/FLAG6518e5179 [2024-10-11 05:56:13,542 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c3ff09f63/65db6ffe76654065bde6947719a4c267 [2024-10-11 05:56:13,545 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 05:56:13,546 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 05:56:13,547 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 05:56:13,548 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 05:56:13,554 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 05:56:13,555 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:56:13" (1/1) ... [2024-10-11 05:56:13,556 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@785b77d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:13, skipping insertion in model container [2024-10-11 05:56:13,556 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:56:13" (1/1) ... [2024-10-11 05:56:13,615 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 05:56:13,827 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d16_e0.c[1280,1293] [2024-10-11 05:56:14,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:56:14,053 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 05:56:14,064 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d16_e0.c[1280,1293] [2024-10-11 05:56:14,206 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:56:14,235 INFO L204 MainTranslator]: Completed translation [2024-10-11 05:56:14,236 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:14 WrapperNode [2024-10-11 05:56:14,236 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 05:56:14,237 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 05:56:14,237 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 05:56:14,238 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 05:56:14,248 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:14" (1/1) ... [2024-10-11 05:56:14,289 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:14" (1/1) ... [2024-10-11 05:56:14,509 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1977 [2024-10-11 05:56:14,510 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 05:56:14,511 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 05:56:14,512 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 05:56:14,512 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 05:56:14,524 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:14" (1/1) ... [2024-10-11 05:56:14,524 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:14" (1/1) ... [2024-10-11 05:56:14,586 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:14" (1/1) ... [2024-10-11 05:56:14,720 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 05:56:14,720 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:14" (1/1) ... [2024-10-11 05:56:14,721 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:14" (1/1) ... [2024-10-11 05:56:14,856 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:14" (1/1) ... [2024-10-11 05:56:14,880 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:14" (1/1) ... [2024-10-11 05:56:14,897 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:14" (1/1) ... [2024-10-11 05:56:14,912 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:14" (1/1) ... [2024-10-11 05:56:14,946 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 05:56:14,947 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 05:56:14,948 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 05:56:14,948 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 05:56:14,949 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:14" (1/1) ... [2024-10-11 05:56:14,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:56:14,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:56:14,990 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 05:56:14,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 05:56:15,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 05:56:15,044 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 05:56:15,044 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 05:56:15,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 05:56:15,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 05:56:15,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 05:56:15,344 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 05:56:15,349 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 05:56:17,836 INFO L? ?]: Removed 1091 outVars from TransFormulas that were not future-live. [2024-10-11 05:56:17,837 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 05:56:17,902 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 05:56:17,903 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 05:56:17,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:56:17 BoogieIcfgContainer [2024-10-11 05:56:17,903 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 05:56:17,905 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 05:56:17,905 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 05:56:17,909 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 05:56:17,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:56:13" (1/3) ... [2024-10-11 05:56:17,910 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@98ef7a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:56:17, skipping insertion in model container [2024-10-11 05:56:17,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:14" (2/3) ... [2024-10-11 05:56:17,911 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@98ef7a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:56:17, skipping insertion in model container [2024-10-11 05:56:17,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:56:17" (3/3) ... [2024-10-11 05:56:17,912 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.circular_pointer_top_w16_d16_e0.c [2024-10-11 05:56:17,930 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 05:56:17,930 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 05:56:18,021 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 05:56:18,030 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;@36214495, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 05:56:18,031 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 05:56:18,038 INFO L276 IsEmpty]: Start isEmpty. Operand has 549 states, 543 states have (on average 1.4972375690607735) internal successors, (813), 544 states have internal predecessors, (813), 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-10-11 05:56:18,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-11 05:56:18,059 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:18,061 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:18,063 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:18,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:18,068 INFO L85 PathProgramCache]: Analyzing trace with hash -185767001, now seen corresponding path program 1 times [2024-10-11 05:56:18,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:18,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821803275] [2024-10-11 05:56:18,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:18,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:18,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:18,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:56:18,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:18,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 05:56:18,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:18,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 05:56:18,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:18,601 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:18,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:18,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821803275] [2024-10-11 05:56:18,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821803275] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:18,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:18,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 05:56:18,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065367390] [2024-10-11 05:56:18,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:18,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 05:56:18,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:18,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 05:56:18,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 05:56:18,648 INFO L87 Difference]: Start difference. First operand has 549 states, 543 states have (on average 1.4972375690607735) internal successors, (813), 544 states have internal predecessors, (813), 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 68.0) internal successors, (136), 2 states have internal predecessors, (136), 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-10-11 05:56:18,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:18,735 INFO L93 Difference]: Finished difference Result 996 states and 1490 transitions. [2024-10-11 05:56:18,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 05:56:18,741 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 68.0) internal successors, (136), 2 states have internal predecessors, (136), 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 148 [2024-10-11 05:56:18,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:18,759 INFO L225 Difference]: With dead ends: 996 [2024-10-11 05:56:18,759 INFO L226 Difference]: Without dead ends: 548 [2024-10-11 05:56:18,767 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-10-11 05:56:18,772 INFO L432 NwaCegarLoop]: 815 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:18,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 815 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:56:18,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2024-10-11 05:56:18,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2024-10-11 05:56:18,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 543 states have (on average 1.4917127071823204) internal successors, (810), 543 states have internal predecessors, (810), 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-10-11 05:56:18,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 816 transitions. [2024-10-11 05:56:18,847 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 816 transitions. Word has length 148 [2024-10-11 05:56:18,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:18,848 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 816 transitions. [2024-10-11 05:56:18,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 68.0) internal successors, (136), 2 states have internal predecessors, (136), 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-10-11 05:56:18,849 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 816 transitions. [2024-10-11 05:56:18,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-11 05:56:18,852 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:18,853 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:18,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 05:56:18,855 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:18,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:18,856 INFO L85 PathProgramCache]: Analyzing trace with hash 386034401, now seen corresponding path program 1 times [2024-10-11 05:56:18,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:18,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428869326] [2024-10-11 05:56:18,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:18,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:19,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:20,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:56:20,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:20,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 05:56:20,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:20,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 05:56:20,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:20,171 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:20,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:20,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428869326] [2024-10-11 05:56:20,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428869326] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:20,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:20,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:56:20,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580109378] [2024-10-11 05:56:20,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:20,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:56:20,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:20,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:56:20,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:56:20,178 INFO L87 Difference]: Start difference. First operand 548 states and 816 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 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-10-11 05:56:20,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:20,242 INFO L93 Difference]: Finished difference Result 552 states and 820 transitions. [2024-10-11 05:56:20,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:20,243 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 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 148 [2024-10-11 05:56:20,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:20,249 INFO L225 Difference]: With dead ends: 552 [2024-10-11 05:56:20,250 INFO L226 Difference]: Without dead ends: 550 [2024-10-11 05:56:20,251 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-10-11 05:56:20,253 INFO L432 NwaCegarLoop]: 813 mSDtfsCounter, 0 mSDsluCounter, 1621 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2434 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:20,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2434 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:56:20,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2024-10-11 05:56:20,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2024-10-11 05:56:20,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 545 states have (on average 1.489908256880734) internal successors, (812), 545 states have internal predecessors, (812), 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-10-11 05:56:20,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 818 transitions. [2024-10-11 05:56:20,285 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 818 transitions. Word has length 148 [2024-10-11 05:56:20,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:20,287 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 818 transitions. [2024-10-11 05:56:20,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 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-10-11 05:56:20,287 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 818 transitions. [2024-10-11 05:56:20,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-11 05:56:20,290 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:20,290 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:20,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 05:56:20,290 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:20,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:20,291 INFO L85 PathProgramCache]: Analyzing trace with hash -916139479, now seen corresponding path program 1 times [2024-10-11 05:56:20,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:20,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220920285] [2024-10-11 05:56:20,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:20,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:20,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:20,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:56:20,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:20,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 05:56:20,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:20,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 05:56:20,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:20,905 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:20,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:20,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220920285] [2024-10-11 05:56:20,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220920285] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:20,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:20,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:56:20,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007883268] [2024-10-11 05:56:20,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:20,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:56:20,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:20,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:56:20,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:20,912 INFO L87 Difference]: Start difference. First operand 550 states and 818 transitions. Second operand has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 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-10-11 05:56:21,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:21,501 INFO L93 Difference]: Finished difference Result 1370 states and 2040 transitions. [2024-10-11 05:56:21,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 05:56:21,502 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 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 149 [2024-10-11 05:56:21,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:21,505 INFO L225 Difference]: With dead ends: 1370 [2024-10-11 05:56:21,507 INFO L226 Difference]: Without dead ends: 550 [2024-10-11 05:56:21,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 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-10-11 05:56:21,511 INFO L432 NwaCegarLoop]: 859 mSDtfsCounter, 1618 mSDsluCounter, 1487 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1618 SdHoareTripleChecker+Valid, 2346 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:21,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1618 Valid, 2346 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 05:56:21,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2024-10-11 05:56:21,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2024-10-11 05:56:21,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 545 states have (on average 1.4880733944954128) internal successors, (811), 545 states have internal predecessors, (811), 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-10-11 05:56:21,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 817 transitions. [2024-10-11 05:56:21,532 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 817 transitions. Word has length 149 [2024-10-11 05:56:21,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:21,534 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 817 transitions. [2024-10-11 05:56:21,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 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-10-11 05:56:21,534 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 817 transitions. [2024-10-11 05:56:21,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-11 05:56:21,537 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:21,537 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:21,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 05:56:21,538 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:21,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:21,538 INFO L85 PathProgramCache]: Analyzing trace with hash -2116961565, now seen corresponding path program 1 times [2024-10-11 05:56:21,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:21,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703201411] [2024-10-11 05:56:21,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:21,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:21,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:22,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:56:22,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:22,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 05:56:22,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:22,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 05:56:22,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:22,065 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:22,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:22,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703201411] [2024-10-11 05:56:22,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703201411] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:22,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:22,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:56:22,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126289690] [2024-10-11 05:56:22,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:22,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:56:22,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:22,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:56:22,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:56:22,068 INFO L87 Difference]: Start difference. First operand 550 states and 817 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 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-10-11 05:56:22,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:22,104 INFO L93 Difference]: Finished difference Result 1001 states and 1486 transitions. [2024-10-11 05:56:22,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:22,105 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 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 150 [2024-10-11 05:56:22,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:22,108 INFO L225 Difference]: With dead ends: 1001 [2024-10-11 05:56:22,108 INFO L226 Difference]: Without dead ends: 552 [2024-10-11 05:56:22,112 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-10-11 05:56:22,114 INFO L432 NwaCegarLoop]: 812 mSDtfsCounter, 0 mSDsluCounter, 1616 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2428 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:22,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2428 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:56:22,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-10-11 05:56:22,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2024-10-11 05:56:22,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4862888482632541) internal successors, (813), 547 states have internal predecessors, (813), 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-10-11 05:56:22,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 819 transitions. [2024-10-11 05:56:22,132 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 819 transitions. Word has length 150 [2024-10-11 05:56:22,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:22,133 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 819 transitions. [2024-10-11 05:56:22,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 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-10-11 05:56:22,134 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 819 transitions. [2024-10-11 05:56:22,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 05:56:22,156 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:22,157 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:22,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 05:56:22,157 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:22,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:22,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1995703104, now seen corresponding path program 1 times [2024-10-11 05:56:22,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:22,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103572047] [2024-10-11 05:56:22,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:22,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:22,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:22,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:56:22,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:22,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 05:56:22,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:22,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 05:56:22,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:22,764 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:22,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:22,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103572047] [2024-10-11 05:56:22,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103572047] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:22,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:22,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:56:22,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571701423] [2024-10-11 05:56:22,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:22,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:56:22,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:22,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:56:22,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:56:22,767 INFO L87 Difference]: Start difference. First operand 552 states and 819 transitions. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 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-10-11 05:56:22,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:22,899 INFO L93 Difference]: Finished difference Result 1003 states and 1487 transitions. [2024-10-11 05:56:22,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:22,900 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 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 151 [2024-10-11 05:56:22,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:22,902 INFO L225 Difference]: With dead ends: 1003 [2024-10-11 05:56:22,902 INFO L226 Difference]: Without dead ends: 552 [2024-10-11 05:56:22,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:22,904 INFO L432 NwaCegarLoop]: 772 mSDtfsCounter, 702 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 1546 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:22,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 1546 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:56:22,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-10-11 05:56:22,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2024-10-11 05:56:22,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4844606946983547) internal successors, (812), 547 states have internal predecessors, (812), 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-10-11 05:56:22,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 818 transitions. [2024-10-11 05:56:22,923 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 818 transitions. Word has length 151 [2024-10-11 05:56:22,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:22,924 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 818 transitions. [2024-10-11 05:56:22,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 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-10-11 05:56:22,925 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 818 transitions. [2024-10-11 05:56:22,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 05:56:22,930 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:22,930 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:22,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 05:56:22,931 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:22,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:22,931 INFO L85 PathProgramCache]: Analyzing trace with hash -334083056, now seen corresponding path program 1 times [2024-10-11 05:56:22,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:22,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881798324] [2024-10-11 05:56:22,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:22,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:23,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:23,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:56:23,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:23,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 05:56:23,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:23,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 05:56:23,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:23,440 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:23,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:23,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881798324] [2024-10-11 05:56:23,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881798324] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:23,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:23,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:56:23,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389339525] [2024-10-11 05:56:23,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:23,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:56:23,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:23,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:56:23,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:23,444 INFO L87 Difference]: Start difference. First operand 552 states and 818 transitions. Second operand has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 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-10-11 05:56:23,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:23,563 INFO L93 Difference]: Finished difference Result 1009 states and 1493 transitions. [2024-10-11 05:56:23,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 05:56:23,564 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 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 152 [2024-10-11 05:56:23,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:23,566 INFO L225 Difference]: With dead ends: 1009 [2024-10-11 05:56:23,567 INFO L226 Difference]: Without dead ends: 552 [2024-10-11 05:56:23,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 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-10-11 05:56:23,569 INFO L432 NwaCegarLoop]: 804 mSDtfsCounter, 713 mSDsluCounter, 1581 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 2385 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:23,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [713 Valid, 2385 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:56:23,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-10-11 05:56:23,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2024-10-11 05:56:23,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.482632541133455) internal successors, (811), 547 states have internal predecessors, (811), 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-10-11 05:56:23,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 817 transitions. [2024-10-11 05:56:23,586 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 817 transitions. Word has length 152 [2024-10-11 05:56:23,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:23,586 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 817 transitions. [2024-10-11 05:56:23,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 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-10-11 05:56:23,587 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 817 transitions. [2024-10-11 05:56:23,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-11 05:56:23,589 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:23,589 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:23,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 05:56:23,590 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:23,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:23,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1729904971, now seen corresponding path program 1 times [2024-10-11 05:56:23,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:23,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619436099] [2024-10-11 05:56:23,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:23,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:23,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:23,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:56:23,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:23,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 05:56:23,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:23,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 05:56:23,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:23,990 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:23,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:23,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619436099] [2024-10-11 05:56:23,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619436099] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:23,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:23,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:56:23,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250221531] [2024-10-11 05:56:23,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:23,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:56:23,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:23,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:56:23,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:23,993 INFO L87 Difference]: Start difference. First operand 552 states and 817 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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-10-11 05:56:24,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:24,115 INFO L93 Difference]: Finished difference Result 1003 states and 1483 transitions. [2024-10-11 05:56:24,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:24,116 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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 153 [2024-10-11 05:56:24,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:24,119 INFO L225 Difference]: With dead ends: 1003 [2024-10-11 05:56:24,120 INFO L226 Difference]: Without dead ends: 552 [2024-10-11 05:56:24,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:56:24,121 INFO L432 NwaCegarLoop]: 772 mSDtfsCounter, 802 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 1552 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:24,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [805 Valid, 1552 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:56:24,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-10-11 05:56:24,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2024-10-11 05:56:24,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4808043875685557) internal successors, (810), 547 states have internal predecessors, (810), 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-10-11 05:56:24,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 816 transitions. [2024-10-11 05:56:24,139 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 816 transitions. Word has length 153 [2024-10-11 05:56:24,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:24,139 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 816 transitions. [2024-10-11 05:56:24,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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-10-11 05:56:24,139 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 816 transitions. [2024-10-11 05:56:24,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-11 05:56:24,141 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:24,141 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:24,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 05:56:24,142 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:24,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:24,142 INFO L85 PathProgramCache]: Analyzing trace with hash 871281751, now seen corresponding path program 1 times [2024-10-11 05:56:24,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:24,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939110998] [2024-10-11 05:56:24,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:24,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:24,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:24,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:56:24,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:24,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 05:56:24,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:24,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 05:56:24,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:24,549 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:24,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:24,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939110998] [2024-10-11 05:56:24,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939110998] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:24,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:24,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:56:24,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781883207] [2024-10-11 05:56:24,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:24,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:56:24,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:24,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:56:24,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:24,552 INFO L87 Difference]: Start difference. First operand 552 states and 816 transitions. Second operand has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 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-10-11 05:56:24,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:24,680 INFO L93 Difference]: Finished difference Result 1003 states and 1481 transitions. [2024-10-11 05:56:24,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:24,681 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 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 154 [2024-10-11 05:56:24,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:24,683 INFO L225 Difference]: With dead ends: 1003 [2024-10-11 05:56:24,684 INFO L226 Difference]: Without dead ends: 552 [2024-10-11 05:56:24,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:56:24,686 INFO L432 NwaCegarLoop]: 772 mSDtfsCounter, 798 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 801 SdHoareTripleChecker+Valid, 1552 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:24,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [801 Valid, 1552 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:56:24,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-10-11 05:56:24,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2024-10-11 05:56:24,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4789762340036563) internal successors, (809), 547 states have internal predecessors, (809), 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-10-11 05:56:24,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 815 transitions. [2024-10-11 05:56:24,700 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 815 transitions. Word has length 154 [2024-10-11 05:56:24,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:24,701 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 815 transitions. [2024-10-11 05:56:24,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 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-10-11 05:56:24,701 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 815 transitions. [2024-10-11 05:56:24,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-11 05:56:24,703 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:24,703 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:24,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 05:56:24,703 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:24,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:24,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1040354958, now seen corresponding path program 1 times [2024-10-11 05:56:24,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:24,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620226547] [2024-10-11 05:56:24,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:24,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:24,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:25,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:56:25,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:25,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 05:56:25,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:25,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 05:56:25,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:25,303 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:25,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:25,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620226547] [2024-10-11 05:56:25,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620226547] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:25,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:25,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:56:25,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179936460] [2024-10-11 05:56:25,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:25,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:56:25,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:25,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:56:25,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:56:25,305 INFO L87 Difference]: Start difference. First operand 552 states and 815 transitions. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 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-10-11 05:56:25,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:25,503 INFO L93 Difference]: Finished difference Result 1003 states and 1479 transitions. [2024-10-11 05:56:25,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:25,504 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 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 155 [2024-10-11 05:56:25,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:25,507 INFO L225 Difference]: With dead ends: 1003 [2024-10-11 05:56:25,507 INFO L226 Difference]: Without dead ends: 552 [2024-10-11 05:56:25,508 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-10-11 05:56:25,511 INFO L432 NwaCegarLoop]: 728 mSDtfsCounter, 686 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 1458 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:25,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [686 Valid, 1458 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 05:56:25,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-10-11 05:56:25,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2024-10-11 05:56:25,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.477148080438757) internal successors, (808), 547 states have internal predecessors, (808), 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-10-11 05:56:25,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 814 transitions. [2024-10-11 05:56:25,526 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 814 transitions. Word has length 155 [2024-10-11 05:56:25,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:25,527 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 814 transitions. [2024-10-11 05:56:25,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 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-10-11 05:56:25,527 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 814 transitions. [2024-10-11 05:56:25,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-11 05:56:25,529 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:25,529 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:25,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 05:56:25,529 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:25,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:25,530 INFO L85 PathProgramCache]: Analyzing trace with hash -158861950, now seen corresponding path program 1 times [2024-10-11 05:56:25,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:25,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817426205] [2024-10-11 05:56:25,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:25,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:25,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:25,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:56:25,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:25,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 05:56:25,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:25,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 05:56:25,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:25,937 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:25,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:25,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817426205] [2024-10-11 05:56:25,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817426205] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:25,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:25,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:56:25,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422991213] [2024-10-11 05:56:25,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:25,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:56:25,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:25,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:56:25,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:25,939 INFO L87 Difference]: Start difference. First operand 552 states and 814 transitions. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 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-10-11 05:56:26,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:26,104 INFO L93 Difference]: Finished difference Result 1009 states and 1485 transitions. [2024-10-11 05:56:26,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 05:56:26,104 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 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 156 [2024-10-11 05:56:26,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:26,107 INFO L225 Difference]: With dead ends: 1009 [2024-10-11 05:56:26,107 INFO L226 Difference]: Without dead ends: 552 [2024-10-11 05:56:26,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 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-10-11 05:56:26,109 INFO L432 NwaCegarLoop]: 800 mSDtfsCounter, 697 mSDsluCounter, 1533 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 2333 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:26,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [697 Valid, 2333 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:56:26,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-10-11 05:56:26,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2024-10-11 05:56:26,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4753199268738575) internal successors, (807), 547 states have internal predecessors, (807), 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-10-11 05:56:26,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 813 transitions. [2024-10-11 05:56:26,127 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 813 transitions. Word has length 156 [2024-10-11 05:56:26,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:26,128 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 813 transitions. [2024-10-11 05:56:26,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 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-10-11 05:56:26,128 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 813 transitions. [2024-10-11 05:56:26,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-11 05:56:26,130 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:26,130 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:26,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 05:56:26,130 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:26,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:26,131 INFO L85 PathProgramCache]: Analyzing trace with hash -401911171, now seen corresponding path program 1 times [2024-10-11 05:56:26,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:26,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24714364] [2024-10-11 05:56:26,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:26,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:26,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:26,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:56:26,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:26,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 05:56:26,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:26,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 05:56:26,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:26,550 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:26,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:26,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24714364] [2024-10-11 05:56:26,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24714364] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:26,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:26,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:56:26,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379200536] [2024-10-11 05:56:26,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:26,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:56:26,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:26,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:56:26,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:26,554 INFO L87 Difference]: Start difference. First operand 552 states and 813 transitions. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 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-10-11 05:56:26,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:26,750 INFO L93 Difference]: Finished difference Result 1003 states and 1475 transitions. [2024-10-11 05:56:26,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:26,750 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 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 157 [2024-10-11 05:56:26,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:26,753 INFO L225 Difference]: With dead ends: 1003 [2024-10-11 05:56:26,753 INFO L226 Difference]: Without dead ends: 552 [2024-10-11 05:56:26,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:56:26,755 INFO L432 NwaCegarLoop]: 728 mSDtfsCounter, 798 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 801 SdHoareTripleChecker+Valid, 1464 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:26,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [801 Valid, 1464 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 05:56:26,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-10-11 05:56:26,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2024-10-11 05:56:26,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4734917733089579) internal successors, (806), 547 states have internal predecessors, (806), 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-10-11 05:56:26,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 812 transitions. [2024-10-11 05:56:26,770 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 812 transitions. Word has length 157 [2024-10-11 05:56:26,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:26,770 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 812 transitions. [2024-10-11 05:56:26,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 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-10-11 05:56:26,771 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 812 transitions. [2024-10-11 05:56:26,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-11 05:56:26,772 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:26,772 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:26,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 05:56:26,773 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:26,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:26,775 INFO L85 PathProgramCache]: Analyzing trace with hash -959173431, now seen corresponding path program 1 times [2024-10-11 05:56:26,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:26,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197104887] [2024-10-11 05:56:26,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:26,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:26,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:27,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:56:27,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:27,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 05:56:27,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:27,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 05:56:27,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:27,183 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:27,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:27,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197104887] [2024-10-11 05:56:27,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197104887] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:27,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:27,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:56:27,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989355473] [2024-10-11 05:56:27,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:27,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:56:27,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:27,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:56:27,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:27,187 INFO L87 Difference]: Start difference. First operand 552 states and 812 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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-10-11 05:56:27,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:27,387 INFO L93 Difference]: Finished difference Result 1003 states and 1473 transitions. [2024-10-11 05:56:27,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:27,388 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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 158 [2024-10-11 05:56:27,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:27,391 INFO L225 Difference]: With dead ends: 1003 [2024-10-11 05:56:27,391 INFO L226 Difference]: Without dead ends: 552 [2024-10-11 05:56:27,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:56:27,394 INFO L432 NwaCegarLoop]: 728 mSDtfsCounter, 794 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 1464 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:27,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 1464 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 05:56:27,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-10-11 05:56:27,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2024-10-11 05:56:27,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4716636197440585) internal successors, (805), 547 states have internal predecessors, (805), 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-10-11 05:56:27,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 811 transitions. [2024-10-11 05:56:27,409 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 811 transitions. Word has length 158 [2024-10-11 05:56:27,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:27,409 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 811 transitions. [2024-10-11 05:56:27,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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-10-11 05:56:27,411 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 811 transitions. [2024-10-11 05:56:27,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-11 05:56:27,412 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:27,413 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:27,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 05:56:27,413 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:27,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:27,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1672871516, now seen corresponding path program 1 times [2024-10-11 05:56:27,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:27,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384919832] [2024-10-11 05:56:27,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:27,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:27,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:27,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:56:27,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:27,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 05:56:27,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:27,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 05:56:27,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:27,951 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:27,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:27,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384919832] [2024-10-11 05:56:27,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384919832] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:27,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:27,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:56:27,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425049718] [2024-10-11 05:56:27,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:27,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:56:27,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:27,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:56:27,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:27,955 INFO L87 Difference]: Start difference. First operand 552 states and 811 transitions. Second operand has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 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-10-11 05:56:28,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:28,154 INFO L93 Difference]: Finished difference Result 1003 states and 1471 transitions. [2024-10-11 05:56:28,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:28,155 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 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 159 [2024-10-11 05:56:28,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:28,158 INFO L225 Difference]: With dead ends: 1003 [2024-10-11 05:56:28,158 INFO L226 Difference]: Without dead ends: 552 [2024-10-11 05:56:28,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:56:28,160 INFO L432 NwaCegarLoop]: 728 mSDtfsCounter, 1461 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1464 SdHoareTripleChecker+Valid, 1458 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:28,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1464 Valid, 1458 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 05:56:28,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-10-11 05:56:28,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2024-10-11 05:56:28,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.469835466179159) internal successors, (804), 547 states have internal predecessors, (804), 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-10-11 05:56:28,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 810 transitions. [2024-10-11 05:56:28,180 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 810 transitions. Word has length 159 [2024-10-11 05:56:28,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:28,180 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 810 transitions. [2024-10-11 05:56:28,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 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-10-11 05:56:28,181 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 810 transitions. [2024-10-11 05:56:28,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-11 05:56:28,182 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:28,183 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:28,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 05:56:28,183 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:28,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:28,184 INFO L85 PathProgramCache]: Analyzing trace with hash 925686153, now seen corresponding path program 1 times [2024-10-11 05:56:28,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:28,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567795612] [2024-10-11 05:56:28,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:28,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:28,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:28,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:56:28,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:28,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 05:56:28,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:28,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 05:56:28,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:28,673 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:28,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:28,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567795612] [2024-10-11 05:56:28,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567795612] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:28,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:28,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:56:28,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629701619] [2024-10-11 05:56:28,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:28,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:56:28,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:28,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:56:28,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:28,676 INFO L87 Difference]: Start difference. First operand 552 states and 810 transitions. Second operand has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 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-10-11 05:56:28,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:28,860 INFO L93 Difference]: Finished difference Result 1003 states and 1469 transitions. [2024-10-11 05:56:28,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:28,861 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 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 160 [2024-10-11 05:56:28,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:28,864 INFO L225 Difference]: With dead ends: 1003 [2024-10-11 05:56:28,864 INFO L226 Difference]: Without dead ends: 552 [2024-10-11 05:56:28,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:56:28,867 INFO L432 NwaCegarLoop]: 728 mSDtfsCounter, 783 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 1464 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:28,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 1464 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:56:28,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-10-11 05:56:28,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2024-10-11 05:56:28,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4680073126142597) internal successors, (803), 547 states have internal predecessors, (803), 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-10-11 05:56:28,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 809 transitions. [2024-10-11 05:56:28,882 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 809 transitions. Word has length 160 [2024-10-11 05:56:28,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:28,883 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 809 transitions. [2024-10-11 05:56:28,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 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-10-11 05:56:28,883 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 809 transitions. [2024-10-11 05:56:28,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 05:56:28,884 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:28,885 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:28,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 05:56:28,885 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:28,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:28,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1086953085, now seen corresponding path program 1 times [2024-10-11 05:56:28,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:28,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314766309] [2024-10-11 05:56:28,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:28,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:28,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:29,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:56:29,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:29,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 05:56:29,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:29,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 05:56:29,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:29,272 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:29,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:29,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314766309] [2024-10-11 05:56:29,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314766309] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:29,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:29,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:56:29,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004213959] [2024-10-11 05:56:29,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:29,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:56:29,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:29,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:56:29,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:29,275 INFO L87 Difference]: Start difference. First operand 552 states and 809 transitions. Second operand has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 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-10-11 05:56:29,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:29,469 INFO L93 Difference]: Finished difference Result 1003 states and 1467 transitions. [2024-10-11 05:56:29,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:29,470 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 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 161 [2024-10-11 05:56:29,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:29,472 INFO L225 Difference]: With dead ends: 1003 [2024-10-11 05:56:29,472 INFO L226 Difference]: Without dead ends: 552 [2024-10-11 05:56:29,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:56:29,476 INFO L432 NwaCegarLoop]: 728 mSDtfsCounter, 1445 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1448 SdHoareTripleChecker+Valid, 1458 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:29,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1448 Valid, 1458 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 05:56:29,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-10-11 05:56:29,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2024-10-11 05:56:29,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4661791590493602) internal successors, (802), 547 states have internal predecessors, (802), 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-10-11 05:56:29,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 808 transitions. [2024-10-11 05:56:29,491 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 808 transitions. Word has length 161 [2024-10-11 05:56:29,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:29,492 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 808 transitions. [2024-10-11 05:56:29,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 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-10-11 05:56:29,492 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 808 transitions. [2024-10-11 05:56:29,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 05:56:29,494 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:29,494 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:29,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 05:56:29,494 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:29,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:29,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1586247038, now seen corresponding path program 1 times [2024-10-11 05:56:29,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:29,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821702905] [2024-10-11 05:56:29,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:29,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:29,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:29,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:56:29,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:29,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 05:56:29,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:29,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 05:56:29,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:29,954 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:29,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:29,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821702905] [2024-10-11 05:56:29,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821702905] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:29,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:29,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:56:29,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273969349] [2024-10-11 05:56:29,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:29,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:56:29,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:29,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:56:29,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:29,960 INFO L87 Difference]: Start difference. First operand 552 states and 808 transitions. Second operand has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 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-10-11 05:56:30,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:30,148 INFO L93 Difference]: Finished difference Result 1003 states and 1465 transitions. [2024-10-11 05:56:30,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:30,149 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 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 162 [2024-10-11 05:56:30,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:30,151 INFO L225 Difference]: With dead ends: 1003 [2024-10-11 05:56:30,151 INFO L226 Difference]: Without dead ends: 552 [2024-10-11 05:56:30,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:56:30,153 INFO L432 NwaCegarLoop]: 728 mSDtfsCounter, 1437 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1440 SdHoareTripleChecker+Valid, 1458 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:30,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1440 Valid, 1458 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 05:56:30,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-10-11 05:56:30,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2024-10-11 05:56:30,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4643510054844606) internal successors, (801), 547 states have internal predecessors, (801), 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-10-11 05:56:30,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 807 transitions. [2024-10-11 05:56:30,168 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 807 transitions. Word has length 162 [2024-10-11 05:56:30,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:30,169 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 807 transitions. [2024-10-11 05:56:30,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 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-10-11 05:56:30,169 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 807 transitions. [2024-10-11 05:56:30,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-11 05:56:30,171 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:30,171 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:30,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 05:56:30,171 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:30,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:30,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1194570710, now seen corresponding path program 1 times [2024-10-11 05:56:30,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:30,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807130876] [2024-10-11 05:56:30,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:30,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:30,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:30,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:56:30,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:30,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 05:56:30,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:30,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 05:56:30,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:30,728 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:30,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:30,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807130876] [2024-10-11 05:56:30,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807130876] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:30,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:30,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:56:30,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851263131] [2024-10-11 05:56:30,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:30,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:56:30,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:30,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:56:30,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:56:30,731 INFO L87 Difference]: Start difference. First operand 552 states and 807 transitions. Second operand has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 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-10-11 05:56:30,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:30,804 INFO L93 Difference]: Finished difference Result 1003 states and 1463 transitions. [2024-10-11 05:56:30,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:30,805 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 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 163 [2024-10-11 05:56:30,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:30,807 INFO L225 Difference]: With dead ends: 1003 [2024-10-11 05:56:30,807 INFO L226 Difference]: Without dead ends: 552 [2024-10-11 05:56:30,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:30,809 INFO L432 NwaCegarLoop]: 780 mSDtfsCounter, 699 mSDsluCounter, 782 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 1562 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:30,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [699 Valid, 1562 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:56:30,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-10-11 05:56:30,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2024-10-11 05:56:30,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4606946983546618) internal successors, (799), 547 states have internal predecessors, (799), 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-10-11 05:56:30,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 805 transitions. [2024-10-11 05:56:30,823 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 805 transitions. Word has length 163 [2024-10-11 05:56:30,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:30,824 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 805 transitions. [2024-10-11 05:56:30,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 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-10-11 05:56:30,824 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 805 transitions. [2024-10-11 05:56:30,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-11 05:56:30,826 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:30,826 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:30,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 05:56:30,827 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:30,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:30,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1563044179, now seen corresponding path program 1 times [2024-10-11 05:56:30,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:30,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009537134] [2024-10-11 05:56:30,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:30,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:30,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:31,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:56:31,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:31,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 05:56:31,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:31,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 05:56:31,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:31,340 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:31,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:31,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009537134] [2024-10-11 05:56:31,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009537134] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:31,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:31,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:56:31,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368267401] [2024-10-11 05:56:31,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:31,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:56:31,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:31,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:56:31,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:31,343 INFO L87 Difference]: Start difference. First operand 552 states and 805 transitions. Second operand has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 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-10-11 05:56:31,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:31,424 INFO L93 Difference]: Finished difference Result 1003 states and 1459 transitions. [2024-10-11 05:56:31,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:31,425 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 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 165 [2024-10-11 05:56:31,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:31,428 INFO L225 Difference]: With dead ends: 1003 [2024-10-11 05:56:31,428 INFO L226 Difference]: Without dead ends: 552 [2024-10-11 05:56:31,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:56:31,429 INFO L432 NwaCegarLoop]: 780 mSDtfsCounter, 1481 mSDsluCounter, 782 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1484 SdHoareTripleChecker+Valid, 1562 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:31,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1484 Valid, 1562 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:56:31,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-10-11 05:56:31,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2024-10-11 05:56:31,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4588665447897624) internal successors, (798), 547 states have internal predecessors, (798), 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-10-11 05:56:31,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 804 transitions. [2024-10-11 05:56:31,445 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 804 transitions. Word has length 165 [2024-10-11 05:56:31,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:31,445 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 804 transitions. [2024-10-11 05:56:31,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 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-10-11 05:56:31,446 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 804 transitions. [2024-10-11 05:56:31,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-11 05:56:31,448 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:31,448 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:31,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 05:56:31,449 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:31,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:31,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1228719973, now seen corresponding path program 1 times [2024-10-11 05:56:31,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:31,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186172241] [2024-10-11 05:56:31,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:31,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:31,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:32,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:56:32,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:32,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 05:56:32,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:32,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 05:56:32,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:32,033 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:32,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:32,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186172241] [2024-10-11 05:56:32,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186172241] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:32,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:32,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:56:32,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629128327] [2024-10-11 05:56:32,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:32,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:56:32,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:32,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:56:32,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:56:32,036 INFO L87 Difference]: Start difference. First operand 552 states and 804 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 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-10-11 05:56:32,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:32,107 INFO L93 Difference]: Finished difference Result 1003 states and 1457 transitions. [2024-10-11 05:56:32,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:32,108 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 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 166 [2024-10-11 05:56:32,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:32,110 INFO L225 Difference]: With dead ends: 1003 [2024-10-11 05:56:32,110 INFO L226 Difference]: Without dead ends: 552 [2024-10-11 05:56:32,111 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:32,112 INFO L432 NwaCegarLoop]: 783 mSDtfsCounter, 734 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 736 SdHoareTripleChecker+Valid, 1568 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:32,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [736 Valid, 1568 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:56:32,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-10-11 05:56:32,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2024-10-11 05:56:32,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4570383912248628) internal successors, (797), 547 states have internal predecessors, (797), 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-10-11 05:56:32,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 803 transitions. [2024-10-11 05:56:32,126 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 803 transitions. Word has length 166 [2024-10-11 05:56:32,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:32,126 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 803 transitions. [2024-10-11 05:56:32,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 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-10-11 05:56:32,126 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 803 transitions. [2024-10-11 05:56:32,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-11 05:56:32,128 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:32,128 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:32,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 05:56:32,129 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:32,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:32,129 INFO L85 PathProgramCache]: Analyzing trace with hash 873646117, now seen corresponding path program 1 times [2024-10-11 05:56:32,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:32,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062716724] [2024-10-11 05:56:32,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:32,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:32,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:32,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:56:32,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:32,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 05:56:32,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:32,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 05:56:32,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:32,791 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:32,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:32,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062716724] [2024-10-11 05:56:32,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062716724] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:32,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:32,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:56:32,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502985875] [2024-10-11 05:56:32,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:32,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:56:32,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:32,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:56:32,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:56:32,795 INFO L87 Difference]: Start difference. First operand 552 states and 803 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 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-10-11 05:56:32,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:32,869 INFO L93 Difference]: Finished difference Result 1003 states and 1455 transitions. [2024-10-11 05:56:32,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:32,869 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 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 167 [2024-10-11 05:56:32,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:32,872 INFO L225 Difference]: With dead ends: 1003 [2024-10-11 05:56:32,872 INFO L226 Difference]: Without dead ends: 552 [2024-10-11 05:56:32,873 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-10-11 05:56:32,874 INFO L432 NwaCegarLoop]: 783 mSDtfsCounter, 732 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 1568 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:32,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [734 Valid, 1568 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:56:32,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-10-11 05:56:32,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2024-10-11 05:56:32,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4552102376599634) internal successors, (796), 547 states have internal predecessors, (796), 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-10-11 05:56:32,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 802 transitions. [2024-10-11 05:56:32,894 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 802 transitions. Word has length 167 [2024-10-11 05:56:32,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:32,894 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 802 transitions. [2024-10-11 05:56:32,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 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-10-11 05:56:32,895 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 802 transitions. [2024-10-11 05:56:32,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-11 05:56:32,896 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:32,896 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:32,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 05:56:32,897 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:32,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:32,897 INFO L85 PathProgramCache]: Analyzing trace with hash -48804542, now seen corresponding path program 1 times [2024-10-11 05:56:32,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:32,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538731489] [2024-10-11 05:56:32,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:32,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:33,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:33,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:56:33,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:33,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 05:56:33,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:33,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 05:56:33,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:33,729 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:33,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:33,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538731489] [2024-10-11 05:56:33,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538731489] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:33,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:33,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:56:33,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805243139] [2024-10-11 05:56:33,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:33,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:56:33,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:33,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:56:33,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:56:33,733 INFO L87 Difference]: Start difference. First operand 552 states and 802 transitions. Second operand has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 7 states have internal predecessors, (156), 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-10-11 05:56:34,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:34,171 INFO L93 Difference]: Finished difference Result 1069 states and 1549 transitions. [2024-10-11 05:56:34,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:56:34,172 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 7 states have internal predecessors, (156), 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 168 [2024-10-11 05:56:34,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:34,176 INFO L225 Difference]: With dead ends: 1069 [2024-10-11 05:56:34,177 INFO L226 Difference]: Without dead ends: 556 [2024-10-11 05:56:34,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:56:34,179 INFO L432 NwaCegarLoop]: 773 mSDtfsCounter, 863 mSDsluCounter, 2917 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 866 SdHoareTripleChecker+Valid, 3690 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:34,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [866 Valid, 3690 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 05:56:34,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2024-10-11 05:56:34,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 554. [2024-10-11 05:56:34,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 549 states have (on average 1.4517304189435336) internal successors, (797), 549 states have internal predecessors, (797), 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-10-11 05:56:34,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 803 transitions. [2024-10-11 05:56:34,203 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 803 transitions. Word has length 168 [2024-10-11 05:56:34,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:34,204 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 803 transitions. [2024-10-11 05:56:34,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 7 states have internal predecessors, (156), 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-10-11 05:56:34,204 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 803 transitions. [2024-10-11 05:56:34,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-11 05:56:34,207 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:34,208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:34,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 05:56:34,208 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:34,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:34,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1591431925, now seen corresponding path program 1 times [2024-10-11 05:56:34,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:34,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707251626] [2024-10-11 05:56:34,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:34,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:34,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:35,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 05:56:35,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:35,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 05:56:35,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:35,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 05:56:35,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:35,374 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:35,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:35,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707251626] [2024-10-11 05:56:35,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707251626] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:35,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:35,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:56:35,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938287541] [2024-10-11 05:56:35,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:35,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:56:35,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:35,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:56:35,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:35,377 INFO L87 Difference]: Start difference. First operand 554 states and 803 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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-10-11 05:56:35,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:35,853 INFO L93 Difference]: Finished difference Result 1011 states and 1461 transitions. [2024-10-11 05:56:35,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 05:56:35,854 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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 169 [2024-10-11 05:56:35,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:35,857 INFO L225 Difference]: With dead ends: 1011 [2024-10-11 05:56:35,857 INFO L226 Difference]: Without dead ends: 558 [2024-10-11 05:56:35,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:35,859 INFO L432 NwaCegarLoop]: 606 mSDtfsCounter, 756 mSDsluCounter, 1200 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 756 SdHoareTripleChecker+Valid, 1806 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:35,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [756 Valid, 1806 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 05:56:35,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2024-10-11 05:56:35,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 556. [2024-10-11 05:56:35,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 551 states have (on average 1.4500907441016333) internal successors, (799), 551 states have internal predecessors, (799), 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-10-11 05:56:35,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 805 transitions. [2024-10-11 05:56:35,878 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 805 transitions. Word has length 169 [2024-10-11 05:56:35,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:35,879 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 805 transitions. [2024-10-11 05:56:35,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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-10-11 05:56:35,879 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 805 transitions. [2024-10-11 05:56:35,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-11 05:56:35,881 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:35,881 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:35,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 05:56:35,881 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:35,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:35,882 INFO L85 PathProgramCache]: Analyzing trace with hash -568859358, now seen corresponding path program 1 times [2024-10-11 05:56:35,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:35,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823583736] [2024-10-11 05:56:35,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:35,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:36,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:36,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 05:56:36,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:36,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 05:56:36,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:36,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 05:56:36,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:36,373 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:36,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:36,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823583736] [2024-10-11 05:56:36,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823583736] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:36,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:36,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:56:36,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819680565] [2024-10-11 05:56:36,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:36,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:56:36,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:36,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:56:36,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:56:36,377 INFO L87 Difference]: Start difference. First operand 556 states and 805 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 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-10-11 05:56:36,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:36,497 INFO L93 Difference]: Finished difference Result 1011 states and 1459 transitions. [2024-10-11 05:56:36,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:36,498 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 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 170 [2024-10-11 05:56:36,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:36,500 INFO L225 Difference]: With dead ends: 1011 [2024-10-11 05:56:36,500 INFO L226 Difference]: Without dead ends: 556 [2024-10-11 05:56:36,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:36,503 INFO L432 NwaCegarLoop]: 758 mSDtfsCounter, 682 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 1518 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:36,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [682 Valid, 1518 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:56:36,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2024-10-11 05:56:36,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2024-10-11 05:56:36,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 551 states have (on average 1.4482758620689655) internal successors, (798), 551 states have internal predecessors, (798), 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-10-11 05:56:36,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 804 transitions. [2024-10-11 05:56:36,518 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 804 transitions. Word has length 170 [2024-10-11 05:56:36,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:36,520 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 804 transitions. [2024-10-11 05:56:36,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 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-10-11 05:56:36,520 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 804 transitions. [2024-10-11 05:56:36,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 05:56:36,522 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:36,522 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:36,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 05:56:36,523 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:36,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:36,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1772869966, now seen corresponding path program 1 times [2024-10-11 05:56:36,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:36,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427570331] [2024-10-11 05:56:36,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:36,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:36,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:37,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 05:56:37,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:37,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 05:56:37,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:37,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 05:56:37,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:37,090 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:37,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:37,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427570331] [2024-10-11 05:56:37,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427570331] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:37,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:37,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:56:37,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498722442] [2024-10-11 05:56:37,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:37,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:56:37,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:37,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:56:37,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:37,093 INFO L87 Difference]: Start difference. First operand 556 states and 804 transitions. Second operand has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 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-10-11 05:56:37,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:37,226 INFO L93 Difference]: Finished difference Result 1011 states and 1457 transitions. [2024-10-11 05:56:37,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:37,227 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 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 171 [2024-10-11 05:56:37,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:37,229 INFO L225 Difference]: With dead ends: 1011 [2024-10-11 05:56:37,230 INFO L226 Difference]: Without dead ends: 556 [2024-10-11 05:56:37,231 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-10-11 05:56:37,231 INFO L432 NwaCegarLoop]: 758 mSDtfsCounter, 680 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 1524 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:37,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 1524 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:56:37,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2024-10-11 05:56:37,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2024-10-11 05:56:37,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 551 states have (on average 1.4464609800362977) internal successors, (797), 551 states have internal predecessors, (797), 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-10-11 05:56:37,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 803 transitions. [2024-10-11 05:56:37,248 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 803 transitions. Word has length 171 [2024-10-11 05:56:37,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:37,248 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 803 transitions. [2024-10-11 05:56:37,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 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-10-11 05:56:37,249 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 803 transitions. [2024-10-11 05:56:37,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-11 05:56:37,250 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:37,251 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:37,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 05:56:37,251 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:37,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:37,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1245572259, now seen corresponding path program 1 times [2024-10-11 05:56:37,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:37,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704299571] [2024-10-11 05:56:37,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:37,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:37,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:37,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 05:56:37,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:37,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 05:56:37,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:37,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 05:56:37,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:37,787 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:37,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:37,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704299571] [2024-10-11 05:56:37,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704299571] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:37,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:37,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:56:37,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194647079] [2024-10-11 05:56:37,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:37,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:56:37,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:37,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:56:37,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:37,792 INFO L87 Difference]: Start difference. First operand 556 states and 803 transitions. Second operand has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 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-10-11 05:56:37,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:37,916 INFO L93 Difference]: Finished difference Result 1011 states and 1455 transitions. [2024-10-11 05:56:37,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:37,920 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 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 172 [2024-10-11 05:56:37,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:37,923 INFO L225 Difference]: With dead ends: 1011 [2024-10-11 05:56:37,924 INFO L226 Difference]: Without dead ends: 556 [2024-10-11 05:56:37,925 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-10-11 05:56:37,925 INFO L432 NwaCegarLoop]: 758 mSDtfsCounter, 1350 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1350 SdHoareTripleChecker+Valid, 1518 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:37,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1350 Valid, 1518 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:56:37,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2024-10-11 05:56:37,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2024-10-11 05:56:37,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 551 states have (on average 1.4446460980036298) internal successors, (796), 551 states have internal predecessors, (796), 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-10-11 05:56:37,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 802 transitions. [2024-10-11 05:56:37,947 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 802 transitions. Word has length 172 [2024-10-11 05:56:37,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:37,947 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 802 transitions. [2024-10-11 05:56:37,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 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-10-11 05:56:37,948 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 802 transitions. [2024-10-11 05:56:37,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-11 05:56:37,952 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:37,952 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:37,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 05:56:37,952 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:37,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:37,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1455036687, now seen corresponding path program 1 times [2024-10-11 05:56:37,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:37,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25183590] [2024-10-11 05:56:37,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:37,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:38,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:38,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 05:56:38,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:38,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 05:56:38,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:38,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 05:56:38,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:38,464 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:38,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:38,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25183590] [2024-10-11 05:56:38,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25183590] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:38,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:38,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:56:38,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43353408] [2024-10-11 05:56:38,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:38,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:56:38,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:38,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:56:38,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:56:38,467 INFO L87 Difference]: Start difference. First operand 556 states and 802 transitions. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 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-10-11 05:56:38,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:38,645 INFO L93 Difference]: Finished difference Result 1011 states and 1453 transitions. [2024-10-11 05:56:38,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:38,645 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 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 173 [2024-10-11 05:56:38,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:38,648 INFO L225 Difference]: With dead ends: 1011 [2024-10-11 05:56:38,648 INFO L226 Difference]: Without dead ends: 556 [2024-10-11 05:56:38,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:38,650 INFO L432 NwaCegarLoop]: 719 mSDtfsCounter, 664 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:38,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [664 Valid, 1440 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:56:38,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2024-10-11 05:56:38,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2024-10-11 05:56:38,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 551 states have (on average 1.442831215970962) internal successors, (795), 551 states have internal predecessors, (795), 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-10-11 05:56:38,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 801 transitions. [2024-10-11 05:56:38,669 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 801 transitions. Word has length 173 [2024-10-11 05:56:38,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:38,669 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 801 transitions. [2024-10-11 05:56:38,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 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-10-11 05:56:38,669 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 801 transitions. [2024-10-11 05:56:38,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-10-11 05:56:38,672 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:38,672 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:38,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 05:56:38,672 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:38,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:38,673 INFO L85 PathProgramCache]: Analyzing trace with hash 116803075, now seen corresponding path program 1 times [2024-10-11 05:56:38,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:38,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507018365] [2024-10-11 05:56:38,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:38,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:38,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:39,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 05:56:39,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:39,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 05:56:39,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:39,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 05:56:39,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:39,354 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:39,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:39,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507018365] [2024-10-11 05:56:39,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507018365] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:39,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:39,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:56:39,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969810056] [2024-10-11 05:56:39,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:39,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:56:39,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:39,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:56:39,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:39,357 INFO L87 Difference]: Start difference. First operand 556 states and 801 transitions. Second operand has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 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-10-11 05:56:39,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:39,545 INFO L93 Difference]: Finished difference Result 1011 states and 1451 transitions. [2024-10-11 05:56:39,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:39,546 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 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 174 [2024-10-11 05:56:39,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:39,548 INFO L225 Difference]: With dead ends: 1011 [2024-10-11 05:56:39,549 INFO L226 Difference]: Without dead ends: 556 [2024-10-11 05:56:39,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:56:39,550 INFO L432 NwaCegarLoop]: 719 mSDtfsCounter, 662 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 662 SdHoareTripleChecker+Valid, 1446 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:39,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [662 Valid, 1446 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:56:39,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2024-10-11 05:56:39,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2024-10-11 05:56:39,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 551 states have (on average 1.441016333938294) internal successors, (794), 551 states have internal predecessors, (794), 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-10-11 05:56:39,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 800 transitions. [2024-10-11 05:56:39,565 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 800 transitions. Word has length 174 [2024-10-11 05:56:39,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:39,565 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 800 transitions. [2024-10-11 05:56:39,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 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-10-11 05:56:39,566 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 800 transitions. [2024-10-11 05:56:39,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-11 05:56:39,567 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:39,567 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:39,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-11 05:56:39,568 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:39,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:39,568 INFO L85 PathProgramCache]: Analyzing trace with hash -2081744846, now seen corresponding path program 1 times [2024-10-11 05:56:39,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:39,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348843135] [2024-10-11 05:56:39,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:39,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:39,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:40,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 05:56:40,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:40,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 05:56:40,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:40,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 05:56:40,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:40,119 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:40,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:40,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348843135] [2024-10-11 05:56:40,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348843135] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:40,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:40,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:56:40,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760988302] [2024-10-11 05:56:40,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:40,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:56:40,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:40,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:56:40,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:40,123 INFO L87 Difference]: Start difference. First operand 556 states and 800 transitions. Second operand has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 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-10-11 05:56:40,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:40,310 INFO L93 Difference]: Finished difference Result 1011 states and 1449 transitions. [2024-10-11 05:56:40,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:40,310 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 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 175 [2024-10-11 05:56:40,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:40,313 INFO L225 Difference]: With dead ends: 1011 [2024-10-11 05:56:40,313 INFO L226 Difference]: Without dead ends: 556 [2024-10-11 05:56:40,314 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-10-11 05:56:40,315 INFO L432 NwaCegarLoop]: 719 mSDtfsCounter, 1314 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1314 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:40,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1314 Valid, 1440 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:56:40,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2024-10-11 05:56:40,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2024-10-11 05:56:40,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 551 states have (on average 1.4392014519056262) internal successors, (793), 551 states have internal predecessors, (793), 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-10-11 05:56:40,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 799 transitions. [2024-10-11 05:56:40,331 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 799 transitions. Word has length 175 [2024-10-11 05:56:40,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:40,331 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 799 transitions. [2024-10-11 05:56:40,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 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-10-11 05:56:40,332 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 799 transitions. [2024-10-11 05:56:40,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-10-11 05:56:40,333 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:40,334 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:40,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-11 05:56:40,334 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:40,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:40,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1575189374, now seen corresponding path program 1 times [2024-10-11 05:56:40,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:40,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105000837] [2024-10-11 05:56:40,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:40,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:40,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:40,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 05:56:40,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:40,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 05:56:40,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:40,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 05:56:40,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:40,908 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:40,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:40,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105000837] [2024-10-11 05:56:40,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105000837] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:40,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:40,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:56:40,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254730217] [2024-10-11 05:56:40,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:40,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:56:40,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:40,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:56:40,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:40,910 INFO L87 Difference]: Start difference. First operand 556 states and 799 transitions. Second operand has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 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-10-11 05:56:41,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:41,100 INFO L93 Difference]: Finished difference Result 1011 states and 1447 transitions. [2024-10-11 05:56:41,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:41,102 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 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 176 [2024-10-11 05:56:41,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:41,105 INFO L225 Difference]: With dead ends: 1011 [2024-10-11 05:56:41,105 INFO L226 Difference]: Without dead ends: 556 [2024-10-11 05:56:41,107 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-10-11 05:56:41,109 INFO L432 NwaCegarLoop]: 719 mSDtfsCounter, 1308 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1308 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:41,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1308 Valid, 1440 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 05:56:41,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2024-10-11 05:56:41,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2024-10-11 05:56:41,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 551 states have (on average 1.4373865698729582) internal successors, (792), 551 states have internal predecessors, (792), 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-10-11 05:56:41,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 798 transitions. [2024-10-11 05:56:41,129 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 798 transitions. Word has length 176 [2024-10-11 05:56:41,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:41,130 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 798 transitions. [2024-10-11 05:56:41,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 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-10-11 05:56:41,130 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 798 transitions. [2024-10-11 05:56:41,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-10-11 05:56:41,133 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:41,133 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:41,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-11 05:56:41,133 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:41,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:41,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1939178995, now seen corresponding path program 1 times [2024-10-11 05:56:41,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:41,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197299785] [2024-10-11 05:56:41,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:41,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:41,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:41,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 05:56:41,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:41,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 05:56:41,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:41,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 05:56:41,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:41,685 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:41,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:41,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197299785] [2024-10-11 05:56:41,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197299785] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:41,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:41,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:56:41,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437021571] [2024-10-11 05:56:41,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:41,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:56:41,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:41,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:56:41,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:56:41,687 INFO L87 Difference]: Start difference. First operand 556 states and 798 transitions. Second operand has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 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-10-11 05:56:41,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:41,833 INFO L93 Difference]: Finished difference Result 1011 states and 1445 transitions. [2024-10-11 05:56:41,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:41,834 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 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 177 [2024-10-11 05:56:41,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:41,836 INFO L225 Difference]: With dead ends: 1011 [2024-10-11 05:56:41,836 INFO L226 Difference]: Without dead ends: 556 [2024-10-11 05:56:41,837 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-10-11 05:56:41,838 INFO L432 NwaCegarLoop]: 719 mSDtfsCounter, 644 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:41,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [644 Valid, 1440 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:56:41,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2024-10-11 05:56:41,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2024-10-11 05:56:41,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 551 states have (on average 1.4355716878402904) internal successors, (791), 551 states have internal predecessors, (791), 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-10-11 05:56:41,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 797 transitions. [2024-10-11 05:56:41,852 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 797 transitions. Word has length 177 [2024-10-11 05:56:41,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:41,852 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 797 transitions. [2024-10-11 05:56:41,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 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-10-11 05:56:41,852 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 797 transitions. [2024-10-11 05:56:41,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-10-11 05:56:41,854 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:41,854 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:41,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-11 05:56:41,855 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:41,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:41,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1042592127, now seen corresponding path program 1 times [2024-10-11 05:56:41,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:41,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495423742] [2024-10-11 05:56:41,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:41,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:42,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:42,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 05:56:42,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:42,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 05:56:42,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:42,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 05:56:42,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:42,448 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:42,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:42,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495423742] [2024-10-11 05:56:42,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495423742] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:42,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:42,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:56:42,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255922816] [2024-10-11 05:56:42,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:42,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:56:42,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:42,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:56:42,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:42,452 INFO L87 Difference]: Start difference. First operand 556 states and 797 transitions. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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-10-11 05:56:42,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:42,653 INFO L93 Difference]: Finished difference Result 1011 states and 1443 transitions. [2024-10-11 05:56:42,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:42,654 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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 178 [2024-10-11 05:56:42,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:42,657 INFO L225 Difference]: With dead ends: 1011 [2024-10-11 05:56:42,657 INFO L226 Difference]: Without dead ends: 556 [2024-10-11 05:56:42,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:56:42,658 INFO L432 NwaCegarLoop]: 719 mSDtfsCounter, 658 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 1446 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:42,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 1446 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 05:56:42,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2024-10-11 05:56:42,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2024-10-11 05:56:42,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 551 states have (on average 1.4337568058076224) internal successors, (790), 551 states have internal predecessors, (790), 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-10-11 05:56:42,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 796 transitions. [2024-10-11 05:56:42,681 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 796 transitions. Word has length 178 [2024-10-11 05:56:42,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:42,682 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 796 transitions. [2024-10-11 05:56:42,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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-10-11 05:56:42,682 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 796 transitions. [2024-10-11 05:56:42,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-11 05:56:42,684 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:42,685 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:42,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-11 05:56:42,685 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:42,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:42,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1865261108, now seen corresponding path program 1 times [2024-10-11 05:56:42,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:42,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457326579] [2024-10-11 05:56:42,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:42,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:42,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:43,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 05:56:43,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:43,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 05:56:43,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:43,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 05:56:43,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:43,281 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:43,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:43,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457326579] [2024-10-11 05:56:43,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457326579] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:43,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:43,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:56:43,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664460070] [2024-10-11 05:56:43,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:43,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:56:43,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:43,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:56:43,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:43,283 INFO L87 Difference]: Start difference. First operand 556 states and 796 transitions. Second operand has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 states have internal predecessors, (167), 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-10-11 05:56:43,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:43,452 INFO L93 Difference]: Finished difference Result 1011 states and 1441 transitions. [2024-10-11 05:56:43,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:43,452 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 states have internal predecessors, (167), 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 179 [2024-10-11 05:56:43,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:43,455 INFO L225 Difference]: With dead ends: 1011 [2024-10-11 05:56:43,455 INFO L226 Difference]: Without dead ends: 556 [2024-10-11 05:56:43,456 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-10-11 05:56:43,456 INFO L432 NwaCegarLoop]: 719 mSDtfsCounter, 657 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 1446 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:43,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [657 Valid, 1446 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:56:43,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2024-10-11 05:56:43,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2024-10-11 05:56:43,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 551 states have (on average 1.4319419237749547) internal successors, (789), 551 states have internal predecessors, (789), 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-10-11 05:56:43,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 795 transitions. [2024-10-11 05:56:43,472 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 795 transitions. Word has length 179 [2024-10-11 05:56:43,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:43,472 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 795 transitions. [2024-10-11 05:56:43,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 states have internal predecessors, (167), 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-10-11 05:56:43,473 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 795 transitions. [2024-10-11 05:56:43,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-10-11 05:56:43,474 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:43,474 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:43,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-11 05:56:43,475 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:43,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:43,475 INFO L85 PathProgramCache]: Analyzing trace with hash -278776832, now seen corresponding path program 1 times [2024-10-11 05:56:43,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:43,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038426729] [2024-10-11 05:56:43,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:43,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:43,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:44,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 05:56:44,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:44,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 05:56:44,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:44,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 05:56:44,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:44,374 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:44,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:44,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038426729] [2024-10-11 05:56:44,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038426729] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:44,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:44,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:56:44,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868548629] [2024-10-11 05:56:44,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:44,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:56:44,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:44,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:56:44,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:44,378 INFO L87 Difference]: Start difference. First operand 556 states and 795 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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-10-11 05:56:44,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:44,431 INFO L93 Difference]: Finished difference Result 1089 states and 1529 transitions. [2024-10-11 05:56:44,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 05:56:44,432 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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 180 [2024-10-11 05:56:44,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:44,434 INFO L225 Difference]: With dead ends: 1089 [2024-10-11 05:56:44,434 INFO L226 Difference]: Without dead ends: 634 [2024-10-11 05:56:44,435 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-10-11 05:56:44,436 INFO L432 NwaCegarLoop]: 780 mSDtfsCounter, 21 mSDsluCounter, 2334 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 3114 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:44,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 3114 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:56:44,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2024-10-11 05:56:44,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 632. [2024-10-11 05:56:44,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 627 states have (on average 1.3955342902711323) internal successors, (875), 627 states have internal predecessors, (875), 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-10-11 05:56:44,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 881 transitions. [2024-10-11 05:56:44,456 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 881 transitions. Word has length 180 [2024-10-11 05:56:44,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:44,456 INFO L471 AbstractCegarLoop]: Abstraction has 632 states and 881 transitions. [2024-10-11 05:56:44,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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-10-11 05:56:44,457 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 881 transitions. [2024-10-11 05:56:44,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-11 05:56:44,458 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:44,458 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:44,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-11 05:56:44,458 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:44,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:44,459 INFO L85 PathProgramCache]: Analyzing trace with hash 856740426, now seen corresponding path program 1 times [2024-10-11 05:56:44,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:44,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532845541] [2024-10-11 05:56:44,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:44,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:44,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:45,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 05:56:45,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:45,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 05:56:45,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:45,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 05:56:45,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:45,156 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:45,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:45,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532845541] [2024-10-11 05:56:45,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532845541] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:45,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:45,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:56:45,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259736628] [2024-10-11 05:56:45,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:45,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:56:45,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:45,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:56:45,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:56:45,159 INFO L87 Difference]: Start difference. First operand 632 states and 881 transitions. Second operand has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 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-10-11 05:56:45,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:45,797 INFO L93 Difference]: Finished difference Result 1167 states and 1617 transitions. [2024-10-11 05:56:45,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 05:56:45,802 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 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 181 [2024-10-11 05:56:45,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:45,805 INFO L225 Difference]: With dead ends: 1167 [2024-10-11 05:56:45,805 INFO L226 Difference]: Without dead ends: 636 [2024-10-11 05:56:45,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-11 05:56:45,806 INFO L432 NwaCegarLoop]: 583 mSDtfsCounter, 1493 mSDsluCounter, 1744 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1495 SdHoareTripleChecker+Valid, 2327 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:45,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1495 Valid, 2327 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 05:56:45,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2024-10-11 05:56:45,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 634. [2024-10-11 05:56:45,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 629 states have (on average 1.3926868044515104) internal successors, (876), 629 states have internal predecessors, (876), 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-10-11 05:56:45,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 882 transitions. [2024-10-11 05:56:45,827 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 882 transitions. Word has length 181 [2024-10-11 05:56:45,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:45,827 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 882 transitions. [2024-10-11 05:56:45,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 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-10-11 05:56:45,828 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 882 transitions. [2024-10-11 05:56:45,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-10-11 05:56:45,828 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:45,829 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:45,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-11 05:56:45,829 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:45,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:45,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1952129003, now seen corresponding path program 1 times [2024-10-11 05:56:45,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:45,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949684290] [2024-10-11 05:56:45,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:45,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:46,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:46,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 05:56:46,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:46,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 05:56:46,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:46,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 05:56:46,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:46,416 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:46,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:46,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949684290] [2024-10-11 05:56:46,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949684290] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:46,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:46,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:56:46,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292763108] [2024-10-11 05:56:46,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:46,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:56:46,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:46,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:56:46,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:56:46,418 INFO L87 Difference]: Start difference. First operand 634 states and 882 transitions. Second operand has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 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-10-11 05:56:47,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:47,072 INFO L93 Difference]: Finished difference Result 1171 states and 1619 transitions. [2024-10-11 05:56:47,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 05:56:47,072 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 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 182 [2024-10-11 05:56:47,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:47,075 INFO L225 Difference]: With dead ends: 1171 [2024-10-11 05:56:47,075 INFO L226 Difference]: Without dead ends: 638 [2024-10-11 05:56:47,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-11 05:56:47,078 INFO L432 NwaCegarLoop]: 582 mSDtfsCounter, 1475 mSDsluCounter, 1741 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1476 SdHoareTripleChecker+Valid, 2323 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:47,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1476 Valid, 2323 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 05:56:47,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2024-10-11 05:56:47,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 636. [2024-10-11 05:56:47,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 631 states have (on average 1.3898573692551506) internal successors, (877), 631 states have internal predecessors, (877), 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-10-11 05:56:47,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 883 transitions. [2024-10-11 05:56:47,096 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 883 transitions. Word has length 182 [2024-10-11 05:56:47,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:47,097 INFO L471 AbstractCegarLoop]: Abstraction has 636 states and 883 transitions. [2024-10-11 05:56:47,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 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-10-11 05:56:47,097 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 883 transitions. [2024-10-11 05:56:47,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-10-11 05:56:47,098 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:47,099 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:47,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-11 05:56:47,099 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:47,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:47,100 INFO L85 PathProgramCache]: Analyzing trace with hash -94203579, now seen corresponding path program 1 times [2024-10-11 05:56:47,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:47,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909334740] [2024-10-11 05:56:47,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:47,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:47,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:47,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 05:56:47,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:47,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 05:56:47,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:47,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 05:56:47,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:47,774 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:47,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:47,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909334740] [2024-10-11 05:56:47,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909334740] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:47,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:47,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:56:47,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063966051] [2024-10-11 05:56:47,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:47,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:56:47,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:47,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:56:47,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:56:47,776 INFO L87 Difference]: Start difference. First operand 636 states and 883 transitions. Second operand has 6 states, 6 states have (on average 28.5) internal successors, (171), 6 states have internal predecessors, (171), 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-10-11 05:56:48,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:48,372 INFO L93 Difference]: Finished difference Result 1173 states and 1618 transitions. [2024-10-11 05:56:48,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 05:56:48,373 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.5) internal successors, (171), 6 states have internal predecessors, (171), 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 183 [2024-10-11 05:56:48,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:48,376 INFO L225 Difference]: With dead ends: 1173 [2024-10-11 05:56:48,376 INFO L226 Difference]: Without dead ends: 638 [2024-10-11 05:56:48,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:56:48,380 INFO L432 NwaCegarLoop]: 582 mSDtfsCounter, 710 mSDsluCounter, 1741 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 2323 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:48,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 2323 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 05:56:48,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2024-10-11 05:56:48,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 637. [2024-10-11 05:56:48,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 632 states have (on average 1.389240506329114) internal successors, (878), 632 states have internal predecessors, (878), 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-10-11 05:56:48,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 884 transitions. [2024-10-11 05:56:48,399 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 884 transitions. Word has length 183 [2024-10-11 05:56:48,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:48,399 INFO L471 AbstractCegarLoop]: Abstraction has 637 states and 884 transitions. [2024-10-11 05:56:48,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.5) internal successors, (171), 6 states have internal predecessors, (171), 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-10-11 05:56:48,399 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 884 transitions. [2024-10-11 05:56:48,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-10-11 05:56:48,401 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:48,401 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:48,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-11 05:56:48,401 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:48,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:48,402 INFO L85 PathProgramCache]: Analyzing trace with hash 81812914, now seen corresponding path program 1 times [2024-10-11 05:56:48,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:48,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398129666] [2024-10-11 05:56:48,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:48,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:48,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:49,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 05:56:49,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:49,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 05:56:49,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:49,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 05:56:49,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:49,097 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:49,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:49,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398129666] [2024-10-11 05:56:49,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398129666] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:49,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:49,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:56:49,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653047691] [2024-10-11 05:56:49,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:49,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:56:49,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:49,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:56:49,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:56:49,101 INFO L87 Difference]: Start difference. First operand 637 states and 884 transitions. Second operand has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 6 states have internal predecessors, (172), 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-10-11 05:56:49,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:49,670 INFO L93 Difference]: Finished difference Result 1175 states and 1620 transitions. [2024-10-11 05:56:49,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 05:56:49,670 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 6 states have internal predecessors, (172), 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 184 [2024-10-11 05:56:49,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:49,673 INFO L225 Difference]: With dead ends: 1175 [2024-10-11 05:56:49,673 INFO L226 Difference]: Without dead ends: 639 [2024-10-11 05:56:49,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:56:49,674 INFO L432 NwaCegarLoop]: 582 mSDtfsCounter, 718 mSDsluCounter, 1741 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 2323 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:49,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 2323 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 05:56:49,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2024-10-11 05:56:49,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 638. [2024-10-11 05:56:49,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 633 states have (on average 1.3886255924170616) internal successors, (879), 633 states have internal predecessors, (879), 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-10-11 05:56:49,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 885 transitions. [2024-10-11 05:56:49,689 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 885 transitions. Word has length 184 [2024-10-11 05:56:49,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:49,690 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 885 transitions. [2024-10-11 05:56:49,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 6 states have internal predecessors, (172), 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-10-11 05:56:49,690 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 885 transitions. [2024-10-11 05:56:49,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-11 05:56:49,691 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:49,691 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:49,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-11 05:56:49,692 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:49,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:49,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1149060892, now seen corresponding path program 1 times [2024-10-11 05:56:49,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:49,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724468655] [2024-10-11 05:56:49,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:49,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:49,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:50,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 05:56:50,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:50,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 05:56:50,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:50,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 05:56:50,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:50,510 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:50,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:50,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724468655] [2024-10-11 05:56:50,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724468655] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:50,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:50,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:56:50,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635264182] [2024-10-11 05:56:50,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:50,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:56:50,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:50,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:56:50,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:50,514 INFO L87 Difference]: Start difference. First operand 638 states and 885 transitions. Second operand has 5 states, 5 states have (on average 34.6) internal successors, (173), 5 states have internal predecessors, (173), 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-10-11 05:56:50,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:50,919 INFO L93 Difference]: Finished difference Result 1179 states and 1625 transitions. [2024-10-11 05:56:50,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 05:56:50,920 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.6) internal successors, (173), 5 states have internal predecessors, (173), 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 185 [2024-10-11 05:56:50,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:50,923 INFO L225 Difference]: With dead ends: 1179 [2024-10-11 05:56:50,923 INFO L226 Difference]: Without dead ends: 642 [2024-10-11 05:56:50,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:50,924 INFO L432 NwaCegarLoop]: 594 mSDtfsCounter, 682 mSDsluCounter, 1176 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 1770 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:50,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [682 Valid, 1770 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 05:56:50,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2024-10-11 05:56:50,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 640. [2024-10-11 05:56:50,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 635 states have (on average 1.3874015748031496) internal successors, (881), 635 states have internal predecessors, (881), 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-10-11 05:56:50,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 887 transitions. [2024-10-11 05:56:50,938 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 887 transitions. Word has length 185 [2024-10-11 05:56:50,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:50,938 INFO L471 AbstractCegarLoop]: Abstraction has 640 states and 887 transitions. [2024-10-11 05:56:50,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.6) internal successors, (173), 5 states have internal predecessors, (173), 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-10-11 05:56:50,938 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 887 transitions. [2024-10-11 05:56:50,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-11 05:56:50,939 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:50,939 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:50,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-10-11 05:56:50,940 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:50,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:50,940 INFO L85 PathProgramCache]: Analyzing trace with hash 299442045, now seen corresponding path program 1 times [2024-10-11 05:56:50,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:50,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051850090] [2024-10-11 05:56:50,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:50,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:51,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:51,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 05:56:51,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:51,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 05:56:51,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:51,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 05:56:51,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:51,689 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:51,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:51,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051850090] [2024-10-11 05:56:51,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051850090] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:51,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:51,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:56:51,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784627975] [2024-10-11 05:56:51,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:51,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:56:51,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:51,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:56:51,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:56:51,698 INFO L87 Difference]: Start difference. First operand 640 states and 887 transitions. Second operand has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 6 states have internal predecessors, (173), 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-10-11 05:56:52,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:52,260 INFO L93 Difference]: Finished difference Result 1309 states and 1765 transitions. [2024-10-11 05:56:52,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:56:52,261 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 6 states have internal predecessors, (173), 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 185 [2024-10-11 05:56:52,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:52,264 INFO L225 Difference]: With dead ends: 1309 [2024-10-11 05:56:52,265 INFO L226 Difference]: Without dead ends: 770 [2024-10-11 05:56:52,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 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-10-11 05:56:52,267 INFO L432 NwaCegarLoop]: 638 mSDtfsCounter, 804 mSDsluCounter, 1820 mSDsCounter, 0 mSdLazyCounter, 865 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 2458 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 865 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:52,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [804 Valid, 2458 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 865 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 05:56:52,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2024-10-11 05:56:52,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 640. [2024-10-11 05:56:52,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 635 states have (on average 1.384251968503937) internal successors, (879), 635 states have internal predecessors, (879), 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-10-11 05:56:52,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 885 transitions. [2024-10-11 05:56:52,284 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 885 transitions. Word has length 185 [2024-10-11 05:56:52,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:52,284 INFO L471 AbstractCegarLoop]: Abstraction has 640 states and 885 transitions. [2024-10-11 05:56:52,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 6 states have internal predecessors, (173), 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-10-11 05:56:52,284 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 885 transitions. [2024-10-11 05:56:52,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-10-11 05:56:52,285 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:52,286 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:52,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-10-11 05:56:52,286 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:52,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:52,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1906798752, now seen corresponding path program 1 times [2024-10-11 05:56:52,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:52,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508552999] [2024-10-11 05:56:52,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:52,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:52,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:52,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 05:56:52,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:52,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 05:56:52,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:52,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 05:56:52,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:52,938 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:52,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:52,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508552999] [2024-10-11 05:56:52,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508552999] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:52,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:52,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:56:52,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600912514] [2024-10-11 05:56:52,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:52,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:56:52,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:52,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:56:52,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:56:52,940 INFO L87 Difference]: Start difference. First operand 640 states and 885 transitions. Second operand has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 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-10-11 05:56:53,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:53,536 INFO L93 Difference]: Finished difference Result 1181 states and 1622 transitions. [2024-10-11 05:56:53,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 05:56:53,536 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 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 186 [2024-10-11 05:56:53,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:53,539 INFO L225 Difference]: With dead ends: 1181 [2024-10-11 05:56:53,539 INFO L226 Difference]: Without dead ends: 642 [2024-10-11 05:56:53,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:56:53,540 INFO L432 NwaCegarLoop]: 582 mSDtfsCounter, 729 mSDsluCounter, 1741 mSDsCounter, 0 mSdLazyCounter, 815 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 732 SdHoareTripleChecker+Valid, 2323 SdHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:53,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [732 Valid, 2323 Invalid, 815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 815 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 05:56:53,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2024-10-11 05:56:53,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 641. [2024-10-11 05:56:53,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 636 states have (on average 1.3836477987421383) internal successors, (880), 636 states have internal predecessors, (880), 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-10-11 05:56:53,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 886 transitions. [2024-10-11 05:56:53,554 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 886 transitions. Word has length 186 [2024-10-11 05:56:53,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:53,554 INFO L471 AbstractCegarLoop]: Abstraction has 641 states and 886 transitions. [2024-10-11 05:56:53,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 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-10-11 05:56:53,554 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 886 transitions. [2024-10-11 05:56:53,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-11 05:56:53,555 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:53,555 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:53,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-10-11 05:56:53,556 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:53,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:53,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1415872086, now seen corresponding path program 1 times [2024-10-11 05:56:53,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:53,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941115051] [2024-10-11 05:56:53,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:53,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:53,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:54,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 05:56:54,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:54,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 05:56:54,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:54,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 05:56:54,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:54,718 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:54,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:54,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941115051] [2024-10-11 05:56:54,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941115051] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:54,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:54,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 05:56:54,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094339035] [2024-10-11 05:56:54,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:54,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 05:56:54,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:54,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 05:56:54,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:56:54,720 INFO L87 Difference]: Start difference. First operand 641 states and 886 transitions. Second operand has 9 states, 9 states have (on average 19.444444444444443) internal successors, (175), 9 states have internal predecessors, (175), 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-10-11 05:56:56,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:56,192 INFO L93 Difference]: Finished difference Result 1636 states and 2238 transitions. [2024-10-11 05:56:56,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 05:56:56,193 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 19.444444444444443) internal successors, (175), 9 states have internal predecessors, (175), 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 187 [2024-10-11 05:56:56,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:56,197 INFO L225 Difference]: With dead ends: 1636 [2024-10-11 05:56:56,198 INFO L226 Difference]: Without dead ends: 1096 [2024-10-11 05:56:56,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-10-11 05:56:56,203 INFO L432 NwaCegarLoop]: 925 mSDtfsCounter, 2042 mSDsluCounter, 4240 mSDsCounter, 0 mSdLazyCounter, 1944 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2043 SdHoareTripleChecker+Valid, 5165 SdHoareTripleChecker+Invalid, 1949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:56,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2043 Valid, 5165 Invalid, 1949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1944 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 05:56:56,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1096 states. [2024-10-11 05:56:56,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1096 to 667. [2024-10-11 05:56:56,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 661 states have (on average 1.3827534039334342) internal successors, (914), 661 states have internal predecessors, (914), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 05:56:56,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 922 transitions. [2024-10-11 05:56:56,227 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 922 transitions. Word has length 187 [2024-10-11 05:56:56,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:56,227 INFO L471 AbstractCegarLoop]: Abstraction has 667 states and 922 transitions. [2024-10-11 05:56:56,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.444444444444443) internal successors, (175), 9 states have internal predecessors, (175), 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-10-11 05:56:56,228 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 922 transitions. [2024-10-11 05:56:56,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-11 05:56:56,233 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:56,233 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:56,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-10-11 05:56:56,234 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:56,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:56,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1070943050, now seen corresponding path program 1 times [2024-10-11 05:56:56,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:56,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842249494] [2024-10-11 05:56:56,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:56,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:56,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:57,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 05:56:57,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:57,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 05:56:57,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:57,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 05:56:57,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:57,356 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:57,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:57,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842249494] [2024-10-11 05:56:57,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842249494] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:57,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:57,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:56:57,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453326176] [2024-10-11 05:56:57,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:57,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:56:57,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:57,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:56:57,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:56:57,359 INFO L87 Difference]: Start difference. First operand 667 states and 922 transitions. Second operand has 6 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 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-10-11 05:56:57,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:57,491 INFO L93 Difference]: Finished difference Result 1500 states and 2023 transitions. [2024-10-11 05:56:57,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 05:56:57,491 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 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 187 [2024-10-11 05:56:57,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:57,499 INFO L225 Difference]: With dead ends: 1500 [2024-10-11 05:56:57,499 INFO L226 Difference]: Without dead ends: 934 [2024-10-11 05:56:57,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 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-10-11 05:56:57,501 INFO L432 NwaCegarLoop]: 771 mSDtfsCounter, 1118 mSDsluCounter, 2309 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1121 SdHoareTripleChecker+Valid, 3080 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:57,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1121 Valid, 3080 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:56:57,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2024-10-11 05:56:57,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 934. [2024-10-11 05:56:57,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 924 states have (on average 1.3365800865800865) internal successors, (1235), 924 states have internal predecessors, (1235), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 05:56:57,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1251 transitions. [2024-10-11 05:56:57,527 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1251 transitions. Word has length 187 [2024-10-11 05:56:57,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:57,528 INFO L471 AbstractCegarLoop]: Abstraction has 934 states and 1251 transitions. [2024-10-11 05:56:57,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 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-10-11 05:56:57,528 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1251 transitions. [2024-10-11 05:56:57,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2024-10-11 05:56:57,531 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:57,531 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:57,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-10-11 05:56:57,531 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:57,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:57,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1656599849, now seen corresponding path program 1 times [2024-10-11 05:56:57,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:57,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720563098] [2024-10-11 05:56:57,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:57,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:57,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:58,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 05:56:58,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:58,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 05:56:58,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:58,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 05:56:58,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:58,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 334 [2024-10-11 05:56:58,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:58,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2024-10-11 05:56:58,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:58,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 366 [2024-10-11 05:56:58,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:58,422 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 05:56:58,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:58,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720563098] [2024-10-11 05:56:58,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720563098] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:58,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:58,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:56:58,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346464699] [2024-10-11 05:56:58,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:58,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:56:58,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:58,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:56:58,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:58,425 INFO L87 Difference]: Start difference. First operand 934 states and 1251 transitions. Second operand has 5 states, 5 states have (on average 86.8) internal successors, (434), 5 states have internal predecessors, (434), 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-10-11 05:56:58,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:58,579 INFO L93 Difference]: Finished difference Result 1500 states and 2022 transitions. [2024-10-11 05:56:58,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:58,581 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 86.8) internal successors, (434), 5 states have internal predecessors, (434), 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 461 [2024-10-11 05:56:58,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:58,588 INFO L225 Difference]: With dead ends: 1500 [2024-10-11 05:56:58,588 INFO L226 Difference]: Without dead ends: 934 [2024-10-11 05:56:58,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:56:58,594 INFO L432 NwaCegarLoop]: 716 mSDtfsCounter, 720 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:58,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [723 Valid, 1440 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:56:58,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2024-10-11 05:56:58,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 934. [2024-10-11 05:56:58,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 924 states have (on average 1.3354978354978355) internal successors, (1234), 924 states have internal predecessors, (1234), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 05:56:58,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1250 transitions. [2024-10-11 05:56:58,621 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1250 transitions. Word has length 461 [2024-10-11 05:56:58,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:58,623 INFO L471 AbstractCegarLoop]: Abstraction has 934 states and 1250 transitions. [2024-10-11 05:56:58,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.8) internal successors, (434), 5 states have internal predecessors, (434), 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-10-11 05:56:58,623 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1250 transitions. [2024-10-11 05:56:58,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2024-10-11 05:56:58,627 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:58,628 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:58,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-10-11 05:56:58,628 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:58,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:58,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1390272967, now seen corresponding path program 1 times [2024-10-11 05:56:58,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:58,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139183256] [2024-10-11 05:56:58,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:58,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:58,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:59,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 05:56:59,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:59,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 05:56:59,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:59,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 05:56:59,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:59,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 335 [2024-10-11 05:56:59,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:59,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 353 [2024-10-11 05:56:59,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:59,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 367 [2024-10-11 05:56:59,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:59,600 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 05:56:59,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:59,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139183256] [2024-10-11 05:56:59,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139183256] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:59,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:59,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:56:59,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645698921] [2024-10-11 05:56:59,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:59,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:56:59,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:59,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:56:59,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:59,603 INFO L87 Difference]: Start difference. First operand 934 states and 1250 transitions. Second operand has 5 states, 5 states have (on average 87.0) internal successors, (435), 5 states have internal predecessors, (435), 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-10-11 05:56:59,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:59,750 INFO L93 Difference]: Finished difference Result 1500 states and 2020 transitions. [2024-10-11 05:56:59,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:59,751 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 87.0) internal successors, (435), 5 states have internal predecessors, (435), 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 462 [2024-10-11 05:56:59,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:59,758 INFO L225 Difference]: With dead ends: 1500 [2024-10-11 05:56:59,759 INFO L226 Difference]: Without dead ends: 934 [2024-10-11 05:56:59,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:56:59,761 INFO L432 NwaCegarLoop]: 716 mSDtfsCounter, 712 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:59,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [715 Valid, 1440 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:56:59,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2024-10-11 05:56:59,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 934. [2024-10-11 05:56:59,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 924 states have (on average 1.3344155844155845) internal successors, (1233), 924 states have internal predecessors, (1233), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 05:56:59,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1249 transitions. [2024-10-11 05:56:59,787 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1249 transitions. Word has length 462 [2024-10-11 05:56:59,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:59,788 INFO L471 AbstractCegarLoop]: Abstraction has 934 states and 1249 transitions. [2024-10-11 05:56:59,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.0) internal successors, (435), 5 states have internal predecessors, (435), 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-10-11 05:56:59,788 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1249 transitions. [2024-10-11 05:56:59,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2024-10-11 05:56:59,792 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:59,792 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:59,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-10-11 05:56:59,793 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:59,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:59,794 INFO L85 PathProgramCache]: Analyzing trace with hash -374343788, now seen corresponding path program 1 times [2024-10-11 05:56:59,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:59,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988136639] [2024-10-11 05:56:59,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:59,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:57:00,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:00,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 05:57:00,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:00,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 05:57:00,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:00,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 05:57:00,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:00,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 336 [2024-10-11 05:57:00,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:00,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 354 [2024-10-11 05:57:00,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:00,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 368 [2024-10-11 05:57:00,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:00,680 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 05:57:00,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:57:00,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988136639] [2024-10-11 05:57:00,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988136639] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:57:00,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:57:00,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:57:00,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162189065] [2024-10-11 05:57:00,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:57:00,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:57:00,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:57:00,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:57:00,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:57:00,683 INFO L87 Difference]: Start difference. First operand 934 states and 1249 transitions. Second operand has 5 states, 5 states have (on average 87.2) internal successors, (436), 5 states have internal predecessors, (436), 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-10-11 05:57:00,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:57:00,833 INFO L93 Difference]: Finished difference Result 1500 states and 2018 transitions. [2024-10-11 05:57:00,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:57:00,834 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 87.2) internal successors, (436), 5 states have internal predecessors, (436), 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 463 [2024-10-11 05:57:00,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:57:00,836 INFO L225 Difference]: With dead ends: 1500 [2024-10-11 05:57:00,836 INFO L226 Difference]: Without dead ends: 934 [2024-10-11 05:57:00,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:57:00,839 INFO L432 NwaCegarLoop]: 716 mSDtfsCounter, 1279 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1282 SdHoareTripleChecker+Valid, 1434 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:57:00,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1282 Valid, 1434 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:57:00,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2024-10-11 05:57:00,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 934. [2024-10-11 05:57:00,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 924 states have (on average 1.3333333333333333) internal successors, (1232), 924 states have internal predecessors, (1232), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 05:57:00,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1248 transitions. [2024-10-11 05:57:00,864 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1248 transitions. Word has length 463 [2024-10-11 05:57:00,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:57:00,865 INFO L471 AbstractCegarLoop]: Abstraction has 934 states and 1248 transitions. [2024-10-11 05:57:00,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.2) internal successors, (436), 5 states have internal predecessors, (436), 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-10-11 05:57:00,865 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1248 transitions. [2024-10-11 05:57:00,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2024-10-11 05:57:00,868 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:57:00,868 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:57:00,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-10-11 05:57:00,869 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:57:00,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:57:00,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1345611346, now seen corresponding path program 1 times [2024-10-11 05:57:00,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:57:00,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340563325] [2024-10-11 05:57:00,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:57:00,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:57:01,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:01,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 05:57:01,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:01,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 05:57:01,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:01,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 05:57:01,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:01,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 337 [2024-10-11 05:57:01,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:01,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 355 [2024-10-11 05:57:01,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:01,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 369 [2024-10-11 05:57:01,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:01,858 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 05:57:01,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:57:01,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340563325] [2024-10-11 05:57:01,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340563325] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:57:01,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:57:01,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:57:01,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009283702] [2024-10-11 05:57:01,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:57:01,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:57:01,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:57:01,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:57:01,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:57:01,861 INFO L87 Difference]: Start difference. First operand 934 states and 1248 transitions. Second operand has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 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-10-11 05:57:01,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:57:01,992 INFO L93 Difference]: Finished difference Result 1500 states and 2016 transitions. [2024-10-11 05:57:01,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:57:01,993 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 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 464 [2024-10-11 05:57:01,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:57:01,996 INFO L225 Difference]: With dead ends: 1500 [2024-10-11 05:57:01,996 INFO L226 Difference]: Without dead ends: 934 [2024-10-11 05:57:01,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:57:01,998 INFO L432 NwaCegarLoop]: 716 mSDtfsCounter, 1263 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1266 SdHoareTripleChecker+Valid, 1434 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:57:01,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1266 Valid, 1434 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:57:01,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2024-10-11 05:57:02,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 934. [2024-10-11 05:57:02,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 924 states have (on average 1.3322510822510822) internal successors, (1231), 924 states have internal predecessors, (1231), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 05:57:02,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1247 transitions. [2024-10-11 05:57:02,021 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1247 transitions. Word has length 464 [2024-10-11 05:57:02,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:57:02,022 INFO L471 AbstractCegarLoop]: Abstraction has 934 states and 1247 transitions. [2024-10-11 05:57:02,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 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-10-11 05:57:02,022 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1247 transitions. [2024-10-11 05:57:02,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2024-10-11 05:57:02,026 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:57:02,026 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:57:02,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-10-11 05:57:02,027 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:57:02,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:57:02,027 INFO L85 PathProgramCache]: Analyzing trace with hash -15538561, now seen corresponding path program 1 times [2024-10-11 05:57:02,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:57:02,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602242229] [2024-10-11 05:57:02,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:57:02,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:57:02,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:02,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 05:57:02,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:02,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 05:57:02,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:02,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 05:57:02,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:02,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2024-10-11 05:57:02,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:02,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 356 [2024-10-11 05:57:02,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:02,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 370 [2024-10-11 05:57:02,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:02,806 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 05:57:02,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:57:02,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602242229] [2024-10-11 05:57:02,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602242229] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:57:02,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:57:02,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:57:02,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916808421] [2024-10-11 05:57:02,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:57:02,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:57:02,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:57:02,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:57:02,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:57:02,808 INFO L87 Difference]: Start difference. First operand 934 states and 1247 transitions. Second operand has 5 states, 5 states have (on average 87.6) internal successors, (438), 5 states have internal predecessors, (438), 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-10-11 05:57:02,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:57:02,966 INFO L93 Difference]: Finished difference Result 1500 states and 2014 transitions. [2024-10-11 05:57:02,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:57:02,967 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 87.6) internal successors, (438), 5 states have internal predecessors, (438), 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 465 [2024-10-11 05:57:02,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:57:02,970 INFO L225 Difference]: With dead ends: 1500 [2024-10-11 05:57:02,970 INFO L226 Difference]: Without dead ends: 934 [2024-10-11 05:57:02,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:57:02,971 INFO L432 NwaCegarLoop]: 716 mSDtfsCounter, 688 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:57:02,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [691 Valid, 1440 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:57:02,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2024-10-11 05:57:02,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 934. [2024-10-11 05:57:02,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 924 states have (on average 1.3311688311688312) internal successors, (1230), 924 states have internal predecessors, (1230), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 05:57:02,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1246 transitions. [2024-10-11 05:57:02,993 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1246 transitions. Word has length 465 [2024-10-11 05:57:02,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:57:02,993 INFO L471 AbstractCegarLoop]: Abstraction has 934 states and 1246 transitions. [2024-10-11 05:57:02,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.6) internal successors, (438), 5 states have internal predecessors, (438), 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-10-11 05:57:02,994 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1246 transitions. [2024-10-11 05:57:02,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2024-10-11 05:57:02,997 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:57:02,997 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:57:02,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-10-11 05:57:02,997 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:57:02,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:57:02,998 INFO L85 PathProgramCache]: Analyzing trace with hash 530120541, now seen corresponding path program 1 times [2024-10-11 05:57:02,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:57:02,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581896899] [2024-10-11 05:57:02,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:57:02,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:57:03,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:03,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 05:57:03,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:03,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 05:57:03,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:03,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 05:57:03,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:03,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 339 [2024-10-11 05:57:03,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:03,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 357 [2024-10-11 05:57:03,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:03,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 371 [2024-10-11 05:57:03,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:03,741 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 05:57:03,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:57:03,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581896899] [2024-10-11 05:57:03,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581896899] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:57:03,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:57:03,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:57:03,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941547040] [2024-10-11 05:57:03,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:57:03,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:57:03,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:57:03,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:57:03,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:57:03,744 INFO L87 Difference]: Start difference. First operand 934 states and 1246 transitions. Second operand has 5 states, 5 states have (on average 87.8) internal successors, (439), 5 states have internal predecessors, (439), 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-10-11 05:57:03,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:57:03,859 INFO L93 Difference]: Finished difference Result 1500 states and 2012 transitions. [2024-10-11 05:57:03,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:57:03,860 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 87.8) internal successors, (439), 5 states have internal predecessors, (439), 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 466 [2024-10-11 05:57:03,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:57:03,863 INFO L225 Difference]: With dead ends: 1500 [2024-10-11 05:57:03,863 INFO L226 Difference]: Without dead ends: 934 [2024-10-11 05:57:03,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:57:03,868 INFO L432 NwaCegarLoop]: 716 mSDtfsCounter, 680 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 683 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:57:03,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [683 Valid, 1440 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:57:03,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2024-10-11 05:57:03,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 934. [2024-10-11 05:57:03,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 924 states have (on average 1.33008658008658) internal successors, (1229), 924 states have internal predecessors, (1229), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 05:57:03,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1245 transitions. [2024-10-11 05:57:03,898 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1245 transitions. Word has length 466 [2024-10-11 05:57:03,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:57:03,899 INFO L471 AbstractCegarLoop]: Abstraction has 934 states and 1245 transitions. [2024-10-11 05:57:03,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.8) internal successors, (439), 5 states have internal predecessors, (439), 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-10-11 05:57:03,899 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1245 transitions. [2024-10-11 05:57:03,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2024-10-11 05:57:03,903 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:57:03,903 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:57:03,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-10-11 05:57:03,904 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:57:03,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:57:03,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1517534742, now seen corresponding path program 1 times [2024-10-11 05:57:03,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:57:03,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622073884] [2024-10-11 05:57:03,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:57:03,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:57:04,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:04,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 05:57:04,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:04,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 05:57:04,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:04,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 05:57:04,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:04,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 340 [2024-10-11 05:57:04,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:04,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 358 [2024-10-11 05:57:04,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:04,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 372 [2024-10-11 05:57:04,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:04,713 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 05:57:04,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:57:04,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622073884] [2024-10-11 05:57:04,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622073884] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:57:04,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:57:04,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:57:04,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571745477] [2024-10-11 05:57:04,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:57:04,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:57:04,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:57:04,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:57:04,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:57:04,715 INFO L87 Difference]: Start difference. First operand 934 states and 1245 transitions. Second operand has 5 states, 5 states have (on average 88.0) internal successors, (440), 5 states have internal predecessors, (440), 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-10-11 05:57:04,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:57:04,823 INFO L93 Difference]: Finished difference Result 1500 states and 2010 transitions. [2024-10-11 05:57:04,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:57:04,823 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 88.0) internal successors, (440), 5 states have internal predecessors, (440), 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 467 [2024-10-11 05:57:04,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:57:04,826 INFO L225 Difference]: With dead ends: 1500 [2024-10-11 05:57:04,826 INFO L226 Difference]: Without dead ends: 934 [2024-10-11 05:57:04,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:57:04,827 INFO L432 NwaCegarLoop]: 716 mSDtfsCounter, 1215 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1218 SdHoareTripleChecker+Valid, 1434 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:57:04,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1218 Valid, 1434 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:57:04,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2024-10-11 05:57:04,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 934. [2024-10-11 05:57:04,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 924 states have (on average 1.329004329004329) internal successors, (1228), 924 states have internal predecessors, (1228), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 05:57:04,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1244 transitions. [2024-10-11 05:57:04,850 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1244 transitions. Word has length 467 [2024-10-11 05:57:04,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:57:04,850 INFO L471 AbstractCegarLoop]: Abstraction has 934 states and 1244 transitions. [2024-10-11 05:57:04,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.0) internal successors, (440), 5 states have internal predecessors, (440), 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-10-11 05:57:04,851 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1244 transitions. [2024-10-11 05:57:04,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2024-10-11 05:57:04,854 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:57:04,854 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:57:04,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-10-11 05:57:04,855 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:57:04,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:57:04,855 INFO L85 PathProgramCache]: Analyzing trace with hash 178220264, now seen corresponding path program 1 times [2024-10-11 05:57:04,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:57:04,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270048756] [2024-10-11 05:57:04,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:57:04,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:57:05,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:05,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 05:57:05,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:05,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 05:57:05,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:05,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 05:57:05,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:05,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 341 [2024-10-11 05:57:05,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:05,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2024-10-11 05:57:05,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:05,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 373 [2024-10-11 05:57:05,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:05,582 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 05:57:05,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:57:05,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270048756] [2024-10-11 05:57:05,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270048756] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:57:05,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:57:05,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:57:05,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830333934] [2024-10-11 05:57:05,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:57:05,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:57:05,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:57:05,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:57:05,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:57:05,585 INFO L87 Difference]: Start difference. First operand 934 states and 1244 transitions. Second operand has 5 states, 5 states have (on average 88.2) internal successors, (441), 5 states have internal predecessors, (441), 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-10-11 05:57:05,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:57:05,688 INFO L93 Difference]: Finished difference Result 1500 states and 2008 transitions. [2024-10-11 05:57:05,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:57:05,689 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 88.2) internal successors, (441), 5 states have internal predecessors, (441), 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 468 [2024-10-11 05:57:05,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:57:05,692 INFO L225 Difference]: With dead ends: 1500 [2024-10-11 05:57:05,692 INFO L226 Difference]: Without dead ends: 934 [2024-10-11 05:57:05,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:57:05,698 INFO L432 NwaCegarLoop]: 716 mSDtfsCounter, 1199 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1202 SdHoareTripleChecker+Valid, 1434 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:57:05,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1202 Valid, 1434 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:57:05,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2024-10-11 05:57:05,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 934. [2024-10-11 05:57:05,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 924 states have (on average 1.327922077922078) internal successors, (1227), 924 states have internal predecessors, (1227), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 05:57:05,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1243 transitions. [2024-10-11 05:57:05,725 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1243 transitions. Word has length 468 [2024-10-11 05:57:05,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:57:05,726 INFO L471 AbstractCegarLoop]: Abstraction has 934 states and 1243 transitions. [2024-10-11 05:57:05,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.2) internal successors, (441), 5 states have internal predecessors, (441), 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-10-11 05:57:05,726 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1243 transitions. [2024-10-11 05:57:05,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2024-10-11 05:57:05,729 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:57:05,729 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:57:05,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-10-11 05:57:05,730 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:57:05,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:57:05,731 INFO L85 PathProgramCache]: Analyzing trace with hash -593376811, now seen corresponding path program 1 times [2024-10-11 05:57:05,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:57:05,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137246039] [2024-10-11 05:57:05,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:57:05,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:57:05,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:06,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 05:57:06,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:06,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 05:57:06,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:06,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 05:57:06,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:06,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 342 [2024-10-11 05:57:06,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:06,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 360 [2024-10-11 05:57:06,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:06,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 374 [2024-10-11 05:57:06,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:06,604 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 05:57:06,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:57:06,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137246039] [2024-10-11 05:57:06,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137246039] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:57:06,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:57:06,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:57:06,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008661443] [2024-10-11 05:57:06,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:57:06,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:57:06,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:57:06,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:57:06,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:57:06,609 INFO L87 Difference]: Start difference. First operand 934 states and 1243 transitions. Second operand has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 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-10-11 05:57:06,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:57:06,697 INFO L93 Difference]: Finished difference Result 1500 states and 2006 transitions. [2024-10-11 05:57:06,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:57:06,698 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 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 469 [2024-10-11 05:57:06,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:57:06,700 INFO L225 Difference]: With dead ends: 1500 [2024-10-11 05:57:06,700 INFO L226 Difference]: Without dead ends: 934 [2024-10-11 05:57:06,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:57:06,702 INFO L432 NwaCegarLoop]: 740 mSDtfsCounter, 641 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 1488 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:57:06,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [644 Valid, 1488 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:57:06,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2024-10-11 05:57:06,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 934. [2024-10-11 05:57:06,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 924 states have (on average 1.326839826839827) internal successors, (1226), 924 states have internal predecessors, (1226), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 05:57:06,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1242 transitions. [2024-10-11 05:57:06,730 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1242 transitions. Word has length 469 [2024-10-11 05:57:06,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:57:06,730 INFO L471 AbstractCegarLoop]: Abstraction has 934 states and 1242 transitions. [2024-10-11 05:57:06,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 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-10-11 05:57:06,731 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1242 transitions. [2024-10-11 05:57:06,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2024-10-11 05:57:06,733 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:57:06,734 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:57:06,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-10-11 05:57:06,734 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:57:06,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:57:06,734 INFO L85 PathProgramCache]: Analyzing trace with hash 272330483, now seen corresponding path program 1 times [2024-10-11 05:57:06,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:57:06,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076857576] [2024-10-11 05:57:06,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:57:06,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:57:07,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:07,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 05:57:07,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:07,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 05:57:07,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:07,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 05:57:07,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:07,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 343 [2024-10-11 05:57:07,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:07,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 361 [2024-10-11 05:57:07,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:07,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 375 [2024-10-11 05:57:07,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:07,495 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 05:57:07,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:57:07,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076857576] [2024-10-11 05:57:07,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076857576] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:57:07,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:57:07,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:57:07,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791731353] [2024-10-11 05:57:07,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:57:07,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:57:07,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:57:07,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:57:07,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:57:07,497 INFO L87 Difference]: Start difference. First operand 934 states and 1242 transitions. Second operand has 5 states, 5 states have (on average 88.6) internal successors, (443), 5 states have internal predecessors, (443), 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-10-11 05:57:07,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:57:07,573 INFO L93 Difference]: Finished difference Result 1500 states and 2004 transitions. [2024-10-11 05:57:07,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:57:07,575 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 88.6) internal successors, (443), 5 states have internal predecessors, (443), 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 470 [2024-10-11 05:57:07,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:57:07,579 INFO L225 Difference]: With dead ends: 1500 [2024-10-11 05:57:07,579 INFO L226 Difference]: Without dead ends: 934 [2024-10-11 05:57:07,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:57:07,582 INFO L432 NwaCegarLoop]: 740 mSDtfsCounter, 633 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 1488 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:57:07,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [636 Valid, 1488 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:57:07,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2024-10-11 05:57:07,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 934. [2024-10-11 05:57:07,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 924 states have (on average 1.3257575757575757) internal successors, (1225), 924 states have internal predecessors, (1225), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 05:57:07,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1241 transitions. [2024-10-11 05:57:07,604 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1241 transitions. Word has length 470 [2024-10-11 05:57:07,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:57:07,605 INFO L471 AbstractCegarLoop]: Abstraction has 934 states and 1241 transitions. [2024-10-11 05:57:07,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.6) internal successors, (443), 5 states have internal predecessors, (443), 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-10-11 05:57:07,605 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1241 transitions. [2024-10-11 05:57:07,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2024-10-11 05:57:07,611 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:57:07,612 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:57:07,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-10-11 05:57:07,612 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:57:07,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:57:07,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1622752832, now seen corresponding path program 1 times [2024-10-11 05:57:07,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:57:07,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144341883] [2024-10-11 05:57:07,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:57:07,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:57:07,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:08,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 05:57:08,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:08,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 05:57:08,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:08,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 05:57:08,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:08,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2024-10-11 05:57:08,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:08,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2024-10-11 05:57:08,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:08,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2024-10-11 05:57:08,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:08,356 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 05:57:08,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:57:08,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144341883] [2024-10-11 05:57:08,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144341883] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:57:08,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:57:08,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:57:08,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855710194] [2024-10-11 05:57:08,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:57:08,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:57:08,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:57:08,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:57:08,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:57:08,358 INFO L87 Difference]: Start difference. First operand 934 states and 1241 transitions. Second operand has 5 states, 5 states have (on average 88.8) internal successors, (444), 5 states have internal predecessors, (444), 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-10-11 05:57:08,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:57:08,437 INFO L93 Difference]: Finished difference Result 1500 states and 2002 transitions. [2024-10-11 05:57:08,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:57:08,438 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 88.8) internal successors, (444), 5 states have internal predecessors, (444), 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 471 [2024-10-11 05:57:08,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:57:08,439 INFO L225 Difference]: With dead ends: 1500 [2024-10-11 05:57:08,440 INFO L226 Difference]: Without dead ends: 934 [2024-10-11 05:57:08,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:57:08,441 INFO L432 NwaCegarLoop]: 740 mSDtfsCounter, 625 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 1488 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:57:08,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [628 Valid, 1488 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:57:08,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2024-10-11 05:57:08,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 934. [2024-10-11 05:57:08,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 924 states have (on average 1.3246753246753247) internal successors, (1224), 924 states have internal predecessors, (1224), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 05:57:08,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1240 transitions. [2024-10-11 05:57:08,457 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1240 transitions. Word has length 471 [2024-10-11 05:57:08,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:57:08,457 INFO L471 AbstractCegarLoop]: Abstraction has 934 states and 1240 transitions. [2024-10-11 05:57:08,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.8) internal successors, (444), 5 states have internal predecessors, (444), 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-10-11 05:57:08,458 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1240 transitions. [2024-10-11 05:57:08,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2024-10-11 05:57:08,461 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:57:08,462 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:57:08,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-10-11 05:57:08,462 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:57:08,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:57:08,462 INFO L85 PathProgramCache]: Analyzing trace with hash -2067741314, now seen corresponding path program 1 times [2024-10-11 05:57:08,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:57:08,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201994327] [2024-10-11 05:57:08,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:57:08,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:57:08,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:09,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 05:57:09,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:09,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 05:57:09,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:09,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 05:57:09,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:09,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 345 [2024-10-11 05:57:09,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:09,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 363 [2024-10-11 05:57:09,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:09,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 377 [2024-10-11 05:57:09,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:09,377 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 05:57:09,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:57:09,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201994327] [2024-10-11 05:57:09,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201994327] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:57:09,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:57:09,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:57:09,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515432626] [2024-10-11 05:57:09,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:57:09,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:57:09,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:57:09,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:57:09,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:57:09,380 INFO L87 Difference]: Start difference. First operand 934 states and 1240 transitions. Second operand has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 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-10-11 05:57:09,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:57:09,469 INFO L93 Difference]: Finished difference Result 1500 states and 2000 transitions. [2024-10-11 05:57:09,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:57:09,470 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 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 472 [2024-10-11 05:57:09,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:57:09,472 INFO L225 Difference]: With dead ends: 1500 [2024-10-11 05:57:09,472 INFO L226 Difference]: Without dead ends: 934 [2024-10-11 05:57:09,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:57:09,474 INFO L432 NwaCegarLoop]: 740 mSDtfsCounter, 1120 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1123 SdHoareTripleChecker+Valid, 1482 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:57:09,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1123 Valid, 1482 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:57:09,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2024-10-11 05:57:09,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 934. [2024-10-11 05:57:09,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 924 states have (on average 1.3235930735930737) internal successors, (1223), 924 states have internal predecessors, (1223), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 05:57:09,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1239 transitions. [2024-10-11 05:57:09,497 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1239 transitions. Word has length 472 [2024-10-11 05:57:09,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:57:09,498 INFO L471 AbstractCegarLoop]: Abstraction has 934 states and 1239 transitions. [2024-10-11 05:57:09,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 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-10-11 05:57:09,498 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1239 transitions. [2024-10-11 05:57:09,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2024-10-11 05:57:09,501 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:57:09,501 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:57:09,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-10-11 05:57:09,502 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:57:09,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:57:09,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1796759339, now seen corresponding path program 1 times [2024-10-11 05:57:09,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:57:09,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998058051] [2024-10-11 05:57:09,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:57:09,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:57:09,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:10,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 05:57:10,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:10,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 05:57:10,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:10,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 05:57:10,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:10,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 346 [2024-10-11 05:57:10,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:10,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 364 [2024-10-11 05:57:10,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:10,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 378 [2024-10-11 05:57:10,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:10,379 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 05:57:10,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:57:10,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998058051] [2024-10-11 05:57:10,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998058051] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:57:10,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:57:10,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:57:10,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697913362] [2024-10-11 05:57:10,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:57:10,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:57:10,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:57:10,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:57:10,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:57:10,382 INFO L87 Difference]: Start difference. First operand 934 states and 1239 transitions. Second operand has 5 states, 5 states have (on average 89.2) internal successors, (446), 5 states have internal predecessors, (446), 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-10-11 05:57:10,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:57:10,454 INFO L93 Difference]: Finished difference Result 1500 states and 1998 transitions. [2024-10-11 05:57:10,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:57:10,455 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 89.2) internal successors, (446), 5 states have internal predecessors, (446), 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 473 [2024-10-11 05:57:10,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:57:10,457 INFO L225 Difference]: With dead ends: 1500 [2024-10-11 05:57:10,457 INFO L226 Difference]: Without dead ends: 934 [2024-10-11 05:57:10,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:57:10,459 INFO L432 NwaCegarLoop]: 752 mSDtfsCounter, 1097 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1100 SdHoareTripleChecker+Valid, 1506 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:57:10,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1100 Valid, 1506 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:57:10,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2024-10-11 05:57:10,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 934. [2024-10-11 05:57:10,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 924 states have (on average 1.3225108225108224) internal successors, (1222), 924 states have internal predecessors, (1222), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 05:57:10,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1238 transitions. [2024-10-11 05:57:10,480 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1238 transitions. Word has length 473 [2024-10-11 05:57:10,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:57:10,480 INFO L471 AbstractCegarLoop]: Abstraction has 934 states and 1238 transitions. [2024-10-11 05:57:10,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.2) internal successors, (446), 5 states have internal predecessors, (446), 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-10-11 05:57:10,481 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1238 transitions. [2024-10-11 05:57:10,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2024-10-11 05:57:10,484 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:57:10,484 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:57:10,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-10-11 05:57:10,484 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:57:10,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:57:10,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1310510967, now seen corresponding path program 1 times [2024-10-11 05:57:10,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:57:10,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828869099] [2024-10-11 05:57:10,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:57:10,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:57:10,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:11,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 05:57:11,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:11,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 05:57:11,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:11,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 05:57:11,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:11,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 347 [2024-10-11 05:57:11,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:11,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 365 [2024-10-11 05:57:11,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:11,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 379 [2024-10-11 05:57:11,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:11,358 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 05:57:11,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:57:11,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828869099] [2024-10-11 05:57:11,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828869099] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:57:11,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:57:11,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:57:11,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157080640] [2024-10-11 05:57:11,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:57:11,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:57:11,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:57:11,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:57:11,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:57:11,361 INFO L87 Difference]: Start difference. First operand 934 states and 1238 transitions. Second operand has 5 states, 5 states have (on average 89.4) internal successors, (447), 5 states have internal predecessors, (447), 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-10-11 05:57:11,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:57:11,431 INFO L93 Difference]: Finished difference Result 1500 states and 1996 transitions. [2024-10-11 05:57:11,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:57:11,432 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 89.4) internal successors, (447), 5 states have internal predecessors, (447), 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 474 [2024-10-11 05:57:11,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:57:11,433 INFO L225 Difference]: With dead ends: 1500 [2024-10-11 05:57:11,433 INFO L226 Difference]: Without dead ends: 934 [2024-10-11 05:57:11,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:57:11,434 INFO L432 NwaCegarLoop]: 752 mSDtfsCounter, 1081 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1084 SdHoareTripleChecker+Valid, 1506 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:57:11,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1084 Valid, 1506 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:57:11,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2024-10-11 05:57:11,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 934. [2024-10-11 05:57:11,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 924 states have (on average 1.3214285714285714) internal successors, (1221), 924 states have internal predecessors, (1221), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 05:57:11,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1237 transitions. [2024-10-11 05:57:11,456 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1237 transitions. Word has length 474 [2024-10-11 05:57:11,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:57:11,457 INFO L471 AbstractCegarLoop]: Abstraction has 934 states and 1237 transitions. [2024-10-11 05:57:11,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.4) internal successors, (447), 5 states have internal predecessors, (447), 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-10-11 05:57:11,457 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1237 transitions. [2024-10-11 05:57:11,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2024-10-11 05:57:11,460 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:57:11,461 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:57:11,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-10-11 05:57:11,461 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:57:11,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:57:11,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1910828182, now seen corresponding path program 1 times [2024-10-11 05:57:11,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:57:11,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15417711] [2024-10-11 05:57:11,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:57:11,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:57:11,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:12,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 05:57:12,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:12,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 05:57:12,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:12,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 05:57:12,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:12,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2024-10-11 05:57:12,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:12,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 366 [2024-10-11 05:57:12,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:12,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 380 [2024-10-11 05:57:12,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:12,339 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 05:57:12,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:57:12,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15417711] [2024-10-11 05:57:12,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15417711] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:57:12,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:57:12,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:57:12,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050490263] [2024-10-11 05:57:12,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:57:12,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:57:12,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:57:12,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:57:12,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:57:12,341 INFO L87 Difference]: Start difference. First operand 934 states and 1237 transitions. Second operand has 5 states, 5 states have (on average 89.6) internal successors, (448), 5 states have internal predecessors, (448), 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)