/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-53.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 21:30:43,961 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 21:30:44,044 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-15 21:30:44,048 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 21:30:44,049 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 21:30:44,075 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 21:30:44,076 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 21:30:44,076 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 21:30:44,077 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 21:30:44,080 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 21:30:44,080 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 21:30:44,081 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 21:30:44,082 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 21:30:44,083 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 21:30:44,083 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 21:30:44,083 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 21:30:44,083 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 21:30:44,084 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 21:30:44,084 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 21:30:44,084 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 21:30:44,084 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 21:30:44,085 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 21:30:44,085 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 21:30:44,085 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 21:30:44,085 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 21:30:44,086 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 21:30:44,086 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 21:30:44,086 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 21:30:44,087 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 21:30:44,087 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 21:30:44,088 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 21:30:44,088 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 21:30:44,088 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:30:44,088 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 21:30:44,088 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 21:30:44,089 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 21:30:44,089 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 21:30:44,089 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 21:30:44,089 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 21:30:44,089 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 21:30:44,090 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 21:30:44,090 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 21:30:44,090 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 21:30:44,090 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-15 21:30:44,317 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 21:30:44,340 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 21:30:44,343 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 21:30:44,344 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 21:30:44,345 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 21:30:44,346 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-53.i [2023-12-15 21:30:45,472 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 21:30:45,656 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 21:30:45,657 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-53.i [2023-12-15 21:30:45,666 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba0b99c0b/ddf4d586df14478c8d5f57bed962ac4a/FLAGf6ebd6510 [2023-12-15 21:30:45,676 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba0b99c0b/ddf4d586df14478c8d5f57bed962ac4a [2023-12-15 21:30:45,678 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 21:30:45,679 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 21:30:45,680 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 21:30:45,680 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 21:30:45,684 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 21:30:45,685 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:30:45" (1/1) ... [2023-12-15 21:30:45,686 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e1bfac4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:30:45, skipping insertion in model container [2023-12-15 21:30:45,686 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:30:45" (1/1) ... [2023-12-15 21:30:45,720 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 21:30:45,838 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-53.i[916,929] [2023-12-15 21:30:45,897 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:30:45,907 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 21:30:45,916 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-53.i[916,929] [2023-12-15 21:30:45,953 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:30:45,970 INFO L206 MainTranslator]: Completed translation [2023-12-15 21:30:45,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:30:45 WrapperNode [2023-12-15 21:30:45,971 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 21:30:45,972 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 21:30:45,972 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 21:30:45,972 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 21:30:45,978 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:30:45" (1/1) ... [2023-12-15 21:30:45,992 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:30:45" (1/1) ... [2023-12-15 21:30:46,034 INFO L138 Inliner]: procedures = 29, calls = 166, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 491 [2023-12-15 21:30:46,034 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 21:30:46,035 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 21:30:46,035 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 21:30:46,035 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 21:30:46,044 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:30:45" (1/1) ... [2023-12-15 21:30:46,044 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:30:45" (1/1) ... [2023-12-15 21:30:46,056 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:30:45" (1/1) ... [2023-12-15 21:30:46,083 INFO L175 MemorySlicer]: Split 133 memory accesses to 5 slices as follows [2, 45, 20, 39, 27]. 34 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 6, 2, 5, 2]. The 18 writes are split as follows [0, 9, 2, 5, 2]. [2023-12-15 21:30:46,083 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:30:45" (1/1) ... [2023-12-15 21:30:46,083 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:30:45" (1/1) ... [2023-12-15 21:30:46,115 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:30:45" (1/1) ... [2023-12-15 21:30:46,135 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:30:45" (1/1) ... [2023-12-15 21:30:46,137 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:30:45" (1/1) ... [2023-12-15 21:30:46,140 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:30:45" (1/1) ... [2023-12-15 21:30:46,144 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 21:30:46,145 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 21:30:46,145 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 21:30:46,145 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 21:30:46,146 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:30:45" (1/1) ... [2023-12-15 21:30:46,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:30:46,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:30:46,189 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-15 21:30:46,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-15 21:30:46,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 21:30:46,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-15 21:30:46,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-15 21:30:46,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2023-12-15 21:30:46,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2023-12-15 21:30:46,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2023-12-15 21:30:46,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-15 21:30:46,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-15 21:30:46,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-15 21:30:46,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-15 21:30:46,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-12-15 21:30:46,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-15 21:30:46,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-15 21:30:46,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2023-12-15 21:30:46,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2023-12-15 21:30:46,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2023-12-15 21:30:46,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-15 21:30:46,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-15 21:30:46,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-15 21:30:46,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-15 21:30:46,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-12-15 21:30:46,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-15 21:30:46,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-15 21:30:46,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2023-12-15 21:30:46,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2023-12-15 21:30:46,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2023-12-15 21:30:46,234 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-15 21:30:46,234 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-15 21:30:46,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 21:30:46,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-15 21:30:46,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-15 21:30:46,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-15 21:30:46,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-15 21:30:46,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 21:30:46,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 21:30:46,391 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 21:30:46,393 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 21:30:46,905 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 21:30:46,955 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 21:30:46,955 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 21:30:46,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:30:46 BoogieIcfgContainer [2023-12-15 21:30:46,955 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 21:30:46,958 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 21:30:46,958 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 21:30:46,961 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 21:30:46,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 09:30:45" (1/3) ... [2023-12-15 21:30:46,962 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42e179db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:30:46, skipping insertion in model container [2023-12-15 21:30:46,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:30:45" (2/3) ... [2023-12-15 21:30:46,963 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42e179db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:30:46, skipping insertion in model container [2023-12-15 21:30:46,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:30:46" (3/3) ... [2023-12-15 21:30:46,964 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-53.i [2023-12-15 21:30:46,979 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 21:30:46,980 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 21:30:47,018 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 21:30:47,023 INFO L357 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, mHoare=true, 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;@240fac7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 21:30:47,024 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 21:30:47,027 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 84 states have (on average 1.4404761904761905) internal successors, (121), 85 states have internal predecessors, (121), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-15 21:30:47,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-15 21:30:47,040 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:30:47,041 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:30:47,041 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:30:47,045 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:30:47,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1983161675, now seen corresponding path program 1 times [2023-12-15 21:30:47,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:30:47,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139137972] [2023-12-15 21:30:47,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:47,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:30:47,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:47,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:30:47,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:47,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:30:47,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:47,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:30:47,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:47,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:30:47,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:47,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:30:47,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:47,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:30:47,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:47,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:30:47,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:47,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:30:47,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:47,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:30:47,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:47,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:30:47,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:47,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:30:47,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:47,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:30:47,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:47,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:30:47,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:47,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:30:47,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:47,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 21:30:47,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:47,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 21:30:47,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:47,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:30:47,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:47,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-15 21:30:47,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:47,440 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-15 21:30:47,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:30:47,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139137972] [2023-12-15 21:30:47,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139137972] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:30:47,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:30:47,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 21:30:47,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38448958] [2023-12-15 21:30:47,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:30:47,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 21:30:47,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:30:47,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 21:30:47,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 21:30:47,486 INFO L87 Difference]: Start difference. First operand has 105 states, 84 states have (on average 1.4404761904761905) internal successors, (121), 85 states have internal predecessors, (121), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-15 21:30:47,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:30:47,529 INFO L93 Difference]: Finished difference Result 207 states and 330 transitions. [2023-12-15 21:30:47,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 21:30:47,532 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 135 [2023-12-15 21:30:47,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:30:47,541 INFO L225 Difference]: With dead ends: 207 [2023-12-15 21:30:47,541 INFO L226 Difference]: Without dead ends: 103 [2023-12-15 21:30:47,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 21:30:47,548 INFO L413 NwaCegarLoop]: 146 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, 146 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 [2023-12-15 21:30:47,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:30:47,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-12-15 21:30:47,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2023-12-15 21:30:47,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 83 states have (on average 1.3734939759036144) internal successors, (114), 83 states have internal predecessors, (114), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-15 21:30:47,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 150 transitions. [2023-12-15 21:30:47,593 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 150 transitions. Word has length 135 [2023-12-15 21:30:47,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:30:47,593 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 150 transitions. [2023-12-15 21:30:47,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-15 21:30:47,594 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 150 transitions. [2023-12-15 21:30:47,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-15 21:30:47,599 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:30:47,599 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:30:47,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 21:30:47,599 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:30:47,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:30:47,600 INFO L85 PathProgramCache]: Analyzing trace with hash 833082901, now seen corresponding path program 1 times [2023-12-15 21:30:47,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:30:47,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847148169] [2023-12-15 21:30:47,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:47,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:30:47,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:48,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:30:48,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:48,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:30:48,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:48,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:30:48,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:48,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:30:48,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:48,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:30:48,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:48,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:30:48,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:48,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:30:48,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:48,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:30:48,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:48,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:30:48,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:48,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:30:48,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:48,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:30:48,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:48,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:30:48,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:48,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:30:48,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:48,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:30:48,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:48,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 21:30:48,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:48,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 21:30:48,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:48,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:30:48,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:48,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-15 21:30:48,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:48,265 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-15 21:30:48,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:30:48,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847148169] [2023-12-15 21:30:48,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847148169] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:30:48,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:30:48,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 21:30:48,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478041974] [2023-12-15 21:30:48,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:30:48,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 21:30:48,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:30:48,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 21:30:48,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:30:48,275 INFO L87 Difference]: Start difference. First operand 103 states and 150 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-15 21:30:48,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:30:48,346 INFO L93 Difference]: Finished difference Result 205 states and 299 transitions. [2023-12-15 21:30:48,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 21:30:48,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 135 [2023-12-15 21:30:48,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:30:48,353 INFO L225 Difference]: With dead ends: 205 [2023-12-15 21:30:48,353 INFO L226 Difference]: Without dead ends: 103 [2023-12-15 21:30:48,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:30:48,355 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 1 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:30:48,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 273 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:30:48,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-12-15 21:30:48,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2023-12-15 21:30:48,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 83 states have (on average 1.3614457831325302) internal successors, (113), 83 states have internal predecessors, (113), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-15 21:30:48,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 149 transitions. [2023-12-15 21:30:48,370 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 149 transitions. Word has length 135 [2023-12-15 21:30:48,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:30:48,372 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 149 transitions. [2023-12-15 21:30:48,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-15 21:30:48,372 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 149 transitions. [2023-12-15 21:30:48,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-15 21:30:48,379 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:30:48,379 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:30:48,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 21:30:48,380 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:30:48,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:30:48,380 INFO L85 PathProgramCache]: Analyzing trace with hash -446780777, now seen corresponding path program 1 times [2023-12-15 21:30:48,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:30:48,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374744189] [2023-12-15 21:30:48,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:48,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:30:48,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:49,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:30:49,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:49,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:30:49,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:49,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:30:49,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:49,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:30:49,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:49,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:30:49,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:49,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:30:49,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:49,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:30:49,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:49,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:30:49,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:49,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:30:49,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:49,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:30:49,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:49,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:30:49,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:49,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:30:49,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:49,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:30:49,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:49,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:30:49,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:49,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 21:30:49,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:49,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 21:30:49,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:49,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:30:49,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:49,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-15 21:30:49,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:49,770 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-15 21:30:49,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:30:49,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374744189] [2023-12-15 21:30:49,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374744189] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:30:49,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:30:49,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 21:30:49,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718108539] [2023-12-15 21:30:49,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:30:49,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:30:49,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:30:49,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:30:49,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:30:49,775 INFO L87 Difference]: Start difference. First operand 103 states and 149 transitions. Second operand has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-15 21:30:49,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:30:49,972 INFO L93 Difference]: Finished difference Result 233 states and 338 transitions. [2023-12-15 21:30:49,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 21:30:49,973 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 135 [2023-12-15 21:30:49,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:30:49,980 INFO L225 Difference]: With dead ends: 233 [2023-12-15 21:30:49,981 INFO L226 Difference]: Without dead ends: 131 [2023-12-15 21:30:49,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-12-15 21:30:49,985 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 162 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:30:49,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 573 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:30:49,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-12-15 21:30:49,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 105. [2023-12-15 21:30:49,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 85 states have (on average 1.3529411764705883) internal successors, (115), 85 states have internal predecessors, (115), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-15 21:30:49,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 151 transitions. [2023-12-15 21:30:50,000 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 151 transitions. Word has length 135 [2023-12-15 21:30:50,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:30:50,000 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 151 transitions. [2023-12-15 21:30:50,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-15 21:30:50,001 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 151 transitions. [2023-12-15 21:30:50,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-15 21:30:50,002 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:30:50,002 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:30:50,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 21:30:50,002 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:30:50,002 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:30:50,002 INFO L85 PathProgramCache]: Analyzing trace with hash -839807787, now seen corresponding path program 1 times [2023-12-15 21:30:50,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:30:50,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439081936] [2023-12-15 21:30:50,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:50,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:30:50,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:51,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:30:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:51,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:30:51,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:51,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:30:51,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:51,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:30:51,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:51,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:30:51,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:51,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:30:51,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:51,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:30:51,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:51,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:30:51,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:51,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:30:51,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:51,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:30:51,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:51,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:30:51,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:51,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:30:51,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:51,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:30:51,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:51,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:30:51,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:51,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 21:30:51,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:51,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 21:30:51,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:51,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:30:51,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:51,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-15 21:30:51,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:51,450 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-15 21:30:51,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:30:51,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439081936] [2023-12-15 21:30:51,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439081936] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:30:51,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:30:51,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-15 21:30:51,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048751038] [2023-12-15 21:30:51,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:30:51,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 21:30:51,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:30:51,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 21:30:51,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:30:51,452 INFO L87 Difference]: Start difference. First operand 105 states and 151 transitions. Second operand has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-15 21:30:51,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:30:51,869 INFO L93 Difference]: Finished difference Result 350 states and 504 transitions. [2023-12-15 21:30:51,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 21:30:51,870 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 135 [2023-12-15 21:30:51,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:30:51,872 INFO L225 Difference]: With dead ends: 350 [2023-12-15 21:30:51,873 INFO L226 Difference]: Without dead ends: 246 [2023-12-15 21:30:51,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-12-15 21:30:51,879 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 148 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-15 21:30:51,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 875 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-15 21:30:51,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2023-12-15 21:30:51,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 241. [2023-12-15 21:30:51,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 189 states have (on average 1.3386243386243386) internal successors, (253), 190 states have internal predecessors, (253), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-15 21:30:51,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 349 transitions. [2023-12-15 21:30:51,913 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 349 transitions. Word has length 135 [2023-12-15 21:30:51,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:30:51,914 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 349 transitions. [2023-12-15 21:30:51,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-15 21:30:51,914 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 349 transitions. [2023-12-15 21:30:51,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-12-15 21:30:51,915 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:30:51,916 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:30:51,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 21:30:51,916 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:30:51,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:30:51,916 INFO L85 PathProgramCache]: Analyzing trace with hash -539074770, now seen corresponding path program 1 times [2023-12-15 21:30:51,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:30:51,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624217492] [2023-12-15 21:30:51,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:51,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:30:52,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:53,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:30:53,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:53,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:30:53,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:53,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:30:53,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:53,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:30:53,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:53,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:30:53,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:53,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:30:53,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:53,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:30:53,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:53,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:30:53,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:53,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:30:53,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:53,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:30:53,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:53,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:30:53,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:53,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:30:53,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:53,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:30:53,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:53,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:30:53,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:53,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 21:30:53,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:53,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 21:30:53,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:53,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:30:53,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:53,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-15 21:30:53,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:53,729 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-15 21:30:53,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:30:53,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624217492] [2023-12-15 21:30:53,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624217492] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:30:53,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:30:53,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-15 21:30:53,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986696011] [2023-12-15 21:30:53,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:30:53,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-15 21:30:53,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:30:53,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-15 21:30:53,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-12-15 21:30:53,742 INFO L87 Difference]: Start difference. First operand 241 states and 349 transitions. Second operand has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-15 21:30:54,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:30:54,473 INFO L93 Difference]: Finished difference Result 350 states and 504 transitions. [2023-12-15 21:30:54,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-15 21:30:54,474 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 137 [2023-12-15 21:30:54,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:30:54,475 INFO L225 Difference]: With dead ends: 350 [2023-12-15 21:30:54,476 INFO L226 Difference]: Without dead ends: 246 [2023-12-15 21:30:54,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2023-12-15 21:30:54,477 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 118 mSDsluCounter, 1042 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 1213 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-15 21:30:54,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 1213 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-15 21:30:54,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2023-12-15 21:30:54,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 243. [2023-12-15 21:30:54,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 190 states have (on average 1.3263157894736841) internal successors, (252), 191 states have internal predecessors, (252), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-15 21:30:54,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 348 transitions. [2023-12-15 21:30:54,502 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 348 transitions. Word has length 137 [2023-12-15 21:30:54,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:30:54,503 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 348 transitions. [2023-12-15 21:30:54,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-15 21:30:54,503 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 348 transitions. [2023-12-15 21:30:54,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-12-15 21:30:54,504 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:30:54,505 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:30:54,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-15 21:30:54,505 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:30:54,505 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:30:54,505 INFO L85 PathProgramCache]: Analyzing trace with hash 777830637, now seen corresponding path program 1 times [2023-12-15 21:30:54,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:30:54,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750150324] [2023-12-15 21:30:54,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:54,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:30:54,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:54,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:30:54,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:54,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:30:54,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:54,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:30:54,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:54,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:30:54,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:54,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:30:54,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:54,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:30:54,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:54,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:30:54,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:54,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:30:54,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:54,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:30:54,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:54,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:30:54,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:54,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:30:54,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:54,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:30:54,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:54,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:30:54,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:54,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:30:54,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:54,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 21:30:54,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:54,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 21:30:54,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:54,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:30:54,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:54,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-15 21:30:54,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:54,723 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-15 21:30:54,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:30:54,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750150324] [2023-12-15 21:30:54,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750150324] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:30:54,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:30:54,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 21:30:54,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614285432] [2023-12-15 21:30:54,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:30:54,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 21:30:54,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:30:54,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 21:30:54,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:30:54,726 INFO L87 Difference]: Start difference. First operand 243 states and 348 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-15 21:30:54,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:30:54,774 INFO L93 Difference]: Finished difference Result 451 states and 643 transitions. [2023-12-15 21:30:54,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 21:30:54,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 140 [2023-12-15 21:30:54,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:30:54,777 INFO L225 Difference]: With dead ends: 451 [2023-12-15 21:30:54,777 INFO L226 Difference]: Without dead ends: 243 [2023-12-15 21:30:54,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:30:54,779 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 36 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:30:54,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 234 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:30:54,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2023-12-15 21:30:54,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2023-12-15 21:30:54,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 190 states have (on average 1.3157894736842106) internal successors, (250), 191 states have internal predecessors, (250), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-15 21:30:54,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 346 transitions. [2023-12-15 21:30:54,805 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 346 transitions. Word has length 140 [2023-12-15 21:30:54,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:30:54,806 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 346 transitions. [2023-12-15 21:30:54,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-15 21:30:54,807 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 346 transitions. [2023-12-15 21:30:54,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-12-15 21:30:54,808 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:30:54,809 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:30:54,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-15 21:30:54,809 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:30:54,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:30:54,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1035996075, now seen corresponding path program 1 times [2023-12-15 21:30:54,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:30:54,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388212368] [2023-12-15 21:30:54,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:54,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:30:54,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:55,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:30:55,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:55,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:30:55,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:55,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:30:55,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:55,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:30:55,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:55,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:30:55,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:55,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:30:55,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:55,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:30:55,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:55,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:30:55,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:55,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:30:55,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:55,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:30:55,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:55,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:30:55,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:55,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:30:55,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:55,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:30:55,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:55,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:30:55,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:55,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 21:30:55,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:55,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 21:30:55,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:55,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:30:55,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:55,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-15 21:30:55,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:55,955 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-15 21:30:55,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:30:55,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388212368] [2023-12-15 21:30:55,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388212368] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:30:55,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:30:55,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 21:30:55,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647776825] [2023-12-15 21:30:55,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:30:55,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 21:30:55,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:30:55,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 21:30:55,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:30:55,958 INFO L87 Difference]: Start difference. First operand 243 states and 346 transitions. Second operand has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-15 21:30:56,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:30:56,215 INFO L93 Difference]: Finished difference Result 563 states and 786 transitions. [2023-12-15 21:30:56,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-15 21:30:56,216 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 140 [2023-12-15 21:30:56,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:30:56,219 INFO L225 Difference]: With dead ends: 563 [2023-12-15 21:30:56,219 INFO L226 Difference]: Without dead ends: 355 [2023-12-15 21:30:56,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2023-12-15 21:30:56,221 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 142 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 831 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:30:56,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 831 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:30:56,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2023-12-15 21:30:56,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 329. [2023-12-15 21:30:56,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 270 states have (on average 1.3111111111111111) internal successors, (354), 273 states have internal predecessors, (354), 52 states have call successors, (52), 6 states have call predecessors, (52), 6 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2023-12-15 21:30:56,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 458 transitions. [2023-12-15 21:30:56,250 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 458 transitions. Word has length 140 [2023-12-15 21:30:56,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:30:56,251 INFO L495 AbstractCegarLoop]: Abstraction has 329 states and 458 transitions. [2023-12-15 21:30:56,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-15 21:30:56,251 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 458 transitions. [2023-12-15 21:30:56,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-12-15 21:30:56,253 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:30:56,253 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:30:56,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-15 21:30:56,254 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:30:56,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:30:56,254 INFO L85 PathProgramCache]: Analyzing trace with hash -282543593, now seen corresponding path program 1 times [2023-12-15 21:30:56,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:30:56,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011992511] [2023-12-15 21:30:56,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:56,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:30:56,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:57,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:30:57,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:57,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:30:57,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:57,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:30:57,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:57,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:30:57,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:57,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:30:57,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:57,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:30:57,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:57,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:30:57,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:57,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:30:57,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:57,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:30:57,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:57,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:30:57,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:57,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:30:57,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:57,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:30:57,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:57,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:30:57,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:57,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:30:57,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:57,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 21:30:57,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:57,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 21:30:57,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:57,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:30:57,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:57,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-15 21:30:57,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:57,630 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-15 21:30:57,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:30:57,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011992511] [2023-12-15 21:30:57,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011992511] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:30:57,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:30:57,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-15 21:30:57,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464465667] [2023-12-15 21:30:57,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:30:57,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-15 21:30:57,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:30:57,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-15 21:30:57,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-12-15 21:30:57,632 INFO L87 Difference]: Start difference. First operand 329 states and 458 transitions. Second operand has 11 states, 9 states have (on average 6.0) internal successors, (54), 11 states have internal predecessors, (54), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2023-12-15 21:30:58,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:30:58,452 INFO L93 Difference]: Finished difference Result 775 states and 1070 transitions. [2023-12-15 21:30:58,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-15 21:30:58,453 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 6.0) internal successors, (54), 11 states have internal predecessors, (54), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) Word has length 141 [2023-12-15 21:30:58,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:30:58,455 INFO L225 Difference]: With dead ends: 775 [2023-12-15 21:30:58,455 INFO L226 Difference]: Without dead ends: 481 [2023-12-15 21:30:58,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2023-12-15 21:30:58,457 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 328 mSDsluCounter, 1061 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 1224 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-15 21:30:58,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 1224 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 708 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-15 21:30:58,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2023-12-15 21:30:58,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 309. [2023-12-15 21:30:58,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 262 states have (on average 1.3206106870229009) internal successors, (346), 264 states have internal predecessors, (346), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-15 21:30:58,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 426 transitions. [2023-12-15 21:30:58,492 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 426 transitions. Word has length 141 [2023-12-15 21:30:58,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:30:58,492 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 426 transitions. [2023-12-15 21:30:58,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 6.0) internal successors, (54), 11 states have internal predecessors, (54), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2023-12-15 21:30:58,493 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 426 transitions. [2023-12-15 21:30:58,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-12-15 21:30:58,494 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:30:58,494 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:30:58,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-15 21:30:58,495 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:30:58,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:30:58,495 INFO L85 PathProgramCache]: Analyzing trace with hash -675570603, now seen corresponding path program 1 times [2023-12-15 21:30:58,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:30:58,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015548113] [2023-12-15 21:30:58,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:58,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:30:58,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:59,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:30:59,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:59,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:30:59,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:59,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:30:59,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:59,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:30:59,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:59,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:30:59,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:59,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:30:59,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:59,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:30:59,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:59,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:30:59,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:59,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:30:59,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:59,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:30:59,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:59,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:30:59,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:59,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:30:59,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:59,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:30:59,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:59,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:30:59,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:59,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 21:30:59,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:59,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 21:30:59,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:59,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:30:59,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:59,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-15 21:30:59,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:59,155 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-15 21:30:59,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:30:59,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015548113] [2023-12-15 21:30:59,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015548113] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:30:59,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:30:59,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-15 21:30:59,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883958906] [2023-12-15 21:30:59,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:30:59,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 21:30:59,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:30:59,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 21:30:59,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:30:59,157 INFO L87 Difference]: Start difference. First operand 309 states and 426 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-15 21:30:59,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:30:59,653 INFO L93 Difference]: Finished difference Result 729 states and 1001 transitions. [2023-12-15 21:30:59,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 21:30:59,653 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141 [2023-12-15 21:30:59,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:30:59,656 INFO L225 Difference]: With dead ends: 729 [2023-12-15 21:30:59,656 INFO L226 Difference]: Without dead ends: 421 [2023-12-15 21:30:59,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-12-15 21:30:59,658 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 264 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-15 21:30:59,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 733 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-15 21:30:59,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2023-12-15 21:30:59,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 316. [2023-12-15 21:30:59,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 269 states have (on average 1.308550185873606) internal successors, (352), 271 states have internal predecessors, (352), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-15 21:30:59,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 432 transitions. [2023-12-15 21:30:59,696 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 432 transitions. Word has length 141 [2023-12-15 21:30:59,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:30:59,697 INFO L495 AbstractCegarLoop]: Abstraction has 316 states and 432 transitions. [2023-12-15 21:30:59,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-15 21:30:59,697 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 432 transitions. [2023-12-15 21:30:59,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-12-15 21:30:59,698 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:30:59,699 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:30:59,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-15 21:30:59,699 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:30:59,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:30:59,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1971487335, now seen corresponding path program 1 times [2023-12-15 21:30:59,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:30:59,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495467542] [2023-12-15 21:30:59,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:59,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:30:59,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:59,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:30:59,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:59,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:30:59,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:59,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:30:59,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:59,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:30:59,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:59,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:30:59,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:00,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:00,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:00,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:31:00,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:00,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:31:00,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:00,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:31:00,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:00,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:31:00,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:00,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:31:00,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:00,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:31:00,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:00,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:31:00,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:00,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:31:00,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:00,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 21:31:00,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:00,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 21:31:00,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:00,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:31:00,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:00,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-15 21:31:00,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:00,018 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-15 21:31:00,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:00,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495467542] [2023-12-15 21:31:00,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495467542] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:00,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:00,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:31:00,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340152288] [2023-12-15 21:31:00,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:00,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:31:00,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:00,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:31:00,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:31:00,020 INFO L87 Difference]: Start difference. First operand 316 states and 432 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-15 21:31:00,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:00,243 INFO L93 Difference]: Finished difference Result 901 states and 1238 transitions. [2023-12-15 21:31:00,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 21:31:00,243 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141 [2023-12-15 21:31:00,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:00,246 INFO L225 Difference]: With dead ends: 901 [2023-12-15 21:31:00,246 INFO L226 Difference]: Without dead ends: 586 [2023-12-15 21:31:00,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:31:00,248 INFO L413 NwaCegarLoop]: 224 mSDtfsCounter, 168 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:00,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 760 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:31:00,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2023-12-15 21:31:00,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 336. [2023-12-15 21:31:00,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 289 states have (on average 1.2975778546712802) internal successors, (375), 291 states have internal predecessors, (375), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-15 21:31:00,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 455 transitions. [2023-12-15 21:31:00,299 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 455 transitions. Word has length 141 [2023-12-15 21:31:00,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:00,299 INFO L495 AbstractCegarLoop]: Abstraction has 336 states and 455 transitions. [2023-12-15 21:31:00,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-15 21:31:00,300 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 455 transitions. [2023-12-15 21:31:00,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-12-15 21:31:00,301 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:00,301 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:31:00,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-15 21:31:00,301 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:00,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:00,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1930452951, now seen corresponding path program 1 times [2023-12-15 21:31:00,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:00,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368254072] [2023-12-15 21:31:00,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:00,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:00,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:01,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:01,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:01,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:01,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:01,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:01,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:31:01,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:31:01,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:31:01,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:31:01,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:31:01,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:31:01,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:31:01,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:31:01,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 21:31:01,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 21:31:01,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:31:01,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-15 21:31:01,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,123 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-15 21:31:01,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:01,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368254072] [2023-12-15 21:31:01,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368254072] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:01,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:01,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-15 21:31:01,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994076788] [2023-12-15 21:31:01,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:01,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 21:31:01,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:01,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 21:31:01,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-15 21:31:01,125 INFO L87 Difference]: Start difference. First operand 336 states and 455 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-15 21:31:01,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:01,987 INFO L93 Difference]: Finished difference Result 784 states and 1061 transitions. [2023-12-15 21:31:01,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-15 21:31:01,988 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141 [2023-12-15 21:31:01,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:01,990 INFO L225 Difference]: With dead ends: 784 [2023-12-15 21:31:01,990 INFO L226 Difference]: Without dead ends: 449 [2023-12-15 21:31:01,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2023-12-15 21:31:01,991 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 306 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 1021 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:01,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 1021 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-15 21:31:01,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2023-12-15 21:31:02,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 406. [2023-12-15 21:31:02,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 343 states have (on average 1.2944606413994169) internal successors, (444), 346 states have internal predecessors, (444), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-15 21:31:02,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 552 transitions. [2023-12-15 21:31:02,047 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 552 transitions. Word has length 141 [2023-12-15 21:31:02,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:02,047 INFO L495 AbstractCegarLoop]: Abstraction has 406 states and 552 transitions. [2023-12-15 21:31:02,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-15 21:31:02,048 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 552 transitions. [2023-12-15 21:31:02,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-12-15 21:31:02,049 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:02,049 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:31:02,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-15 21:31:02,049 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:02,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:02,050 INFO L85 PathProgramCache]: Analyzing trace with hash -421090215, now seen corresponding path program 1 times [2023-12-15 21:31:02,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:02,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647429672] [2023-12-15 21:31:02,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:02,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:02,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:02,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:02,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:02,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:02,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:02,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:02,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:31:02,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:31:02,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:31:02,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:31:02,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:31:02,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:31:02,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:31:02,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:31:02,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 21:31:02,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 21:31:02,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:31:02,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-15 21:31:02,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,245 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-15 21:31:02,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:02,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647429672] [2023-12-15 21:31:02,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647429672] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:02,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:02,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:31:02,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464279406] [2023-12-15 21:31:02,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:02,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:31:02,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:02,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:31:02,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:31:02,248 INFO L87 Difference]: Start difference. First operand 406 states and 552 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-15 21:31:02,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:02,342 INFO L93 Difference]: Finished difference Result 851 states and 1158 transitions. [2023-12-15 21:31:02,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:31:02,343 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 142 [2023-12-15 21:31:02,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:02,346 INFO L225 Difference]: With dead ends: 851 [2023-12-15 21:31:02,346 INFO L226 Difference]: Without dead ends: 446 [2023-12-15 21:31:02,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:31:02,347 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 32 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:02,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 540 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:31:02,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2023-12-15 21:31:02,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 421. [2023-12-15 21:31:02,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 358 states have (on average 1.282122905027933) internal successors, (459), 361 states have internal predecessors, (459), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-15 21:31:02,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 567 transitions. [2023-12-15 21:31:02,406 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 567 transitions. Word has length 142 [2023-12-15 21:31:02,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:02,406 INFO L495 AbstractCegarLoop]: Abstraction has 421 states and 567 transitions. [2023-12-15 21:31:02,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-15 21:31:02,406 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 567 transitions. [2023-12-15 21:31:02,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-12-15 21:31:02,408 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:02,408 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:31:02,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-15 21:31:02,409 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:02,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:02,409 INFO L85 PathProgramCache]: Analyzing trace with hash 721525071, now seen corresponding path program 1 times [2023-12-15 21:31:02,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:02,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480884887] [2023-12-15 21:31:02,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:02,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:02,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:02,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:02,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:02,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:02,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:02,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:02,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:31:02,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:31:02,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:31:02,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:31:02,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:31:02,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:31:02,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:31:02,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:31:02,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 21:31:02,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 21:31:02,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:31:02,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-15 21:31:02,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,603 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-15 21:31:02,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:02,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480884887] [2023-12-15 21:31:02,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480884887] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:02,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:02,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 21:31:02,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446708481] [2023-12-15 21:31:02,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:02,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:31:02,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:02,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:31:02,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:31:02,606 INFO L87 Difference]: Start difference. First operand 421 states and 567 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-15 21:31:02,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:02,711 INFO L93 Difference]: Finished difference Result 931 states and 1248 transitions. [2023-12-15 21:31:02,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 21:31:02,712 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 142 [2023-12-15 21:31:02,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:02,716 INFO L225 Difference]: With dead ends: 931 [2023-12-15 21:31:02,716 INFO L226 Difference]: Without dead ends: 511 [2023-12-15 21:31:02,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-15 21:31:02,718 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 74 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:02,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 689 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:31:02,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2023-12-15 21:31:02,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 435. [2023-12-15 21:31:02,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 372 states have (on average 1.271505376344086) internal successors, (473), 375 states have internal predecessors, (473), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-15 21:31:02,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 581 transitions. [2023-12-15 21:31:02,802 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 581 transitions. Word has length 142 [2023-12-15 21:31:02,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:02,802 INFO L495 AbstractCegarLoop]: Abstraction has 435 states and 581 transitions. [2023-12-15 21:31:02,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-15 21:31:02,802 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 581 transitions. [2023-12-15 21:31:02,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-12-15 21:31:02,804 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:02,804 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:31:02,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-15 21:31:02,804 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:02,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:02,805 INFO L85 PathProgramCache]: Analyzing trace with hash 549103024, now seen corresponding path program 1 times [2023-12-15 21:31:02,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:02,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861141160] [2023-12-15 21:31:02,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:02,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:02,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:03,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:03,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:03,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:03,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:03,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:03,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:03,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:03,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:03,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:03,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:03,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:03,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:03,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:31:03,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:03,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:31:03,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:03,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:31:03,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:03,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:31:03,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:03,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:31:03,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:03,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:31:03,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:03,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:31:03,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:03,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:31:03,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:03,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 21:31:03,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:03,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 21:31:03,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:03,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:31:03,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:03,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-15 21:31:03,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:03,673 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-15 21:31:03,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:03,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861141160] [2023-12-15 21:31:03,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861141160] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:03,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:03,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-15 21:31:03,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831034149] [2023-12-15 21:31:03,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:03,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-15 21:31:03,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:03,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-15 21:31:03,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-12-15 21:31:03,675 INFO L87 Difference]: Start difference. First operand 435 states and 581 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-15 21:31:04,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:04,584 INFO L93 Difference]: Finished difference Result 831 states and 1115 transitions. [2023-12-15 21:31:04,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-15 21:31:04,586 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 143 [2023-12-15 21:31:04,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:04,589 INFO L225 Difference]: With dead ends: 831 [2023-12-15 21:31:04,589 INFO L226 Difference]: Without dead ends: 651 [2023-12-15 21:31:04,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2023-12-15 21:31:04,590 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 350 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 1036 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:04,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 1036 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-15 21:31:04,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2023-12-15 21:31:04,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 470. [2023-12-15 21:31:04,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 396 states have (on average 1.27020202020202) internal successors, (503), 399 states have internal predecessors, (503), 64 states have call successors, (64), 9 states have call predecessors, (64), 9 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2023-12-15 21:31:04,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 631 transitions. [2023-12-15 21:31:04,686 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 631 transitions. Word has length 143 [2023-12-15 21:31:04,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:04,686 INFO L495 AbstractCegarLoop]: Abstraction has 470 states and 631 transitions. [2023-12-15 21:31:04,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-15 21:31:04,687 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 631 transitions. [2023-12-15 21:31:04,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-12-15 21:31:04,689 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:04,689 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:31:04,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-15 21:31:04,689 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:04,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:04,690 INFO L85 PathProgramCache]: Analyzing trace with hash 156076014, now seen corresponding path program 1 times [2023-12-15 21:31:04,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:04,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78938316] [2023-12-15 21:31:04,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:04,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:04,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:04,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:04,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:04,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:04,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:04,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:04,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:31:04,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:31:04,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:31:04,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:31:04,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:31:04,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:31:04,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:31:04,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:31:04,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 21:31:04,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 21:31:04,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:31:04,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-15 21:31:04,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,982 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-15 21:31:04,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:04,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78938316] [2023-12-15 21:31:04,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78938316] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:04,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:04,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:31:04,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211909901] [2023-12-15 21:31:04,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:04,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:31:04,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:04,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:31:04,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:31:04,985 INFO L87 Difference]: Start difference. First operand 470 states and 631 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-15 21:31:05,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:05,237 INFO L93 Difference]: Finished difference Result 877 states and 1180 transitions. [2023-12-15 21:31:05,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:31:05,238 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 143 [2023-12-15 21:31:05,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:05,241 INFO L225 Difference]: With dead ends: 877 [2023-12-15 21:31:05,241 INFO L226 Difference]: Without dead ends: 696 [2023-12-15 21:31:05,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:31:05,245 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 136 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:05,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 499 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:31:05,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2023-12-15 21:31:05,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 470. [2023-12-15 21:31:05,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 396 states have (on average 1.2651515151515151) internal successors, (501), 399 states have internal predecessors, (501), 64 states have call successors, (64), 9 states have call predecessors, (64), 9 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2023-12-15 21:31:05,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 629 transitions. [2023-12-15 21:31:05,319 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 629 transitions. Word has length 143 [2023-12-15 21:31:05,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:05,320 INFO L495 AbstractCegarLoop]: Abstraction has 470 states and 629 transitions. [2023-12-15 21:31:05,320 INFO L496 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-15 21:31:05,320 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 629 transitions. [2023-12-15 21:31:05,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-12-15 21:31:05,321 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:05,321 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:31:05,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-15 21:31:05,322 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:05,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:05,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1532867728, now seen corresponding path program 1 times [2023-12-15 21:31:05,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:05,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822099493] [2023-12-15 21:31:05,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:05,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:05,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:06,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:06,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:06,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:06,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:06,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:06,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:06,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:06,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:06,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:06,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:06,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:06,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:06,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:31:06,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:06,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:31:06,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:06,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:31:06,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:06,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:31:06,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:06,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:31:06,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:06,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:31:06,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:06,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:31:06,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:06,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:31:06,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:06,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 21:31:06,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:06,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 21:31:06,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:06,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:31:06,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:06,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-15 21:31:06,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:06,119 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-15 21:31:06,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:06,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822099493] [2023-12-15 21:31:06,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822099493] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:06,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:06,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-15 21:31:06,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636310934] [2023-12-15 21:31:06,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:06,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-15 21:31:06,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:06,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-15 21:31:06,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-12-15 21:31:06,123 INFO L87 Difference]: Start difference. First operand 470 states and 629 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-15 21:31:06,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:06,995 INFO L93 Difference]: Finished difference Result 766 states and 1018 transitions. [2023-12-15 21:31:06,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-15 21:31:06,996 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 143 [2023-12-15 21:31:06,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:06,999 INFO L225 Difference]: With dead ends: 766 [2023-12-15 21:31:06,999 INFO L226 Difference]: Without dead ends: 585 [2023-12-15 21:31:06,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2023-12-15 21:31:07,000 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 311 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 1047 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:07,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 1047 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-15 21:31:07,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2023-12-15 21:31:07,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 547. [2023-12-15 21:31:07,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 457 states have (on average 1.262582056892779) internal successors, (577), 461 states have internal predecessors, (577), 78 states have call successors, (78), 11 states have call predecessors, (78), 11 states have return successors, (78), 74 states have call predecessors, (78), 78 states have call successors, (78) [2023-12-15 21:31:07,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 733 transitions. [2023-12-15 21:31:07,100 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 733 transitions. Word has length 143 [2023-12-15 21:31:07,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:07,101 INFO L495 AbstractCegarLoop]: Abstraction has 547 states and 733 transitions. [2023-12-15 21:31:07,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-15 21:31:07,101 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 733 transitions. [2023-12-15 21:31:07,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-15 21:31:07,104 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:07,104 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:31:07,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-15 21:31:07,104 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:07,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:07,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1333738674, now seen corresponding path program 1 times [2023-12-15 21:31:07,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:07,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324883403] [2023-12-15 21:31:07,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:07,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:07,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:08,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:08,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:08,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:08,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:08,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:08,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:08,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:08,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:08,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:08,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:08,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:08,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:08,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:31:08,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:08,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:31:08,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:08,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:31:08,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:08,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:31:08,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:08,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:31:08,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:08,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:31:08,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:08,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:31:08,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:08,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:31:08,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:08,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 21:31:08,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:08,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 21:31:08,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:08,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:31:08,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:08,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-15 21:31:08,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:08,194 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-15 21:31:08,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:08,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324883403] [2023-12-15 21:31:08,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324883403] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:08,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:08,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-15 21:31:08,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123322094] [2023-12-15 21:31:08,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:08,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 21:31:08,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:08,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 21:31:08,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-15 21:31:08,195 INFO L87 Difference]: Start difference. First operand 547 states and 733 transitions. Second operand has 9 states, 6 states have (on average 9.5) internal successors, (57), 9 states have internal predecessors, (57), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2023-12-15 21:31:08,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:08,586 INFO L93 Difference]: Finished difference Result 1375 states and 1846 transitions. [2023-12-15 21:31:08,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-15 21:31:08,586 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 9.5) internal successors, (57), 9 states have internal predecessors, (57), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) Word has length 144 [2023-12-15 21:31:08,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:08,589 INFO L225 Difference]: With dead ends: 1375 [2023-12-15 21:31:08,590 INFO L226 Difference]: Without dead ends: 829 [2023-12-15 21:31:08,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-12-15 21:31:08,591 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 120 mSDsluCounter, 923 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 1091 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:08,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 1091 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:31:08,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2023-12-15 21:31:08,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 767. [2023-12-15 21:31:08,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 767 states, 650 states have (on average 1.2707692307692309) internal successors, (826), 658 states have internal predecessors, (826), 100 states have call successors, (100), 16 states have call predecessors, (100), 16 states have return successors, (100), 92 states have call predecessors, (100), 100 states have call successors, (100) [2023-12-15 21:31:08,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1026 transitions. [2023-12-15 21:31:08,749 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1026 transitions. Word has length 144 [2023-12-15 21:31:08,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:08,749 INFO L495 AbstractCegarLoop]: Abstraction has 767 states and 1026 transitions. [2023-12-15 21:31:08,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 9.5) internal successors, (57), 9 states have internal predecessors, (57), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2023-12-15 21:31:08,749 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1026 transitions. [2023-12-15 21:31:08,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-15 21:31:08,750 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:08,750 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:31:08,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-15 21:31:08,751 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:08,751 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:08,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1465541730, now seen corresponding path program 1 times [2023-12-15 21:31:08,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:08,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447491302] [2023-12-15 21:31:08,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:08,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:08,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:10,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:10,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:10,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:10,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:10,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:10,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:31:10,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:31:10,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:31:10,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:31:10,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:31:10,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:31:10,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:31:10,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:31:10,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 21:31:10,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 21:31:10,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:31:10,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-15 21:31:10,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,104 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-15 21:31:10,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:10,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447491302] [2023-12-15 21:31:10,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447491302] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:10,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:10,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-15 21:31:10,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528923867] [2023-12-15 21:31:10,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:10,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 21:31:10,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:10,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 21:31:10,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:31:10,106 INFO L87 Difference]: Start difference. First operand 767 states and 1026 transitions. Second operand has 8 states, 6 states have (on average 9.5) internal successors, (57), 8 states have internal predecessors, (57), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2023-12-15 21:31:10,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:10,518 INFO L93 Difference]: Finished difference Result 1279 states and 1674 transitions. [2023-12-15 21:31:10,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-15 21:31:10,519 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 9.5) internal successors, (57), 8 states have internal predecessors, (57), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) Word has length 144 [2023-12-15 21:31:10,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:10,523 INFO L225 Difference]: With dead ends: 1279 [2023-12-15 21:31:10,523 INFO L226 Difference]: Without dead ends: 1277 [2023-12-15 21:31:10,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-12-15 21:31:10,524 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 62 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:10,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 854 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:31:10,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states. [2023-12-15 21:31:10,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 1145. [2023-12-15 21:31:10,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1145 states, 1016 states have (on average 1.266732283464567) internal successors, (1287), 1028 states have internal predecessors, (1287), 108 states have call successors, (108), 20 states have call predecessors, (108), 20 states have return successors, (108), 96 states have call predecessors, (108), 108 states have call successors, (108) [2023-12-15 21:31:10,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 1503 transitions. [2023-12-15 21:31:10,701 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 1503 transitions. Word has length 144 [2023-12-15 21:31:10,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:10,701 INFO L495 AbstractCegarLoop]: Abstraction has 1145 states and 1503 transitions. [2023-12-15 21:31:10,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 9.5) internal successors, (57), 8 states have internal predecessors, (57), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2023-12-15 21:31:10,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1503 transitions. [2023-12-15 21:31:10,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-15 21:31:10,703 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:10,703 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:31:10,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-15 21:31:10,704 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:10,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:10,704 INFO L85 PathProgramCache]: Analyzing trace with hash 704533060, now seen corresponding path program 1 times [2023-12-15 21:31:10,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:10,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825249247] [2023-12-15 21:31:10,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:10,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:10,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:10,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:10,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:10,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:10,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:10,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:10,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:31:10,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:31:10,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:31:10,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:31:10,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:31:10,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:31:10,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:31:10,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:31:10,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 21:31:10,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 21:31:10,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:31:10,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-15 21:31:10,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,899 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-15 21:31:10,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:10,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825249247] [2023-12-15 21:31:10,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825249247] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:10,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:10,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 21:31:10,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249010723] [2023-12-15 21:31:10,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:10,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 21:31:10,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:10,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 21:31:10,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:31:10,902 INFO L87 Difference]: Start difference. First operand 1145 states and 1503 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-15 21:31:11,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:11,150 INFO L93 Difference]: Finished difference Result 2703 states and 3499 transitions. [2023-12-15 21:31:11,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-15 21:31:11,151 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 144 [2023-12-15 21:31:11,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:11,156 INFO L225 Difference]: With dead ends: 2703 [2023-12-15 21:31:11,157 INFO L226 Difference]: Without dead ends: 1585 [2023-12-15 21:31:11,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2023-12-15 21:31:11,159 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 94 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:11,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 859 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:31:11,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2023-12-15 21:31:11,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1161. [2023-12-15 21:31:11,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1161 states, 1032 states have (on average 1.2625968992248062) internal successors, (1303), 1044 states have internal predecessors, (1303), 108 states have call successors, (108), 20 states have call predecessors, (108), 20 states have return successors, (108), 96 states have call predecessors, (108), 108 states have call successors, (108) [2023-12-15 21:31:11,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1519 transitions. [2023-12-15 21:31:11,322 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1519 transitions. Word has length 144 [2023-12-15 21:31:11,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:11,322 INFO L495 AbstractCegarLoop]: Abstraction has 1161 states and 1519 transitions. [2023-12-15 21:31:11,322 INFO L496 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-15 21:31:11,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1519 transitions. [2023-12-15 21:31:11,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-15 21:31:11,324 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:11,325 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:31:11,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-15 21:31:11,325 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:11,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:11,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1908510180, now seen corresponding path program 1 times [2023-12-15 21:31:11,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:11,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678046428] [2023-12-15 21:31:11,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:11,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:11,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:12,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:12,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:12,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:12,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:12,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:12,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:12,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:12,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:12,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:12,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:12,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:12,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:12,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:31:12,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:12,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:31:12,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:12,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:31:12,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:12,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:31:12,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:12,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:31:12,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:12,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:31:12,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:12,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:31:12,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:12,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:31:12,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:12,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 21:31:12,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:12,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 21:31:12,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:12,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:31:12,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:12,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-15 21:31:12,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:12,101 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 36 proven. 15 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-12-15 21:31:12,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:12,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678046428] [2023-12-15 21:31:12,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678046428] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:31:12,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29043964] [2023-12-15 21:31:12,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:12,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:31:12,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:31:12,108 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:31:12,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-15 21:31:12,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:12,394 INFO L262 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-15 21:31:12,408 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:31:12,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2023-12-15 21:31:12,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2023-12-15 21:31:12,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2023-12-15 21:31:12,683 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:31:12,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 18 [2023-12-15 21:31:12,721 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 281 proven. 15 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2023-12-15 21:31:12,721 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:31:12,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2023-12-15 21:31:13,138 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 36 proven. 15 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-12-15 21:31:13,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [29043964] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:31:13,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:31:13,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 12] total 26 [2023-12-15 21:31:13,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127719448] [2023-12-15 21:31:13,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:31:13,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-15 21:31:13,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:13,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-15 21:31:13,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=532, Unknown=0, NotChecked=0, Total=650 [2023-12-15 21:31:13,141 INFO L87 Difference]: Start difference. First operand 1161 states and 1519 transitions. Second operand has 26 states, 23 states have (on average 5.782608695652174) internal successors, (133), 26 states have internal predecessors, (133), 9 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (42), 6 states have call predecessors, (42), 9 states have call successors, (42) [2023-12-15 21:31:15,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:15,179 INFO L93 Difference]: Finished difference Result 2648 states and 3428 transitions. [2023-12-15 21:31:15,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-12-15 21:31:15,180 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 5.782608695652174) internal successors, (133), 26 states have internal predecessors, (133), 9 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (42), 6 states have call predecessors, (42), 9 states have call successors, (42) Word has length 146 [2023-12-15 21:31:15,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:15,186 INFO L225 Difference]: With dead ends: 2648 [2023-12-15 21:31:15,186 INFO L226 Difference]: Without dead ends: 1514 [2023-12-15 21:31:15,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 673 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=576, Invalid=2394, Unknown=0, NotChecked=0, Total=2970 [2023-12-15 21:31:15,190 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 1349 mSDsluCounter, 1437 mSDsCounter, 0 mSdLazyCounter, 1087 mSolverCounterSat, 314 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1387 SdHoareTripleChecker+Valid, 1575 SdHoareTripleChecker+Invalid, 1401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 314 IncrementalHoareTripleChecker+Valid, 1087 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:15,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1387 Valid, 1575 Invalid, 1401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [314 Valid, 1087 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-15 21:31:15,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2023-12-15 21:31:15,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1355. [2023-12-15 21:31:15,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1355 states, 1193 states have (on average 1.2640402347024309) internal successors, (1508), 1207 states have internal predecessors, (1508), 132 states have call successors, (132), 29 states have call predecessors, (132), 29 states have return successors, (132), 118 states have call predecessors, (132), 132 states have call successors, (132) [2023-12-15 21:31:15,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1355 states and 1772 transitions. [2023-12-15 21:31:15,402 INFO L78 Accepts]: Start accepts. Automaton has 1355 states and 1772 transitions. Word has length 146 [2023-12-15 21:31:15,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:15,402 INFO L495 AbstractCegarLoop]: Abstraction has 1355 states and 1772 transitions. [2023-12-15 21:31:15,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 5.782608695652174) internal successors, (133), 26 states have internal predecessors, (133), 9 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (42), 6 states have call predecessors, (42), 9 states have call successors, (42) [2023-12-15 21:31:15,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1772 transitions. [2023-12-15 21:31:15,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-15 21:31:15,404 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:15,405 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:31:15,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-15 21:31:15,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:31:15,610 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:15,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:15,611 INFO L85 PathProgramCache]: Analyzing trace with hash 753428320, now seen corresponding path program 1 times [2023-12-15 21:31:15,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:15,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779588726] [2023-12-15 21:31:15,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:15,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:15,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:16,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:16,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:16,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:16,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:16,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:16,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:16,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:16,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:16,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:16,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:16,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:16,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:16,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:31:16,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:16,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:31:16,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:16,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:31:16,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:16,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:31:16,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:16,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:31:16,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:16,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:31:16,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:16,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:31:16,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:16,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:31:16,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:16,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 21:31:16,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:16,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 21:31:16,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:16,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:31:16,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:16,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-15 21:31:16,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:16,260 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 42 proven. 9 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-12-15 21:31:16,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:16,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779588726] [2023-12-15 21:31:16,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779588726] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:31:16,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240821317] [2023-12-15 21:31:16,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:16,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:31:16,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:31:16,265 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:31:16,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-15 21:31:16,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:16,536 INFO L262 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-15 21:31:16,542 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:31:16,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-12-15 21:31:16,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 21 [2023-12-15 21:31:16,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-12-15 21:31:16,944 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 213 proven. 9 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2023-12-15 21:31:16,944 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:31:17,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2023-12-15 21:31:17,179 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 42 proven. 9 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-12-15 21:31:17,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240821317] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:31:17,179 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:31:17,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 20 [2023-12-15 21:31:17,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265242332] [2023-12-15 21:31:17,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:31:17,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-15 21:31:17,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:17,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-15 21:31:17,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2023-12-15 21:31:17,181 INFO L87 Difference]: Start difference. First operand 1355 states and 1772 transitions. Second operand has 20 states, 18 states have (on average 7.111111111111111) internal successors, (128), 20 states have internal predecessors, (128), 6 states have call successors, (54), 3 states have call predecessors, (54), 6 states have return successors, (54), 4 states have call predecessors, (54), 6 states have call successors, (54) [2023-12-15 21:31:18,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:18,495 INFO L93 Difference]: Finished difference Result 3132 states and 4067 transitions. [2023-12-15 21:31:18,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-12-15 21:31:18,495 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 7.111111111111111) internal successors, (128), 20 states have internal predecessors, (128), 6 states have call successors, (54), 3 states have call predecessors, (54), 6 states have return successors, (54), 4 states have call predecessors, (54), 6 states have call successors, (54) Word has length 146 [2023-12-15 21:31:18,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:18,502 INFO L225 Difference]: With dead ends: 3132 [2023-12-15 21:31:18,502 INFO L226 Difference]: Without dead ends: 1816 [2023-12-15 21:31:18,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 318 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=245, Invalid=1087, Unknown=0, NotChecked=0, Total=1332 [2023-12-15 21:31:18,505 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 474 mSDsluCounter, 1382 mSDsCounter, 0 mSdLazyCounter, 1085 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 1498 SdHoareTripleChecker+Invalid, 1143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:18,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 1498 Invalid, 1143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1085 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-15 21:31:18,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1816 states. [2023-12-15 21:31:18,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1816 to 1576. [2023-12-15 21:31:18,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1389 states have (on average 1.2598992080633549) internal successors, (1750), 1405 states have internal predecessors, (1750), 152 states have call successors, (152), 34 states have call predecessors, (152), 34 states have return successors, (152), 136 states have call predecessors, (152), 152 states have call successors, (152) [2023-12-15 21:31:18,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 2054 transitions. [2023-12-15 21:31:18,716 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 2054 transitions. Word has length 146 [2023-12-15 21:31:18,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:18,716 INFO L495 AbstractCegarLoop]: Abstraction has 1576 states and 2054 transitions. [2023-12-15 21:31:18,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 7.111111111111111) internal successors, (128), 20 states have internal predecessors, (128), 6 states have call successors, (54), 3 states have call predecessors, (54), 6 states have return successors, (54), 4 states have call predecessors, (54), 6 states have call successors, (54) [2023-12-15 21:31:18,717 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 2054 transitions. [2023-12-15 21:31:18,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-15 21:31:18,718 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:18,718 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:31:18,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-15 21:31:18,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-12-15 21:31:18,925 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:18,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:18,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1638793950, now seen corresponding path program 1 times [2023-12-15 21:31:18,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:18,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136442374] [2023-12-15 21:31:18,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:18,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:19,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:19,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:19,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:19,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:19,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:19,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:19,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:19,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:19,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:19,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:19,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:19,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:19,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:19,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:31:19,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:19,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:31:19,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:19,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:31:19,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:19,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:31:19,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:19,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:31:19,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:19,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:31:19,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:19,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:31:19,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:19,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:31:19,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:19,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 21:31:19,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:19,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 21:31:19,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:19,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:31:19,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:19,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-15 21:31:19,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:19,638 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 3 proven. 48 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-12-15 21:31:19,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:19,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136442374] [2023-12-15 21:31:19,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136442374] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:31:19,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599914649] [2023-12-15 21:31:19,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:19,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:31:19,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:31:19,639 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:31:19,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-15 21:31:19,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:19,868 INFO L262 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-15 21:31:19,876 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:31:19,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2023-12-15 21:31:19,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-15 21:31:19,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-12-15 21:31:19,992 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 213 proven. 9 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2023-12-15 21:31:19,992 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:31:20,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2023-12-15 21:31:20,222 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 42 proven. 9 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-12-15 21:31:20,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599914649] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:31:20,222 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:31:20,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 8] total 19 [2023-12-15 21:31:20,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168912030] [2023-12-15 21:31:20,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:31:20,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-15 21:31:20,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:20,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-15 21:31:20,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2023-12-15 21:31:20,224 INFO L87 Difference]: Start difference. First operand 1576 states and 2054 transitions. Second operand has 19 states, 16 states have (on average 8.625) internal successors, (138), 19 states have internal predecessors, (138), 7 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (39), 4 states have call predecessors, (39), 7 states have call successors, (39) [2023-12-15 21:31:21,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:21,137 INFO L93 Difference]: Finished difference Result 3331 states and 4245 transitions. [2023-12-15 21:31:21,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-15 21:31:21,139 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 8.625) internal successors, (138), 19 states have internal predecessors, (138), 7 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (39), 4 states have call predecessors, (39), 7 states have call successors, (39) Word has length 147 [2023-12-15 21:31:21,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:21,147 INFO L225 Difference]: With dead ends: 3331 [2023-12-15 21:31:21,147 INFO L226 Difference]: Without dead ends: 1794 [2023-12-15 21:31:21,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 325 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=277, Invalid=913, Unknown=0, NotChecked=0, Total=1190 [2023-12-15 21:31:21,153 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 337 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:21,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 642 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-15 21:31:21,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1794 states. [2023-12-15 21:31:21,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1794 to 875. [2023-12-15 21:31:21,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 875 states, 756 states have (on average 1.2301587301587302) internal successors, (930), 761 states have internal predecessors, (930), 92 states have call successors, (92), 26 states have call predecessors, (92), 26 states have return successors, (92), 87 states have call predecessors, (92), 92 states have call successors, (92) [2023-12-15 21:31:21,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1114 transitions. [2023-12-15 21:31:21,308 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1114 transitions. Word has length 147 [2023-12-15 21:31:21,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:21,308 INFO L495 AbstractCegarLoop]: Abstraction has 875 states and 1114 transitions. [2023-12-15 21:31:21,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 8.625) internal successors, (138), 19 states have internal predecessors, (138), 7 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (39), 4 states have call predecessors, (39), 7 states have call successors, (39) [2023-12-15 21:31:21,308 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1114 transitions. [2023-12-15 21:31:21,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-15 21:31:21,309 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:21,309 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:31:21,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-15 21:31:21,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:31:21,516 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:21,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:21,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1455963043, now seen corresponding path program 1 times [2023-12-15 21:31:21,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:21,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461799127] [2023-12-15 21:31:21,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:21,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:21,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:22,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:22,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:22,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:22,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:22,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:22,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:22,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:22,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:22,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:22,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:22,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:22,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:22,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:31:22,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:22,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:31:22,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:22,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:31:22,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:22,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:31:22,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:22,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:31:22,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:22,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:31:22,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:22,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:31:22,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:22,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:31:22,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:22,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 21:31:22,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:22,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 21:31:22,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:22,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:31:22,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:22,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-15 21:31:22,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:22,116 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-15 21:31:22,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:22,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461799127] [2023-12-15 21:31:22,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461799127] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:22,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:22,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-15 21:31:22,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714022005] [2023-12-15 21:31:22,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:22,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-15 21:31:22,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:22,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-15 21:31:22,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-12-15 21:31:22,117 INFO L87 Difference]: Start difference. First operand 875 states and 1114 transitions. Second operand has 10 states, 9 states have (on average 6.777777777777778) internal successors, (61), 10 states have internal predecessors, (61), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-15 21:31:22,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:22,619 INFO L93 Difference]: Finished difference Result 1420 states and 1803 transitions. [2023-12-15 21:31:22,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-15 21:31:22,619 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.777777777777778) internal successors, (61), 10 states have internal predecessors, (61), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 148 [2023-12-15 21:31:22,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:22,623 INFO L225 Difference]: With dead ends: 1420 [2023-12-15 21:31:22,623 INFO L226 Difference]: Without dead ends: 950 [2023-12-15 21:31:22,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2023-12-15 21:31:22,625 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 150 mSDsluCounter, 1590 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 1831 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:22,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 1831 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:31:22,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2023-12-15 21:31:22,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 919. [2023-12-15 21:31:22,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 919 states, 779 states have (on average 1.2182284980744544) internal successors, (949), 784 states have internal predecessors, (949), 106 states have call successors, (106), 33 states have call predecessors, (106), 33 states have return successors, (106), 101 states have call predecessors, (106), 106 states have call successors, (106) [2023-12-15 21:31:22,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1161 transitions. [2023-12-15 21:31:22,787 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1161 transitions. Word has length 148 [2023-12-15 21:31:22,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:22,787 INFO L495 AbstractCegarLoop]: Abstraction has 919 states and 1161 transitions. [2023-12-15 21:31:22,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.777777777777778) internal successors, (61), 10 states have internal predecessors, (61), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-15 21:31:22,787 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1161 transitions. [2023-12-15 21:31:22,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-12-15 21:31:22,789 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:22,789 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:31:22,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-15 21:31:22,789 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:22,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:22,789 INFO L85 PathProgramCache]: Analyzing trace with hash 907858676, now seen corresponding path program 1 times [2023-12-15 21:31:22,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:22,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629404384] [2023-12-15 21:31:22,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:22,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:22,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:23,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:23,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:23,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:23,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:23,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:23,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:23,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:23,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:23,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:23,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:23,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:23,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:23,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:31:23,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:23,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:31:23,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:23,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:31:23,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:23,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:31:23,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:23,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:31:23,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:23,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:31:23,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:24,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:31:24,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:24,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:31:24,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:24,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 21:31:24,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:24,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 21:31:24,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:24,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:31:24,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:24,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-15 21:31:24,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:24,050 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 114 proven. 54 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2023-12-15 21:31:24,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:24,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629404384] [2023-12-15 21:31:24,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629404384] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:31:24,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199000717] [2023-12-15 21:31:24,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:24,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:31:24,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:31:24,053 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:31:24,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-15 21:31:26,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:26,100 INFO L262 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 61 conjunts are in the unsatisfiable core [2023-12-15 21:31:26,107 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:31:26,294 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 25 treesize of output 13 [2023-12-15 21:31:26,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2023-12-15 21:31:27,840 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:31:27,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 42 [2023-12-15 21:31:28,477 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 408 proven. 54 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2023-12-15 21:31:28,478 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:31:29,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [199000717] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:31:29,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-15 21:31:29,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19] total 31 [2023-12-15 21:31:29,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057849676] [2023-12-15 21:31:29,756 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-15 21:31:29,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-12-15 21:31:29,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:29,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-12-15 21:31:29,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=1714, Unknown=0, NotChecked=0, Total=2070 [2023-12-15 21:31:29,758 INFO L87 Difference]: Start difference. First operand 919 states and 1161 transitions. Second operand has 31 states, 23 states have (on average 4.913043478260869) internal successors, (113), 27 states have internal predecessors, (113), 14 states have call successors, (36), 6 states have call predecessors, (36), 9 states have return successors, (36), 10 states have call predecessors, (36), 14 states have call successors, (36) Received shutdown request... [2023-12-15 21:31:31,897 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-15 21:31:31,917 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-15 21:31:32,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-15 21:31:33,118 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-15 21:31:33,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 [2023-12-15 21:31:33,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 602 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=479, Invalid=1971, Unknown=0, NotChecked=0, Total=2450 [2023-12-15 21:31:33,125 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 15 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:33,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 24 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-15 21:31:33,126 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 21:31:33,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-12-15 21:31:33,126 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-12-15 21:31:33,130 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:31:33,131 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 21:31:33,133 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 09:31:33 BoogieIcfgContainer [2023-12-15 21:31:33,133 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 21:31:33,134 INFO L158 Benchmark]: Toolchain (without parser) took 47454.69ms. Allocated memory was 246.4MB in the beginning and 849.3MB in the end (delta: 602.9MB). Free memory was 195.1MB in the beginning and 338.7MB in the end (delta: -143.6MB). Peak memory consumption was 460.1MB. Max. memory is 8.0GB. [2023-12-15 21:31:33,134 INFO L158 Benchmark]: CDTParser took 0.83ms. Allocated memory is still 246.4MB. Free memory is still 194.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 21:31:33,134 INFO L158 Benchmark]: CACSL2BoogieTranslator took 290.79ms. Allocated memory is still 246.4MB. Free memory was 194.9MB in the beginning and 179.8MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-15 21:31:33,134 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.93ms. Allocated memory is still 246.4MB. Free memory was 179.6MB in the beginning and 175.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-15 21:31:33,134 INFO L158 Benchmark]: Boogie Preprocessor took 109.54ms. Allocated memory is still 246.4MB. Free memory was 175.4MB in the beginning and 170.2MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-15 21:31:33,135 INFO L158 Benchmark]: RCFGBuilder took 810.39ms. Allocated memory was 246.4MB in the beginning and 436.2MB in the end (delta: 189.8MB). Free memory was 170.2MB in the beginning and 385.8MB in the end (delta: -215.6MB). Peak memory consumption was 29.8MB. Max. memory is 8.0GB. [2023-12-15 21:31:33,135 INFO L158 Benchmark]: TraceAbstraction took 46175.46ms. Allocated memory was 436.2MB in the beginning and 849.3MB in the end (delta: 413.1MB). Free memory was 385.3MB in the beginning and 338.7MB in the end (delta: 46.6MB). Peak memory consumption was 459.7MB. Max. memory is 8.0GB. [2023-12-15 21:31:33,136 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.83ms. Allocated memory is still 246.4MB. Free memory is still 194.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 290.79ms. Allocated memory is still 246.4MB. Free memory was 194.9MB in the beginning and 179.8MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 62.93ms. Allocated memory is still 246.4MB. Free memory was 179.6MB in the beginning and 175.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 109.54ms. Allocated memory is still 246.4MB. Free memory was 175.4MB in the beginning and 170.2MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 810.39ms. Allocated memory was 246.4MB in the beginning and 436.2MB in the end (delta: 189.8MB). Free memory was 170.2MB in the beginning and 385.8MB in the end (delta: -215.6MB). Peak memory consumption was 29.8MB. Max. memory is 8.0GB. * TraceAbstraction took 46175.46ms. Allocated memory was 436.2MB in the beginning and 849.3MB in the end (delta: 413.1MB). Free memory was 385.3MB in the beginning and 338.7MB in the end (delta: 46.6MB). Peak memory consumption was 459.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 19]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 19). Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 105 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 46.1s, OverallIterations: 24, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 15.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5257 SdHoareTripleChecker+Valid, 8.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5177 mSDsluCounter, 20068 SdHoareTripleChecker+Invalid, 7.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16477 mSDsCounter, 737 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7964 IncrementalHoareTripleChecker+Invalid, 8702 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 737 mSolverCounterUnsat, 3591 mSDtfsCounter, 7964 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2342 GetRequests, 2005 SyntacticMatches, 1 SemanticMatches, 336 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1805 ImplicationChecksByTransitivity, 6.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1576occurred in iteration=21, InterpolantAutomatonStates: 255, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 23 MinimizatonAttempts, 3143 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 3.6s SatisfiabilityAnalysisTime, 22.5s InterpolantComputationTime, 3990 NumberOfCodeBlocks, 3990 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 4398 ConstructedInterpolants, 0 QuantifiedInterpolants, 23725 SizeOfPredicates, 62 NumberOfNonLiveVariables, 2109 ConjunctsInSsa, 140 ConjunctsInUnsatCore, 31 InterpolantComputations, 20 PerfectInterpolantSequences, 18726/18972 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout !ENTRY org.eclipse.osgi 4 0 2023-12-15 21:31:33.151 !MESSAGE Application error !STACK 1 org.eclipse.core.internal.resources.ResourceException(/)[568]: java.io.FileNotFoundException: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba0b99c0b/.metadata/.plugins/org.eclipse.core.resources/.root/1.tree (No such file or directory) at java.base/java.io.FileOutputStream.open0(Native Method) at java.base/java.io.FileOutputStream.open(FileOutputStream.java:298) at java.base/java.io.FileOutputStream.(FileOutputStream.java:237) at java.base/java.io.FileOutputStream.(FileOutputStream.java:187) at org.eclipse.core.internal.localstore.SafeFileOutputStream.(SafeFileOutputStream.java:55) at org.eclipse.core.internal.resources.SaveManager.saveTree(SaveManager.java:1381) at org.eclipse.core.internal.resources.SaveManager.save(SaveManager.java:1168) at org.eclipse.core.internal.resources.Workspace.save(Workspace.java:2333) at org.eclipse.core.internal.resources.Workspace.save(Workspace.java:2322) at de.uni_freiburg.informatik.ultimate.core.coreplugin.UltimateCore.start(UltimateCore.java:190) at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203) at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134) at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104) at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401) at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255) at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method) at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62) at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43) at java.base/java.lang.reflect.Method.invoke(Method.java:566) at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:657) at org.eclipse.equinox.launcher.Main.basicRun(Main.java:594) at org.eclipse.equinox.launcher.Main.run(Main.java:1465) at org.eclipse.equinox.launcher.Main.main(Main.java:1438) Completed graceful shutdown