/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 23:23:49,024 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 23:23:49,026 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 23:23:49,094 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 23:23:49,095 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 23:23:49,096 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 23:23:49,096 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 23:23:49,111 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 23:23:49,113 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 23:23:49,117 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 23:23:49,117 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 23:23:49,118 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 23:23:49,118 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 23:23:49,119 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 23:23:49,119 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 23:23:49,120 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 23:23:49,120 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 23:23:49,121 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 23:23:49,123 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 23:23:49,128 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 23:23:49,129 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 23:23:49,130 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 23:23:49,133 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 23:23:49,133 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 23:23:49,137 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 23:23:49,137 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 23:23:49,137 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 23:23:49,138 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 23:23:49,138 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 23:23:49,138 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 23:23:49,138 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 23:23:49,139 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 23:23:49,139 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 23:23:49,140 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 23:23:49,140 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 23:23:49,140 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 23:23:49,141 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 23:23:49,141 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 23:23:49,141 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 23:23:49,141 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 23:23:49,142 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 23:23:49,145 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-01-31 23:23:49,153 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 23:23:49,154 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 23:23:49,155 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 23:23:49,155 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 23:23:49,155 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 23:23:49,155 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 23:23:49,155 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 23:23:49,155 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 23:23:49,155 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 23:23:49,156 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 23:23:49,156 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 23:23:49,156 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 23:23:49,156 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 23:23:49,156 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 23:23:49,157 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 23:23:49,157 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 23:23:49,157 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 23:23:49,157 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-01-31 23:23:49,157 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-31 23:23:49,157 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-01-31 23:23:49,157 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-31 23:23:49,362 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 23:23:49,381 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 23:23:49,383 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 23:23:49,385 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 23:23:49,385 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 23:23:49,386 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2022-01-31 23:23:49,439 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1730c4374/73d06c9327574fd489864682bb1cf21f/FLAG4ac74ffa4 [2022-01-31 23:23:49,783 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 23:23:49,783 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2022-01-31 23:23:49,788 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1730c4374/73d06c9327574fd489864682bb1cf21f/FLAG4ac74ffa4 [2022-01-31 23:23:49,798 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1730c4374/73d06c9327574fd489864682bb1cf21f [2022-01-31 23:23:49,800 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 23:23:49,801 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-01-31 23:23:49,802 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 23:23:49,803 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 23:23:49,808 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 23:23:49,809 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 11:23:49" (1/1) ... [2022-01-31 23:23:49,809 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52b88041 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:23:49, skipping insertion in model container [2022-01-31 23:23:49,809 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 11:23:49" (1/1) ... [2022-01-31 23:23:49,813 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 23:23:49,838 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 23:23:49,955 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1224,1237] [2022-01-31 23:23:49,958 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1636,1649] [2022-01-31 23:23:49,959 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1851,1864] [2022-01-31 23:23:49,961 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2384,2397] [2022-01-31 23:23:49,961 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2599,2612] [2022-01-31 23:23:49,963 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2901,2914] [2022-01-31 23:23:49,963 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3116,3129] [2022-01-31 23:23:49,964 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3386,3399] [2022-01-31 23:23:49,965 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3604,3617] [2022-01-31 23:23:49,967 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4088,4101] [2022-01-31 23:23:49,967 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4306,4319] [2022-01-31 23:23:49,969 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4802,4815] [2022-01-31 23:23:49,970 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5203,5216] [2022-01-31 23:23:49,970 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5421,5434] [2022-01-31 23:23:49,971 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5792,5805] [2022-01-31 23:23:49,972 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6010,6023] [2022-01-31 23:23:49,973 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6296,6309] [2022-01-31 23:23:49,974 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6514,6527] [2022-01-31 23:23:49,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 23:23:49,980 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 23:23:49,989 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1224,1237] [2022-01-31 23:23:49,990 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1636,1649] [2022-01-31 23:23:49,991 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1851,1864] [2022-01-31 23:23:49,992 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2384,2397] [2022-01-31 23:23:49,992 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2599,2612] [2022-01-31 23:23:49,993 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2901,2914] [2022-01-31 23:23:49,994 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3116,3129] [2022-01-31 23:23:49,995 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3386,3399] [2022-01-31 23:23:49,995 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3604,3617] [2022-01-31 23:23:49,997 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4088,4101] [2022-01-31 23:23:49,997 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4306,4319] [2022-01-31 23:23:49,998 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4802,4815] [2022-01-31 23:23:49,999 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5203,5216] [2022-01-31 23:23:50,000 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5421,5434] [2022-01-31 23:23:50,001 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5792,5805] [2022-01-31 23:23:50,001 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6010,6023] [2022-01-31 23:23:50,002 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6296,6309] [2022-01-31 23:23:50,002 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6514,6527] [2022-01-31 23:23:50,008 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 23:23:50,016 INFO L208 MainTranslator]: Completed translation [2022-01-31 23:23:50,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:23:50 WrapperNode [2022-01-31 23:23:50,016 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 23:23:50,017 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 23:23:50,017 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 23:23:50,017 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 23:23:50,024 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:23:50" (1/1) ... [2022-01-31 23:23:50,024 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:23:50" (1/1) ... [2022-01-31 23:23:50,029 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:23:50" (1/1) ... [2022-01-31 23:23:50,029 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:23:50" (1/1) ... [2022-01-31 23:23:50,040 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:23:50" (1/1) ... [2022-01-31 23:23:50,043 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:23:50" (1/1) ... [2022-01-31 23:23:50,044 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:23:50" (1/1) ... [2022-01-31 23:23:50,045 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 23:23:50,051 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 23:23:50,051 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 23:23:50,051 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 23:23:50,052 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:23:50" (1/1) ... [2022-01-31 23:23:50,058 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 23:23:50,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 23:23:50,074 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-31 23:23:50,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-31 23:23:50,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 23:23:50,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 23:23:50,097 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 23:23:50,097 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-31 23:23:50,097 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 23:23:50,097 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 23:23:50,097 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 23:23:50,097 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 23:23:50,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 23:23:50,097 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-31 23:23:50,098 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 23:23:50,098 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 23:23:50,098 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 23:23:50,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 23:23:50,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 23:23:50,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 23:23:50,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 23:23:50,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 23:23:50,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 23:23:50,166 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 23:23:50,167 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 23:23:50,355 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 23:23:50,359 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 23:23:50,359 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-31 23:23:50,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:23:50 BoogieIcfgContainer [2022-01-31 23:23:50,361 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 23:23:50,362 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 23:23:50,362 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 23:23:50,366 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 23:23:50,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 11:23:49" (1/3) ... [2022-01-31 23:23:50,367 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15afa5c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 11:23:50, skipping insertion in model container [2022-01-31 23:23:50,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:23:50" (2/3) ... [2022-01-31 23:23:50,367 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15afa5c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 11:23:50, skipping insertion in model container [2022-01-31 23:23:50,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:23:50" (3/3) ... [2022-01-31 23:23:50,368 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+lhb-reducer.c [2022-01-31 23:23:50,371 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-01-31 23:23:50,372 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-01-31 23:23:50,405 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 23:23:50,409 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=AcceleratedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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, mLoopAccelerationTechnique=QVASR [2022-01-31 23:23:50,410 INFO L340 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2022-01-31 23:23:50,419 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 57 states have (on average 1.8421052631578947) internal successors, (105), 75 states have internal predecessors, (105), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 23:23:50,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-01-31 23:23:50,424 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:50,424 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:23:50,425 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-01-31 23:23:50,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:50,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1796468500, now seen corresponding path program 1 times [2022-01-31 23:23:50,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:50,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [416068968] [2022-01-31 23:23:50,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:50,459 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:50,496 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:50,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:50,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:50,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:50,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:23:50,704 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:50,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [416068968] [2022-01-31 23:23:50,706 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [416068968] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:50,706 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:50,706 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 23:23:50,707 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891057988] [2022-01-31 23:23:50,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:50,710 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 23:23:50,710 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:50,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 23:23:50,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 23:23:50,729 INFO L87 Difference]: Start difference. First operand has 80 states, 57 states have (on average 1.8421052631578947) internal successors, (105), 75 states have internal predecessors, (105), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:50,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:50,956 INFO L93 Difference]: Finished difference Result 129 states and 172 transitions. [2022-01-31 23:23:50,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 23:23:50,959 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-01-31 23:23:50,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:50,964 INFO L225 Difference]: With dead ends: 129 [2022-01-31 23:23:50,964 INFO L226 Difference]: Without dead ends: 111 [2022-01-31 23:23:50,966 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-31 23:23:50,968 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 67 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:50,969 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 208 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 23:23:50,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-01-31 23:23:50,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 73. [2022-01-31 23:23:50,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 69 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:50,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2022-01-31 23:23:50,996 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 12 [2022-01-31 23:23:50,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:50,996 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2022-01-31 23:23:50,996 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:50,996 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2022-01-31 23:23:50,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-01-31 23:23:50,997 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:50,997 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:23:50,997 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 23:23:50,997 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-01-31 23:23:50,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:50,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1799639252, now seen corresponding path program 1 times [2022-01-31 23:23:50,998 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:50,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [169451310] [2022-01-31 23:23:50,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:50,999 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:51,000 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:51,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:51,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:51,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:51,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:23:51,046 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:51,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [169451310] [2022-01-31 23:23:51,059 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [169451310] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:51,059 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:51,059 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 23:23:51,060 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078070413] [2022-01-31 23:23:51,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:51,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 23:23:51,060 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:51,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 23:23:51,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 23:23:51,061 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:51,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:51,244 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2022-01-31 23:23:51,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 23:23:51,244 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-01-31 23:23:51,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:51,249 INFO L225 Difference]: With dead ends: 111 [2022-01-31 23:23:51,249 INFO L226 Difference]: Without dead ends: 109 [2022-01-31 23:23:51,250 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-31 23:23:51,251 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 72 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:51,255 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 218 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 23:23:51,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-01-31 23:23:51,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 71. [2022-01-31 23:23:51,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 67 states have internal predecessors, (72), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:51,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2022-01-31 23:23:51,273 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 12 [2022-01-31 23:23:51,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:51,273 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2022-01-31 23:23:51,273 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:51,273 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2022-01-31 23:23:51,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-31 23:23:51,273 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:51,273 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:23:51,274 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 23:23:51,274 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-01-31 23:23:51,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:51,275 INFO L85 PathProgramCache]: Analyzing trace with hash -991466384, now seen corresponding path program 1 times [2022-01-31 23:23:51,275 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:51,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [654753597] [2022-01-31 23:23:51,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:51,276 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:51,277 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:51,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:51,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:51,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:51,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:23:51,348 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:51,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [654753597] [2022-01-31 23:23:51,349 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [654753597] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:51,349 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:51,349 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 23:23:51,349 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121830976] [2022-01-31 23:23:51,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:51,349 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 23:23:51,349 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:51,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 23:23:51,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 23:23:51,350 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:51,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:51,494 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2022-01-31 23:23:51,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 23:23:51,494 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-01-31 23:23:51,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:51,495 INFO L225 Difference]: With dead ends: 73 [2022-01-31 23:23:51,495 INFO L226 Difference]: Without dead ends: 71 [2022-01-31 23:23:51,495 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-31 23:23:51,496 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 68 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:51,496 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 132 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 23:23:51,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-01-31 23:23:51,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2022-01-31 23:23:51,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 65 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:51,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2022-01-31 23:23:51,502 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 15 [2022-01-31 23:23:51,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:51,503 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2022-01-31 23:23:51,503 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:51,503 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2022-01-31 23:23:51,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-31 23:23:51,503 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:51,503 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:23:51,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-31 23:23:51,504 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr12ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-01-31 23:23:51,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:51,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1020772778, now seen corresponding path program 1 times [2022-01-31 23:23:51,504 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:51,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [789886274] [2022-01-31 23:23:51,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:51,505 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:51,506 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:51,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:51,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:51,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:51,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:23:51,548 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:51,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [789886274] [2022-01-31 23:23:51,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [789886274] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:51,548 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:51,549 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 23:23:51,549 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915135300] [2022-01-31 23:23:51,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:51,549 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 23:23:51,549 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:51,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 23:23:51,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 23:23:51,550 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:51,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:51,650 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2022-01-31 23:23:51,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 23:23:51,650 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-01-31 23:23:51,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:51,651 INFO L225 Difference]: With dead ends: 71 [2022-01-31 23:23:51,651 INFO L226 Difference]: Without dead ends: 69 [2022-01-31 23:23:51,651 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-31 23:23:51,652 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 66 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:51,652 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 126 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 23:23:51,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-01-31 23:23:51,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2022-01-31 23:23:51,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 50 states have (on average 1.36) internal successors, (68), 63 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:51,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2022-01-31 23:23:51,665 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 15 [2022-01-31 23:23:51,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:51,666 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2022-01-31 23:23:51,666 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:51,667 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2022-01-31 23:23:51,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-31 23:23:51,668 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:51,668 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:23:51,668 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-31 23:23:51,668 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-01-31 23:23:51,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:51,668 INFO L85 PathProgramCache]: Analyzing trace with hash -670683748, now seen corresponding path program 1 times [2022-01-31 23:23:51,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:51,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1873609180] [2022-01-31 23:23:51,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:51,672 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:51,673 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:51,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:51,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:51,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:51,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:23:51,756 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:51,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1873609180] [2022-01-31 23:23:51,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1873609180] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:51,756 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:51,757 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 23:23:51,757 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424437121] [2022-01-31 23:23:51,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:51,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 23:23:51,757 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:51,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 23:23:51,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 23:23:51,757 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:51,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:51,842 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-01-31 23:23:51,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 23:23:51,843 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-01-31 23:23:51,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:51,844 INFO L225 Difference]: With dead ends: 69 [2022-01-31 23:23:51,844 INFO L226 Difference]: Without dead ends: 65 [2022-01-31 23:23:51,845 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-01-31 23:23:51,846 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 23 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:51,847 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 147 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 23:23:51,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-01-31 23:23:51,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2022-01-31 23:23:51,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 59 states have internal predecessors, (64), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:51,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2022-01-31 23:23:51,857 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 16 [2022-01-31 23:23:51,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:51,857 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2022-01-31 23:23:51,857 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:51,857 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2022-01-31 23:23:51,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-31 23:23:51,858 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:51,858 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:23:51,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-31 23:23:51,859 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr16ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-01-31 23:23:51,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:51,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1578739961, now seen corresponding path program 1 times [2022-01-31 23:23:51,859 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:51,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1636922329] [2022-01-31 23:23:51,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:51,860 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:51,861 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:51,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:51,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:51,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:51,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:23:51,926 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:51,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1636922329] [2022-01-31 23:23:51,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1636922329] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:51,926 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:51,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 23:23:51,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760154603] [2022-01-31 23:23:51,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:51,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 23:23:51,926 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:51,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 23:23:51,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 23:23:51,927 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:52,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:52,061 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2022-01-31 23:23:52,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 23:23:52,062 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-01-31 23:23:52,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:52,063 INFO L225 Difference]: With dead ends: 108 [2022-01-31 23:23:52,063 INFO L226 Difference]: Without dead ends: 106 [2022-01-31 23:23:52,063 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-31 23:23:52,064 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 102 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:52,065 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 167 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 23:23:52,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-01-31 23:23:52,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 61. [2022-01-31 23:23:52,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 57 states have internal predecessors, (62), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:52,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2022-01-31 23:23:52,079 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 16 [2022-01-31 23:23:52,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:52,079 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2022-01-31 23:23:52,079 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:52,079 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2022-01-31 23:23:52,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-31 23:23:52,081 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:52,081 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:23:52,082 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-31 23:23:52,082 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr14ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-01-31 23:23:52,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:52,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1578753863, now seen corresponding path program 1 times [2022-01-31 23:23:52,082 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:52,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1704265826] [2022-01-31 23:23:52,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:52,083 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:52,083 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:52,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:52,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:52,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:52,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:23:52,149 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:52,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1704265826] [2022-01-31 23:23:52,149 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1704265826] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:52,149 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:52,149 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 23:23:52,149 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623002566] [2022-01-31 23:23:52,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:52,149 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 23:23:52,149 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:52,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 23:23:52,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 23:23:52,150 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:52,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:52,265 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2022-01-31 23:23:52,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 23:23:52,266 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-01-31 23:23:52,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:52,267 INFO L225 Difference]: With dead ends: 93 [2022-01-31 23:23:52,267 INFO L226 Difference]: Without dead ends: 91 [2022-01-31 23:23:52,267 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-31 23:23:52,267 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 88 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:52,268 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 147 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 23:23:52,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-01-31 23:23:52,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 59. [2022-01-31 23:23:52,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 55 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:52,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2022-01-31 23:23:52,273 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 16 [2022-01-31 23:23:52,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:52,274 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2022-01-31 23:23:52,274 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:52,278 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2022-01-31 23:23:52,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-31 23:23:52,281 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:52,281 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:23:52,281 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-31 23:23:52,281 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr13ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-01-31 23:23:52,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:52,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1579181860, now seen corresponding path program 1 times [2022-01-31 23:23:52,282 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:52,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [607588000] [2022-01-31 23:23:52,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:52,283 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:52,284 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:52,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:52,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:52,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:52,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:23:52,335 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:52,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [607588000] [2022-01-31 23:23:52,335 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [607588000] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:52,335 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:52,335 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 23:23:52,335 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815237015] [2022-01-31 23:23:52,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:52,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 23:23:52,335 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:52,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 23:23:52,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 23:23:52,336 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:52,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:52,399 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2022-01-31 23:23:52,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 23:23:52,400 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-01-31 23:23:52,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:52,400 INFO L225 Difference]: With dead ends: 61 [2022-01-31 23:23:52,401 INFO L226 Difference]: Without dead ends: 57 [2022-01-31 23:23:52,401 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-01-31 23:23:52,401 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 20 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:52,401 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 129 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 23:23:52,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-01-31 23:23:52,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2022-01-31 23:23:52,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 51 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:52,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2022-01-31 23:23:52,409 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 16 [2022-01-31 23:23:52,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:52,409 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2022-01-31 23:23:52,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:52,409 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2022-01-31 23:23:52,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-31 23:23:52,409 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:52,409 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:23:52,409 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-31 23:23:52,410 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-01-31 23:23:52,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:52,410 INFO L85 PathProgramCache]: Analyzing trace with hash 697862626, now seen corresponding path program 1 times [2022-01-31 23:23:52,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:52,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2030659037] [2022-01-31 23:23:52,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:52,410 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:52,411 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:52,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:52,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:52,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:52,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:23:52,451 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:52,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2030659037] [2022-01-31 23:23:52,451 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2030659037] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:52,451 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:52,451 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 23:23:52,451 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717894444] [2022-01-31 23:23:52,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:52,452 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 23:23:52,452 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:52,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 23:23:52,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 23:23:52,452 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:52,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:52,543 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2022-01-31 23:23:52,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 23:23:52,543 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-01-31 23:23:52,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:52,543 INFO L225 Difference]: With dead ends: 74 [2022-01-31 23:23:52,544 INFO L226 Difference]: Without dead ends: 72 [2022-01-31 23:23:52,544 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-31 23:23:52,544 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 74 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:52,544 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 116 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 23:23:52,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-01-31 23:23:52,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 53. [2022-01-31 23:23:52,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 49 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:52,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2022-01-31 23:23:52,549 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 17 [2022-01-31 23:23:52,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:52,549 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2022-01-31 23:23:52,549 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:52,550 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-01-31 23:23:52,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-31 23:23:52,550 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:52,550 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:23:52,550 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-31 23:23:52,550 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-01-31 23:23:52,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:52,550 INFO L85 PathProgramCache]: Analyzing trace with hash 699401826, now seen corresponding path program 1 times [2022-01-31 23:23:52,551 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:52,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1246477936] [2022-01-31 23:23:52,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:52,551 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:52,552 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:52,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:52,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:52,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:52,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:23:52,586 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:52,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1246477936] [2022-01-31 23:23:52,586 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1246477936] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:52,586 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:52,586 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 23:23:52,586 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742640379] [2022-01-31 23:23:52,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:52,587 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 23:23:52,587 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:52,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 23:23:52,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 23:23:52,587 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:52,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:52,656 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2022-01-31 23:23:52,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 23:23:52,656 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-01-31 23:23:52,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:52,658 INFO L225 Difference]: With dead ends: 55 [2022-01-31 23:23:52,658 INFO L226 Difference]: Without dead ends: 53 [2022-01-31 23:23:52,659 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-31 23:23:52,659 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 48 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:52,660 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 90 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 23:23:52,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-01-31 23:23:52,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2022-01-31 23:23:52,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 40 states have (on average 1.3) internal successors, (52), 47 states have internal predecessors, (52), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:52,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2022-01-31 23:23:52,665 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 17 [2022-01-31 23:23:52,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:52,666 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2022-01-31 23:23:52,666 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:52,666 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2022-01-31 23:23:52,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-31 23:23:52,667 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:52,667 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:23:52,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-31 23:23:52,668 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr17ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-01-31 23:23:52,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:52,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1696295318, now seen corresponding path program 1 times [2022-01-31 23:23:52,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:52,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [409904965] [2022-01-31 23:23:52,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:52,669 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:52,669 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:52,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:52,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:52,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:52,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:23:52,775 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:52,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [409904965] [2022-01-31 23:23:52,775 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [409904965] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:52,775 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:52,775 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 23:23:52,775 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501855059] [2022-01-31 23:23:52,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:52,776 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 23:23:52,776 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:52,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 23:23:52,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-31 23:23:52,776 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:52,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:52,913 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2022-01-31 23:23:52,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 23:23:52,913 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-01-31 23:23:52,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:52,914 INFO L225 Difference]: With dead ends: 110 [2022-01-31 23:23:52,914 INFO L226 Difference]: Without dead ends: 108 [2022-01-31 23:23:52,914 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-01-31 23:23:52,914 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 87 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:52,914 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 188 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 23:23:52,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-01-31 23:23:52,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 56. [2022-01-31 23:23:52,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 45 states have (on average 1.288888888888889) internal successors, (58), 52 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:52,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2022-01-31 23:23:52,920 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 17 [2022-01-31 23:23:52,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:52,921 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2022-01-31 23:23:52,921 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:52,921 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-01-31 23:23:52,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-31 23:23:52,921 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:52,921 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:23:52,921 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-31 23:23:52,921 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-01-31 23:23:52,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:52,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1696726294, now seen corresponding path program 1 times [2022-01-31 23:23:52,922 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:52,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1601254026] [2022-01-31 23:23:52,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:52,922 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:52,935 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:52,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:53,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:53,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:53,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:23:53,018 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:53,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1601254026] [2022-01-31 23:23:53,018 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1601254026] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:53,018 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:53,019 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 23:23:53,019 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270767736] [2022-01-31 23:23:53,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:53,019 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 23:23:53,019 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:53,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 23:23:53,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-31 23:23:53,019 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:53,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:53,157 INFO L93 Difference]: Finished difference Result 108 states and 117 transitions. [2022-01-31 23:23:53,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 23:23:53,158 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-01-31 23:23:53,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:53,158 INFO L225 Difference]: With dead ends: 108 [2022-01-31 23:23:53,158 INFO L226 Difference]: Without dead ends: 106 [2022-01-31 23:23:53,159 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-01-31 23:23:53,159 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 74 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:53,159 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 181 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 23:23:53,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-01-31 23:23:53,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 58. [2022-01-31 23:23:53,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 54 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:53,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2022-01-31 23:23:53,166 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 17 [2022-01-31 23:23:53,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:53,166 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2022-01-31 23:23:53,166 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:53,166 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2022-01-31 23:23:53,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 23:23:53,166 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:53,166 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:23:53,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-31 23:23:53,167 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-01-31 23:23:53,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:53,167 INFO L85 PathProgramCache]: Analyzing trace with hash 160273451, now seen corresponding path program 1 times [2022-01-31 23:23:53,167 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:53,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2007510494] [2022-01-31 23:23:53,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:53,168 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:53,168 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:53,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:53,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:53,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:53,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:23:53,201 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:53,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2007510494] [2022-01-31 23:23:53,202 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2007510494] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:53,202 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:53,202 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 23:23:53,202 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239569098] [2022-01-31 23:23:53,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:53,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 23:23:53,202 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:53,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 23:23:53,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 23:23:53,202 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:53,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:53,314 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2022-01-31 23:23:53,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 23:23:53,315 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-01-31 23:23:53,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:53,315 INFO L225 Difference]: With dead ends: 79 [2022-01-31 23:23:53,315 INFO L226 Difference]: Without dead ends: 77 [2022-01-31 23:23:53,315 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-31 23:23:53,316 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 65 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:53,316 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 108 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 23:23:53,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-01-31 23:23:53,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 56. [2022-01-31 23:23:53,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 52 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:53,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2022-01-31 23:23:53,322 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 18 [2022-01-31 23:23:53,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:53,322 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2022-01-31 23:23:53,322 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:53,322 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-01-31 23:23:53,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 23:23:53,323 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:53,323 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:23:53,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-31 23:23:53,323 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-01-31 23:23:53,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:53,323 INFO L85 PathProgramCache]: Analyzing trace with hash 158908031, now seen corresponding path program 1 times [2022-01-31 23:23:53,323 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:53,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1280738474] [2022-01-31 23:23:53,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:53,324 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:53,324 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:53,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:53,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:53,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:53,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:23:53,397 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:53,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1280738474] [2022-01-31 23:23:53,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1280738474] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:53,397 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:53,397 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 23:23:53,398 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810537912] [2022-01-31 23:23:53,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:53,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 23:23:53,398 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:53,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 23:23:53,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-31 23:23:53,398 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:53,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:53,502 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2022-01-31 23:23:53,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 23:23:53,503 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-01-31 23:23:53,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:53,508 INFO L225 Difference]: With dead ends: 90 [2022-01-31 23:23:53,509 INFO L226 Difference]: Without dead ends: 88 [2022-01-31 23:23:53,509 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-01-31 23:23:53,509 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 64 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:53,510 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 134 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 23:23:53,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-01-31 23:23:53,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 62. [2022-01-31 23:23:53,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 58 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:53,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2022-01-31 23:23:53,520 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 18 [2022-01-31 23:23:53,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:53,522 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2022-01-31 23:23:53,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:53,522 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2022-01-31 23:23:53,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 23:23:53,522 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:53,522 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:23:53,522 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-31 23:23:53,523 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-01-31 23:23:53,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:53,523 INFO L85 PathProgramCache]: Analyzing trace with hash 206623281, now seen corresponding path program 1 times [2022-01-31 23:23:53,523 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:53,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [564504633] [2022-01-31 23:23:53,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:53,523 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:53,524 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:53,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:53,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:53,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:53,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:23:53,609 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:53,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [564504633] [2022-01-31 23:23:53,609 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [564504633] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:53,609 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:53,609 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 23:23:53,609 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662984260] [2022-01-31 23:23:53,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:53,609 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 23:23:53,609 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:53,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 23:23:53,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-31 23:23:53,610 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:53,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:53,707 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2022-01-31 23:23:53,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 23:23:53,708 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-01-31 23:23:53,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:53,708 INFO L225 Difference]: With dead ends: 74 [2022-01-31 23:23:53,708 INFO L226 Difference]: Without dead ends: 70 [2022-01-31 23:23:53,708 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-01-31 23:23:53,709 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 37 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:53,709 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 111 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 23:23:53,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-01-31 23:23:53,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 63. [2022-01-31 23:23:53,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 59 states have internal predecessors, (67), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:53,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2022-01-31 23:23:53,719 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 18 [2022-01-31 23:23:53,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:53,719 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2022-01-31 23:23:53,719 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:53,719 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2022-01-31 23:23:53,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-31 23:23:53,720 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:53,720 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:23:53,720 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-31 23:23:53,720 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-01-31 23:23:53,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:53,720 INFO L85 PathProgramCache]: Analyzing trace with hash 673512821, now seen corresponding path program 1 times [2022-01-31 23:23:53,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:53,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1705828585] [2022-01-31 23:23:53,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:53,721 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:53,722 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:53,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:53,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:53,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:53,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:23:53,803 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:53,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1705828585] [2022-01-31 23:23:53,803 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1705828585] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:53,804 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:53,804 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 23:23:53,804 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493711216] [2022-01-31 23:23:53,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:53,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 23:23:53,804 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:53,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 23:23:53,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-31 23:23:53,805 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:53,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:53,957 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2022-01-31 23:23:53,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 23:23:53,957 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-01-31 23:23:53,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:53,958 INFO L225 Difference]: With dead ends: 91 [2022-01-31 23:23:53,958 INFO L226 Difference]: Without dead ends: 89 [2022-01-31 23:23:53,958 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-01-31 23:23:53,958 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 51 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:53,959 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 199 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 23:23:53,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-01-31 23:23:53,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 66. [2022-01-31 23:23:53,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 56 states have (on average 1.25) internal successors, (70), 62 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:53,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2022-01-31 23:23:53,966 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 19 [2022-01-31 23:23:53,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:53,966 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2022-01-31 23:23:53,966 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:53,966 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2022-01-31 23:23:53,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-31 23:23:53,966 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:53,966 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:23:53,966 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-31 23:23:53,966 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-01-31 23:23:53,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:53,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1908108286, now seen corresponding path program 1 times [2022-01-31 23:23:53,967 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:53,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [48314911] [2022-01-31 23:23:53,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:53,967 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:53,968 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:53,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:53,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:53,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:53,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:23:53,993 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:53,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [48314911] [2022-01-31 23:23:53,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [48314911] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:53,994 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:53,994 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 23:23:53,994 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65771764] [2022-01-31 23:23:53,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:53,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 23:23:53,994 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:53,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 23:23:53,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 23:23:53,994 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:54,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:54,050 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2022-01-31 23:23:54,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 23:23:54,050 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-01-31 23:23:54,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:54,051 INFO L225 Difference]: With dead ends: 66 [2022-01-31 23:23:54,051 INFO L226 Difference]: Without dead ends: 64 [2022-01-31 23:23:54,051 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-01-31 23:23:54,052 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 44 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:54,052 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 75 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 23:23:54,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-01-31 23:23:54,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-01-31 23:23:54,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 60 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:54,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2022-01-31 23:23:54,066 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 20 [2022-01-31 23:23:54,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:54,067 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2022-01-31 23:23:54,067 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:54,067 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2022-01-31 23:23:54,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-31 23:23:54,067 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:54,067 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:23:54,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-31 23:23:54,067 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-01-31 23:23:54,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:54,068 INFO L85 PathProgramCache]: Analyzing trace with hash 978188398, now seen corresponding path program 1 times [2022-01-31 23:23:54,068 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:54,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2026151515] [2022-01-31 23:23:54,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:54,068 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:54,069 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:54,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:54,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:54,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:54,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:23:54,097 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:54,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2026151515] [2022-01-31 23:23:54,098 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2026151515] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:54,098 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:54,098 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 23:23:54,098 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545019410] [2022-01-31 23:23:54,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:54,098 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 23:23:54,098 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:54,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 23:23:54,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 23:23:54,098 INFO L87 Difference]: Start difference. First operand 64 states and 71 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:54,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:54,152 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2022-01-31 23:23:54,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 23:23:54,153 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-01-31 23:23:54,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:54,153 INFO L225 Difference]: With dead ends: 64 [2022-01-31 23:23:54,153 INFO L226 Difference]: Without dead ends: 60 [2022-01-31 23:23:54,154 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-01-31 23:23:54,154 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 15 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:54,154 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 101 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 23:23:54,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-01-31 23:23:54,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-01-31 23:23:54,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 52 states have (on average 1.2307692307692308) internal successors, (64), 56 states have internal predecessors, (64), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:54,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2022-01-31 23:23:54,163 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 21 [2022-01-31 23:23:54,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:54,163 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2022-01-31 23:23:54,163 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:54,163 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2022-01-31 23:23:54,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-31 23:23:54,163 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:54,163 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:23:54,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-31 23:23:54,163 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-01-31 23:23:54,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:54,164 INFO L85 PathProgramCache]: Analyzing trace with hash 272309526, now seen corresponding path program 1 times [2022-01-31 23:23:54,164 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:54,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [377909666] [2022-01-31 23:23:54,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:54,164 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:54,165 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:54,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:54,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:54,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:54,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:23:54,217 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:54,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [377909666] [2022-01-31 23:23:54,217 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [377909666] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:54,217 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:54,217 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 23:23:54,217 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378960629] [2022-01-31 23:23:54,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:54,217 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 23:23:54,217 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:54,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 23:23:54,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-31 23:23:54,218 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:54,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:54,335 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2022-01-31 23:23:54,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 23:23:54,336 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-01-31 23:23:54,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:54,336 INFO L225 Difference]: With dead ends: 75 [2022-01-31 23:23:54,336 INFO L226 Difference]: Without dead ends: 73 [2022-01-31 23:23:54,337 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-01-31 23:23:54,337 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 111 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:54,337 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 62 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 23:23:54,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-01-31 23:23:54,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 55. [2022-01-31 23:23:54,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 51 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:54,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2022-01-31 23:23:54,344 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 22 [2022-01-31 23:23:54,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:54,344 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2022-01-31 23:23:54,344 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:54,344 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2022-01-31 23:23:54,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-31 23:23:54,344 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:54,344 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:23:54,345 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-31 23:23:54,345 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr17ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-01-31 23:23:54,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:54,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1682587452, now seen corresponding path program 1 times [2022-01-31 23:23:54,345 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:54,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [987884909] [2022-01-31 23:23:54,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:54,356 INFO L92 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Could not compute Simultaneous Update! [2022-01-31 23:23:54,356 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:54,357 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:54,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:54,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:54,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:54,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:23:54,415 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:54,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [987884909] [2022-01-31 23:23:54,415 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [987884909] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:54,415 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:54,415 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 23:23:54,415 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432816632] [2022-01-31 23:23:54,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:54,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 23:23:54,415 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:54,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 23:23:54,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-31 23:23:54,416 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:54,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:54,531 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2022-01-31 23:23:54,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 23:23:54,531 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-01-31 23:23:54,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:54,532 INFO L225 Difference]: With dead ends: 72 [2022-01-31 23:23:54,532 INFO L226 Difference]: Without dead ends: 70 [2022-01-31 23:23:54,532 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-01-31 23:23:54,532 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 61 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:54,532 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 60 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 23:23:54,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-01-31 23:23:54,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 51. [2022-01-31 23:23:54,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 47 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:54,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2022-01-31 23:23:54,540 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 22 [2022-01-31 23:23:54,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:54,540 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2022-01-31 23:23:54,540 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:54,540 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2022-01-31 23:23:54,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-31 23:23:54,540 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:54,540 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:23:54,540 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-31 23:23:54,541 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-01-31 23:23:54,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:54,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1683018428, now seen corresponding path program 1 times [2022-01-31 23:23:54,541 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:54,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [891051747] [2022-01-31 23:23:54,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:54,542 INFO L92 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Could not compute Simultaneous Update! [2022-01-31 23:23:54,542 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:54,543 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:54,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:54,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:54,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:54,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:23:54,610 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:54,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [891051747] [2022-01-31 23:23:54,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [891051747] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:54,610 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:54,610 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 23:23:54,610 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366477719] [2022-01-31 23:23:54,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:54,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 23:23:54,610 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:54,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 23:23:54,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-31 23:23:54,611 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:54,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:54,703 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2022-01-31 23:23:54,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 23:23:54,704 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-01-31 23:23:54,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:54,704 INFO L225 Difference]: With dead ends: 67 [2022-01-31 23:23:54,704 INFO L226 Difference]: Without dead ends: 65 [2022-01-31 23:23:54,704 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-01-31 23:23:54,705 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 88 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:54,705 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 48 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 23:23:54,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-01-31 23:23:54,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 44. [2022-01-31 23:23:54,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.205128205128205) internal successors, (47), 40 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:54,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2022-01-31 23:23:54,711 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 22 [2022-01-31 23:23:54,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:54,711 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2022-01-31 23:23:54,712 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:54,712 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-01-31 23:23:54,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-31 23:23:54,712 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:54,712 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:23:54,712 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-31 23:23:54,712 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-01-31 23:23:54,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:54,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1184340980, now seen corresponding path program 1 times [2022-01-31 23:23:54,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:54,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [125290670] [2022-01-31 23:23:54,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:54,713 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:54,713 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:54,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:54,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:54,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:54,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:23:54,762 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:54,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [125290670] [2022-01-31 23:23:54,762 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [125290670] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:54,762 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:54,762 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 23:23:54,763 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550978926] [2022-01-31 23:23:54,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:54,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 23:23:54,763 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:54,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 23:23:54,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-31 23:23:54,764 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:54,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:54,852 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2022-01-31 23:23:54,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 23:23:54,854 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-01-31 23:23:54,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:54,854 INFO L225 Difference]: With dead ends: 56 [2022-01-31 23:23:54,854 INFO L226 Difference]: Without dead ends: 54 [2022-01-31 23:23:54,854 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-01-31 23:23:54,855 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 45 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:54,855 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 58 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 23:23:54,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-01-31 23:23:54,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2022-01-31 23:23:54,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:54,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2022-01-31 23:23:54,861 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 23 [2022-01-31 23:23:54,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:54,861 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2022-01-31 23:23:54,861 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:54,861 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2022-01-31 23:23:54,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-31 23:23:54,861 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:23:54,862 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:23:54,862 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-31 23:23:54,862 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-01-31 23:23:54,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:23:54,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1136625730, now seen corresponding path program 1 times [2022-01-31 23:23:54,862 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:23:54,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1031808317] [2022-01-31 23:23:54,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:23:54,862 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:23:54,863 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:23:54,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:54,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:23:54,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:23:54,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:23:54,909 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:23:54,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1031808317] [2022-01-31 23:23:54,910 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1031808317] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:23:54,910 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:23:54,910 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 23:23:54,910 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963974852] [2022-01-31 23:23:54,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:23:54,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 23:23:54,910 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:23:54,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 23:23:54,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-31 23:23:54,910 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:54,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:23:54,980 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-01-31 23:23:54,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 23:23:54,980 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-01-31 23:23:54,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:23:54,981 INFO L225 Difference]: With dead ends: 39 [2022-01-31 23:23:54,981 INFO L226 Difference]: Without dead ends: 0 [2022-01-31 23:23:54,981 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-01-31 23:23:54,981 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 72 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 23:23:54,982 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 43 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 23:23:54,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-31 23:23:54,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-31 23:23:54,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-31 23:23:54,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-31 23:23:54,982 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2022-01-31 23:23:54,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:23:54,982 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-31 23:23:54,982 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:23:54,982 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-31 23:23:54,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-31 23:23:54,984 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (17 of 18 remaining) [2022-01-31 23:23:54,984 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (16 of 18 remaining) [2022-01-31 23:23:54,984 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (15 of 18 remaining) [2022-01-31 23:23:54,984 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (14 of 18 remaining) [2022-01-31 23:23:54,985 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (13 of 18 remaining) [2022-01-31 23:23:54,985 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONERROR_FUNCTION (12 of 18 remaining) [2022-01-31 23:23:54,985 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONERROR_FUNCTION (11 of 18 remaining) [2022-01-31 23:23:54,985 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONERROR_FUNCTION (10 of 18 remaining) [2022-01-31 23:23:54,985 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONERROR_FUNCTION (9 of 18 remaining) [2022-01-31 23:23:54,985 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (8 of 18 remaining) [2022-01-31 23:23:54,985 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONERROR_FUNCTION (7 of 18 remaining) [2022-01-31 23:23:54,985 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONERROR_FUNCTION (6 of 18 remaining) [2022-01-31 23:23:54,985 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONERROR_FUNCTION (5 of 18 remaining) [2022-01-31 23:23:54,985 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONERROR_FUNCTION (4 of 18 remaining) [2022-01-31 23:23:54,985 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONERROR_FUNCTION (3 of 18 remaining) [2022-01-31 23:23:54,985 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONERROR_FUNCTION (2 of 18 remaining) [2022-01-31 23:23:54,985 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr16ASSERT_VIOLATIONERROR_FUNCTION (1 of 18 remaining) [2022-01-31 23:23:54,985 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr17ASSERT_VIOLATIONERROR_FUNCTION (0 of 18 remaining) [2022-01-31 23:23:54,985 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-31 23:23:54,987 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-31 23:24:05,413 WARN L228 SmtUtils]: Spent 6.35s on a formula simplification. DAG size of input: 63 DAG size of output: 60 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-01-31 23:24:36,234 WARN L228 SmtUtils]: Spent 28.12s on a formula simplification. DAG size of input: 77 DAG size of output: 76 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-01-31 23:24:40,000 INFO L858 garLoopResultBuilder]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2022-01-31 23:24:40,001 INFO L858 garLoopResultBuilder]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2022-01-31 23:24:40,001 INFO L858 garLoopResultBuilder]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2022-01-31 23:24:40,001 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed. [2022-01-31 23:24:40,001 INFO L858 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-01-31 23:24:40,001 INFO L858 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2022-01-31 23:24:40,001 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2022-01-31 23:24:40,001 INFO L854 garLoopResultBuilder]: At program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 114) the Hoare annotation is: false [2022-01-31 23:24:40,001 INFO L854 garLoopResultBuilder]: At program point L126(line 126) the Hoare annotation is: false [2022-01-31 23:24:40,001 INFO L861 garLoopResultBuilder]: At program point mainEXIT(lines 15 402) the Hoare annotation is: true [2022-01-31 23:24:40,001 INFO L854 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: false [2022-01-31 23:24:40,001 INFO L854 garLoopResultBuilder]: At program point L176(line 176) the Hoare annotation is: false [2022-01-31 23:24:40,001 INFO L854 garLoopResultBuilder]: At program point L366(line 366) the Hoare annotation is: false [2022-01-31 23:24:40,001 INFO L854 garLoopResultBuilder]: At program point L333(line 333) the Hoare annotation is: false [2022-01-31 23:24:40,002 INFO L854 garLoopResultBuilder]: At program point L234(lines 234 242) the Hoare annotation is: (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~10 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~11 0))) (.cse2 (<= 1 main_~main__t~0))) (or (and (< main_~main__t~0 main_~main__tagbuf_len~0) .cse0 .cse1 .cse2) (and (<= main_~main__t~0 1) .cse0 .cse1 (not (<= main_~main__tagbuf_len~0 0)) .cse2))) [2022-01-31 23:24:40,002 INFO L854 garLoopResultBuilder]: At program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 278) the Hoare annotation is: false [2022-01-31 23:24:40,002 INFO L854 garLoopResultBuilder]: At program point L152(lines 152 160) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (not (= main_~__VERIFIER_assert__cond~5 0)) (not (= main_~__VERIFIER_assert__cond~6 0)) (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-01-31 23:24:40,002 INFO L854 garLoopResultBuilder]: At program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 154) the Hoare annotation is: false [2022-01-31 23:24:40,002 INFO L854 garLoopResultBuilder]: At program point L309(line 309) the Hoare annotation is: false [2022-01-31 23:24:40,002 INFO L854 garLoopResultBuilder]: At program point L20(lines 20 401) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0)) [2022-01-31 23:24:40,002 INFO L854 garLoopResultBuilder]: At program point L276(lines 276 391) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (not (= main_~__VERIFIER_assert__cond~13 0)) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= main_~main__t~0 0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (< 0 main_~main__tagbuf_len~0)) [2022-01-31 23:24:40,002 INFO L854 garLoopResultBuilder]: At program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 333) the Hoare annotation is: false [2022-01-31 23:24:40,002 INFO L854 garLoopResultBuilder]: At program point L70(lines 70 94) the Hoare annotation is: (and (<= 1 main_~main__t~0) (not (= main_~__VERIFIER_assert__cond~2 0)) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-01-31 23:24:40,002 INFO L854 garLoopResultBuilder]: At program point L384(lines 282 391) the Hoare annotation is: (let ((.cse1 (= main_~main__t~0 0))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (not (= main_~__VERIFIER_assert__cond~13 0)))) (or (and .cse3 (<= 1 main_~main__t~0)) (and .cse3 .cse1))))) (or (and .cse2 (not (= main_~__VERIFIER_assert__cond~18 0))) (and .cse2 .cse1))))) (or (and .cse0 (< main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~__VERIFIER_assert__cond~19 0))) (and .cse0 .cse1 (< 0 main_~main__tagbuf_len~0))))) [2022-01-31 23:24:40,002 INFO L854 garLoopResultBuilder]: At program point L351(lines 32 395) the Hoare annotation is: (or (and (not (= main_~__VERIFIER_assert__cond~17 0)) (< main_~main__t~0 main_~main__tagbuf_len~0) (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~13 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~16 0)))) (or (and (<= main_~main__t~0 1) .cse0 .cse1) (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~19 0))))) (<= 1 main_~main__t~0)) (and (= main_~main__t~0 0) (< 0 main_~main__tagbuf_len~0))) [2022-01-31 23:24:40,002 INFO L854 garLoopResultBuilder]: At program point L186(lines 186 196) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~9 0)) (not (= main_~__VERIFIER_assert__cond~8 0)) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-01-31 23:24:40,002 INFO L854 garLoopResultBuilder]: At program point L376(lines 376 385) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~13 0)) (< main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~__VERIFIER_assert__cond~18 0)) (<= 1 main_~main__t~0) (not (= main_~__VERIFIER_assert__cond~19 0))) [2022-01-31 23:24:40,002 INFO L854 garLoopResultBuilder]: At program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 142) the Hoare annotation is: false [2022-01-31 23:24:40,002 INFO L854 garLoopResultBuilder]: At program point L343(lines 343 352) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~17 0)) (< main_~main__t~0 main_~main__tagbuf_len~0) (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~13 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~16 0)))) (or (and (<= main_~main__t~0 1) .cse0 .cse1) (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~19 0))))) (<= 1 main_~main__t~0)) [2022-01-31 23:24:40,002 INFO L854 garLoopResultBuilder]: At program point L112(lines 112 203) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~4 0)) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 1 main_~main__t~0)) [2022-01-31 23:24:40,003 INFO L861 garLoopResultBuilder]: At program point mainFINAL(lines 15 402) the Hoare annotation is: true [2022-01-31 23:24:40,003 INFO L854 garLoopResultBuilder]: At program point L236(line 236) the Hoare annotation is: false [2022-01-31 23:24:40,003 INFO L854 garLoopResultBuilder]: At program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 309) the Hoare annotation is: false [2022-01-31 23:24:40,003 INFO L854 garLoopResultBuilder]: At program point L195(lines 56 253) the Hoare annotation is: (and (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-01-31 23:24:40,003 INFO L854 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 52) the Hoare annotation is: false [2022-01-31 23:24:40,003 INFO L854 garLoopResultBuilder]: At program point mainENTRY(lines 15 402) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0)) [2022-01-31 23:24:40,003 INFO L854 garLoopResultBuilder]: At program point L154(line 154) the Hoare annotation is: false [2022-01-31 23:24:40,003 INFO L854 garLoopResultBuilder]: At program point L278(line 278) the Hoare annotation is: false [2022-01-31 23:24:40,003 INFO L854 garLoopResultBuilder]: At program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 188) the Hoare annotation is: false [2022-01-31 23:24:40,003 INFO L854 garLoopResultBuilder]: At program point L105(lines 105 209) the Hoare annotation is: (and (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-01-31 23:24:40,003 INFO L854 garLoopResultBuilder]: At program point L72(line 72) the Hoare annotation is: false [2022-01-31 23:24:40,003 INFO L854 garLoopResultBuilder]: At program point L39(lines 39 255) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= main_~main__t~0 0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (< 0 main_~main__tagbuf_len~0)) [2022-01-31 23:24:40,003 INFO L854 garLoopResultBuilder]: At program point L295(lines 295 317) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~13 0)) (not (= main_~__VERIFIER_assert__cond~14 0)) (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-01-31 23:24:40,003 INFO L854 garLoopResultBuilder]: At program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 366) the Hoare annotation is: false [2022-01-31 23:24:40,003 INFO L854 garLoopResultBuilder]: At program point L188(line 188) the Hoare annotation is: false [2022-01-31 23:24:40,003 INFO L854 garLoopResultBuilder]: At program point L378(line 378) the Hoare annotation is: false [2022-01-31 23:24:40,003 INFO L854 garLoopResultBuilder]: At program point L345(line 345) the Hoare annotation is: false [2022-01-31 23:24:40,004 INFO L854 garLoopResultBuilder]: At program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 176) the Hoare annotation is: false [2022-01-31 23:24:40,004 INFO L854 garLoopResultBuilder]: At program point L114(line 114) the Hoare annotation is: false [2022-01-31 23:24:40,004 INFO L854 garLoopResultBuilder]: At program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 345) the Hoare annotation is: false [2022-01-31 23:24:40,004 INFO L854 garLoopResultBuilder]: At program point L32(lines 32 395) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= main_~main__t~0 0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (< 0 main_~main__tagbuf_len~0)) [2022-01-31 23:24:40,004 INFO L854 garLoopResultBuilder]: At program point L288(lines 288 390) the Hoare annotation is: (and (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~13 0))) (.cse1 (<= 1 main_~main__t~0))) (or (and (<= main_~main__t~0 1) .cse0 .cse1) (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~19 0))))) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-01-31 23:24:40,004 INFO L854 garLoopResultBuilder]: At program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 84) the Hoare annotation is: false [2022-01-31 23:24:40,004 INFO L854 garLoopResultBuilder]: At program point L222(lines 222 244) the Hoare annotation is: (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~10 0))) (.cse1 (<= 1 main_~main__t~0))) (or (and (<= main_~main__t~0 1) .cse0 (not (<= main_~main__tagbuf_len~0 0)) .cse1) (and (< main_~main__t~0 main_~main__tagbuf_len~0) .cse0 .cse1))) [2022-01-31 23:24:40,004 INFO L854 garLoopResultBuilder]: At program point L24(lines 24 396) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= main_~main__t~0 0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-01-31 23:24:40,004 INFO L854 garLoopResultBuilder]: At program point L82(lines 82 92) the Hoare annotation is: (and (<= 1 main_~main__t~0) (not (= main_~__VERIFIER_assert__cond~3 0)) (not (= main_~__VERIFIER_assert__cond~2 0)) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-01-31 23:24:40,004 INFO L854 garLoopResultBuilder]: At program point L140(lines 140 162) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~5 0)) (not (= main_~__VERIFIER_assert__cond~6 0)) (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-01-31 23:24:40,004 INFO L854 garLoopResultBuilder]: At program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 236) the Hoare annotation is: false [2022-01-31 23:24:40,004 INFO L854 garLoopResultBuilder]: At program point L297(line 297) the Hoare annotation is: false [2022-01-31 23:24:40,004 INFO L854 garLoopResultBuilder]: At program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 72) the Hoare annotation is: false [2022-01-31 23:24:40,004 INFO L854 garLoopResultBuilder]: At program point L124(lines 124 201) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~4 0)) (< main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~__VERIFIER_assert__cond~5 0)) (<= 1 main_~main__t~0)) [2022-01-31 23:24:40,004 INFO L861 garLoopResultBuilder]: At program point L314(lines 32 395) the Hoare annotation is: true [2022-01-31 23:24:40,004 INFO L854 garLoopResultBuilder]: At program point L215(lines 215 250) the Hoare annotation is: (and (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-01-31 23:24:40,004 INFO L854 garLoopResultBuilder]: At program point L50(lines 50 253) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= main_~main__t~0 0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (< 0 main_~main__tagbuf_len~0)) [2022-01-31 23:24:40,004 INFO L854 garLoopResultBuilder]: At program point L174(lines 174 198) the Hoare annotation is: (and (< main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~__VERIFIER_assert__cond~8 0)) (<= 1 main_~main__t~0)) [2022-01-31 23:24:40,005 INFO L854 garLoopResultBuilder]: At program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 224) the Hoare annotation is: false [2022-01-31 23:24:40,005 INFO L854 garLoopResultBuilder]: At program point L364(lines 364 387) the Hoare annotation is: (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~13 0))) (.cse1 (< main_~main__t~0 main_~main__tagbuf_len~0)) (.cse2 (not (= main_~__VERIFIER_assert__cond~18 0))) (.cse3 (<= 1 main_~main__t~0))) (or (and (<= main_~main__t~0 1) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (not (= main_~__VERIFIER_assert__cond~19 0))))) [2022-01-31 23:24:40,005 INFO L854 garLoopResultBuilder]: At program point L331(lines 331 354) the Hoare annotation is: (and (< main_~main__t~0 main_~main__tagbuf_len~0) (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~13 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~16 0)))) (or (and (<= main_~main__t~0 1) .cse0 .cse1) (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~19 0))))) (<= 1 main_~main__t~0)) [2022-01-31 23:24:40,005 INFO L854 garLoopResultBuilder]: At program point L265(lines 265 393) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= main_~main__t~0 0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (< 0 main_~main__tagbuf_len~0)) [2022-01-31 23:24:40,005 INFO L854 garLoopResultBuilder]: At program point mainErr17ASSERT_VIOLATIONERROR_FUNCTION(line 378) the Hoare annotation is: false [2022-01-31 23:24:40,005 INFO L854 garLoopResultBuilder]: At program point L133(lines 133 200) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~5 0)) (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-01-31 23:24:40,005 INFO L854 garLoopResultBuilder]: At program point L224(line 224) the Hoare annotation is: false [2022-01-31 23:24:40,005 INFO L854 garLoopResultBuilder]: At program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 126) the Hoare annotation is: false [2022-01-31 23:24:40,005 INFO L854 garLoopResultBuilder]: At program point L249(lines 101 251) the Hoare annotation is: (and (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-01-31 23:24:40,005 INFO L854 garLoopResultBuilder]: At program point L84(line 84) the Hoare annotation is: false [2022-01-31 23:24:40,005 INFO L854 garLoopResultBuilder]: At program point L307(lines 307 315) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~13 0)) (not (= main_~__VERIFIER_assert__cond~14 0)) (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~__VERIFIER_assert__cond~15 0))) [2022-01-31 23:24:40,005 INFO L854 garLoopResultBuilder]: At program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 297) the Hoare annotation is: false [2022-01-31 23:24:40,005 INFO L854 garLoopResultBuilder]: At program point L142(line 142) the Hoare annotation is: false [2022-01-31 23:24:40,005 INFO L854 garLoopResultBuilder]: At program point L101(lines 101 251) the Hoare annotation is: (and (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-01-31 23:24:40,005 INFO L854 garLoopResultBuilder]: At program point L324(lines 324 389) the Hoare annotation is: (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~13 0))) (.cse1 (< main_~main__t~0 main_~main__tagbuf_len~0)) (.cse2 (<= 1 main_~main__t~0))) (or (and .cse0 .cse1 .cse2 (not (= main_~__VERIFIER_assert__cond~19 0))) (and (<= main_~main__t~0 1) .cse0 .cse1 .cse2))) [2022-01-31 23:24:40,005 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-01-31 23:24:40,005 INFO L854 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-01-31 23:24:40,005 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-01-31 23:24:40,006 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-01-31 23:24:40,006 INFO L861 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-01-31 23:24:40,006 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-01-31 23:24:40,006 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-01-31 23:24:40,009 INFO L732 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] [2022-01-31 23:24:40,011 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-31 23:24:40,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 11:24:40 BoogieIcfgContainer [2022-01-31 23:24:40,033 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-31 23:24:40,033 INFO L158 Benchmark]: Toolchain (without parser) took 50232.25ms. Allocated memory was 206.6MB in the beginning and 637.5MB in the end (delta: 431.0MB). Free memory was 158.1MB in the beginning and 287.1MB in the end (delta: -129.0MB). Peak memory consumption was 363.7MB. Max. memory is 8.0GB. [2022-01-31 23:24:40,033 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 206.6MB. Free memory is still 174.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-31 23:24:40,033 INFO L158 Benchmark]: CACSL2BoogieTranslator took 214.98ms. Allocated memory is still 206.6MB. Free memory was 157.8MB in the beginning and 178.1MB in the end (delta: -20.3MB). Peak memory consumption was 9.7MB. Max. memory is 8.0GB. [2022-01-31 23:24:40,034 INFO L158 Benchmark]: Boogie Preprocessor took 28.17ms. Allocated memory is still 206.6MB. Free memory was 178.1MB in the beginning and 176.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-31 23:24:40,034 INFO L158 Benchmark]: RCFGBuilder took 309.89ms. Allocated memory is still 206.6MB. Free memory was 176.6MB in the beginning and 161.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-01-31 23:24:40,034 INFO L158 Benchmark]: TraceAbstraction took 49670.85ms. Allocated memory was 206.6MB in the beginning and 637.5MB in the end (delta: 431.0MB). Free memory was 161.4MB in the beginning and 287.1MB in the end (delta: -125.7MB). Peak memory consumption was 366.6MB. Max. memory is 8.0GB. [2022-01-31 23:24:40,035 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 206.6MB. Free memory is still 174.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 214.98ms. Allocated memory is still 206.6MB. Free memory was 157.8MB in the beginning and 178.1MB in the end (delta: -20.3MB). Peak memory consumption was 9.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.17ms. Allocated memory is still 206.6MB. Free memory was 178.1MB in the beginning and 176.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 309.89ms. Allocated memory is still 206.6MB. Free memory was 176.6MB in the beginning and 161.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 49670.85ms. Allocated memory was 206.6MB in the beginning and 637.5MB in the end (delta: 431.0MB). Free memory was 161.4MB in the beginning and 287.1MB in the end (delta: -125.7MB). Peak memory consumption was 366.6MB. 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 - PositiveResult [Line: 52]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 72]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 84]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 114]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 126]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 142]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 154]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 176]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 188]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 224]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 236]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 278]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 297]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 309]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 333]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 345]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 366]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 378]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 87 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 49.6s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 45.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1442 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1442 mSDsluCounter, 2848 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1755 mSDsCounter, 160 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3304 IncrementalHoareTripleChecker+Invalid, 3464 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 160 mSolverCounterUnsat, 1093 mSDtfsCounter, 3304 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 246 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=0, InterpolantAutomatonStates: 177, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 432 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 80 LocationsWithAnnotation, 80 PreInvPairs, 97 NumberOfFragments, 793 HoareAnnotationTreeSize, 80 FomulaSimplifications, 1699133 FormulaSimplificationTreeSizeReduction, 43.8s HoareSimplificationTime, 80 FomulaSimplificationsInter, 2584679 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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 - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (((!(__VERIFIER_assert__cond == 0) && main__t < main__tagbuf_len) && (((main__t <= 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) || ((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)))) && 1 <= main__t) || (main__t == 0 && 0 < main__tagbuf_len) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: !(main__tagbuf_len <= main__t) && 1 <= main__t - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 282]: Loop Invariant Derived loop invariant: ((((((!(__VERIFIER_assert__cond == 0) && 1 <= main__t) || (!(__VERIFIER_assert__cond == 0) && main__t == 0)) && !(__VERIFIER_assert__cond == 0)) || (((!(__VERIFIER_assert__cond == 0) && 1 <= main__t) || (!(__VERIFIER_assert__cond == 0) && main__t == 0)) && main__t == 0)) && main__t < main__tagbuf_len) && !(__VERIFIER_assert__cond == 0)) || ((((((!(__VERIFIER_assert__cond == 0) && 1 <= main__t) || (!(__VERIFIER_assert__cond == 0) && main__t == 0)) && !(__VERIFIER_assert__cond == 0)) || (((!(__VERIFIER_assert__cond == 0) && 1 <= main__t) || (!(__VERIFIER_assert__cond == 0) && main__t == 0)) && main__t == 0)) && main__t == 0) && 0 < main__tagbuf_len) - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: 1 <= main__t && main__t <= main__tagbuf_len - ProcedureContractResult [Line: 15]: Procedure Contract for main Derived contract for procedure main: 1 RESULT: Ultimate proved your program to be correct! [2022-01-31 23:24:40,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...