./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-85.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-85.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash adaaa37c405e7d679e050e08a9505edbe41bf89f875de14489d406f30fd12a14 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 03:31:15,797 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 03:31:15,844 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 03:31:15,847 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 03:31:15,848 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 03:31:15,871 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 03:31:15,871 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 03:31:15,871 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 03:31:15,872 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 03:31:15,872 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 03:31:15,876 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 03:31:15,876 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 03:31:15,877 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 03:31:15,877 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 03:31:15,877 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 03:31:15,877 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 03:31:15,877 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 03:31:15,878 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 03:31:15,878 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 03:31:15,878 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 03:31:15,878 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 03:31:15,881 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 03:31:15,881 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 03:31:15,881 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 03:31:15,882 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 03:31:15,882 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 03:31:15,882 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 03:31:15,882 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 03:31:15,882 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 03:31:15,883 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 03:31:15,884 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 03:31:15,884 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 03:31:15,884 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:31:15,884 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 03:31:15,885 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 03:31:15,885 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 03:31:15,885 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 03:31:15,885 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 03:31:15,886 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 03:31:15,886 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 03:31:15,886 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 03:31:15,886 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 03:31:15,886 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> adaaa37c405e7d679e050e08a9505edbe41bf89f875de14489d406f30fd12a14 [2024-10-13 03:31:16,062 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 03:31:16,086 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 03:31:16,089 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 03:31:16,090 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 03:31:16,090 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 03:31:16,091 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-85.i [2024-10-13 03:31:17,500 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 03:31:17,661 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 03:31:17,662 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-85.i [2024-10-13 03:31:17,669 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bc817b98/94e83bc5c08b4971a41e92a1c11d6427/FLAGb9be2ece6 [2024-10-13 03:31:18,066 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bc817b98/94e83bc5c08b4971a41e92a1c11d6427 [2024-10-13 03:31:18,068 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 03:31:18,069 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 03:31:18,071 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 03:31:18,071 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 03:31:18,075 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 03:31:18,076 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:31:18" (1/1) ... [2024-10-13 03:31:18,077 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e1ddf35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:31:18, skipping insertion in model container [2024-10-13 03:31:18,077 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:31:18" (1/1) ... [2024-10-13 03:31:18,095 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 03:31:18,235 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-85.i[917,930] [2024-10-13 03:31:18,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:31:18,335 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 03:31:18,344 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-85.i[917,930] [2024-10-13 03:31:18,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:31:18,376 INFO L204 MainTranslator]: Completed translation [2024-10-13 03:31:18,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:31:18 WrapperNode [2024-10-13 03:31:18,377 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 03:31:18,377 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 03:31:18,378 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 03:31:18,378 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 03:31:18,383 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:31:18" (1/1) ... [2024-10-13 03:31:18,396 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:31:18" (1/1) ... [2024-10-13 03:31:18,444 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 126 [2024-10-13 03:31:18,445 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 03:31:18,448 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 03:31:18,448 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 03:31:18,449 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 03:31:18,463 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:31:18" (1/1) ... [2024-10-13 03:31:18,463 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:31:18" (1/1) ... [2024-10-13 03:31:18,466 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:31:18" (1/1) ... [2024-10-13 03:31:18,496 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-13 03:31:18,497 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:31:18" (1/1) ... [2024-10-13 03:31:18,497 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:31:18" (1/1) ... [2024-10-13 03:31:18,505 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:31:18" (1/1) ... [2024-10-13 03:31:18,508 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:31:18" (1/1) ... [2024-10-13 03:31:18,509 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:31:18" (1/1) ... [2024-10-13 03:31:18,511 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:31:18" (1/1) ... [2024-10-13 03:31:18,517 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 03:31:18,518 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 03:31:18,518 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 03:31:18,518 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 03:31:18,519 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:31:18" (1/1) ... [2024-10-13 03:31:18,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:31:18,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:31:18,559 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 03:31:18,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 03:31:18,610 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 03:31:18,610 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 03:31:18,611 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 03:31:18,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 03:31:18,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 03:31:18,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 03:31:18,719 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 03:31:18,721 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 03:31:18,948 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-13 03:31:18,948 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 03:31:18,982 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 03:31:18,982 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 03:31:18,982 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:31:18 BoogieIcfgContainer [2024-10-13 03:31:18,983 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 03:31:18,986 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 03:31:18,986 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 03:31:18,989 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 03:31:18,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:31:18" (1/3) ... [2024-10-13 03:31:18,990 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f9b9aa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:31:18, skipping insertion in model container [2024-10-13 03:31:18,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:31:18" (2/3) ... [2024-10-13 03:31:18,991 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f9b9aa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:31:18, skipping insertion in model container [2024-10-13 03:31:18,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:31:18" (3/3) ... [2024-10-13 03:31:18,992 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-85.i [2024-10-13 03:31:19,005 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 03:31:19,005 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 03:31:19,077 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 03:31:19,084 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;@417d064e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 03:31:19,084 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 03:31:19,090 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 28 states have internal predecessors, (37), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-13 03:31:19,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-13 03:31:19,106 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:31:19,107 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:31:19,108 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:31:19,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:31:19,113 INFO L85 PathProgramCache]: Analyzing trace with hash -682589884, now seen corresponding path program 1 times [2024-10-13 03:31:19,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:31:19,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905327356] [2024-10-13 03:31:19,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:31:19,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:31:19,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:19,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:31:19,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:19,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:31:19,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:19,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:31:19,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:19,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:31:19,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:19,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:31:19,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:19,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:31:19,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:19,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:31:19,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:19,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:31:19,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:19,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:31:19,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:19,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:31:19,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:19,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:31:19,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:19,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:31:19,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:19,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:31:19,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:19,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:31:19,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:19,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:31:19,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:19,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:31:19,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:19,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:31:19,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:19,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:31:19,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:19,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 03:31:19,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:19,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:31:19,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:19,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 03:31:19,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:19,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 03:31:19,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:19,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 03:31:19,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:19,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-13 03:31:19,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:31:19,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905327356] [2024-10-13 03:31:19,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905327356] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:31:19,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:31:19,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 03:31:19,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693020070] [2024-10-13 03:31:19,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:31:19,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 03:31:19,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:31:19,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 03:31:19,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:31:19,540 INFO L87 Difference]: Start difference. First operand has 53 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 28 states have internal predecessors, (37), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-13 03:31:19,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:31:19,573 INFO L93 Difference]: Finished difference Result 103 states and 187 transitions. [2024-10-13 03:31:19,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 03:31:19,576 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 135 [2024-10-13 03:31:19,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:31:19,583 INFO L225 Difference]: With dead ends: 103 [2024-10-13 03:31:19,584 INFO L226 Difference]: Without dead ends: 51 [2024-10-13 03:31:19,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 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-13 03:31:19,592 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:31:19,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:31:19,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-13 03:31:19,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-10-13 03:31:19,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-13 03:31:19,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 78 transitions. [2024-10-13 03:31:19,628 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 78 transitions. Word has length 135 [2024-10-13 03:31:19,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:31:19,628 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 78 transitions. [2024-10-13 03:31:19,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-13 03:31:19,629 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 78 transitions. [2024-10-13 03:31:19,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-13 03:31:19,632 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:31:19,632 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:31:19,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 03:31:19,632 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:31:19,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:31:19,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1279187578, now seen corresponding path program 1 times [2024-10-13 03:31:19,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:31:19,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657785683] [2024-10-13 03:31:19,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:31:19,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:31:19,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:26,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:31:26,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:26,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:31:26,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:26,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:31:26,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:26,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:31:26,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:26,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:31:26,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:26,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:31:26,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:26,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:31:26,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:26,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:31:26,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:26,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:31:26,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:26,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:31:26,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:26,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:31:26,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:26,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:31:26,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:26,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:31:26,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:26,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:31:26,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:26,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:31:26,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:26,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:31:26,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:26,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:31:26,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:26,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:31:26,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:26,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 03:31:26,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:26,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:31:26,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:26,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 03:31:26,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:26,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 03:31:26,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:26,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 03:31:26,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:26,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-13 03:31:26,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:31:26,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657785683] [2024-10-13 03:31:26,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657785683] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:31:26,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:31:26,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 03:31:26,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939799562] [2024-10-13 03:31:26,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:31:26,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 03:31:26,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:31:26,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 03:31:26,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-13 03:31:26,377 INFO L87 Difference]: Start difference. First operand 51 states and 78 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-13 03:31:28,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:31:28,732 INFO L93 Difference]: Finished difference Result 89 states and 122 transitions. [2024-10-13 03:31:28,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 03:31:28,732 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 135 [2024-10-13 03:31:28,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:31:28,735 INFO L225 Difference]: With dead ends: 89 [2024-10-13 03:31:28,735 INFO L226 Difference]: Without dead ends: 87 [2024-10-13 03:31:28,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-10-13 03:31:28,736 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 80 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 03:31:28,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 198 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 03:31:28,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-13 03:31:28,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 60. [2024-10-13 03:31:28,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-13 03:31:28,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 88 transitions. [2024-10-13 03:31:28,751 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 88 transitions. Word has length 135 [2024-10-13 03:31:28,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:31:28,752 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 88 transitions. [2024-10-13 03:31:28,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-13 03:31:28,752 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 88 transitions. [2024-10-13 03:31:28,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-13 03:31:28,754 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:31:28,754 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:31:28,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 03:31:28,754 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:31:28,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:31:28,755 INFO L85 PathProgramCache]: Analyzing trace with hash 495819784, now seen corresponding path program 1 times [2024-10-13 03:31:28,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:31:28,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020333898] [2024-10-13 03:31:28,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:31:28,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:31:28,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:34,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:31:34,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:34,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:31:34,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:34,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:31:34,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:34,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:31:34,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:34,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:31:34,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:34,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:31:34,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:34,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:31:34,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:34,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:31:34,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:34,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:31:34,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:34,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:31:34,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:34,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:31:34,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:34,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:31:34,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:34,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:31:34,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:34,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:31:34,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:34,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:31:34,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:34,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:31:34,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:34,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:31:34,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:34,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:31:34,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:34,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 03:31:34,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:34,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:31:34,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:34,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 03:31:34,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:34,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 03:31:34,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:34,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 03:31:34,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:34,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-13 03:31:34,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:31:34,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020333898] [2024-10-13 03:31:34,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020333898] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:31:34,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:31:34,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 03:31:34,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562161274] [2024-10-13 03:31:34,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:31:34,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 03:31:34,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:31:34,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 03:31:34,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-13 03:31:34,678 INFO L87 Difference]: Start difference. First operand 60 states and 88 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-13 03:31:37,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:31:37,067 INFO L93 Difference]: Finished difference Result 92 states and 126 transitions. [2024-10-13 03:31:37,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 03:31:37,068 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 135 [2024-10-13 03:31:37,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:31:37,071 INFO L225 Difference]: With dead ends: 92 [2024-10-13 03:31:37,071 INFO L226 Difference]: Without dead ends: 90 [2024-10-13 03:31:37,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-10-13 03:31:37,074 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 64 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 03:31:37,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 220 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 03:31:37,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-13 03:31:37,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 58. [2024-10-13 03:31:37,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-13 03:31:37,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 85 transitions. [2024-10-13 03:31:37,099 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 85 transitions. Word has length 135 [2024-10-13 03:31:37,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:31:37,100 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 85 transitions. [2024-10-13 03:31:37,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-13 03:31:37,100 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 85 transitions. [2024-10-13 03:31:37,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-13 03:31:37,102 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:31:37,102 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:31:37,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 03:31:37,102 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:31:37,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:31:37,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1000663725, now seen corresponding path program 1 times [2024-10-13 03:31:37,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:31:37,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434724255] [2024-10-13 03:31:37,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:31:37,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:31:37,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:43,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:31:43,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:43,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:31:43,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:43,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:31:43,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:43,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:31:43,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:43,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:31:43,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:43,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:31:43,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:43,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:31:43,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:43,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:31:43,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:43,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:31:43,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:43,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:31:43,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:43,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:31:43,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:43,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:31:43,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:43,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:31:43,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:43,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:31:43,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:43,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:31:43,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:43,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:31:43,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:43,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:31:43,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:43,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:31:43,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:43,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 03:31:43,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:43,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:31:43,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:43,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 03:31:43,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:43,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 03:31:43,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:43,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 03:31:43,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:43,462 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-13 03:31:43,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:31:43,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434724255] [2024-10-13 03:31:43,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434724255] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:31:43,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:31:43,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 03:31:43,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379138276] [2024-10-13 03:31:43,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:31:43,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 03:31:43,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:31:43,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 03:31:43,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-13 03:31:43,469 INFO L87 Difference]: Start difference. First operand 58 states and 85 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-13 03:31:44,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:31:44,467 INFO L93 Difference]: Finished difference Result 102 states and 137 transitions. [2024-10-13 03:31:44,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 03:31:44,468 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 136 [2024-10-13 03:31:44,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:31:44,474 INFO L225 Difference]: With dead ends: 102 [2024-10-13 03:31:44,474 INFO L226 Difference]: Without dead ends: 100 [2024-10-13 03:31:44,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-10-13 03:31:44,477 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 79 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 03:31:44,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 215 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 03:31:44,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-13 03:31:44,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 62. [2024-10-13 03:31:44,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-13 03:31:44,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 92 transitions. [2024-10-13 03:31:44,493 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 92 transitions. Word has length 136 [2024-10-13 03:31:44,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:31:44,494 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 92 transitions. [2024-10-13 03:31:44,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-13 03:31:44,494 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 92 transitions. [2024-10-13 03:31:44,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-13 03:31:44,496 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:31:44,496 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:31:44,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 03:31:44,496 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:31:44,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:31:44,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1000604143, now seen corresponding path program 1 times [2024-10-13 03:31:44,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:31:44,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546164091] [2024-10-13 03:31:44,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:31:44,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:31:44,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:48,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:31:48,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:48,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:31:48,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:48,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:31:48,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:48,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:31:48,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:48,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:31:48,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:48,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:31:48,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:48,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:31:48,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:48,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:31:48,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:48,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:31:48,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:48,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:31:48,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:48,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:31:48,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:48,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:31:48,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:48,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:31:48,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:48,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:31:48,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:48,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:31:48,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:48,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:31:48,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:48,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:31:48,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:48,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:31:48,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:48,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 03:31:48,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:48,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:31:48,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:48,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 03:31:48,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:48,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 03:31:48,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:48,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 03:31:48,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:48,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-13 03:31:48,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:31:48,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546164091] [2024-10-13 03:31:48,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546164091] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:31:48,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:31:48,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 03:31:48,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19470905] [2024-10-13 03:31:48,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:31:48,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 03:31:48,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:31:48,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 03:31:48,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-13 03:31:48,990 INFO L87 Difference]: Start difference. First operand 62 states and 92 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-13 03:31:51,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:31:51,506 INFO L93 Difference]: Finished difference Result 120 states and 159 transitions. [2024-10-13 03:31:51,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 03:31:51,506 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 136 [2024-10-13 03:31:51,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:31:51,507 INFO L225 Difference]: With dead ends: 120 [2024-10-13 03:31:51,507 INFO L226 Difference]: Without dead ends: 118 [2024-10-13 03:31:51,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2024-10-13 03:31:51,508 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 79 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 03:31:51,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 353 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 03:31:51,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-13 03:31:51,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 65. [2024-10-13 03:31:51,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 39 states have internal predecessors, (52), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-13 03:31:51,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 98 transitions. [2024-10-13 03:31:51,518 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 98 transitions. Word has length 136 [2024-10-13 03:31:51,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:31:51,519 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 98 transitions. [2024-10-13 03:31:51,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-13 03:31:51,519 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 98 transitions. [2024-10-13 03:31:51,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-13 03:31:51,520 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:31:51,520 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:31:51,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 03:31:51,521 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:31:51,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:31:51,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1238157577, now seen corresponding path program 1 times [2024-10-13 03:31:51,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:31:51,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898869490] [2024-10-13 03:31:51,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:31:51,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:31:51,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:57,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:31:57,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:57,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:31:57,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:57,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:31:57,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:57,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:31:57,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:57,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:31:57,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:57,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:31:57,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:57,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:31:57,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:57,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:31:57,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:57,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:31:57,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:57,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:31:57,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:57,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:31:57,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:57,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:31:57,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:57,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:31:57,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:57,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:31:57,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:57,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:31:57,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:57,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:31:57,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:57,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:31:57,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:57,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:31:57,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:57,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 03:31:57,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:57,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:31:57,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:57,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 03:31:57,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:57,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 03:31:57,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:57,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 03:31:57,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:31:57,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-13 03:31:57,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:31:57,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898869490] [2024-10-13 03:31:57,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898869490] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:31:57,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:31:57,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 03:31:57,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577639245] [2024-10-13 03:31:57,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:31:57,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 03:31:57,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:31:57,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 03:31:57,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-13 03:31:57,303 INFO L87 Difference]: Start difference. First operand 65 states and 98 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-13 03:31:59,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:31:59,518 INFO L93 Difference]: Finished difference Result 175 states and 247 transitions. [2024-10-13 03:31:59,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 03:31:59,518 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 136 [2024-10-13 03:31:59,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:31:59,519 INFO L225 Difference]: With dead ends: 175 [2024-10-13 03:31:59,520 INFO L226 Difference]: Without dead ends: 111 [2024-10-13 03:31:59,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2024-10-13 03:31:59,524 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 88 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-13 03:31:59,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 315 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-13 03:31:59,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-13 03:31:59,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 80. [2024-10-13 03:31:59,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 49 states have internal predecessors, (61), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-13 03:31:59,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 115 transitions. [2024-10-13 03:31:59,556 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 115 transitions. Word has length 136 [2024-10-13 03:31:59,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:31:59,558 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 115 transitions. [2024-10-13 03:31:59,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-13 03:31:59,559 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 115 transitions. [2024-10-13 03:31:59,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-13 03:31:59,559 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:31:59,560 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:31:59,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 03:31:59,560 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:31:59,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:31:59,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1240004619, now seen corresponding path program 1 times [2024-10-13 03:31:59,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:31:59,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331104984] [2024-10-13 03:31:59,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:31:59,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:31:59,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:08,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:32:08,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:08,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:32:08,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:08,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:32:08,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:08,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:32:08,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:08,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:32:08,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:08,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:32:08,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:08,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:32:08,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:08,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:32:08,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:08,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:32:08,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:08,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:32:08,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:08,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:32:08,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:08,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:32:08,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:08,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:32:08,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:08,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:32:08,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:08,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:32:08,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:08,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:32:08,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:08,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:32:08,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:08,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:32:08,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:08,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 03:32:08,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:08,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:32:08,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:08,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 03:32:08,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:08,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 03:32:08,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:08,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 03:32:08,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:08,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-13 03:32:08,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:32:08,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331104984] [2024-10-13 03:32:08,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331104984] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:32:08,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:32:08,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 03:32:08,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629299229] [2024-10-13 03:32:08,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:32:08,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 03:32:08,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:32:08,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 03:32:08,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-13 03:32:08,204 INFO L87 Difference]: Start difference. First operand 80 states and 115 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-13 03:32:10,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:32:10,674 INFO L93 Difference]: Finished difference Result 109 states and 145 transitions. [2024-10-13 03:32:10,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 03:32:10,675 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 136 [2024-10-13 03:32:10,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:32:10,677 INFO L225 Difference]: With dead ends: 109 [2024-10-13 03:32:10,677 INFO L226 Difference]: Without dead ends: 107 [2024-10-13 03:32:10,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2024-10-13 03:32:10,678 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 73 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 03:32:10,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 262 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 03:32:10,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-13 03:32:10,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 80. [2024-10-13 03:32:10,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 49 states have internal predecessors, (61), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-13 03:32:10,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 115 transitions. [2024-10-13 03:32:10,704 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 115 transitions. Word has length 136 [2024-10-13 03:32:10,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:32:10,704 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 115 transitions. [2024-10-13 03:32:10,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-13 03:32:10,705 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 115 transitions. [2024-10-13 03:32:10,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-13 03:32:10,706 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:32:10,706 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:32:10,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 03:32:10,707 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:32:10,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:32:10,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1810010351, now seen corresponding path program 1 times [2024-10-13 03:32:10,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:32:10,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443936334] [2024-10-13 03:32:10,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:32:10,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:32:10,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:16,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:32:16,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:16,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:32:16,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:16,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:32:16,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:16,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:32:16,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:16,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:32:16,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:16,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:32:16,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:16,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:32:16,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:16,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:32:16,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:16,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:32:16,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:16,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:32:16,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:16,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:32:16,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:16,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:32:16,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:16,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:32:16,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:16,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:32:16,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:16,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:32:16,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:16,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:32:16,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:16,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:32:16,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:16,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:32:16,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:17,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 03:32:17,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:17,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:32:17,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:17,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 03:32:17,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:17,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 03:32:17,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:17,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 03:32:17,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:17,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-13 03:32:17,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:32:17,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443936334] [2024-10-13 03:32:17,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443936334] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:32:17,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:32:17,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 03:32:17,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349345279] [2024-10-13 03:32:17,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:32:17,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 03:32:17,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:32:17,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 03:32:17,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-13 03:32:17,008 INFO L87 Difference]: Start difference. First operand 80 states and 115 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-13 03:32:17,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:32:17,919 INFO L93 Difference]: Finished difference Result 110 states and 147 transitions. [2024-10-13 03:32:17,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 03:32:17,920 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 136 [2024-10-13 03:32:17,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:32:17,921 INFO L225 Difference]: With dead ends: 110 [2024-10-13 03:32:17,922 INFO L226 Difference]: Without dead ends: 108 [2024-10-13 03:32:17,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-10-13 03:32:17,928 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 68 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 03:32:17,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 243 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 03:32:17,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-13 03:32:17,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 81. [2024-10-13 03:32:17,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 50 states have internal predecessors, (63), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-13 03:32:17,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 117 transitions. [2024-10-13 03:32:17,967 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 117 transitions. Word has length 136 [2024-10-13 03:32:17,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:32:17,968 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 117 transitions. [2024-10-13 03:32:17,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-13 03:32:17,968 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 117 transitions. [2024-10-13 03:32:17,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-13 03:32:17,970 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:32:17,970 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:32:17,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 03:32:17,970 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:32:17,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:32:17,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1809950769, now seen corresponding path program 1 times [2024-10-13 03:32:17,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:32:17,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909721520] [2024-10-13 03:32:17,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:32:17,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:32:18,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:20,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:32:20,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:20,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:32:20,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:20,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:32:20,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:20,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:32:20,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:20,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:32:20,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:20,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:32:20,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:20,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:32:20,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:20,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:32:20,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:20,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:32:20,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:20,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:32:20,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:20,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:32:20,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:20,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:32:20,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:20,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:32:20,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:20,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:32:20,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:20,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:32:20,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:20,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:32:20,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:20,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:32:20,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:20,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:32:20,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:20,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 03:32:20,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:20,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:32:20,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:20,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 03:32:20,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:20,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 03:32:20,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:20,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 03:32:20,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:20,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-13 03:32:20,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:32:20,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909721520] [2024-10-13 03:32:20,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909721520] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:32:20,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:32:20,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 03:32:20,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339569451] [2024-10-13 03:32:20,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:32:20,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 03:32:20,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:32:20,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 03:32:20,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 03:32:20,949 INFO L87 Difference]: Start difference. First operand 81 states and 117 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-13 03:32:21,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:32:21,378 INFO L93 Difference]: Finished difference Result 124 states and 163 transitions. [2024-10-13 03:32:21,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 03:32:21,378 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 136 [2024-10-13 03:32:21,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:32:21,380 INFO L225 Difference]: With dead ends: 124 [2024-10-13 03:32:21,380 INFO L226 Difference]: Without dead ends: 122 [2024-10-13 03:32:21,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-13 03:32:21,380 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 65 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 03:32:21,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 390 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 03:32:21,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-10-13 03:32:21,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 78. [2024-10-13 03:32:21,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 47 states have internal predecessors, (57), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-13 03:32:21,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 111 transitions. [2024-10-13 03:32:21,394 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 111 transitions. Word has length 136 [2024-10-13 03:32:21,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:32:21,394 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 111 transitions. [2024-10-13 03:32:21,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-13 03:32:21,395 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 111 transitions. [2024-10-13 03:32:21,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-13 03:32:21,395 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:32:21,395 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:32:21,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 03:32:21,396 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:32:21,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:32:21,396 INFO L85 PathProgramCache]: Analyzing trace with hash -2047504203, now seen corresponding path program 1 times [2024-10-13 03:32:21,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:32:21,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515518726] [2024-10-13 03:32:21,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:32:21,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:32:21,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:26,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:32:26,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:26,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:32:26,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:26,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:32:26,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:26,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:32:26,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:26,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:32:26,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:26,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:32:26,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:26,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:32:26,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:26,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:32:26,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:26,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:32:26,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:26,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:32:26,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:26,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:32:26,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:26,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:32:26,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:26,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:32:26,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:26,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:32:26,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:26,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:32:26,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:26,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:32:26,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:26,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:32:26,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:26,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:32:26,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:26,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 03:32:26,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:26,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:32:26,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:26,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 03:32:26,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:26,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 03:32:26,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:26,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 03:32:26,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:26,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-13 03:32:26,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:32:26,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515518726] [2024-10-13 03:32:26,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515518726] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:32:26,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:32:26,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 03:32:26,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906482380] [2024-10-13 03:32:26,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:32:26,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 03:32:26,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:32:26,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 03:32:26,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-13 03:32:26,722 INFO L87 Difference]: Start difference. First operand 78 states and 111 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-13 03:32:28,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:32:28,590 INFO L93 Difference]: Finished difference Result 180 states and 250 transitions. [2024-10-13 03:32:28,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 03:32:28,591 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 136 [2024-10-13 03:32:28,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:32:28,592 INFO L225 Difference]: With dead ends: 180 [2024-10-13 03:32:28,592 INFO L226 Difference]: Without dead ends: 113 [2024-10-13 03:32:28,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2024-10-13 03:32:28,593 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 66 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:32:28,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 361 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 03:32:28,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-13 03:32:28,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 78. [2024-10-13 03:32:28,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 47 states have internal predecessors, (57), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-13 03:32:28,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 111 transitions. [2024-10-13 03:32:28,631 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 111 transitions. Word has length 136 [2024-10-13 03:32:28,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:32:28,631 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 111 transitions. [2024-10-13 03:32:28,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-13 03:32:28,632 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 111 transitions. [2024-10-13 03:32:28,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-13 03:32:28,632 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:32:28,632 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:32:28,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 03:32:28,633 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:32:28,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:32:28,633 INFO L85 PathProgramCache]: Analyzing trace with hash -2049351245, now seen corresponding path program 1 times [2024-10-13 03:32:28,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:32:28,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061679702] [2024-10-13 03:32:28,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:32:28,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:32:28,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:36,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:32:36,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:36,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:32:36,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:36,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:32:36,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:36,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:32:36,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:36,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:32:36,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:36,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:32:36,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:36,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:32:36,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:36,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:32:36,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:36,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:32:36,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:36,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:32:36,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:36,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:32:36,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:36,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:32:36,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:36,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:32:36,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:36,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:32:36,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:36,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:32:36,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:36,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:32:36,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:36,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:32:36,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:36,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:32:36,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:36,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 03:32:36,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:36,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:32:36,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:36,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 03:32:36,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:36,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 03:32:36,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:36,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 03:32:36,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:36,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-13 03:32:36,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:32:36,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061679702] [2024-10-13 03:32:36,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061679702] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:32:36,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:32:36,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 03:32:36,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850416580] [2024-10-13 03:32:36,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:32:36,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 03:32:36,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:32:36,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 03:32:36,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-13 03:32:36,512 INFO L87 Difference]: Start difference. First operand 78 states and 111 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-13 03:32:39,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:32:39,126 INFO L93 Difference]: Finished difference Result 111 states and 148 transitions. [2024-10-13 03:32:39,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 03:32:39,126 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 136 [2024-10-13 03:32:39,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:32:39,128 INFO L225 Difference]: With dead ends: 111 [2024-10-13 03:32:39,128 INFO L226 Difference]: Without dead ends: 109 [2024-10-13 03:32:39,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2024-10-13 03:32:39,129 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 59 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-13 03:32:39,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 312 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-13 03:32:39,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-13 03:32:39,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 74. [2024-10-13 03:32:39,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 43 states have internal predecessors, (50), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-13 03:32:39,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 104 transitions. [2024-10-13 03:32:39,147 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 104 transitions. Word has length 136 [2024-10-13 03:32:39,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:32:39,147 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 104 transitions. [2024-10-13 03:32:39,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-13 03:32:39,148 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 104 transitions. [2024-10-13 03:32:39,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-13 03:32:39,148 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:32:39,149 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:32:39,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 03:32:39,149 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:32:39,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:32:39,149 INFO L85 PathProgramCache]: Analyzing trace with hash 214008004, now seen corresponding path program 1 times [2024-10-13 03:32:39,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:32:39,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596525828] [2024-10-13 03:32:39,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:32:39,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:32:39,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:48,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:32:48,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:48,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:32:48,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:48,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:32:48,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:48,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:32:48,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:48,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:32:48,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:48,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:32:48,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:48,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:32:48,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:48,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:32:48,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:48,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:32:48,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:48,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:32:48,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:48,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:32:48,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:48,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:32:48,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:48,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:32:48,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:48,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:32:48,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:48,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:32:48,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:48,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:32:48,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:48,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:32:48,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:48,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:32:48,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:48,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 03:32:48,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:48,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:32:48,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:48,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 03:32:48,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:48,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 03:32:48,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:48,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 03:32:48,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:32:48,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-13 03:32:48,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:32:48,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596525828] [2024-10-13 03:32:48,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596525828] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:32:48,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:32:48,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 03:32:48,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677359811] [2024-10-13 03:32:48,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:32:48,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 03:32:48,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:32:48,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 03:32:48,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-13 03:32:48,074 INFO L87 Difference]: Start difference. First operand 74 states and 104 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)