./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_variablewrapping_wrapper-sp_file-13.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-13.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 51f066b986277b9680a73b6d055c2daa6e446ab9f6af3f7045f30460b8f2f21f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:56:03,575 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:56:03,645 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 13:56:03,650 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:56:03,651 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:56:03,681 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:56:03,682 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:56:03,683 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:56:03,683 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:56:03,683 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:56:03,684 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:56:03,684 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:56:03,685 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:56:03,685 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:56:03,685 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:56:03,685 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:56:03,686 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:56:03,689 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:56:03,690 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 13:56:03,690 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:56:03,694 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:56:03,695 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:56:03,695 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:56:03,695 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:56:03,695 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:56:03,696 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:56:03,696 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:56:03,696 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:56:03,696 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:56:03,696 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:56:03,697 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:56:03,697 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:56:03,697 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:56:03,697 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:56:03,697 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:56:03,698 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:56:03,698 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 13:56:03,699 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 13:56:03,700 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:56:03,700 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:56:03,701 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:56:03,701 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:56:03,701 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 51f066b986277b9680a73b6d055c2daa6e446ab9f6af3f7045f30460b8f2f21f [2024-10-11 13:56:03,983 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:56:04,029 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:56:04,037 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:56:04,041 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:56:04,043 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:56:04,044 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-13.i [2024-10-11 13:56:05,445 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:56:05,685 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:56:05,686 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-13.i [2024-10-11 13:56:05,696 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9ecbbc326/52435534f6f84c9aa94c7d1a2d498989/FLAG7c5eb7b93 [2024-10-11 13:56:05,710 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9ecbbc326/52435534f6f84c9aa94c7d1a2d498989 [2024-10-11 13:56:05,713 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:56:05,714 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:56:05,715 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:56:05,715 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:56:05,721 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:56:05,722 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:56:05" (1/1) ... [2024-10-11 13:56:05,723 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57ebdfee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:56:05, skipping insertion in model container [2024-10-11 13:56:05,723 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:56:05" (1/1) ... [2024-10-11 13:56:05,752 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:56:05,921 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_variablewrapping_wrapper-sp_file-13.i[917,930] [2024-10-11 13:56:06,014 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:56:06,030 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:56:06,045 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_variablewrapping_wrapper-sp_file-13.i[917,930] [2024-10-11 13:56:06,097 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:56:06,128 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:56:06,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:56:06 WrapperNode [2024-10-11 13:56:06,129 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:56:06,130 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:56:06,131 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:56:06,131 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:56:06,138 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:56:06" (1/1) ... [2024-10-11 13:56:06,159 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:56:06" (1/1) ... [2024-10-11 13:56:06,212 INFO L138 Inliner]: procedures = 29, calls = 142, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 480 [2024-10-11 13:56:06,214 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:56:06,215 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:56:06,215 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:56:06,215 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:56:06,227 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:56:06" (1/1) ... [2024-10-11 13:56:06,227 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:56:06" (1/1) ... [2024-10-11 13:56:06,233 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:56:06" (1/1) ... [2024-10-11 13:56:06,260 INFO L175 MemorySlicer]: Split 115 memory accesses to 2 slices as follows [2, 113]. 98 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 13]. The 15 writes are split as follows [0, 15]. [2024-10-11 13:56:06,260 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:56:06" (1/1) ... [2024-10-11 13:56:06,261 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:56:06" (1/1) ... [2024-10-11 13:56:06,275 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:56:06" (1/1) ... [2024-10-11 13:56:06,280 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:56:06" (1/1) ... [2024-10-11 13:56:06,283 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:56:06" (1/1) ... [2024-10-11 13:56:06,286 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:56:06" (1/1) ... [2024-10-11 13:56:06,290 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:56:06,292 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:56:06,292 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:56:06,292 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:56:06,296 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:56:06" (1/1) ... [2024-10-11 13:56:06,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:56:06,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:56:06,332 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:56:06,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:56:06,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:56:06,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 13:56:06,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 13:56:06,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-11 13:56:06,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-11 13:56:06,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-11 13:56:06,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-11 13:56:06,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 13:56:06,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 13:56:06,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-11 13:56:06,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-11 13:56:06,393 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:56:06,393 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:56:06,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 13:56:06,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 13:56:06,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:56:06,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:56:06,551 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:56:06,556 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:56:07,123 INFO L? ?]: Removed 126 outVars from TransFormulas that were not future-live. [2024-10-11 13:56:07,123 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:56:07,173 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:56:07,174 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:56:07,174 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:56:07 BoogieIcfgContainer [2024-10-11 13:56:07,174 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:56:07,176 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:56:07,176 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:56:07,180 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:56:07,180 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:56:05" (1/3) ... [2024-10-11 13:56:07,181 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8395737 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:56:07, skipping insertion in model container [2024-10-11 13:56:07,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:56:06" (2/3) ... [2024-10-11 13:56:07,181 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8395737 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:56:07, skipping insertion in model container [2024-10-11 13:56:07,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:56:07" (3/3) ... [2024-10-11 13:56:07,183 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-13.i [2024-10-11 13:56:07,199 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:56:07,200 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:56:07,256 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:56:07,266 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;@773eed99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:56:07,266 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:56:07,271 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 87 states have (on average 1.4827586206896552) internal successors, (129), 88 states have internal predecessors, (129), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 13:56:07,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-11 13:56:07,281 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:56:07,282 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:56:07,283 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:56:07,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:56:07,287 INFO L85 PathProgramCache]: Analyzing trace with hash 813961990, now seen corresponding path program 1 times [2024-10-11 13:56:07,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:56:07,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387567051] [2024-10-11 13:56:07,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:56:07,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:56:07,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:07,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:56:07,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:07,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:56:07,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:07,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:56:07,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:07,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:56:07,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:07,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:56:07,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:07,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:56:07,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:07,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:56:07,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:07,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:56:07,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:07,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:56:07,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:07,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:56:07,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:07,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:56:07,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:07,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:56:07,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:07,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:56:07,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:07,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:56:07,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:07,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:56:07,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:07,806 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:56:07,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:56:07,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387567051] [2024-10-11 13:56:07,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387567051] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:56:07,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:56:07,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:56:07,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385449463] [2024-10-11 13:56:07,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:56:07,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:56:07,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:56:07,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:56:07,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:56:07,851 INFO L87 Difference]: Start difference. First operand has 105 states, 87 states have (on average 1.4827586206896552) internal successors, (129), 88 states have internal predecessors, (129), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 13:56:07,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:56:07,897 INFO L93 Difference]: Finished difference Result 207 states and 331 transitions. [2024-10-11 13:56:07,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:56:07,900 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 126 [2024-10-11 13:56:07,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:56:07,912 INFO L225 Difference]: With dead ends: 207 [2024-10-11 13:56:07,912 INFO L226 Difference]: Without dead ends: 103 [2024-10-11 13:56:07,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:56:07,924 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:56:07,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 150 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:56:07,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-11 13:56:07,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-10-11 13:56:07,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 86 states have (on average 1.441860465116279) internal successors, (124), 86 states have internal predecessors, (124), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 13:56:07,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 154 transitions. [2024-10-11 13:56:07,988 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 154 transitions. Word has length 126 [2024-10-11 13:56:07,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:56:07,991 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 154 transitions. [2024-10-11 13:56:07,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 13:56:07,991 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 154 transitions. [2024-10-11 13:56:07,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-11 13:56:07,996 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:56:07,997 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:56:07,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 13:56:07,998 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:56:07,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:56:07,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1375789232, now seen corresponding path program 1 times [2024-10-11 13:56:07,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:56:07,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261620893] [2024-10-11 13:56:07,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:56:07,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:56:08,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:08,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:56:08,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:08,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:56:08,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:08,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:56:08,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:08,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:56:08,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:08,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:56:08,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:08,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:56:08,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:08,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:56:08,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:08,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:56:08,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:08,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:56:08,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:08,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:56:08,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:08,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:56:08,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:08,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:56:08,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:08,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:56:08,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:08,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:56:08,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:08,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:56:08,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:08,540 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:56:08,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:56:08,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261620893] [2024-10-11 13:56:08,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261620893] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:56:08,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:56:08,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:56:08,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148377355] [2024-10-11 13:56:08,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:56:08,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:56:08,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:56:08,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:56:08,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:56:08,548 INFO L87 Difference]: Start difference. First operand 103 states and 154 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:56:08,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:56:08,613 INFO L93 Difference]: Finished difference Result 207 states and 310 transitions. [2024-10-11 13:56:08,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:56:08,614 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2024-10-11 13:56:08,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:56:08,617 INFO L225 Difference]: With dead ends: 207 [2024-10-11 13:56:08,617 INFO L226 Difference]: Without dead ends: 105 [2024-10-11 13:56:08,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:56:08,619 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:56:08,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 437 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:56:08,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-11 13:56:08,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-10-11 13:56:08,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 88 states have (on average 1.4318181818181819) internal successors, (126), 88 states have internal predecessors, (126), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 13:56:08,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 156 transitions. [2024-10-11 13:56:08,644 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 156 transitions. Word has length 126 [2024-10-11 13:56:08,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:56:08,645 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 156 transitions. [2024-10-11 13:56:08,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:56:08,646 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 156 transitions. [2024-10-11 13:56:08,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-11 13:56:08,651 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:56:08,652 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:56:08,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 13:56:08,652 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:56:08,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:56:08,653 INFO L85 PathProgramCache]: Analyzing trace with hash 322245781, now seen corresponding path program 1 times [2024-10-11 13:56:08,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:56:08,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036097786] [2024-10-11 13:56:08,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:56:08,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:56:08,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:10,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:56:10,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:10,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:56:10,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:10,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:56:10,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:10,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:56:10,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:10,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:56:10,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:10,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:56:10,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:10,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:56:10,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:10,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:56:10,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:10,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:56:10,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:10,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:56:10,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:10,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:56:10,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:10,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:56:10,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:10,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:56:10,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:10,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:56:10,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:10,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:56:10,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:10,284 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:56:10,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:56:10,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036097786] [2024-10-11 13:56:10,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036097786] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:56:10,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:56:10,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 13:56:10,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241324073] [2024-10-11 13:56:10,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:56:10,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 13:56:10,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:56:10,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 13:56:10,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:56:10,293 INFO L87 Difference]: Start difference. First operand 105 states and 156 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 13:56:10,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:56:10,598 INFO L93 Difference]: Finished difference Result 273 states and 407 transitions. [2024-10-11 13:56:10,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:56:10,598 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 128 [2024-10-11 13:56:10,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:56:10,601 INFO L225 Difference]: With dead ends: 273 [2024-10-11 13:56:10,601 INFO L226 Difference]: Without dead ends: 169 [2024-10-11 13:56:10,602 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:56:10,603 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 53 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:56:10,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 412 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:56:10,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-10-11 13:56:10,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 166. [2024-10-11 13:56:10,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 133 states have (on average 1.3984962406015038) internal successors, (186), 133 states have internal predecessors, (186), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 13:56:10,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 246 transitions. [2024-10-11 13:56:10,639 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 246 transitions. Word has length 128 [2024-10-11 13:56:10,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:56:10,640 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 246 transitions. [2024-10-11 13:56:10,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 13:56:10,640 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 246 transitions. [2024-10-11 13:56:10,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-11 13:56:10,645 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:56:10,646 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:56:10,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 13:56:10,646 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:56:10,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:56:10,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1366697961, now seen corresponding path program 1 times [2024-10-11 13:56:10,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:56:10,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971251945] [2024-10-11 13:56:10,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:56:10,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:56:10,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:10,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:56:10,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:11,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:56:11,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:11,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:56:11,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:11,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:56:11,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:11,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:56:11,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:11,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:56:11,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:11,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:56:11,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:11,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:56:11,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:11,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:56:11,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:11,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:56:11,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:11,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:56:11,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:11,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:56:11,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:11,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:56:11,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:11,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:56:11,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:11,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:56:11,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:11,065 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:56:11,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:56:11,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971251945] [2024-10-11 13:56:11,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971251945] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:56:11,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:56:11,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:56:11,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125685343] [2024-10-11 13:56:11,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:56:11,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:56:11,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:56:11,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:56:11,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:56:11,070 INFO L87 Difference]: Start difference. First operand 166 states and 246 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:56:11,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:56:11,165 INFO L93 Difference]: Finished difference Result 270 states and 401 transitions. [2024-10-11 13:56:11,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:56:11,166 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 128 [2024-10-11 13:56:11,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:56:11,168 INFO L225 Difference]: With dead ends: 270 [2024-10-11 13:56:11,168 INFO L226 Difference]: Without dead ends: 166 [2024-10-11 13:56:11,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:56:11,170 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 4 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:56:11,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 375 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:56:11,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-10-11 13:56:11,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2024-10-11 13:56:11,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 133 states have (on average 1.3909774436090225) internal successors, (185), 133 states have internal predecessors, (185), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 13:56:11,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 245 transitions. [2024-10-11 13:56:11,195 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 245 transitions. Word has length 128 [2024-10-11 13:56:11,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:56:11,196 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 245 transitions. [2024-10-11 13:56:11,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:56:11,197 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 245 transitions. [2024-10-11 13:56:11,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-11 13:56:11,198 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:56:11,198 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:56:11,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 13:56:11,201 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:56:11,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:56:11,201 INFO L85 PathProgramCache]: Analyzing trace with hash -665633383, now seen corresponding path program 1 times [2024-10-11 13:56:11,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:56:11,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543665029] [2024-10-11 13:56:11,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:56:11,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:56:11,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:13,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:56:13,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:13,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:56:13,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:13,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:56:13,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:13,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:56:13,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:13,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:56:13,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:13,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:56:13,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:13,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:56:13,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:13,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:56:13,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:13,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:56:13,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:13,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:56:13,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:13,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:56:13,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:13,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:56:13,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:13,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:56:13,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:13,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:56:13,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:13,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:56:13,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:13,114 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:56:13,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:56:13,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543665029] [2024-10-11 13:56:13,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543665029] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:56:13,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:56:13,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 13:56:13,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601826496] [2024-10-11 13:56:13,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:56:13,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 13:56:13,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:56:13,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 13:56:13,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 13:56:13,119 INFO L87 Difference]: Start difference. First operand 166 states and 245 transitions. Second operand has 11 states, 10 states have (on average 5.6) internal successors, (56), 11 states have internal predecessors, (56), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-11 13:56:13,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:56:13,751 INFO L93 Difference]: Finished difference Result 314 states and 463 transitions. [2024-10-11 13:56:13,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:56:13,752 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.6) internal successors, (56), 11 states have internal predecessors, (56), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 128 [2024-10-11 13:56:13,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:56:13,754 INFO L225 Difference]: With dead ends: 314 [2024-10-11 13:56:13,754 INFO L226 Difference]: Without dead ends: 210 [2024-10-11 13:56:13,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2024-10-11 13:56:13,757 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 379 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 13:56:13,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 398 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 13:56:13,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-10-11 13:56:13,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 171. [2024-10-11 13:56:13,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 138 states have (on average 1.391304347826087) internal successors, (192), 138 states have internal predecessors, (192), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 13:56:13,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 252 transitions. [2024-10-11 13:56:13,791 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 252 transitions. Word has length 128 [2024-10-11 13:56:13,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:56:13,793 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 252 transitions. [2024-10-11 13:56:13,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.6) internal successors, (56), 11 states have internal predecessors, (56), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-11 13:56:13,794 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 252 transitions. [2024-10-11 13:56:13,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-11 13:56:13,795 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:56:13,795 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:56:13,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 13:56:13,798 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:56:13,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:56:13,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1686701737, now seen corresponding path program 1 times [2024-10-11 13:56:13,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:56:13,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929706891] [2024-10-11 13:56:13,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:56:13,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:56:13,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:14,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:56:14,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:14,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:56:14,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:14,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:56:14,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:14,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:56:14,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:14,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:56:14,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:14,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:56:14,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:14,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:56:14,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:14,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:56:14,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:14,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:56:14,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:14,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:56:14,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:14,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:56:14,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:14,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:56:14,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:14,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:56:14,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:14,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:56:14,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:14,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:56:14,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:14,088 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:56:14,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:56:14,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929706891] [2024-10-11 13:56:14,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929706891] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:56:14,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:56:14,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:56:14,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106640374] [2024-10-11 13:56:14,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:56:14,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:56:14,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:56:14,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:56:14,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:56:14,090 INFO L87 Difference]: Start difference. First operand 171 states and 252 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:56:14,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:56:14,259 INFO L93 Difference]: Finished difference Result 313 states and 461 transitions. [2024-10-11 13:56:14,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:56:14,260 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 128 [2024-10-11 13:56:14,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:56:14,262 INFO L225 Difference]: With dead ends: 313 [2024-10-11 13:56:14,262 INFO L226 Difference]: Without dead ends: 204 [2024-10-11 13:56:14,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:56:14,265 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 91 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:56:14,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 403 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:56:14,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-10-11 13:56:14,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 175. [2024-10-11 13:56:14,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 142 states have (on average 1.3943661971830985) internal successors, (198), 142 states have internal predecessors, (198), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 13:56:14,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 258 transitions. [2024-10-11 13:56:14,297 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 258 transitions. Word has length 128 [2024-10-11 13:56:14,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:56:14,297 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 258 transitions. [2024-10-11 13:56:14,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:56:14,298 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 258 transitions. [2024-10-11 13:56:14,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-11 13:56:14,299 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:56:14,299 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:56:14,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 13:56:14,300 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:56:14,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:56:14,300 INFO L85 PathProgramCache]: Analyzing trace with hash 625492444, now seen corresponding path program 1 times [2024-10-11 13:56:14,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:56:14,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023633763] [2024-10-11 13:56:14,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:56:14,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:56:14,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:14,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:56:14,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:14,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:56:14,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:14,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:56:14,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:14,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:56:14,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:14,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:56:14,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:14,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:56:14,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:14,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:56:14,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:14,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:56:14,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:14,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:56:14,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:14,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:56:14,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:14,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:56:14,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:14,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:56:14,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:14,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:56:14,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:14,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:56:14,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:14,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:56:14,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:14,529 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:56:14,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:56:14,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023633763] [2024-10-11 13:56:14,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023633763] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:56:14,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:56:14,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:56:14,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042077787] [2024-10-11 13:56:14,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:56:14,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 13:56:14,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:56:14,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 13:56:14,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:56:14,531 INFO L87 Difference]: Start difference. First operand 175 states and 258 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:56:14,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:56:14,565 INFO L93 Difference]: Finished difference Result 286 states and 422 transitions. [2024-10-11 13:56:14,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 13:56:14,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2024-10-11 13:56:14,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:56:14,567 INFO L225 Difference]: With dead ends: 286 [2024-10-11 13:56:14,567 INFO L226 Difference]: Without dead ends: 173 [2024-10-11 13:56:14,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:56:14,568 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:56:14,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 284 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:56:14,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-10-11 13:56:14,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2024-10-11 13:56:14,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 140 states have (on average 1.3785714285714286) internal successors, (193), 140 states have internal predecessors, (193), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 13:56:14,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 253 transitions. [2024-10-11 13:56:14,587 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 253 transitions. Word has length 129 [2024-10-11 13:56:14,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:56:14,588 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 253 transitions. [2024-10-11 13:56:14,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:56:14,588 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 253 transitions. [2024-10-11 13:56:14,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-11 13:56:14,590 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:56:14,590 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:56:14,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 13:56:14,590 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:56:14,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:56:14,591 INFO L85 PathProgramCache]: Analyzing trace with hash 58019569, now seen corresponding path program 1 times [2024-10-11 13:56:14,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:56:14,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354230762] [2024-10-11 13:56:14,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:56:14,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:56:14,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:14,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:56:14,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:14,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:56:14,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:14,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:56:14,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:14,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:56:14,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:14,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:56:14,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:14,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:56:14,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:14,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:56:14,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:14,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:56:14,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:14,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:56:14,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:14,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:56:14,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:14,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:56:14,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:14,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:56:14,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:14,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:56:14,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:14,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:56:14,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:14,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:56:14,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:14,988 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:56:14,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:56:14,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354230762] [2024-10-11 13:56:14,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354230762] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:56:14,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:56:14,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 13:56:14,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110710308] [2024-10-11 13:56:14,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:56:14,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 13:56:14,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:56:14,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 13:56:14,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:56:14,991 INFO L87 Difference]: Start difference. First operand 173 states and 253 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:56:15,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:56:15,271 INFO L93 Difference]: Finished difference Result 332 states and 481 transitions. [2024-10-11 13:56:15,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:56:15,272 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2024-10-11 13:56:15,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:56:15,275 INFO L225 Difference]: With dead ends: 332 [2024-10-11 13:56:15,275 INFO L226 Difference]: Without dead ends: 221 [2024-10-11 13:56:15,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 13:56:15,277 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 195 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:56:15,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 555 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:56:15,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-10-11 13:56:15,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 196. [2024-10-11 13:56:15,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 163 states have (on average 1.3680981595092025) internal successors, (223), 163 states have internal predecessors, (223), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 13:56:15,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 283 transitions. [2024-10-11 13:56:15,302 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 283 transitions. Word has length 129 [2024-10-11 13:56:15,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:56:15,303 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 283 transitions. [2024-10-11 13:56:15,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:56:15,303 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 283 transitions. [2024-10-11 13:56:15,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-11 13:56:15,305 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:56:15,305 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:56:15,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 13:56:15,306 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:56:15,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:56:15,306 INFO L85 PathProgramCache]: Analyzing trace with hash 738077939, now seen corresponding path program 1 times [2024-10-11 13:56:15,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:56:15,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31512218] [2024-10-11 13:56:15,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:56:15,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:56:15,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:15,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:56:15,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:15,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:56:15,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:15,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:56:15,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:15,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:56:15,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:15,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:56:15,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:15,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:56:15,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:15,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:56:15,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:15,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:56:15,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:15,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:56:15,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:15,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:56:15,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:15,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:56:15,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:15,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:56:15,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:15,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:56:15,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:15,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:56:15,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:15,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:56:15,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:15,407 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:56:15,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:56:15,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31512218] [2024-10-11 13:56:15,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31512218] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:56:15,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:56:15,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:56:15,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779699382] [2024-10-11 13:56:15,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:56:15,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 13:56:15,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:56:15,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 13:56:15,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:56:15,410 INFO L87 Difference]: Start difference. First operand 196 states and 283 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:56:15,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:56:15,443 INFO L93 Difference]: Finished difference Result 332 states and 479 transitions. [2024-10-11 13:56:15,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 13:56:15,444 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2024-10-11 13:56:15,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:56:15,446 INFO L225 Difference]: With dead ends: 332 [2024-10-11 13:56:15,446 INFO L226 Difference]: Without dead ends: 198 [2024-10-11 13:56:15,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:56:15,449 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:56:15,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 283 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:56:15,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-10-11 13:56:15,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2024-10-11 13:56:15,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 165 states have (on average 1.3636363636363635) internal successors, (225), 165 states have internal predecessors, (225), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 13:56:15,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 285 transitions. [2024-10-11 13:56:15,475 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 285 transitions. Word has length 129 [2024-10-11 13:56:15,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:56:15,476 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 285 transitions. [2024-10-11 13:56:15,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:56:15,476 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 285 transitions. [2024-10-11 13:56:15,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-11 13:56:15,478 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:56:15,478 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:56:15,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 13:56:15,478 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:56:15,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:56:15,479 INFO L85 PathProgramCache]: Analyzing trace with hash 345050929, now seen corresponding path program 1 times [2024-10-11 13:56:15,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:56:15,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839084341] [2024-10-11 13:56:15,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:56:15,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:56:15,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:16,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:56:16,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:16,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:56:16,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:16,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:56:16,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:16,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:56:16,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:16,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:56:16,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:16,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:56:16,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:16,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:56:16,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:16,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:56:16,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:16,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:56:16,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:16,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:56:16,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:16,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:56:16,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:16,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:56:16,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:16,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:56:16,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:16,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:56:16,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:16,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:56:16,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:16,657 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:56:16,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:56:16,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839084341] [2024-10-11 13:56:16,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839084341] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:56:16,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:56:16,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 13:56:16,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33724482] [2024-10-11 13:56:16,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:56:16,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 13:56:16,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:56:16,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 13:56:16,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:56:16,660 INFO L87 Difference]: Start difference. First operand 198 states and 285 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:56:17,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:56:17,299 INFO L93 Difference]: Finished difference Result 432 states and 611 transitions. [2024-10-11 13:56:17,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 13:56:17,300 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2024-10-11 13:56:17,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:56:17,303 INFO L225 Difference]: With dead ends: 432 [2024-10-11 13:56:17,303 INFO L226 Difference]: Without dead ends: 296 [2024-10-11 13:56:17,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2024-10-11 13:56:17,305 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 274 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 13:56:17,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 507 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 13:56:17,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-10-11 13:56:17,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 216. [2024-10-11 13:56:17,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 183 states have (on average 1.360655737704918) internal successors, (249), 183 states have internal predecessors, (249), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 13:56:17,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 309 transitions. [2024-10-11 13:56:17,336 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 309 transitions. Word has length 129 [2024-10-11 13:56:17,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:56:17,337 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 309 transitions. [2024-10-11 13:56:17,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:56:17,337 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 309 transitions. [2024-10-11 13:56:17,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-11 13:56:17,338 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:56:17,338 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:56:17,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 13:56:17,339 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:56:17,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:56:17,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1630924173, now seen corresponding path program 1 times [2024-10-11 13:56:17,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:56:17,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007471894] [2024-10-11 13:56:17,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:56:17,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:56:17,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:18,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:56:18,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:18,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:56:18,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:18,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:56:18,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:18,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:56:18,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:18,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:56:18,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:18,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:56:18,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:18,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:56:18,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:18,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:56:18,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:18,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:56:18,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:18,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:56:18,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:18,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:56:18,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:18,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:56:18,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:18,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:56:18,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:18,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:56:18,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:18,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:56:18,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:18,441 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:56:18,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:56:18,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007471894] [2024-10-11 13:56:18,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007471894] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:56:18,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:56:18,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 13:56:18,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330442346] [2024-10-11 13:56:18,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:56:18,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:56:18,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:56:18,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:56:18,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:56:18,444 INFO L87 Difference]: Start difference. First operand 216 states and 309 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 13:56:18,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:56:18,798 INFO L93 Difference]: Finished difference Result 492 states and 701 transitions. [2024-10-11 13:56:18,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:56:18,799 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 129 [2024-10-11 13:56:18,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:56:18,801 INFO L225 Difference]: With dead ends: 492 [2024-10-11 13:56:18,801 INFO L226 Difference]: Without dead ends: 342 [2024-10-11 13:56:18,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:56:18,804 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 334 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:56:18,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 377 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:56:18,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2024-10-11 13:56:18,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 336. [2024-10-11 13:56:18,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 287 states have (on average 1.3519163763066202) internal successors, (388), 287 states have internal predecessors, (388), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-11 13:56:18,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 478 transitions. [2024-10-11 13:56:18,856 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 478 transitions. Word has length 129 [2024-10-11 13:56:18,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:56:18,856 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 478 transitions. [2024-10-11 13:56:18,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 13:56:18,857 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 478 transitions. [2024-10-11 13:56:18,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-11 13:56:18,858 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:56:18,858 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:56:18,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 13:56:18,859 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:56:18,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:56:18,860 INFO L85 PathProgramCache]: Analyzing trace with hash -2023951183, now seen corresponding path program 1 times [2024-10-11 13:56:18,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:56:18,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859184269] [2024-10-11 13:56:18,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:56:18,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:56:18,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:19,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:56:19,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:19,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:56:19,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:19,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:56:19,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:19,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:56:19,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:19,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:56:19,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:19,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:56:19,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:19,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:56:19,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:19,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:56:19,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:19,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:56:19,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:19,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:56:19,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:19,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:56:19,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:19,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:56:19,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:19,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:56:19,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:19,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:56:19,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:19,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:56:19,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:19,776 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:56:19,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:56:19,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859184269] [2024-10-11 13:56:19,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859184269] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:56:19,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:56:19,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 13:56:19,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643090634] [2024-10-11 13:56:19,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:56:19,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 13:56:19,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:56:19,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 13:56:19,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:56:19,779 INFO L87 Difference]: Start difference. First operand 336 states and 478 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:56:20,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:56:20,498 INFO L93 Difference]: Finished difference Result 750 states and 1057 transitions. [2024-10-11 13:56:20,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 13:56:20,499 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2024-10-11 13:56:20,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:56:20,505 INFO L225 Difference]: With dead ends: 750 [2024-10-11 13:56:20,505 INFO L226 Difference]: Without dead ends: 480 [2024-10-11 13:56:20,506 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-10-11 13:56:20,507 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 297 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 13:56:20,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 515 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 13:56:20,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2024-10-11 13:56:20,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 358. [2024-10-11 13:56:20,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 309 states have (on average 1.343042071197411) internal successors, (415), 309 states have internal predecessors, (415), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-11 13:56:20,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 505 transitions. [2024-10-11 13:56:20,547 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 505 transitions. Word has length 129 [2024-10-11 13:56:20,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:56:20,548 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 505 transitions. [2024-10-11 13:56:20,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:56:20,548 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 505 transitions. [2024-10-11 13:56:20,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-11 13:56:20,549 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:56:20,550 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:56:20,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 13:56:20,550 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:56:20,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:56:20,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1343892813, now seen corresponding path program 1 times [2024-10-11 13:56:20,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:56:20,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963380291] [2024-10-11 13:56:20,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:56:20,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:56:20,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:20,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:56:20,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:20,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:56:20,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:20,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:56:20,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:20,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:56:20,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:20,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:56:20,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:20,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:56:20,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:20,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:56:20,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:20,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:56:20,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:20,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:56:20,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:20,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:56:20,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:20,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:56:20,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:20,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:56:20,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:20,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:56:20,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:20,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:56:20,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:20,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:56:20,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:20,853 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:56:20,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:56:20,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963380291] [2024-10-11 13:56:20,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963380291] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:56:20,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:56:20,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:56:20,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054098715] [2024-10-11 13:56:20,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:56:20,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:56:20,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:56:20,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:56:20,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:56:20,856 INFO L87 Difference]: Start difference. First operand 358 states and 505 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:56:21,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:56:21,058 INFO L93 Difference]: Finished difference Result 713 states and 1003 transitions. [2024-10-11 13:56:21,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:56:21,059 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2024-10-11 13:56:21,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:56:21,062 INFO L225 Difference]: With dead ends: 713 [2024-10-11 13:56:21,062 INFO L226 Difference]: Without dead ends: 421 [2024-10-11 13:56:21,063 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:56:21,064 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 45 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:56:21,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 763 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:56:21,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-10-11 13:56:21,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 368. [2024-10-11 13:56:21,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 319 states have (on average 1.3448275862068966) internal successors, (429), 319 states have internal predecessors, (429), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-11 13:56:21,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 519 transitions. [2024-10-11 13:56:21,101 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 519 transitions. Word has length 129 [2024-10-11 13:56:21,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:56:21,103 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 519 transitions. [2024-10-11 13:56:21,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:56:21,103 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 519 transitions. [2024-10-11 13:56:21,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-11 13:56:21,105 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:56:21,105 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:56:21,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 13:56:21,106 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:56:21,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:56:21,106 INFO L85 PathProgramCache]: Analyzing trace with hash 211037423, now seen corresponding path program 1 times [2024-10-11 13:56:21,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:56:21,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286894426] [2024-10-11 13:56:21,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:56:21,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:56:21,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:22,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:56:22,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:22,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:56:22,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:22,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:56:22,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:22,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:56:22,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:22,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:56:22,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:22,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:56:22,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:22,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:56:22,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:22,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:56:22,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:22,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:56:22,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:22,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:56:22,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:22,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:56:22,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:22,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:56:22,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:22,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:56:22,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:22,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:56:22,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:22,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:56:22,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:22,586 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:56:22,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:56:22,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286894426] [2024-10-11 13:56:22,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286894426] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:56:22,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:56:22,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 13:56:22,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955977648] [2024-10-11 13:56:22,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:56:22,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 13:56:22,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:56:22,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 13:56:22,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:56:22,590 INFO L87 Difference]: Start difference. First operand 368 states and 519 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 13:56:23,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:56:23,639 INFO L93 Difference]: Finished difference Result 818 states and 1148 transitions. [2024-10-11 13:56:23,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 13:56:23,640 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 129 [2024-10-11 13:56:23,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:56:23,644 INFO L225 Difference]: With dead ends: 818 [2024-10-11 13:56:23,644 INFO L226 Difference]: Without dead ends: 516 [2024-10-11 13:56:23,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-11 13:56:23,645 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 325 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 13:56:23,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 759 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 13:56:23,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2024-10-11 13:56:23,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 484. [2024-10-11 13:56:23,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 419 states have (on average 1.3412887828162292) internal successors, (562), 419 states have internal predecessors, (562), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 13:56:23,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 682 transitions. [2024-10-11 13:56:23,683 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 682 transitions. Word has length 129 [2024-10-11 13:56:23,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:56:23,684 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 682 transitions. [2024-10-11 13:56:23,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 13:56:23,684 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 682 transitions. [2024-10-11 13:56:23,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-11 13:56:23,685 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:56:23,686 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:56:23,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 13:56:23,686 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:56:23,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:56:23,687 INFO L85 PathProgramCache]: Analyzing trace with hash 2137002607, now seen corresponding path program 1 times [2024-10-11 13:56:23,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:56:23,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135674942] [2024-10-11 13:56:23,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:56:23,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:56:23,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:25,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:56:25,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:25,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:56:25,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:25,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:56:25,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:25,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:56:25,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:25,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:56:25,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:25,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:56:25,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:25,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:56:25,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:25,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:56:25,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:25,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:56:25,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:25,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:56:25,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:25,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:56:25,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:25,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:56:25,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:25,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:56:25,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:25,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:56:25,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:25,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:56:25,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:25,280 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:56:25,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:56:25,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135674942] [2024-10-11 13:56:25,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135674942] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:56:25,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:56:25,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 13:56:25,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462565756] [2024-10-11 13:56:25,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:56:25,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 13:56:25,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:56:25,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 13:56:25,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:56:25,282 INFO L87 Difference]: Start difference. First operand 484 states and 682 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 13:56:26,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:56:26,101 INFO L93 Difference]: Finished difference Result 933 states and 1309 transitions. [2024-10-11 13:56:26,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:56:26,101 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 129 [2024-10-11 13:56:26,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:56:26,104 INFO L225 Difference]: With dead ends: 933 [2024-10-11 13:56:26,104 INFO L226 Difference]: Without dead ends: 515 [2024-10-11 13:56:26,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-11 13:56:26,108 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 302 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 13:56:26,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 675 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 13:56:26,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2024-10-11 13:56:26,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 484. [2024-10-11 13:56:26,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 419 states have (on average 1.3389021479713603) internal successors, (561), 419 states have internal predecessors, (561), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 13:56:26,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 681 transitions. [2024-10-11 13:56:26,145 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 681 transitions. Word has length 129 [2024-10-11 13:56:26,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:56:26,145 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 681 transitions. [2024-10-11 13:56:26,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 13:56:26,146 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 681 transitions. [2024-10-11 13:56:26,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-11 13:56:26,147 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:56:26,147 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:56:26,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 13:56:26,147 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:56:26,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:56:26,148 INFO L85 PathProgramCache]: Analyzing trace with hash 285886270, now seen corresponding path program 1 times [2024-10-11 13:56:26,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:56:26,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580549028] [2024-10-11 13:56:26,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:56:26,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:56:26,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:26,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:56:26,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:26,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:56:26,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:26,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:56:26,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:26,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:56:26,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:26,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:56:26,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:26,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:56:26,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:26,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:56:26,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:26,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:56:26,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:26,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:56:26,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:26,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:56:26,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:26,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:56:26,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:26,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:56:26,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:26,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:56:26,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:26,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:56:26,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:26,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:56:26,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:26,581 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:56:26,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:56:26,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580549028] [2024-10-11 13:56:26,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580549028] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:56:26,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:56:26,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 13:56:26,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541492251] [2024-10-11 13:56:26,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:56:26,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:56:26,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:56:26,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:56:26,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:56:26,585 INFO L87 Difference]: Start difference. First operand 484 states and 681 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 13:56:27,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:56:27,023 INFO L93 Difference]: Finished difference Result 699 states and 983 transitions. [2024-10-11 13:56:27,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:56:27,024 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 130 [2024-10-11 13:56:27,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:56:27,027 INFO L225 Difference]: With dead ends: 699 [2024-10-11 13:56:27,027 INFO L226 Difference]: Without dead ends: 528 [2024-10-11 13:56:27,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-10-11 13:56:27,028 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 183 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:56:27,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 385 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:56:27,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2024-10-11 13:56:27,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 488. [2024-10-11 13:56:27,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 423 states have (on average 1.3380614657210401) internal successors, (566), 423 states have internal predecessors, (566), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 13:56:27,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 686 transitions. [2024-10-11 13:56:27,075 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 686 transitions. Word has length 130 [2024-10-11 13:56:27,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:56:27,076 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 686 transitions. [2024-10-11 13:56:27,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 13:56:27,076 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 686 transitions. [2024-10-11 13:56:27,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-11 13:56:27,077 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:56:27,078 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:56:27,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 13:56:27,078 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:56:27,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:56:27,078 INFO L85 PathProgramCache]: Analyzing trace with hash -368392750, now seen corresponding path program 1 times [2024-10-11 13:56:27,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:56:27,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662660592] [2024-10-11 13:56:27,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:56:27,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:56:27,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:27,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:56:27,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:27,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:56:27,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:27,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:56:27,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:27,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:56:27,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:27,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:56:27,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:27,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:56:27,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:27,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:56:27,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:27,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:56:27,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:27,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:56:27,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:27,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:56:27,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:27,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:56:27,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:27,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:56:27,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:27,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:56:27,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:27,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:56:27,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:27,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:56:27,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:27,429 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:56:27,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:56:27,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662660592] [2024-10-11 13:56:27,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662660592] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:56:27,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:56:27,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 13:56:27,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667705170] [2024-10-11 13:56:27,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:56:27,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 13:56:27,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:56:27,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 13:56:27,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:56:27,433 INFO L87 Difference]: Start difference. First operand 488 states and 686 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:56:27,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:56:27,660 INFO L93 Difference]: Finished difference Result 668 states and 940 transitions. [2024-10-11 13:56:27,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:56:27,661 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2024-10-11 13:56:27,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:56:27,664 INFO L225 Difference]: With dead ends: 668 [2024-10-11 13:56:27,664 INFO L226 Difference]: Without dead ends: 493 [2024-10-11 13:56:27,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:56:27,666 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 8 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:56:27,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 608 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:56:27,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2024-10-11 13:56:27,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 492. [2024-10-11 13:56:27,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 427 states have (on average 1.3372365339578454) internal successors, (571), 427 states have internal predecessors, (571), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 13:56:27,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 691 transitions. [2024-10-11 13:56:27,714 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 691 transitions. Word has length 130 [2024-10-11 13:56:27,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:56:27,714 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 691 transitions. [2024-10-11 13:56:27,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:56:27,715 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 691 transitions. [2024-10-11 13:56:27,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-11 13:56:27,716 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:56:27,717 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:56:27,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 13:56:27,717 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:56:27,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:56:27,718 INFO L85 PathProgramCache]: Analyzing trace with hash -2057336492, now seen corresponding path program 1 times [2024-10-11 13:56:27,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:56:27,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42201668] [2024-10-11 13:56:27,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:56:27,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:56:27,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:27,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:56:27,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:27,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:56:27,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:27,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:56:27,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:27,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:56:27,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:27,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:56:27,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:27,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:56:27,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:27,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:56:27,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:27,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:56:27,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:27,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:56:27,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:27,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:56:27,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:27,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:56:27,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:27,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:56:27,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:27,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:56:27,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:27,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:56:27,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:27,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:56:27,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:27,870 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:56:27,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:56:27,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42201668] [2024-10-11 13:56:27,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42201668] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:56:27,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:56:27,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:56:27,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022936728] [2024-10-11 13:56:27,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:56:27,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 13:56:27,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:56:27,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 13:56:27,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:56:27,873 INFO L87 Difference]: Start difference. First operand 492 states and 691 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:56:27,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:56:27,922 INFO L93 Difference]: Finished difference Result 671 states and 942 transitions. [2024-10-11 13:56:27,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 13:56:27,923 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2024-10-11 13:56:27,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:56:27,925 INFO L225 Difference]: With dead ends: 671 [2024-10-11 13:56:27,925 INFO L226 Difference]: Without dead ends: 492 [2024-10-11 13:56:27,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:56:27,927 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:56:27,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 283 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:56:27,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2024-10-11 13:56:27,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 492. [2024-10-11 13:56:27,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 427 states have (on average 1.3325526932084308) internal successors, (569), 427 states have internal predecessors, (569), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 13:56:27,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 689 transitions. [2024-10-11 13:56:27,966 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 689 transitions. Word has length 130 [2024-10-11 13:56:27,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:56:27,966 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 689 transitions. [2024-10-11 13:56:27,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:56:27,967 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 689 transitions. [2024-10-11 13:56:27,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-11 13:56:27,969 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:56:27,969 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:56:27,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 13:56:27,969 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:56:27,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:56:27,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1838481774, now seen corresponding path program 1 times [2024-10-11 13:56:27,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:56:27,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544482208] [2024-10-11 13:56:27,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:56:27,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:56:28,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:29,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:56:29,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:29,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:56:29,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:29,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:56:29,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:29,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:56:29,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:29,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:56:29,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:29,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:56:29,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:29,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:56:29,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:29,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:56:29,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:29,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:56:29,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:29,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:56:29,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:29,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:56:29,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:29,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:56:29,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:29,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:56:29,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:29,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:56:29,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:29,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:56:29,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:29,171 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:56:29,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:56:29,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544482208] [2024-10-11 13:56:29,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544482208] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:56:29,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:56:29,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-11 13:56:29,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788044895] [2024-10-11 13:56:29,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:56:29,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 13:56:29,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:56:29,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 13:56:29,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-10-11 13:56:29,174 INFO L87 Difference]: Start difference. First operand 492 states and 689 transitions. Second operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:56:30,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:56:30,213 INFO L93 Difference]: Finished difference Result 814 states and 1132 transitions. [2024-10-11 13:56:30,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 13:56:30,215 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2024-10-11 13:56:30,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:56:30,218 INFO L225 Difference]: With dead ends: 814 [2024-10-11 13:56:30,218 INFO L226 Difference]: Without dead ends: 635 [2024-10-11 13:56:30,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-10-11 13:56:30,222 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 267 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 947 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 1136 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 13:56:30,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 1136 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 947 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 13:56:30,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2024-10-11 13:56:30,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 509. [2024-10-11 13:56:30,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 444 states have (on average 1.3355855855855856) internal successors, (593), 444 states have internal predecessors, (593), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 13:56:30,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 713 transitions. [2024-10-11 13:56:30,270 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 713 transitions. Word has length 130 [2024-10-11 13:56:30,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:56:30,271 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 713 transitions. [2024-10-11 13:56:30,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:56:30,271 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 713 transitions. [2024-10-11 13:56:30,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-11 13:56:30,273 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:56:30,273 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:56:30,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 13:56:30,273 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:56:30,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:56:30,274 INFO L85 PathProgramCache]: Analyzing trace with hash -8989422, now seen corresponding path program 1 times [2024-10-11 13:56:30,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:56:30,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255270856] [2024-10-11 13:56:30,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:56:30,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:56:30,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:31,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:56:31,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:31,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:56:31,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:31,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:56:31,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:31,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:56:31,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:31,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:56:31,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:31,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:56:31,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:31,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:56:31,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:31,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:56:31,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:31,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:56:31,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:31,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:56:31,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:31,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:56:31,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:31,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:56:31,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:31,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:56:31,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:31,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:56:31,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:31,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:56:31,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:31,585 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:56:31,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:56:31,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255270856] [2024-10-11 13:56:31,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255270856] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:56:31,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:56:31,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-11 13:56:31,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79030998] [2024-10-11 13:56:31,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:56:31,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 13:56:31,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:56:31,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 13:56:31,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-10-11 13:56:31,588 INFO L87 Difference]: Start difference. First operand 509 states and 713 transitions. Second operand has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 13:56:33,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:56:33,115 INFO L93 Difference]: Finished difference Result 824 states and 1147 transitions. [2024-10-11 13:56:33,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 13:56:33,116 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 130 [2024-10-11 13:56:33,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:56:33,119 INFO L225 Difference]: With dead ends: 824 [2024-10-11 13:56:33,119 INFO L226 Difference]: Without dead ends: 628 [2024-10-11 13:56:33,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=160, Invalid=652, Unknown=0, NotChecked=0, Total=812 [2024-10-11 13:56:33,121 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 344 mSDsluCounter, 947 mSDsCounter, 0 mSdLazyCounter, 1351 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 1371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:56:33,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 1080 Invalid, 1371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1351 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 13:56:33,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2024-10-11 13:56:33,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 509. [2024-10-11 13:56:33,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 444 states have (on average 1.3355855855855856) internal successors, (593), 444 states have internal predecessors, (593), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 13:56:33,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 713 transitions. [2024-10-11 13:56:33,172 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 713 transitions. Word has length 130 [2024-10-11 13:56:33,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:56:33,172 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 713 transitions. [2024-10-11 13:56:33,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 13:56:33,172 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 713 transitions. [2024-10-11 13:56:33,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-11 13:56:33,174 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:56:33,174 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:56:33,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 13:56:33,174 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:56:33,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:56:33,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1697933164, now seen corresponding path program 1 times [2024-10-11 13:56:33,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:56:33,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286811223] [2024-10-11 13:56:33,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:56:33,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:56:33,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:34,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:56:34,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:34,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:56:34,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:34,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:56:34,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:34,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:56:34,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:34,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:56:34,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:34,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:56:34,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:34,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:56:34,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:34,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:56:34,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:34,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:56:34,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:34,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:56:34,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:34,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:56:34,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:34,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:56:34,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:34,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:56:34,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:34,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:56:34,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:34,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:56:34,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:34,244 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:56:34,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:56:34,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286811223] [2024-10-11 13:56:34,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286811223] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:56:34,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:56:34,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-11 13:56:34,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141445321] [2024-10-11 13:56:34,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:56:34,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 13:56:34,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:56:34,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 13:56:34,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-10-11 13:56:34,248 INFO L87 Difference]: Start difference. First operand 509 states and 713 transitions. Second operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 13:56:35,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:56:35,329 INFO L93 Difference]: Finished difference Result 751 states and 1048 transitions. [2024-10-11 13:56:35,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 13:56:35,330 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 130 [2024-10-11 13:56:35,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:56:35,333 INFO L225 Difference]: With dead ends: 751 [2024-10-11 13:56:35,333 INFO L226 Difference]: Without dead ends: 555 [2024-10-11 13:56:35,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2024-10-11 13:56:35,335 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 168 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 997 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 13:56:35,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 890 Invalid, 1000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 997 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 13:56:35,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2024-10-11 13:56:35,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 488. [2024-10-11 13:56:35,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 423 states have (on average 1.33096926713948) internal successors, (563), 423 states have internal predecessors, (563), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 13:56:35,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 683 transitions. [2024-10-11 13:56:35,377 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 683 transitions. Word has length 130 [2024-10-11 13:56:35,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:56:35,377 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 683 transitions. [2024-10-11 13:56:35,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 13:56:35,378 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 683 transitions. [2024-10-11 13:56:35,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 13:56:35,380 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:56:35,380 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:56:35,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 13:56:35,380 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:56:35,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:56:35,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1078705642, now seen corresponding path program 1 times [2024-10-11 13:56:35,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:56:35,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623713937] [2024-10-11 13:56:35,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:56:35,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:56:35,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:35,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:56:35,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:35,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:56:35,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:35,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:56:35,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:35,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:56:35,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:35,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:56:35,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:35,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:56:35,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:35,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:56:35,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:35,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:56:35,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:35,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:56:35,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:35,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:56:35,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:35,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:56:35,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:35,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:56:35,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:35,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:56:35,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:35,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:56:35,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:35,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:56:35,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:35,955 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:56:35,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:56:35,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623713937] [2024-10-11 13:56:35,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623713937] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:56:35,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:56:35,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 13:56:35,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056082837] [2024-10-11 13:56:35,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:56:35,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 13:56:35,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:56:35,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 13:56:35,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:56:35,959 INFO L87 Difference]: Start difference. First operand 488 states and 683 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 13:56:36,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:56:36,376 INFO L93 Difference]: Finished difference Result 754 states and 1052 transitions. [2024-10-11 13:56:36,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:56:36,377 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 131 [2024-10-11 13:56:36,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:56:36,380 INFO L225 Difference]: With dead ends: 754 [2024-10-11 13:56:36,380 INFO L226 Difference]: Without dead ends: 579 [2024-10-11 13:56:36,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-11 13:56:36,382 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 209 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:56:36,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 477 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:56:36,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2024-10-11 13:56:36,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 498. [2024-10-11 13:56:36,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 433 states have (on average 1.3325635103926097) internal successors, (577), 433 states have internal predecessors, (577), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 13:56:36,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 697 transitions. [2024-10-11 13:56:36,435 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 697 transitions. Word has length 131 [2024-10-11 13:56:36,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:56:36,436 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 697 transitions. [2024-10-11 13:56:36,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 13:56:36,436 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 697 transitions. [2024-10-11 13:56:36,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 13:56:36,437 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:56:36,437 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:56:36,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 13:56:36,437 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:56:36,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:56:36,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1365737002, now seen corresponding path program 1 times [2024-10-11 13:56:36,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:56:36,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631395831] [2024-10-11 13:56:36,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:56:36,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:56:36,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:37,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:56:37,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:37,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:56:37,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:37,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:56:37,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:37,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:56:37,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:37,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:56:37,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:37,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:56:37,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:37,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:56:37,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:37,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:56:37,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:37,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:56:37,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:37,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:56:37,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:37,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:56:37,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:37,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:56:37,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:37,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:56:37,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:37,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:56:37,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:37,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:56:37,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:37,732 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:56:37,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:56:37,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631395831] [2024-10-11 13:56:37,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631395831] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:56:37,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:56:37,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 13:56:37,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841277701] [2024-10-11 13:56:37,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:56:37,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 13:56:37,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:56:37,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 13:56:37,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:56:37,736 INFO L87 Difference]: Start difference. First operand 498 states and 697 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:56:38,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:56:38,346 INFO L93 Difference]: Finished difference Result 818 states and 1137 transitions. [2024-10-11 13:56:38,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 13:56:38,347 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2024-10-11 13:56:38,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:56:38,350 INFO L225 Difference]: With dead ends: 818 [2024-10-11 13:56:38,350 INFO L226 Difference]: Without dead ends: 633 [2024-10-11 13:56:38,351 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2024-10-11 13:56:38,352 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 304 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:56:38,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 493 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:56:38,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2024-10-11 13:56:38,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 500. [2024-10-11 13:56:38,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 435 states have (on average 1.3333333333333333) internal successors, (580), 435 states have internal predecessors, (580), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 13:56:38,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 700 transitions. [2024-10-11 13:56:38,403 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 700 transitions. Word has length 131 [2024-10-11 13:56:38,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:56:38,403 INFO L471 AbstractCegarLoop]: Abstraction has 500 states and 700 transitions. [2024-10-11 13:56:38,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:56:38,403 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 700 transitions. [2024-10-11 13:56:38,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 13:56:38,404 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:56:38,404 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:56:38,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 13:56:38,405 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:56:38,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:56:38,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1501407468, now seen corresponding path program 1 times [2024-10-11 13:56:38,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:56:38,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274664423] [2024-10-11 13:56:38,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:56:38,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:56:38,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:39,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:56:39,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:39,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:56:39,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:39,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:56:39,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:39,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:56:39,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:39,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:56:39,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:39,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:56:39,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:39,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:56:39,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:39,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:56:39,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:39,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:56:39,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:39,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:56:39,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:39,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:56:39,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:39,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:56:39,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:39,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:56:39,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:39,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:56:39,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:39,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:56:39,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:39,540 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:56:39,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:56:39,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274664423] [2024-10-11 13:56:39,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274664423] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:56:39,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:56:39,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 13:56:39,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602960727] [2024-10-11 13:56:39,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:56:39,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:56:39,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:56:39,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:56:39,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:56:39,547 INFO L87 Difference]: Start difference. First operand 500 states and 700 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 13:56:39,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:56:39,830 INFO L93 Difference]: Finished difference Result 836 states and 1168 transitions. [2024-10-11 13:56:39,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:56:39,831 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 131 [2024-10-11 13:56:39,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:56:39,833 INFO L225 Difference]: With dead ends: 836 [2024-10-11 13:56:39,834 INFO L226 Difference]: Without dead ends: 649 [2024-10-11 13:56:39,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:56:39,835 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 180 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:56:39,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 464 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:56:39,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2024-10-11 13:56:39,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 512. [2024-10-11 13:56:39,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 447 states have (on average 1.3333333333333333) internal successors, (596), 447 states have internal predecessors, (596), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 13:56:39,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 716 transitions. [2024-10-11 13:56:39,893 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 716 transitions. Word has length 131 [2024-10-11 13:56:39,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:56:39,894 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 716 transitions. [2024-10-11 13:56:39,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 13:56:39,894 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 716 transitions. [2024-10-11 13:56:39,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 13:56:39,895 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:56:39,895 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:56:39,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 13:56:39,896 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:56:39,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:56:39,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1108380458, now seen corresponding path program 1 times [2024-10-11 13:56:39,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:56:39,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541858416] [2024-10-11 13:56:39,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:56:39,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:56:39,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:42,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:56:42,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:42,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:56:42,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:42,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:56:42,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:42,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:56:42,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:42,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:56:42,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:42,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:56:42,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:42,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:56:42,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:42,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:56:42,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:42,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:56:42,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:42,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:56:42,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:42,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:56:42,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:42,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:56:42,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:42,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:56:42,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:42,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:56:42,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:42,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:56:42,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:42,118 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:56:42,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:56:42,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541858416] [2024-10-11 13:56:42,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541858416] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:56:42,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:56:42,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-11 13:56:42,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659771582] [2024-10-11 13:56:42,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:56:42,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 13:56:42,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:56:42,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 13:56:42,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-10-11 13:56:42,121 INFO L87 Difference]: Start difference. First operand 512 states and 716 transitions. Second operand has 13 states, 12 states have (on average 4.916666666666667) internal successors, (59), 13 states have internal predecessors, (59), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-11 13:56:43,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:56:43,157 INFO L93 Difference]: Finished difference Result 984 states and 1366 transitions. [2024-10-11 13:56:43,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 13:56:43,158 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.916666666666667) internal successors, (59), 13 states have internal predecessors, (59), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 131 [2024-10-11 13:56:43,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:56:43,162 INFO L225 Difference]: With dead ends: 984 [2024-10-11 13:56:43,162 INFO L226 Difference]: Without dead ends: 654 [2024-10-11 13:56:43,163 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2024-10-11 13:56:43,163 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 359 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 13:56:43,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 564 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 13:56:43,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2024-10-11 13:56:43,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 528. [2024-10-11 13:56:43,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 463 states have (on average 1.3282937365010798) internal successors, (615), 463 states have internal predecessors, (615), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 13:56:43,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 735 transitions. [2024-10-11 13:56:43,224 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 735 transitions. Word has length 131 [2024-10-11 13:56:43,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:56:43,225 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 735 transitions. [2024-10-11 13:56:43,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.916666666666667) internal successors, (59), 13 states have internal predecessors, (59), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-11 13:56:43,226 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 735 transitions. [2024-10-11 13:56:43,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 13:56:43,227 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:56:43,227 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:56:43,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 13:56:43,227 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:56:43,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:56:43,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1788438828, now seen corresponding path program 1 times [2024-10-11 13:56:43,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:56:43,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495326881] [2024-10-11 13:56:43,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:56:43,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:56:43,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:43,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:56:43,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:43,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:56:43,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:43,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:56:43,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:43,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:56:43,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:43,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:56:43,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:43,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:56:43,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:43,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:56:43,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:43,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:56:43,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:43,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:56:43,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:43,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:56:43,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:43,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:56:43,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:43,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:56:43,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:43,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:56:43,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:43,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:56:43,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:43,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:56:43,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:43,545 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:56:43,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:56:43,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495326881] [2024-10-11 13:56:43,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495326881] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:56:43,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:56:43,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 13:56:43,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079018528] [2024-10-11 13:56:43,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:56:43,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:56:43,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:56:43,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:56:43,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:56:43,547 INFO L87 Difference]: Start difference. First operand 528 states and 735 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:56:43,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:56:43,772 INFO L93 Difference]: Finished difference Result 951 states and 1319 transitions. [2024-10-11 13:56:43,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:56:43,773 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2024-10-11 13:56:43,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:56:43,777 INFO L225 Difference]: With dead ends: 951 [2024-10-11 13:56:43,781 INFO L226 Difference]: Without dead ends: 605 [2024-10-11 13:56:43,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 13:56:43,783 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 190 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:56:43,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 706 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:56:43,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2024-10-11 13:56:43,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 504. [2024-10-11 13:56:43,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 439 states have (on average 1.3371298405466971) internal successors, (587), 439 states have internal predecessors, (587), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 13:56:43,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 707 transitions. [2024-10-11 13:56:43,852 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 707 transitions. Word has length 131 [2024-10-11 13:56:43,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:56:43,852 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 707 transitions. [2024-10-11 13:56:43,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:56:43,852 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 707 transitions. [2024-10-11 13:56:43,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 13:56:43,853 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:56:43,853 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:56:43,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 13:56:43,854 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:56:43,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:56:43,854 INFO L85 PathProgramCache]: Analyzing trace with hash -65162922, now seen corresponding path program 1 times [2024-10-11 13:56:43,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:56:43,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330394534] [2024-10-11 13:56:43,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:56:43,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:56:43,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:43,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:56:43,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:43,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:56:43,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:43,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:56:43,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:43,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:56:43,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:43,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:56:43,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:43,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:56:43,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:43,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:56:43,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:43,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:56:43,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:43,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:56:43,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:43,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:56:43,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:43,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:56:43,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:43,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:56:43,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:43,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:56:43,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:43,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:56:43,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:43,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:56:43,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:43,994 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:56:43,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:56:43,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330394534] [2024-10-11 13:56:43,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330394534] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:56:43,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:56:43,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:56:43,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990081931] [2024-10-11 13:56:43,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:56:43,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:56:43,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:56:43,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:56:43,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:56:43,996 INFO L87 Difference]: Start difference. First operand 504 states and 707 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:56:44,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:56:44,149 INFO L93 Difference]: Finished difference Result 723 states and 1011 transitions. [2024-10-11 13:56:44,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:56:44,150 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2024-10-11 13:56:44,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:56:44,152 INFO L225 Difference]: With dead ends: 723 [2024-10-11 13:56:44,152 INFO L226 Difference]: Without dead ends: 540 [2024-10-11 13:56:44,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:56:44,154 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 88 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:56:44,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 426 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:56:44,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2024-10-11 13:56:44,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 504. [2024-10-11 13:56:44,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 439 states have (on average 1.3325740318906605) internal successors, (585), 439 states have internal predecessors, (585), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 13:56:44,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 705 transitions. [2024-10-11 13:56:44,209 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 705 transitions. Word has length 131 [2024-10-11 13:56:44,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:56:44,209 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 705 transitions. [2024-10-11 13:56:44,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:56:44,210 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 705 transitions. [2024-10-11 13:56:44,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 13:56:44,210 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:56:44,211 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:56:44,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-11 13:56:44,211 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:56:44,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:56:44,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1653510824, now seen corresponding path program 1 times [2024-10-11 13:56:44,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:56:44,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160120892] [2024-10-11 13:56:44,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:56:44,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:56:44,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:45,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:56:45,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:45,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:56:45,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:45,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:56:45,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:45,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:56:45,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:45,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:56:45,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:45,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:56:45,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:45,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:56:45,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:45,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:56:45,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:45,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:56:45,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:45,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:56:45,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:45,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:56:45,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:45,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:56:45,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:45,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:56:45,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:45,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:56:45,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:45,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:56:45,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:45,409 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:56:45,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:56:45,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160120892] [2024-10-11 13:56:45,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160120892] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:56:45,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:56:45,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 13:56:45,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357113368] [2024-10-11 13:56:45,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:56:45,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 13:56:45,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:56:45,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 13:56:45,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-10-11 13:56:45,411 INFO L87 Difference]: Start difference. First operand 504 states and 705 transitions. Second operand has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-11 13:56:46,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:56:46,092 INFO L93 Difference]: Finished difference Result 723 states and 1007 transitions. [2024-10-11 13:56:46,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 13:56:46,093 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 131 [2024-10-11 13:56:46,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:56:46,096 INFO L225 Difference]: With dead ends: 723 [2024-10-11 13:56:46,096 INFO L226 Difference]: Without dead ends: 540 [2024-10-11 13:56:46,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2024-10-11 13:56:46,099 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 164 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 13:56:46,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 467 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 13:56:46,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2024-10-11 13:56:46,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 504. [2024-10-11 13:56:46,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 439 states have (on average 1.328018223234624) internal successors, (583), 439 states have internal predecessors, (583), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 13:56:46,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 703 transitions. [2024-10-11 13:56:46,158 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 703 transitions. Word has length 131 [2024-10-11 13:56:46,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:56:46,158 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 703 transitions. [2024-10-11 13:56:46,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-11 13:56:46,159 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 703 transitions. [2024-10-11 13:56:46,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 13:56:46,160 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:56:46,160 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:56:46,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-11 13:56:46,160 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:56:46,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:56:46,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1427776616, now seen corresponding path program 1 times [2024-10-11 13:56:46,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:56:46,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452250954] [2024-10-11 13:56:46,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:56:46,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:56:46,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:47,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:56:47,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:47,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:56:47,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:47,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:56:47,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:47,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:56:47,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:47,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:56:47,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:47,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:56:47,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:47,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:56:47,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:47,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:56:47,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:47,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:56:47,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:47,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:56:47,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:47,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:56:47,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:47,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:56:47,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:47,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:56:47,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:47,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:56:47,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:47,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:56:47,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:47,167 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:56:47,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:56:47,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452250954] [2024-10-11 13:56:47,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452250954] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:56:47,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:56:47,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 13:56:47,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657875490] [2024-10-11 13:56:47,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:56:47,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:56:47,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:56:47,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:56:47,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:56:47,169 INFO L87 Difference]: Start difference. First operand 504 states and 703 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:56:47,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:56:47,792 INFO L93 Difference]: Finished difference Result 937 states and 1300 transitions. [2024-10-11 13:56:47,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 13:56:47,794 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2024-10-11 13:56:47,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:56:47,797 INFO L225 Difference]: With dead ends: 937 [2024-10-11 13:56:47,797 INFO L226 Difference]: Without dead ends: 615 [2024-10-11 13:56:47,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:56:47,799 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 194 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:56:47,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 539 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:56:47,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2024-10-11 13:56:47,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 523. [2024-10-11 13:56:47,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 458 states have (on average 1.3296943231441047) internal successors, (609), 458 states have internal predecessors, (609), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 13:56:47,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 729 transitions. [2024-10-11 13:56:47,863 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 729 transitions. Word has length 131 [2024-10-11 13:56:47,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:56:47,864 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 729 transitions. [2024-10-11 13:56:47,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:56:47,864 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 729 transitions. [2024-10-11 13:56:47,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 13:56:47,865 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:56:47,865 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:56:47,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-11 13:56:47,865 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:56:47,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:56:47,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1170420072, now seen corresponding path program 1 times [2024-10-11 13:56:47,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:56:47,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026206671] [2024-10-11 13:56:47,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:56:47,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:56:47,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:49,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:56:49,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:49,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:56:49,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:49,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:56:49,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:49,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:56:49,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:49,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:56:49,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:49,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:56:49,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:49,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:56:49,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:49,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:56:49,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:49,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:56:49,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:49,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:56:49,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:49,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:56:49,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:49,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:56:49,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:49,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:56:49,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:49,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:56:49,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:49,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:56:49,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:49,461 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:56:49,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:56:49,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026206671] [2024-10-11 13:56:49,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026206671] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:56:49,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:56:49,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 13:56:49,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775704481] [2024-10-11 13:56:49,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:56:49,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 13:56:49,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:56:49,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 13:56:49,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-10-11 13:56:49,463 INFO L87 Difference]: Start difference. First operand 523 states and 729 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 13:56:50,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:56:50,410 INFO L93 Difference]: Finished difference Result 1034 states and 1436 transitions. [2024-10-11 13:56:50,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:56:50,411 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 131 [2024-10-11 13:56:50,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:56:50,414 INFO L225 Difference]: With dead ends: 1034 [2024-10-11 13:56:50,414 INFO L226 Difference]: Without dead ends: 693 [2024-10-11 13:56:50,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2024-10-11 13:56:50,416 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 265 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 13:56:50,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 841 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 13:56:50,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2024-10-11 13:56:50,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 529. [2024-10-11 13:56:50,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 464 states have (on average 1.331896551724138) internal successors, (618), 464 states have internal predecessors, (618), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 13:56:50,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 738 transitions. [2024-10-11 13:56:50,476 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 738 transitions. Word has length 131 [2024-10-11 13:56:50,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:56:50,477 INFO L471 AbstractCegarLoop]: Abstraction has 529 states and 738 transitions. [2024-10-11 13:56:50,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 13:56:50,477 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 738 transitions. [2024-10-11 13:56:50,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-11 13:56:50,478 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:56:50,478 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:56:50,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-11 13:56:50,478 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:56:50,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:56:50,479 INFO L85 PathProgramCache]: Analyzing trace with hash 454158777, now seen corresponding path program 1 times [2024-10-11 13:56:50,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:56:50,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558700475] [2024-10-11 13:56:50,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:56:50,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:56:50,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:51,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:56:51,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:51,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:56:51,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:51,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:56:51,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:51,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:56:51,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:51,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:56:51,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:51,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:56:51,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:51,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:56:51,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:51,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:56:51,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:51,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:56:51,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:51,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:56:51,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:51,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:56:51,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:51,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:56:51,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:51,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:56:51,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:51,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:56:51,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:51,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:56:51,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:51,513 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:56:51,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:56:51,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558700475] [2024-10-11 13:56:51,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558700475] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:56:51,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:56:51,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-11 13:56:51,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863751771] [2024-10-11 13:56:51,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:56:51,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 13:56:51,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:56:51,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 13:56:51,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-10-11 13:56:51,515 INFO L87 Difference]: Start difference. First operand 529 states and 738 transitions. Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:56:52,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:56:52,208 INFO L93 Difference]: Finished difference Result 903 states and 1238 transitions. [2024-10-11 13:56:52,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 13:56:52,209 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 132 [2024-10-11 13:56:52,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:56:52,212 INFO L225 Difference]: With dead ends: 903 [2024-10-11 13:56:52,212 INFO L226 Difference]: Without dead ends: 702 [2024-10-11 13:56:52,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2024-10-11 13:56:52,214 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 222 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 1023 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:56:52,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 1023 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 804 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:56:52,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2024-10-11 13:56:52,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 546. [2024-10-11 13:56:52,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 481 states have (on average 1.3347193347193347) internal successors, (642), 481 states have internal predecessors, (642), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 13:56:52,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 762 transitions. [2024-10-11 13:56:52,279 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 762 transitions. Word has length 132 [2024-10-11 13:56:52,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:56:52,279 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 762 transitions. [2024-10-11 13:56:52,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:56:52,280 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 762 transitions. [2024-10-11 13:56:52,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-11 13:56:52,281 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:56:52,281 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:56:52,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-11 13:56:52,282 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:56:52,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:56:52,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1954684985, now seen corresponding path program 1 times [2024-10-11 13:56:52,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:56:52,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961543691] [2024-10-11 13:56:52,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:56:52,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:56:52,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:53,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:56:53,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:53,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:56:53,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:53,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:56:53,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:53,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:56:53,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:53,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:56:53,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:53,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:56:53,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:53,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:56:53,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:53,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:56:53,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:53,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:56:53,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:53,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:56:53,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:53,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:56:53,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:53,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:56:53,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:53,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:56:53,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:53,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:56:53,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:53,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:56:53,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:53,494 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:56:53,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:56:53,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961543691] [2024-10-11 13:56:53,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961543691] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:56:53,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:56:53,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-11 13:56:53,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675807314] [2024-10-11 13:56:53,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:56:53,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 13:56:53,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:56:53,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 13:56:53,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-10-11 13:56:53,497 INFO L87 Difference]: Start difference. First operand 546 states and 762 transitions. Second operand has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 13:56:54,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:56:54,920 INFO L93 Difference]: Finished difference Result 855 states and 1181 transitions. [2024-10-11 13:56:54,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 13:56:54,921 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 132 [2024-10-11 13:56:54,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:56:54,924 INFO L225 Difference]: With dead ends: 855 [2024-10-11 13:56:54,924 INFO L226 Difference]: Without dead ends: 637 [2024-10-11 13:56:54,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=152, Invalid=604, Unknown=0, NotChecked=0, Total=756 [2024-10-11 13:56:54,928 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 399 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 1315 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 1342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 13:56:54,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 1051 Invalid, 1342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1315 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 13:56:54,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2024-10-11 13:56:54,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 542. [2024-10-11 13:56:54,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 477 states have (on average 1.3354297693920336) internal successors, (637), 477 states have internal predecessors, (637), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 13:56:54,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 757 transitions. [2024-10-11 13:56:54,992 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 757 transitions. Word has length 132 [2024-10-11 13:56:54,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:56:54,992 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 757 transitions. [2024-10-11 13:56:54,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 13:56:54,993 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 757 transitions. [2024-10-11 13:56:54,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-11 13:56:54,993 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:56:54,994 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:56:54,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-11 13:56:54,994 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:56:54,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:56:54,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1917580485, now seen corresponding path program 1 times [2024-10-11 13:56:54,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:56:54,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420165406] [2024-10-11 13:56:54,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:56:54,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:56:55,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:56,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:56:56,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:56,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:56:56,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:56,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:56:56,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:56,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:56:56,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:56,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:56:56,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:56,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:56:56,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:56,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:56:56,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:56,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:56:56,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:56,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:56:56,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:56,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:56:56,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:56,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:56:56,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:56,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:56:56,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:56,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:56:56,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:56,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:56:56,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:56,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:56:56,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:56,233 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:56:56,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:56:56,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420165406] [2024-10-11 13:56:56,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420165406] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:56:56,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:56:56,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-11 13:56:56,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410862739] [2024-10-11 13:56:56,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:56:56,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 13:56:56,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:56:56,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 13:56:56,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-10-11 13:56:56,235 INFO L87 Difference]: Start difference. First operand 542 states and 757 transitions. Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 13:56:57,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:56:57,009 INFO L93 Difference]: Finished difference Result 795 states and 1104 transitions. [2024-10-11 13:56:57,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 13:56:57,010 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 132 [2024-10-11 13:56:57,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:56:57,013 INFO L225 Difference]: With dead ends: 795 [2024-10-11 13:56:57,013 INFO L226 Difference]: Without dead ends: 581 [2024-10-11 13:56:57,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2024-10-11 13:56:57,014 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 218 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 13:56:57,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 658 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 13:56:57,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2024-10-11 13:56:57,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 517. [2024-10-11 13:56:57,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 452 states have (on average 1.334070796460177) internal successors, (603), 452 states have internal predecessors, (603), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 13:56:57,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 723 transitions. [2024-10-11 13:56:57,075 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 723 transitions. Word has length 132 [2024-10-11 13:56:57,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:56:57,076 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 723 transitions. [2024-10-11 13:56:57,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 13:56:57,076 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 723 transitions. [2024-10-11 13:56:57,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-11 13:56:57,077 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:56:57,077 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:56:57,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-11 13:56:57,077 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:56:57,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:56:57,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1459924975, now seen corresponding path program 1 times [2024-10-11 13:56:57,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:56:57,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433286696] [2024-10-11 13:56:57,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:56:57,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:56:57,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:57,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:56:57,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:57,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:56:57,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:57,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:56:57,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:57,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:56:57,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:57,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:56:57,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:57,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:56:57,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:57,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:56:57,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:57,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:56:57,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:57,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:56:57,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:57,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:56:57,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:57,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:56:57,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:57,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:56:57,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:57,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:56:57,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:57,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:56:57,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:57,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:56:57,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:57,449 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:56:57,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:56:57,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433286696] [2024-10-11 13:56:57,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433286696] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:56:57,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:56:57,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 13:56:57,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008443624] [2024-10-11 13:56:57,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:56:57,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 13:56:57,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:56:57,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 13:56:57,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:56:57,451 INFO L87 Difference]: Start difference. First operand 517 states and 723 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:56:57,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:56:57,766 INFO L93 Difference]: Finished difference Result 761 states and 1055 transitions. [2024-10-11 13:56:57,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 13:56:57,766 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 133 [2024-10-11 13:56:57,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:56:57,769 INFO L225 Difference]: With dead ends: 761 [2024-10-11 13:56:57,769 INFO L226 Difference]: Without dead ends: 572 [2024-10-11 13:56:57,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-10-11 13:56:57,770 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 211 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:56:57,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 642 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:56:57,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2024-10-11 13:56:57,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 540. [2024-10-11 13:56:57,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 475 states have (on average 1.3242105263157895) internal successors, (629), 475 states have internal predecessors, (629), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 13:56:57,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 749 transitions. [2024-10-11 13:56:57,840 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 749 transitions. Word has length 133 [2024-10-11 13:56:57,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:56:57,841 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 749 transitions. [2024-10-11 13:56:57,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:56:57,841 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 749 transitions. [2024-10-11 13:56:57,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-11 13:56:57,842 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:56:57,842 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:56:57,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-11 13:56:57,843 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:56:57,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:56:57,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1852951985, now seen corresponding path program 1 times [2024-10-11 13:56:57,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:56:57,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002604945] [2024-10-11 13:56:57,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:56:57,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:56:57,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:00,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:57:00,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:00,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:57:00,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:00,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:57:00,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:00,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:57:00,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:00,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:57:00,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:00,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:57:00,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:00,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:57:00,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:00,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:57:00,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:00,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:57:00,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:00,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:57:00,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:00,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:57:00,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:00,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:57:00,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:00,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:57:00,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:00,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:57:00,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:00,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:57:00,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:00,663 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-11 13:57:00,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:57:00,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002604945] [2024-10-11 13:57:00,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002604945] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:57:00,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698731025] [2024-10-11 13:57:00,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:57:00,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:57:00,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:57:00,666 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 13:57:00,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 13:57:00,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:00,923 INFO L255 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-11 13:57:00,935 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:57:02,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 13:57:02,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 13:57:02,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-11 13:57:03,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 13:57:03,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 13:57:03,199 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-11 13:57:03,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2024-10-11 13:57:03,342 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:57:03,342 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:57:03,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698731025] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:57:03,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:57:03,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [15] total 20 [2024-10-11 13:57:03,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255693002] [2024-10-11 13:57:03,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:57:03,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:57:03,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:57:03,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:57:03,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2024-10-11 13:57:03,345 INFO L87 Difference]: Start difference. First operand 540 states and 749 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:57:03,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:57:03,984 INFO L93 Difference]: Finished difference Result 940 states and 1281 transitions. [2024-10-11 13:57:03,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:57:03,985 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 133 [2024-10-11 13:57:03,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:57:03,988 INFO L225 Difference]: With dead ends: 940 [2024-10-11 13:57:03,988 INFO L226 Difference]: Without dead ends: 728 [2024-10-11 13:57:03,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2024-10-11 13:57:03,990 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 220 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:57:03,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 580 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:57:03,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2024-10-11 13:57:04,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 540. [2024-10-11 13:57:04,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 475 states have (on average 1.3242105263157895) internal successors, (629), 475 states have internal predecessors, (629), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 13:57:04,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 749 transitions. [2024-10-11 13:57:04,056 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 749 transitions. Word has length 133 [2024-10-11 13:57:04,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:57:04,056 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 749 transitions. [2024-10-11 13:57:04,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:57:04,057 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 749 transitions. [2024-10-11 13:57:04,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-11 13:57:04,058 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:57:04,058 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:57:04,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 13:57:04,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-10-11 13:57:04,259 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:57:04,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:57:04,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1872079407, now seen corresponding path program 1 times [2024-10-11 13:57:04,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:57:04,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703459167] [2024-10-11 13:57:04,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:57:04,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:57:04,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:04,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:57:04,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:04,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:57:04,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:04,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:57:04,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:04,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:57:04,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:04,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:57:04,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:04,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:57:04,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:04,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:57:04,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:04,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:57:04,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:04,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:57:04,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:04,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:57:04,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:04,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:57:04,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:04,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:57:04,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:04,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:57:04,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:04,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:57:04,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:04,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:57:04,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:04,729 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:57:04,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:57:04,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703459167] [2024-10-11 13:57:04,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703459167] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:57:04,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:57:04,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 13:57:04,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118503966] [2024-10-11 13:57:04,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:57:04,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 13:57:04,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:57:04,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 13:57:04,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:57:04,732 INFO L87 Difference]: Start difference. First operand 540 states and 749 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:57:05,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:57:05,141 INFO L93 Difference]: Finished difference Result 799 states and 1098 transitions. [2024-10-11 13:57:05,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 13:57:05,142 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 133 [2024-10-11 13:57:05,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:57:05,145 INFO L225 Difference]: With dead ends: 799 [2024-10-11 13:57:05,145 INFO L226 Difference]: Without dead ends: 587 [2024-10-11 13:57:05,146 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:57:05,147 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 154 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:57:05,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 687 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:57:05,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2024-10-11 13:57:05,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 553. [2024-10-11 13:57:05,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 488 states have (on average 1.3237704918032787) internal successors, (646), 488 states have internal predecessors, (646), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 13:57:05,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 766 transitions. [2024-10-11 13:57:05,240 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 766 transitions. Word has length 133 [2024-10-11 13:57:05,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:57:05,240 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 766 transitions. [2024-10-11 13:57:05,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:57:05,240 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 766 transitions. [2024-10-11 13:57:05,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-11 13:57:05,241 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:57:05,241 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:57:05,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-11 13:57:05,242 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:57:05,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:57:05,242 INFO L85 PathProgramCache]: Analyzing trace with hash 2029860879, now seen corresponding path program 1 times [2024-10-11 13:57:05,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:57:05,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175066713] [2024-10-11 13:57:05,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:57:05,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:57:05,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:05,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:57:05,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:05,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:57:05,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:05,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:57:05,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:05,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:57:05,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:05,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:57:05,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:05,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:57:05,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:05,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:57:05,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:05,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:57:05,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:05,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:57:05,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:05,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:57:05,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:05,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:57:05,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:05,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:57:05,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:05,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:57:05,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:05,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:57:05,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:05,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:57:05,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:05,559 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:57:05,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:57:05,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175066713] [2024-10-11 13:57:05,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175066713] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:57:05,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:57:05,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 13:57:05,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651318073] [2024-10-11 13:57:05,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:57:05,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 13:57:05,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:57:05,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 13:57:05,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:57:05,563 INFO L87 Difference]: Start difference. First operand 553 states and 766 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:57:05,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:57:05,809 INFO L93 Difference]: Finished difference Result 818 states and 1123 transitions. [2024-10-11 13:57:05,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:57:05,810 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 133 [2024-10-11 13:57:05,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:57:05,812 INFO L225 Difference]: With dead ends: 818 [2024-10-11 13:57:05,813 INFO L226 Difference]: Without dead ends: 593 [2024-10-11 13:57:05,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:57:05,814 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 218 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:57:05,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 417 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:57:05,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2024-10-11 13:57:05,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 545. [2024-10-11 13:57:05,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 480 states have (on average 1.31875) internal successors, (633), 480 states have internal predecessors, (633), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 13:57:05,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 753 transitions. [2024-10-11 13:57:05,881 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 753 transitions. Word has length 133 [2024-10-11 13:57:05,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:57:05,881 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 753 transitions. [2024-10-11 13:57:05,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:57:05,882 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 753 transitions. [2024-10-11 13:57:05,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-11 13:57:05,882 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:57:05,882 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:57:05,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-11 13:57:05,883 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:57:05,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:57:05,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1971044047, now seen corresponding path program 1 times [2024-10-11 13:57:05,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:57:05,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004688582] [2024-10-11 13:57:05,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:57:05,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:57:05,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:06,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:57:06,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:06,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:57:06,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:06,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:57:06,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:06,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:57:06,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:06,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:57:06,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:06,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:57:06,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:06,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:57:06,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:06,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:57:06,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:06,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:57:06,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:06,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:57:06,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:06,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:57:06,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:06,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:57:06,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:06,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:57:06,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:06,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:57:06,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:06,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:57:06,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:06,320 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:57:06,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:57:06,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004688582] [2024-10-11 13:57:06,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004688582] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:57:06,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:57:06,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 13:57:06,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727123299] [2024-10-11 13:57:06,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:57:06,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:57:06,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:57:06,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:57:06,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:57:06,341 INFO L87 Difference]: Start difference. First operand 545 states and 753 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:57:06,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:57:06,689 INFO L93 Difference]: Finished difference Result 1137 states and 1547 transitions. [2024-10-11 13:57:06,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 13:57:06,690 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 133 [2024-10-11 13:57:06,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:57:06,693 INFO L225 Difference]: With dead ends: 1137 [2024-10-11 13:57:06,693 INFO L226 Difference]: Without dead ends: 633 [2024-10-11 13:57:06,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-10-11 13:57:06,695 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 183 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:57:06,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 448 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:57:06,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2024-10-11 13:57:06,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 587. [2024-10-11 13:57:06,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 522 states have (on average 1.2950191570881227) internal successors, (676), 522 states have internal predecessors, (676), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 13:57:06,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 796 transitions. [2024-10-11 13:57:06,761 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 796 transitions. Word has length 133 [2024-10-11 13:57:06,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:57:06,761 INFO L471 AbstractCegarLoop]: Abstraction has 587 states and 796 transitions. [2024-10-11 13:57:06,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:57:06,762 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 796 transitions. [2024-10-11 13:57:06,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-11 13:57:06,763 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:57:06,763 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:57:06,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-10-11 13:57:06,763 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:57:06,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:57:06,764 INFO L85 PathProgramCache]: Analyzing trace with hash 2106714513, now seen corresponding path program 1 times [2024-10-11 13:57:06,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:57:06,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818578837] [2024-10-11 13:57:06,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:57:06,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:57:06,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:06,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:57:06,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:06,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:57:06,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:06,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:57:06,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:06,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:57:06,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:06,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:57:06,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:06,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:57:06,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:06,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:57:06,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:06,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:57:06,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:06,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:57:06,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:06,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:57:06,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:06,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:57:06,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:06,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:57:06,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:06,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:57:06,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:06,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:57:06,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:06,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:57:06,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:06,823 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:57:06,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:57:06,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818578837] [2024-10-11 13:57:06,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818578837] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:57:06,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:57:06,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:57:06,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188667811] [2024-10-11 13:57:06,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:57:06,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 13:57:06,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:57:06,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 13:57:06,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:57:06,825 INFO L87 Difference]: Start difference. First operand 587 states and 796 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:57:06,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:57:06,881 INFO L93 Difference]: Finished difference Result 1075 states and 1460 transitions. [2024-10-11 13:57:06,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 13:57:06,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 133 [2024-10-11 13:57:06,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:57:06,884 INFO L225 Difference]: With dead ends: 1075 [2024-10-11 13:57:06,885 INFO L226 Difference]: Without dead ends: 554 [2024-10-11 13:57:06,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:57:06,886 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:57:06,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 280 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:57:06,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2024-10-11 13:57:06,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 552. [2024-10-11 13:57:06,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 487 states have (on average 1.297741273100616) internal successors, (632), 487 states have internal predecessors, (632), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 13:57:06,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 752 transitions. [2024-10-11 13:57:06,955 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 752 transitions. Word has length 133 [2024-10-11 13:57:06,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:57:06,955 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 752 transitions. [2024-10-11 13:57:06,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:57:06,955 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 752 transitions. [2024-10-11 13:57:06,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-11 13:57:06,956 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:57:06,957 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:57:06,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-10-11 13:57:06,957 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:57:06,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:57:06,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1969398065, now seen corresponding path program 1 times [2024-10-11 13:57:06,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:57:06,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977265080] [2024-10-11 13:57:06,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:57:06,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:57:06,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:07,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:57:07,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:07,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:57:07,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:07,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:57:07,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:07,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:57:07,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:07,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:57:07,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:07,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:57:07,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:07,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:57:07,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:07,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:57:07,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:07,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:57:07,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:07,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:57:07,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:07,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:57:07,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:07,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:57:07,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:07,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:57:07,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:07,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:57:07,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:07,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:57:07,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:07,412 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:57:07,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:57:07,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977265080] [2024-10-11 13:57:07,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977265080] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:57:07,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:57:07,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 13:57:07,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682171162] [2024-10-11 13:57:07,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:57:07,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:57:07,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:57:07,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:57:07,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:57:07,414 INFO L87 Difference]: Start difference. First operand 552 states and 752 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:57:07,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:57:07,724 INFO L93 Difference]: Finished difference Result 911 states and 1214 transitions. [2024-10-11 13:57:07,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:57:07,725 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 133 [2024-10-11 13:57:07,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:57:07,729 INFO L225 Difference]: With dead ends: 911 [2024-10-11 13:57:07,729 INFO L226 Difference]: Without dead ends: 686 [2024-10-11 13:57:07,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:57:07,734 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 245 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:57:07,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 387 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:57:07,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2024-10-11 13:57:07,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 558. [2024-10-11 13:57:07,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 493 states have (on average 1.2941176470588236) internal successors, (638), 493 states have internal predecessors, (638), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 13:57:07,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 758 transitions. [2024-10-11 13:57:07,809 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 758 transitions. Word has length 133 [2024-10-11 13:57:07,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:57:07,809 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 758 transitions. [2024-10-11 13:57:07,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:57:07,809 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 758 transitions. [2024-10-11 13:57:07,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-11 13:57:07,811 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:57:07,811 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:57:07,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-10-11 13:57:07,811 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:57:07,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:57:07,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1932542221, now seen corresponding path program 1 times [2024-10-11 13:57:07,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:57:07,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281201781] [2024-10-11 13:57:07,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:57:07,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:57:07,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:08,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:57:08,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:08,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:57:08,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:08,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:57:08,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:08,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:57:08,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:08,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:57:08,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:08,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:57:08,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:08,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:57:08,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:08,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:57:08,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:08,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:57:08,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:08,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:57:08,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:08,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:57:08,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:08,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:57:08,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:08,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:57:08,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat