/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.assert.codeblocks.term.scoring.heuristic BIGGEST_EQUIVALENCE_CLASS --traceabstraction.assert.codeblocks.term.scoring.heuristic.partitioning.strategy FIXED_NUM_PARTITIONS --traceabstraction.assert.codeblocks.term.scoring.heuristic.number.of.partitions 4 --traceabstraction.trace.refinement.strategy CAMEL_SMT_AM -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-rb-sentinel-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-79ed534 [2020-07-20 05:47:51,839 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-20 05:47:51,843 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-20 05:47:51,864 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-20 05:47:51,865 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-20 05:47:51,867 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-20 05:47:51,870 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-20 05:47:51,881 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-20 05:47:51,883 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-20 05:47:51,886 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-20 05:47:51,888 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-20 05:47:51,890 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-20 05:47:51,890 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-20 05:47:51,893 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-20 05:47:51,895 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-20 05:47:51,897 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-20 05:47:51,900 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-20 05:47:51,901 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-20 05:47:51,902 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-20 05:47:51,909 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-20 05:47:51,914 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-20 05:47:51,918 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-20 05:47:51,919 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-20 05:47:51,920 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-20 05:47:51,923 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-20 05:47:51,923 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-20 05:47:51,923 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-20 05:47:51,926 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-20 05:47:51,927 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-20 05:47:51,928 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-20 05:47:51,928 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-20 05:47:51,929 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-20 05:47:51,930 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-20 05:47:51,931 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-20 05:47:51,932 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-20 05:47:51,932 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-20 05:47:51,933 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-20 05:47:51,933 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-20 05:47:51,933 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-20 05:47:51,934 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-20 05:47:51,936 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-20 05:47:51,937 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-20 05:47:51,976 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-20 05:47:51,976 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-20 05:47:51,981 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-20 05:47:51,981 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-20 05:47:51,981 INFO L138 SettingsManager]: * Use SBE=true [2020-07-20 05:47:51,981 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-20 05:47:51,982 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-20 05:47:51,982 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-20 05:47:51,982 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-20 05:47:51,982 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-20 05:47:51,982 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-20 05:47:51,983 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-20 05:47:51,983 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-20 05:47:51,983 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-20 05:47:51,986 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-20 05:47:51,986 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-20 05:47:51,986 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-20 05:47:51,987 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-20 05:47:51,987 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-20 05:47:51,987 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-20 05:47:51,987 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-20 05:47:51,987 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 05:47:51,988 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-20 05:47:51,988 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-20 05:47:51,988 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-20 05:47:51,988 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-20 05:47:51,988 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 05:47:51,989 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-20 05:47:51,989 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-20 05:47:51,989 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic -> BIGGEST_EQUIVALENCE_CLASS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic Partitioning Strategy -> FIXED_NUM_PARTITIONS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic number of partitions -> 4 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> CAMEL_SMT_AM [2020-07-20 05:47:52,314 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-20 05:47:52,330 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-20 05:47:52,333 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-20 05:47:52,335 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-20 05:47:52,335 INFO L275 PluginConnector]: CDTParser initialized [2020-07-20 05:47:52,336 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-rb-sentinel-1.i [2020-07-20 05:47:52,409 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54586389c/448e81975aa64f00bad47f5cb2ff047e/FLAG176ca33a2 [2020-07-20 05:47:52,996 INFO L306 CDTParser]: Found 1 translation units. [2020-07-20 05:47:52,997 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-rb-sentinel-1.i [2020-07-20 05:47:53,026 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54586389c/448e81975aa64f00bad47f5cb2ff047e/FLAG176ca33a2 [2020-07-20 05:47:53,275 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54586389c/448e81975aa64f00bad47f5cb2ff047e [2020-07-20 05:47:53,283 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-20 05:47:53,287 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-20 05:47:53,288 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-20 05:47:53,288 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-20 05:47:53,292 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-20 05:47:53,293 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:47:53" (1/1) ... [2020-07-20 05:47:53,296 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@458b7631 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:53, skipping insertion in model container [2020-07-20 05:47:53,296 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:47:53" (1/1) ... [2020-07-20 05:47:53,303 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-20 05:47:53,360 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-20 05:47:53,875 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 05:47:53,886 INFO L203 MainTranslator]: Completed pre-run [2020-07-20 05:47:53,931 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 05:47:53,994 INFO L208 MainTranslator]: Completed translation [2020-07-20 05:47:53,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:53 WrapperNode [2020-07-20 05:47:53,995 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-20 05:47:53,996 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-20 05:47:53,997 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-20 05:47:53,997 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-20 05:47:54,008 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:53" (1/1) ... [2020-07-20 05:47:54,008 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:53" (1/1) ... [2020-07-20 05:47:54,025 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:53" (1/1) ... [2020-07-20 05:47:54,025 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:53" (1/1) ... [2020-07-20 05:47:54,043 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:53" (1/1) ... [2020-07-20 05:47:54,054 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:53" (1/1) ... [2020-07-20 05:47:54,058 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:53" (1/1) ... [2020-07-20 05:47:54,065 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-20 05:47:54,065 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-20 05:47:54,066 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-20 05:47:54,066 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-20 05:47:54,067 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 05:47:54,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-20 05:47:54,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-20 05:47:54,129 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-20 05:47:54,129 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-20 05:47:54,129 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-20 05:47:54,129 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-20 05:47:54,130 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-20 05:47:54,130 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-20 05:47:54,130 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-20 05:47:54,130 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-20 05:47:54,130 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-20 05:47:54,130 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-20 05:47:54,131 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-20 05:47:54,131 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-20 05:47:54,131 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-20 05:47:54,131 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-20 05:47:54,131 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-20 05:47:54,131 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-20 05:47:54,132 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-20 05:47:54,132 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-20 05:47:54,132 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-20 05:47:54,132 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-20 05:47:54,132 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-20 05:47:54,132 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-20 05:47:54,133 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-20 05:47:54,133 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-20 05:47:54,133 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-20 05:47:54,133 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-20 05:47:54,133 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-20 05:47:54,133 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-20 05:47:54,133 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-20 05:47:54,134 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-20 05:47:54,134 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-20 05:47:54,134 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-20 05:47:54,134 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-20 05:47:54,134 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-20 05:47:54,134 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-20 05:47:54,134 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-20 05:47:54,135 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-20 05:47:54,135 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-20 05:47:54,135 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-20 05:47:54,135 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-20 05:47:54,135 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-20 05:47:54,135 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-20 05:47:54,136 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-20 05:47:54,136 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-20 05:47:54,136 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-20 05:47:54,136 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-20 05:47:54,136 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-20 05:47:54,136 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-20 05:47:54,137 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-20 05:47:54,137 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-20 05:47:54,137 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-20 05:47:54,137 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-20 05:47:54,137 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-20 05:47:54,137 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-20 05:47:54,138 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-20 05:47:54,138 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-07-20 05:47:54,138 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-20 05:47:54,138 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-20 05:47:54,138 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-20 05:47:54,138 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-20 05:47:54,139 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-20 05:47:54,139 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-20 05:47:54,139 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-20 05:47:54,139 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-20 05:47:54,139 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-20 05:47:54,139 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-20 05:47:54,140 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-20 05:47:54,140 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-20 05:47:54,140 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-20 05:47:54,140 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-20 05:47:54,140 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-20 05:47:54,140 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-20 05:47:54,141 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-20 05:47:54,141 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-20 05:47:54,141 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-20 05:47:54,141 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-20 05:47:54,141 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-20 05:47:54,141 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-20 05:47:54,142 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-20 05:47:54,142 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-20 05:47:54,142 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-20 05:47:54,142 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-20 05:47:54,142 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-20 05:47:54,142 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-20 05:47:54,142 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-20 05:47:54,143 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-20 05:47:54,143 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-20 05:47:54,143 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-20 05:47:54,143 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-20 05:47:54,143 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-20 05:47:54,143 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-20 05:47:54,144 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-20 05:47:54,144 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-20 05:47:54,144 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-20 05:47:54,144 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-20 05:47:54,144 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-20 05:47:54,144 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-20 05:47:54,144 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-20 05:47:54,144 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-20 05:47:54,144 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-20 05:47:54,145 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-20 05:47:54,145 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-20 05:47:54,145 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-20 05:47:54,145 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-20 05:47:54,145 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-20 05:47:54,145 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-20 05:47:54,145 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-20 05:47:54,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-20 05:47:54,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-20 05:47:54,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-20 05:47:54,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-20 05:47:54,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-20 05:47:54,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-20 05:47:54,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-20 05:47:54,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-20 05:47:54,779 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-20 05:47:54,780 INFO L295 CfgBuilder]: Removed 17 assume(true) statements. [2020-07-20 05:47:54,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:47:54 BoogieIcfgContainer [2020-07-20 05:47:54,784 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-20 05:47:54,786 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-20 05:47:54,786 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-20 05:47:54,789 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-20 05:47:54,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 05:47:53" (1/3) ... [2020-07-20 05:47:54,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4250dfe6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:47:54, skipping insertion in model container [2020-07-20 05:47:54,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:53" (2/3) ... [2020-07-20 05:47:54,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4250dfe6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:47:54, skipping insertion in model container [2020-07-20 05:47:54,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:47:54" (3/3) ... [2020-07-20 05:47:54,793 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel-1.i [2020-07-20 05:47:54,806 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-20 05:47:54,814 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2020-07-20 05:47:54,830 INFO L251 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-07-20 05:47:54,858 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-20 05:47:54,859 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-20 05:47:54,859 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-20 05:47:54,859 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-20 05:47:54,860 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-20 05:47:54,860 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-20 05:47:54,860 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-20 05:47:54,861 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-20 05:47:54,883 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states. [2020-07-20 05:47:54,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-20 05:47:54,890 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:47:54,891 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:47:54,892 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:47:54,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:47:54,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1255802584, now seen corresponding path program 1 times [2020-07-20 05:47:54,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:47:54,912 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266985656] [2020-07-20 05:47:54,912 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4ba393ec [2020-07-20 05:47:55,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:47:55,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:47:55,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 05:47:55,146 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266985656] [2020-07-20 05:47:55,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 05:47:55,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 05:47:55,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979451748] [2020-07-20 05:47:55,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 05:47:55,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:47:55,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 05:47:55,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 05:47:55,176 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 3 states. [2020-07-20 05:47:55,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:47:55,429 INFO L93 Difference]: Finished difference Result 98 states and 156 transitions. [2020-07-20 05:47:55,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 05:47:55,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-07-20 05:47:55,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:47:55,443 INFO L225 Difference]: With dead ends: 98 [2020-07-20 05:47:55,443 INFO L226 Difference]: Without dead ends: 45 [2020-07-20 05:47:55,447 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 05:47:55,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-07-20 05:47:55,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-07-20 05:47:55,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-20 05:47:55,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2020-07-20 05:47:55,493 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 10 [2020-07-20 05:47:55,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:47:55,494 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2020-07-20 05:47:55,494 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 05:47:55,494 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2020-07-20 05:47:55,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-20 05:47:55,495 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:47:55,495 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:47:55,495 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-20 05:47:55,496 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:47:55,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:47:55,496 INFO L82 PathProgramCache]: Analyzing trace with hash -338068956, now seen corresponding path program 1 times [2020-07-20 05:47:55,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:47:55,497 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465929721] [2020-07-20 05:47:55,497 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4ba393ec [2020-07-20 05:47:55,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:47:55,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:47:55,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 05:47:55,630 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465929721] [2020-07-20 05:47:55,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 05:47:55,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 05:47:55,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906703532] [2020-07-20 05:47:55,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 05:47:55,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:47:55,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 05:47:55,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 05:47:55,640 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 5 states. [2020-07-20 05:47:55,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:47:55,862 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2020-07-20 05:47:55,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-20 05:47:55,862 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-07-20 05:47:55,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:47:55,864 INFO L225 Difference]: With dead ends: 51 [2020-07-20 05:47:55,864 INFO L226 Difference]: Without dead ends: 49 [2020-07-20 05:47:55,865 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-20 05:47:55,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-07-20 05:47:55,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2020-07-20 05:47:55,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-20 05:47:55,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2020-07-20 05:47:55,874 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 11 [2020-07-20 05:47:55,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:47:55,874 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2020-07-20 05:47:55,874 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 05:47:55,875 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2020-07-20 05:47:55,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-20 05:47:55,875 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:47:55,876 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:47:55,876 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-20 05:47:55,876 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:47:55,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:47:55,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1890143313, now seen corresponding path program 1 times [2020-07-20 05:47:55,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:47:55,877 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386065951] [2020-07-20 05:47:55,877 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4ba393ec [2020-07-20 05:47:55,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:47:55,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:47:55,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 05:47:55,974 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386065951] [2020-07-20 05:47:55,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 05:47:55,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 05:47:55,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364955549] [2020-07-20 05:47:55,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 05:47:55,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:47:55,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 05:47:55,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 05:47:55,976 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 5 states. [2020-07-20 05:47:56,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:47:56,129 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2020-07-20 05:47:56,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-20 05:47:56,130 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-07-20 05:47:56,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:47:56,131 INFO L225 Difference]: With dead ends: 43 [2020-07-20 05:47:56,131 INFO L226 Difference]: Without dead ends: 41 [2020-07-20 05:47:56,132 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-20 05:47:56,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-20 05:47:56,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-07-20 05:47:56,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-20 05:47:56,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2020-07-20 05:47:56,138 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 12 [2020-07-20 05:47:56,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:47:56,139 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2020-07-20 05:47:56,139 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 05:47:56,139 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2020-07-20 05:47:56,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-20 05:47:56,140 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:47:56,140 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:47:56,140 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-20 05:47:56,140 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:47:56,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:47:56,141 INFO L82 PathProgramCache]: Analyzing trace with hash 290038970, now seen corresponding path program 1 times [2020-07-20 05:47:56,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:47:56,141 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137971080] [2020-07-20 05:47:56,142 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4ba393ec [2020-07-20 05:47:56,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:47:56,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:47:56,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 05:47:56,264 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137971080] [2020-07-20 05:47:56,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 05:47:56,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-20 05:47:56,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091818938] [2020-07-20 05:47:56,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-20 05:47:56,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:47:56,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-20 05:47:56,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-20 05:47:56,266 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 6 states. [2020-07-20 05:47:56,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:47:56,492 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2020-07-20 05:47:56,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-20 05:47:56,492 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-07-20 05:47:56,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:47:56,493 INFO L225 Difference]: With dead ends: 66 [2020-07-20 05:47:56,494 INFO L226 Difference]: Without dead ends: 64 [2020-07-20 05:47:56,494 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-20 05:47:56,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-07-20 05:47:56,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 48. [2020-07-20 05:47:56,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-20 05:47:56,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2020-07-20 05:47:56,502 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 14 [2020-07-20 05:47:56,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:47:56,503 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2020-07-20 05:47:56,503 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-20 05:47:56,503 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2020-07-20 05:47:56,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-20 05:47:56,504 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:47:56,504 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:47:56,504 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-20 05:47:56,505 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:47:56,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:47:56,505 INFO L82 PathProgramCache]: Analyzing trace with hash 2060721718, now seen corresponding path program 1 times [2020-07-20 05:47:56,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:47:56,506 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102648215] [2020-07-20 05:47:56,506 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4ba393ec [2020-07-20 05:47:56,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:47:56,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:47:56,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 05:47:56,655 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102648215] [2020-07-20 05:47:56,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 05:47:56,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 05:47:56,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255042620] [2020-07-20 05:47:56,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 05:47:56,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:47:56,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 05:47:56,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 05:47:56,659 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 5 states. [2020-07-20 05:47:56,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:47:56,918 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2020-07-20 05:47:56,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-20 05:47:56,919 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-07-20 05:47:56,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:47:56,921 INFO L225 Difference]: With dead ends: 48 [2020-07-20 05:47:56,921 INFO L226 Difference]: Without dead ends: 46 [2020-07-20 05:47:56,922 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-20 05:47:56,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-20 05:47:56,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2020-07-20 05:47:56,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-20 05:47:56,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2020-07-20 05:47:56,935 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 15 [2020-07-20 05:47:56,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:47:56,935 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2020-07-20 05:47:56,936 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 05:47:56,936 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2020-07-20 05:47:56,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-20 05:47:56,937 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:47:56,937 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:47:56,938 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-20 05:47:56,938 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:47:56,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:47:56,939 INFO L82 PathProgramCache]: Analyzing trace with hash 373775322, now seen corresponding path program 1 times [2020-07-20 05:47:56,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:47:56,940 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849833202] [2020-07-20 05:47:56,940 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4ba393ec [2020-07-20 05:47:57,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:47:57,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:47:57,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 05:47:57,139 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849833202] [2020-07-20 05:47:57,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 05:47:57,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 05:47:57,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012728464] [2020-07-20 05:47:57,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 05:47:57,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:47:57,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 05:47:57,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 05:47:57,144 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 5 states. [2020-07-20 05:47:57,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:47:57,304 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2020-07-20 05:47:57,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-20 05:47:57,304 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-07-20 05:47:57,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:47:57,305 INFO L225 Difference]: With dead ends: 46 [2020-07-20 05:47:57,306 INFO L226 Difference]: Without dead ends: 44 [2020-07-20 05:47:57,306 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-20 05:47:57,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-20 05:47:57,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-07-20 05:47:57,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-20 05:47:57,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2020-07-20 05:47:57,314 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 17 [2020-07-20 05:47:57,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:47:57,314 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2020-07-20 05:47:57,314 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 05:47:57,314 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2020-07-20 05:47:57,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-20 05:47:57,315 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:47:57,315 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:47:57,316 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-20 05:47:57,316 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:47:57,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:47:57,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1568846049, now seen corresponding path program 1 times [2020-07-20 05:47:57,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:47:57,317 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480361402] [2020-07-20 05:47:57,317 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4ba393ec [2020-07-20 05:47:57,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:47:57,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:47:57,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 05:47:57,408 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480361402] [2020-07-20 05:47:57,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 05:47:57,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-20 05:47:57,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254965135] [2020-07-20 05:47:57,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-20 05:47:57,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:47:57,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-20 05:47:57,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-20 05:47:57,411 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 6 states. [2020-07-20 05:47:57,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:47:57,579 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2020-07-20 05:47:57,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 05:47:57,580 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-07-20 05:47:57,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:47:57,581 INFO L225 Difference]: With dead ends: 59 [2020-07-20 05:47:57,581 INFO L226 Difference]: Without dead ends: 47 [2020-07-20 05:47:57,581 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-20 05:47:57,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-07-20 05:47:57,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2020-07-20 05:47:57,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-20 05:47:57,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2020-07-20 05:47:57,587 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 18 [2020-07-20 05:47:57,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:47:57,587 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2020-07-20 05:47:57,587 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-20 05:47:57,588 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2020-07-20 05:47:57,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-20 05:47:57,588 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:47:57,589 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:47:57,589 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-20 05:47:57,589 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:47:57,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:47:57,590 INFO L82 PathProgramCache]: Analyzing trace with hash 777661568, now seen corresponding path program 1 times [2020-07-20 05:47:57,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:47:57,590 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83063724] [2020-07-20 05:47:57,591 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4ba393ec [2020-07-20 05:47:57,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:47:57,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:47:57,668 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 05:47:57,668 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83063724] [2020-07-20 05:47:57,669 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756145276] [2020-07-20 05:47:57,669 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@756097c1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:47:57,837 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@756097c1 issued 2 check-sat command(s) [2020-07-20 05:47:57,837 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 05:47:57,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-20 05:47:57,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 05:47:57,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 05:47:57,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 05:47:57,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 05:47:57,958 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2020-07-20 05:47:57,962 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 05:47:57,974 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:47:57,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 05:47:57,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 05:47:57,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 05:47:57,985 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2020-07-20 05:47:57,985 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 05:47:57,995 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:47:57,996 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 05:47:57,996 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2020-07-20 05:47:58,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 05:47:58,066 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2020-07-20 05:47:58,067 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 05:47:58,076 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:47:58,081 INFO L350 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2020-07-20 05:47:58,082 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 10 [2020-07-20 05:47:58,083 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 05:47:58,087 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:47:58,088 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 05:47:58,088 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:7 [2020-07-20 05:47:58,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 05:47:58,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 05:47:58,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2020-07-20 05:47:58,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637880029] [2020-07-20 05:47:58,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-20 05:47:58,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:47:58,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-20 05:47:58,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-07-20 05:47:58,108 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 9 states. [2020-07-20 05:47:58,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:47:58,573 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2020-07-20 05:47:58,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-20 05:47:58,574 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-07-20 05:47:58,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:47:58,575 INFO L225 Difference]: With dead ends: 63 [2020-07-20 05:47:58,575 INFO L226 Difference]: Without dead ends: 41 [2020-07-20 05:47:58,575 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-07-20 05:47:58,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-20 05:47:58,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-07-20 05:47:58,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-20 05:47:58,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2020-07-20 05:47:58,580 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 21 [2020-07-20 05:47:58,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:47:58,580 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2020-07-20 05:47:58,581 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-20 05:47:58,581 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2020-07-20 05:47:58,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-20 05:47:58,581 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:47:58,581 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:47:58,782 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2020-07-20 05:47:58,783 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:47:58,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:47:58,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1056872398, now seen corresponding path program 1 times [2020-07-20 05:47:58,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:47:58,784 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421739328] [2020-07-20 05:47:58,785 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4ba393ec [2020-07-20 05:47:58,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:47:59,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:47:59,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 05:47:59,025 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421739328] [2020-07-20 05:47:59,025 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039450821] [2020-07-20 05:47:59,025 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@422272d5 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:47:59,602 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@422272d5 issued 2 check-sat command(s) [2020-07-20 05:47:59,602 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 05:47:59,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 32 conjunts are in the unsatisfiable core [2020-07-20 05:47:59,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 05:47:59,639 INFO L350 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2020-07-20 05:47:59,640 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2020-07-20 05:47:59,641 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 05:47:59,657 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:47:59,664 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-07-20 05:47:59,665 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 05:47:59,678 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:47:59,679 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-20 05:47:59,680 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:26 [2020-07-20 05:47:59,806 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:47:59,806 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2020-07-20 05:47:59,807 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 05:47:59,905 INFO L624 ElimStorePlain]: treesize reduction 14, result has 88.6 percent of original size [2020-07-20 05:47:59,921 INFO L544 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-20 05:47:59,949 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:47:59,957 INFO L544 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-20 05:47:59,993 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:47:59,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 05:47:59,999 INFO L544 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-07-20 05:48:00,026 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:00,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 05:48:00,063 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:00,064 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 55 [2020-07-20 05:48:00,065 INFO L544 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-07-20 05:48:00,114 INFO L624 ElimStorePlain]: treesize reduction 20, result has 72.2 percent of original size [2020-07-20 05:48:00,118 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 05:48:00,119 INFO L244 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:111, output treesize:24 [2020-07-20 05:48:00,240 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:00,241 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2020-07-20 05:48:00,243 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 05:48:00,292 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:00,294 INFO L440 ElimStorePlain]: Different costs {2=[|v_#memory_int_39|, |v_#memory_int_40|, |v_#memory_$Pointer$.base_30|, |v_#memory_int_41|], 4=[|v_#memory_int_43|]} [2020-07-20 05:48:00,299 INFO L544 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-20 05:48:00,339 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:00,343 INFO L544 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-20 05:48:00,386 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:00,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 05:48:00,395 INFO L544 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-07-20 05:48:00,418 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:00,422 INFO L544 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-20 05:48:00,437 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:00,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 05:48:00,503 INFO L350 Elim1Store]: treesize reduction 65, result has 46.7 percent of original size [2020-07-20 05:48:00,503 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 85 [2020-07-20 05:48:00,506 INFO L544 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-07-20 05:48:00,560 INFO L624 ElimStorePlain]: treesize reduction 18, result has 80.9 percent of original size [2020-07-20 05:48:00,573 INFO L544 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-07-20 05:48:00,574 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 11 variables, input treesize:246, output treesize:40 [2020-07-20 05:48:00,727 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2020-07-20 05:48:00,729 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 05:48:00,736 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:00,737 INFO L544 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 05:48:00,737 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:49, output treesize:3 [2020-07-20 05:48:00,744 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 05:48:00,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 05:48:00,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2020-07-20 05:48:00,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922271234] [2020-07-20 05:48:00,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-20 05:48:00,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:48:00,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-20 05:48:00,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-07-20 05:48:00,747 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 12 states. [2020-07-20 05:48:09,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:48:09,569 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2020-07-20 05:48:09,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-20 05:48:09,570 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2020-07-20 05:48:09,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:48:09,571 INFO L225 Difference]: With dead ends: 73 [2020-07-20 05:48:09,571 INFO L226 Difference]: Without dead ends: 71 [2020-07-20 05:48:09,572 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2020-07-20 05:48:09,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-07-20 05:48:09,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 39. [2020-07-20 05:48:09,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-20 05:48:09,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2020-07-20 05:48:09,579 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 25 [2020-07-20 05:48:09,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:48:09,579 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2020-07-20 05:48:09,579 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-20 05:48:09,580 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2020-07-20 05:48:09,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-20 05:48:09,581 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:48:09,581 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:48:09,795 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:48:09,796 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:48:09,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:48:09,797 INFO L82 PathProgramCache]: Analyzing trace with hash -377613816, now seen corresponding path program 1 times [2020-07-20 05:48:09,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:48:09,798 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967311212] [2020-07-20 05:48:09,799 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4ba393ec [2020-07-20 05:48:09,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:48:10,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:48:10,072 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 05:48:10,072 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967311212] [2020-07-20 05:48:10,073 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792572228] [2020-07-20 05:48:10,073 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3b161368 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:48:10,892 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3b161368 issued 3 check-sat command(s) [2020-07-20 05:48:10,892 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 05:48:10,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 51 conjunts are in the unsatisfiable core [2020-07-20 05:48:10,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 05:48:10,916 INFO L350 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2020-07-20 05:48:10,916 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2020-07-20 05:48:10,917 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 05:48:10,927 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:10,929 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-20 05:48:10,930 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:23 [2020-07-20 05:48:11,014 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:11,015 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2020-07-20 05:48:11,016 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 05:48:11,123 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2020-07-20 05:48:11,124 INFO L624 ElimStorePlain]: treesize reduction 14, result has 93.5 percent of original size [2020-07-20 05:48:11,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 05:48:11,136 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-20 05:48:11,149 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:11,149 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 41 [2020-07-20 05:48:11,150 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 05:48:11,220 INFO L624 ElimStorePlain]: treesize reduction 16, result has 89.4 percent of original size [2020-07-20 05:48:11,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 05:48:11,237 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:11,237 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 41 [2020-07-20 05:48:11,238 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-20 05:48:11,291 INFO L624 ElimStorePlain]: treesize reduction 16, result has 81.2 percent of original size [2020-07-20 05:48:11,292 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 05:48:11,293 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:203, output treesize:82 [2020-07-20 05:48:11,397 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:11,397 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2020-07-20 05:48:11,398 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 05:48:11,557 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-07-20 05:48:11,558 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:11,561 INFO L440 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.base_34|, |v_#memory_$Pointer$.offset_32|], 11=[|v_#memory_$Pointer$.offset_30|, |v_#memory_$Pointer$.base_32|]} [2020-07-20 05:48:11,569 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:11,569 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 433 treesize of output 289 [2020-07-20 05:48:11,573 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 05:48:11,813 WARN L193 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2020-07-20 05:48:11,814 INFO L624 ElimStorePlain]: treesize reduction 16, result has 96.4 percent of original size [2020-07-20 05:48:11,837 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 39 [2020-07-20 05:48:11,839 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-20 05:48:11,955 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2020-07-20 05:48:11,956 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:11,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 05:48:11,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 05:48:11,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 05:48:11,975 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-20 05:48:11,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 05:48:12,029 INFO L350 Elim1Store]: treesize reduction 5, result has 90.7 percent of original size [2020-07-20 05:48:12,030 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 135 treesize of output 97 [2020-07-20 05:48:12,031 INFO L544 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-07-20 05:48:12,148 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2020-07-20 05:48:12,151 INFO L624 ElimStorePlain]: treesize reduction 41, result has 86.4 percent of original size [2020-07-20 05:48:12,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 05:48:12,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 05:48:12,231 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:12,232 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 174 treesize of output 144 [2020-07-20 05:48:12,234 INFO L544 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-07-20 05:48:12,363 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 45 [2020-07-20 05:48:12,365 INFO L624 ElimStorePlain]: treesize reduction 134, result has 42.7 percent of original size [2020-07-20 05:48:12,366 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 05:48:12,366 INFO L244 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:457, output treesize:97 [2020-07-20 05:48:12,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 05:48:12,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 05:48:12,580 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 19 [2020-07-20 05:48:12,581 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 05:48:12,596 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:12,597 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-20 05:48:12,598 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:135, output treesize:72 [2020-07-20 05:48:12,693 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:12,694 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 14 case distinctions, treesize of input 69 treesize of output 82 [2020-07-20 05:48:12,696 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-20 05:48:12,696 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-20 05:48:12,700 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-20 05:48:12,703 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 05:48:12,704 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 05:48:12,705 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 05:48:12,710 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-20 05:48:12,711 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-20 05:48:12,712 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 05:48:12,713 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 05:48:12,713 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 05:48:12,715 INFO L501 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-07-20 05:48:12,722 INFO L501 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-07-20 05:48:12,723 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 05:48:12,729 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 05:48:12,729 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 05:48:12,730 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 05:48:12,731 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 05:48:12,732 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 05:48:12,732 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 05:48:12,733 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 05:48:12,733 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 05:48:12,733 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 05:48:12,734 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 05:48:12,734 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 05:48:12,735 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 05:48:12,736 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 05:48:12,736 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 05:48:12,740 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:12,741 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 05:48:12,741 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:73, output treesize:4 [2020-07-20 05:48:12,754 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 05:48:12,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 05:48:12,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2020-07-20 05:48:12,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412371624] [2020-07-20 05:48:12,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-20 05:48:12,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:48:12,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-20 05:48:12,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2020-07-20 05:48:12,757 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 16 states. [2020-07-20 05:48:14,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:48:14,379 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2020-07-20 05:48:14,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-20 05:48:14,380 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 32 [2020-07-20 05:48:14,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:48:14,381 INFO L225 Difference]: With dead ends: 109 [2020-07-20 05:48:14,381 INFO L226 Difference]: Without dead ends: 107 [2020-07-20 05:48:14,382 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2020-07-20 05:48:14,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-07-20 05:48:14,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 73. [2020-07-20 05:48:14,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-07-20 05:48:14,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2020-07-20 05:48:14,391 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 32 [2020-07-20 05:48:14,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:48:14,392 INFO L479 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2020-07-20 05:48:14,392 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-20 05:48:14,392 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2020-07-20 05:48:14,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-20 05:48:14,393 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:48:14,393 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:48:14,606 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-07-20 05:48:14,607 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:48:14,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:48:14,608 INFO L82 PathProgramCache]: Analyzing trace with hash -243600310, now seen corresponding path program 1 times [2020-07-20 05:48:14,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:48:14,608 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242668555] [2020-07-20 05:48:14,609 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4ba393ec [2020-07-20 05:48:14,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:48:14,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:48:14,785 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 05:48:14,786 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242668555] [2020-07-20 05:48:14,786 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456851897] [2020-07-20 05:48:14,786 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@25758f31 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:48:15,356 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@25758f31 issued 3 check-sat command(s) [2020-07-20 05:48:15,357 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 05:48:15,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 37 conjunts are in the unsatisfiable core [2020-07-20 05:48:15,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 05:48:15,393 INFO L350 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2020-07-20 05:48:15,394 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2020-07-20 05:48:15,394 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 05:48:15,404 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:15,405 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-20 05:48:15,405 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:23 [2020-07-20 05:48:15,476 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:15,477 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-07-20 05:48:15,478 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 05:48:15,478 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 05:48:15,512 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:15,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 05:48:15,528 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-20 05:48:15,540 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:15,540 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 41 [2020-07-20 05:48:15,541 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 05:48:15,592 INFO L624 ElimStorePlain]: treesize reduction 16, result has 88.4 percent of original size [2020-07-20 05:48:15,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 05:48:15,617 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:15,618 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 41 [2020-07-20 05:48:15,619 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-20 05:48:15,667 INFO L624 ElimStorePlain]: treesize reduction 16, result has 77.8 percent of original size [2020-07-20 05:48:15,668 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 05:48:15,669 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:194, output treesize:58 [2020-07-20 05:48:15,713 INFO L440 ElimStorePlain]: Different costs {0=[|v_#memory_int_44|], 4=[|v_#memory_$Pointer$.base_36|], 6=[|v_#memory_$Pointer$.offset_34|]} [2020-07-20 05:48:15,718 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2020-07-20 05:48:15,718 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 05:48:15,740 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:15,749 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:15,749 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 72 [2020-07-20 05:48:15,750 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 05:48:15,776 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:15,783 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 39 [2020-07-20 05:48:15,783 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-20 05:48:15,805 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:15,805 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 05:48:15,806 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:125, output treesize:63 [2020-07-20 05:48:15,897 INFO L440 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|], 1=[|#memory_$Pointer$.offset|]} [2020-07-20 05:48:15,901 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:15,901 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 35 [2020-07-20 05:48:15,902 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 05:48:15,912 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:15,916 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2020-07-20 05:48:15,917 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 05:48:15,924 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:15,924 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 05:48:15,925 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:74, output treesize:11 [2020-07-20 05:48:15,953 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-07-20 05:48:15,954 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 05:48:15,956 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:15,957 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 05:48:15,957 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2020-07-20 05:48:15,985 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 05:48:15,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 05:48:15,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 19 [2020-07-20 05:48:15,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123489305] [2020-07-20 05:48:15,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-20 05:48:15,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:48:15,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-20 05:48:15,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2020-07-20 05:48:15,987 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand 19 states. [2020-07-20 05:48:17,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:48:17,230 INFO L93 Difference]: Finished difference Result 120 states and 132 transitions. [2020-07-20 05:48:17,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-20 05:48:17,231 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 32 [2020-07-20 05:48:17,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:48:17,235 INFO L225 Difference]: With dead ends: 120 [2020-07-20 05:48:17,235 INFO L226 Difference]: Without dead ends: 108 [2020-07-20 05:48:17,236 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=124, Invalid=578, Unknown=0, NotChecked=0, Total=702 [2020-07-20 05:48:17,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2020-07-20 05:48:17,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 82. [2020-07-20 05:48:17,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-07-20 05:48:17,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2020-07-20 05:48:17,246 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 32 [2020-07-20 05:48:17,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:48:17,246 INFO L479 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2020-07-20 05:48:17,247 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-20 05:48:17,247 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2020-07-20 05:48:17,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-20 05:48:17,248 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:48:17,248 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:48:17,459 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:48:17,460 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:48:17,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:48:17,461 INFO L82 PathProgramCache]: Analyzing trace with hash 145286649, now seen corresponding path program 2 times [2020-07-20 05:48:17,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:48:17,462 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781567378] [2020-07-20 05:48:17,462 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4ba393ec [2020-07-20 05:48:17,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:48:17,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:48:17,775 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 05:48:17,775 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781567378] [2020-07-20 05:48:17,775 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505106663] [2020-07-20 05:48:17,776 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@19c7ae2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:48:18,497 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@19c7ae2 issued 3 check-sat command(s) [2020-07-20 05:48:18,497 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 05:48:18,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 53 conjunts are in the unsatisfiable core [2020-07-20 05:48:18,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 05:48:18,521 INFO L350 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2020-07-20 05:48:18,522 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2020-07-20 05:48:18,522 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 05:48:18,537 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:18,538 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-20 05:48:18,539 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:23 [2020-07-20 05:48:18,617 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:18,618 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2020-07-20 05:48:18,619 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 05:48:18,717 INFO L624 ElimStorePlain]: treesize reduction 14, result has 93.5 percent of original size [2020-07-20 05:48:18,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 05:48:18,728 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-20 05:48:18,740 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:18,741 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 41 [2020-07-20 05:48:18,742 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 05:48:18,806 INFO L624 ElimStorePlain]: treesize reduction 16, result has 89.4 percent of original size [2020-07-20 05:48:18,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 05:48:18,847 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:18,848 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 41 [2020-07-20 05:48:18,848 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-20 05:48:18,908 INFO L624 ElimStorePlain]: treesize reduction 16, result has 81.2 percent of original size [2020-07-20 05:48:18,909 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 05:48:18,910 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:203, output treesize:82 [2020-07-20 05:48:19,109 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:19,110 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2020-07-20 05:48:19,111 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 05:48:19,529 WARN L193 SmtUtils]: Spent 417.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-07-20 05:48:19,529 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:19,533 INFO L440 ElimStorePlain]: Different costs {0=[|v_#memory_int_48|, |v_#memory_int_47|], 2=[|v_#memory_int_45|, |v_#memory_int_46|], 6=[|v_#memory_$Pointer$.base_39|, |v_#memory_$Pointer$.offset_37|], 11=[|v_#memory_$Pointer$.base_37|, |v_#memory_$Pointer$.offset_35|]} [2020-07-20 05:48:19,614 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2020-07-20 05:48:19,615 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 05:48:20,028 WARN L193 SmtUtils]: Spent 412.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-07-20 05:48:20,028 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:20,061 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2020-07-20 05:48:20,062 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-20 05:48:20,310 WARN L193 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-07-20 05:48:20,311 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:20,319 INFO L544 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-20 05:48:20,485 WARN L193 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-07-20 05:48:20,486 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:20,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 05:48:20,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 05:48:20,507 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 228 treesize of output 231 [2020-07-20 05:48:20,508 INFO L544 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-07-20 05:48:20,779 WARN L193 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2020-07-20 05:48:20,780 INFO L624 ElimStorePlain]: treesize reduction 8, result has 99.3 percent of original size [2020-07-20 05:48:20,788 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:20,789 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 1143 treesize of output 691 [2020-07-20 05:48:20,791 INFO L544 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-07-20 05:48:21,046 WARN L193 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2020-07-20 05:48:21,047 INFO L624 ElimStorePlain]: treesize reduction 24, result has 97.9 percent of original size [2020-07-20 05:48:21,066 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 39 [2020-07-20 05:48:21,067 INFO L544 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-07-20 05:48:21,197 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2020-07-20 05:48:21,197 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:21,391 WARN L193 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 67 [2020-07-20 05:48:21,393 INFO L350 Elim1Store]: treesize reduction 151, result has 60.6 percent of original size [2020-07-20 05:48:21,393 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 579 treesize of output 565 [2020-07-20 05:48:21,397 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-20 05:48:21,398 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 05:48:21,400 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[17, 3, 2, 1] term [2020-07-20 05:48:21,400 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 16 disjuncts [2020-07-20 05:48:21,402 INFO L544 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2020-07-20 05:48:21,594 WARN L193 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 57 [2020-07-20 05:48:21,595 INFO L624 ElimStorePlain]: treesize reduction 883, result has 30.9 percent of original size [2020-07-20 05:48:21,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 05:48:21,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 05:48:21,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 05:48:21,609 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 67 [2020-07-20 05:48:21,610 INFO L544 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2020-07-20 05:48:21,639 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:21,640 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 8 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 05:48:21,640 INFO L244 ElimStorePlain]: Needed 10 recursive calls to eliminate 10 variables, input treesize:1422, output treesize:131 [2020-07-20 05:48:21,788 INFO L440 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.base|], 4=[|#memory_$Pointer$.offset|]} [2020-07-20 05:48:21,802 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:21,802 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 128 treesize of output 78 [2020-07-20 05:48:21,804 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-20 05:48:21,805 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-20 05:48:21,806 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-20 05:48:21,809 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-20 05:48:21,810 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-20 05:48:21,811 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-20 05:48:21,814 INFO L544 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-20 05:48:21,869 INFO L624 ElimStorePlain]: treesize reduction 12, result has 84.4 percent of original size [2020-07-20 05:48:21,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 05:48:21,880 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2020-07-20 05:48:21,881 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 05:48:21,897 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:21,898 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-20 05:48:21,898 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:142, output treesize:18 [2020-07-20 05:48:21,955 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:21,956 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2020-07-20 05:48:21,957 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 05:48:21,967 INFO L624 ElimStorePlain]: treesize reduction 4, result has 66.7 percent of original size [2020-07-20 05:48:21,968 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 05:48:21,968 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2020-07-20 05:48:22,023 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 05:48:22,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 05:48:22,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8] total 20 [2020-07-20 05:48:22,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883146539] [2020-07-20 05:48:22,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-07-20 05:48:22,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:48:22,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-07-20 05:48:22,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2020-07-20 05:48:22,031 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand 20 states. [2020-07-20 05:48:24,000 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 80 [2020-07-20 05:48:24,215 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 88 [2020-07-20 05:48:24,437 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 90 [2020-07-20 05:48:24,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:48:24,860 INFO L93 Difference]: Finished difference Result 138 states and 150 transitions. [2020-07-20 05:48:24,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-20 05:48:24,860 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 35 [2020-07-20 05:48:24,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:48:24,862 INFO L225 Difference]: With dead ends: 138 [2020-07-20 05:48:24,862 INFO L226 Difference]: Without dead ends: 126 [2020-07-20 05:48:24,863 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=127, Invalid=803, Unknown=0, NotChecked=0, Total=930 [2020-07-20 05:48:24,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-07-20 05:48:24,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 103. [2020-07-20 05:48:24,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-07-20 05:48:24,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 112 transitions. [2020-07-20 05:48:24,874 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 112 transitions. Word has length 35 [2020-07-20 05:48:24,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:48:24,875 INFO L479 AbstractCegarLoop]: Abstraction has 103 states and 112 transitions. [2020-07-20 05:48:24,875 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-07-20 05:48:24,875 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 112 transitions. [2020-07-20 05:48:24,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-20 05:48:24,876 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:48:24,876 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:48:25,079 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-07-20 05:48:25,080 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:48:25,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:48:25,081 INFO L82 PathProgramCache]: Analyzing trace with hash -969799515, now seen corresponding path program 1 times [2020-07-20 05:48:25,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:48:25,082 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743409024] [2020-07-20 05:48:25,082 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4ba393ec [2020-07-20 05:48:25,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-20 05:48:25,121 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 05:48:25,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-20 05:48:25,153 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 05:48:25,188 INFO L174 FreeRefinementEngine]: Strategy CAMEL_SMT_AM found a feasible trace [2020-07-20 05:48:25,189 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-20 05:48:25,189 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-20 05:48:25,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 05:48:25 BoogieIcfgContainer [2020-07-20 05:48:25,233 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-20 05:48:25,235 INFO L168 Benchmark]: Toolchain (without parser) took 31950.07 ms. Allocated memory was 145.2 MB in the beginning and 357.6 MB in the end (delta: 212.3 MB). Free memory was 101.9 MB in the beginning and 278.1 MB in the end (delta: -176.2 MB). Peak memory consumption was 36.1 MB. Max. memory is 7.1 GB. [2020-07-20 05:48:25,235 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 145.2 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-20 05:48:25,235 INFO L168 Benchmark]: CACSL2BoogieTranslator took 708.27 ms. Allocated memory was 145.2 MB in the beginning and 201.9 MB in the end (delta: 56.6 MB). Free memory was 101.4 MB in the beginning and 169.1 MB in the end (delta: -67.6 MB). Peak memory consumption was 23.4 MB. Max. memory is 7.1 GB. [2020-07-20 05:48:25,236 INFO L168 Benchmark]: Boogie Preprocessor took 68.50 ms. Allocated memory is still 201.9 MB. Free memory was 169.1 MB in the beginning and 165.6 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2020-07-20 05:48:25,236 INFO L168 Benchmark]: RCFGBuilder took 719.02 ms. Allocated memory is still 201.9 MB. Free memory was 165.6 MB in the beginning and 114.0 MB in the end (delta: 51.6 MB). Peak memory consumption was 51.6 MB. Max. memory is 7.1 GB. [2020-07-20 05:48:25,236 INFO L168 Benchmark]: TraceAbstraction took 30447.59 ms. Allocated memory was 201.9 MB in the beginning and 357.6 MB in the end (delta: 155.7 MB). Free memory was 113.3 MB in the beginning and 278.1 MB in the end (delta: -164.8 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-20 05:48:25,238 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 145.2 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 708.27 ms. Allocated memory was 145.2 MB in the beginning and 201.9 MB in the end (delta: 56.6 MB). Free memory was 101.4 MB in the beginning and 169.1 MB in the end (delta: -67.6 MB). Peak memory consumption was 23.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 68.50 ms. Allocated memory is still 201.9 MB. Free memory was 169.1 MB in the beginning and 165.6 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 719.02 ms. Allocated memory is still 201.9 MB. Free memory was 165.6 MB in the beginning and 114.0 MB in the end (delta: 51.6 MB). Peak memory consumption was 51.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 30447.59 ms. Allocated memory was 201.9 MB in the beginning and 357.6 MB in the end (delta: 155.7 MB). Free memory was 113.3 MB in the beginning and 278.1 MB in the end (delta: -164.8 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1038]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L987] struct TSLL* null = malloc(sizeof(struct TSLL)); [L988] null->next = ((void*)0) [L989] null->prev = ((void*)0) [L990] null->colour = BLACK [L992] struct TSLL* list = malloc(sizeof(struct TSLL)); [L993] list->next = null [L994] list->prev = null [L995] list->colour = BLACK [L997] struct TSLL* end = list; VAL [end={-1:0}, list={-1:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={-1:0}, null={-2:0}] [L1000] COND TRUE __VERIFIER_nondet_int() [L1003] end->next = malloc(sizeof(struct TSLL)) [L1004] EXPR end->next [L1004] end->next->prev = end [L1005] EXPR end->next [L1005] end = end->next [L1006] end->next = null [L1008] COND FALSE !(__VERIFIER_nondet_int()) [L1014] end->colour = RED [L1015] end->next = malloc(sizeof(struct TSLL)) [L1016] EXPR end->next [L1016] end->next->prev = end [L1017] EXPR end->next [L1017] end = end->next [L1018] end->next = null [L1019] end->colour = BLACK VAL [end={-4:0}, list={-1:0}, malloc(sizeof(struct TSLL))={-4:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-3:0}, null={-2:0}] [L1021] EXPR end->colour VAL [end={-4:0}, end->colour=1, list={-1:0}, malloc(sizeof(struct TSLL))={-4:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-3:0}, null={-2:0}] [L1021] COND FALSE !(!(BLACK == end->colour)) [L1022] EXPR end->next VAL [end={-4:0}, end->next={-2:0}, list={-1:0}, malloc(sizeof(struct TSLL))={-4:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-3:0}, null={-2:0}] [L1022] COND FALSE !(!(null == end->next)) [L1023] COND FALSE !(!(null != end)) VAL [end={-4:0}, list={-1:0}, malloc(sizeof(struct TSLL))={-4:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-3:0}, null={-2:0}] [L1000] COND FALSE !(__VERIFIER_nondet_int()) [L1026] end = null [L1027] end = list VAL [end={-1:0}, list={-1:0}, malloc(sizeof(struct TSLL))={-4:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-3:0}, null={-2:0}] [L1030] COND FALSE !(!(null != end)) VAL [end={-1:0}, list={-1:0}, malloc(sizeof(struct TSLL))={-4:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-3:0}, null={-2:0}] [L1031] EXPR end->colour VAL [end={-1:0}, end->colour=1, list={-1:0}, malloc(sizeof(struct TSLL))={-4:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-3:0}, null={-2:0}] [L1031] COND FALSE !(!(BLACK == end->colour)) [L1032] COND TRUE null != end [L1034] EXPR end->colour VAL [end={-1:0}, end->colour=1, list={-1:0}, malloc(sizeof(struct TSLL))={-4:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-3:0}, null={-2:0}] [L1034] COND FALSE !(RED == end->colour) [L1041] EXPR end->next [L1041] end = end->next [L1032] COND TRUE null != end [L1034] EXPR end->colour VAL [end={-3:0}, end->colour=0, list={-1:0}, malloc(sizeof(struct TSLL))={-4:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-3:0}, null={-2:0}] [L1034] COND TRUE RED == end->colour [L1036] EXPR end->next [L1036] end = end->next [L1037] COND FALSE !(!(null != end)) VAL [end={-4:0}, list={-1:0}, malloc(sizeof(struct TSLL))={-4:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-3:0}, null={-2:0}] [L1038] EXPR end->colour VAL [end={-4:0}, end->colour=1, list={-1:0}, malloc(sizeof(struct TSLL))={-4:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-3:0}, null={-2:0}] [L1038] COND TRUE !(BLACK != end->colour) [L1038] __VERIFIER_error() VAL [end={-4:0}, list={-1:0}, malloc(sizeof(struct TSLL))={-4:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-3:0}, null={-2:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 52 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 30.3s, OverallIterations: 13, TraceHistogramMax: 3, AutomataDifference: 16.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 403 SDtfs, 664 SDslu, 1680 SDs, 0 SdLazy, 2148 SolverSat, 162 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 13.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 283 GetRequests, 149 SyntacticMatches, 3 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 138 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 8.9s InterpolantComputationTime, 422 NumberOfCodeBlocks, 378 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 370 ConstructedInterpolants, 29 QuantifiedInterpolants, 291522 SizeOfPredicates, 73 NumberOfNonLiveVariables, 633 ConjunctsInSsa, 184 ConjunctsInUnsatCore, 17 InterpolantComputations, 7 PerfectInterpolantSequences, 7/42 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...