/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/sll-01-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-79ed534 [2020-07-20 05:47:57,958 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-20 05:47:57,961 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-20 05:47:57,982 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-20 05:47:57,982 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-20 05:47:57,985 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-20 05:47:57,987 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-20 05:47:57,999 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-20 05:47:58,001 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-20 05:47:58,003 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-20 05:47:58,004 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-20 05:47:58,005 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-20 05:47:58,005 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-20 05:47:58,006 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-20 05:47:58,013 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-20 05:47:58,014 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-20 05:47:58,016 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-20 05:47:58,019 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-20 05:47:58,021 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-20 05:47:58,027 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-20 05:47:58,032 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-20 05:47:58,033 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-20 05:47:58,035 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-20 05:47:58,036 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-20 05:47:58,039 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-20 05:47:58,040 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-20 05:47:58,040 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-20 05:47:58,043 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-20 05:47:58,043 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-20 05:47:58,044 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-20 05:47:58,045 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-20 05:47:58,046 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-20 05:47:58,047 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-20 05:47:58,047 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-20 05:47:58,052 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-20 05:47:58,052 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-20 05:47:58,053 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-20 05:47:58,053 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-20 05:47:58,054 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-20 05:47:58,055 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-20 05:47:58,056 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-20 05:47:58,057 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:58,071 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-20 05:47:58,072 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-20 05:47:58,073 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-20 05:47:58,073 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-20 05:47:58,074 INFO L138 SettingsManager]: * Use SBE=true [2020-07-20 05:47:58,074 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-20 05:47:58,074 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-20 05:47:58,074 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-20 05:47:58,074 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-20 05:47:58,075 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-20 05:47:58,075 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-20 05:47:58,075 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-20 05:47:58,075 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-20 05:47:58,075 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-20 05:47:58,076 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-20 05:47:58,076 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-20 05:47:58,076 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-20 05:47:58,076 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-20 05:47:58,077 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-20 05:47:58,077 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-20 05:47:58,077 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-20 05:47:58,077 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 05:47:58,077 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-20 05:47:58,078 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-20 05:47:58,078 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-20 05:47:58,078 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-20 05:47:58,078 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 05:47:58,078 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-20 05:47:58,078 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-20 05:47:58,079 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:58,419 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-20 05:47:58,433 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-20 05:47:58,436 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-20 05:47:58,438 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-20 05:47:58,438 INFO L275 PluginConnector]: CDTParser initialized [2020-07-20 05:47:58,439 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-01-2.i [2020-07-20 05:47:58,507 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9e2ae3f0/dfbfa43c96274e92b965e344f8e32107/FLAG46188a6b9 [2020-07-20 05:47:59,071 INFO L306 CDTParser]: Found 1 translation units. [2020-07-20 05:47:59,071 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-2.i [2020-07-20 05:47:59,093 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9e2ae3f0/dfbfa43c96274e92b965e344f8e32107/FLAG46188a6b9 [2020-07-20 05:47:59,310 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9e2ae3f0/dfbfa43c96274e92b965e344f8e32107 [2020-07-20 05:47:59,320 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-20 05:47:59,324 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-20 05:47:59,325 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-20 05:47:59,325 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-20 05:47:59,328 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-20 05:47:59,329 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:47:59" (1/1) ... [2020-07-20 05:47:59,333 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6645bd80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:59, skipping insertion in model container [2020-07-20 05:47:59,333 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:47:59" (1/1) ... [2020-07-20 05:47:59,341 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-20 05:47:59,381 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-20 05:47:59,874 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 05:47:59,883 INFO L203 MainTranslator]: Completed pre-run [2020-07-20 05:47:59,934 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 05:47:59,983 INFO L208 MainTranslator]: Completed translation [2020-07-20 05:47:59,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:59 WrapperNode [2020-07-20 05:47:59,984 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-20 05:47:59,985 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-20 05:47:59,985 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-20 05:47:59,985 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-20 05:48:00,001 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:59" (1/1) ... [2020-07-20 05:48:00,001 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:59" (1/1) ... [2020-07-20 05:48:00,019 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:59" (1/1) ... [2020-07-20 05:48:00,019 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:59" (1/1) ... [2020-07-20 05:48:00,040 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:59" (1/1) ... [2020-07-20 05:48:00,052 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:59" (1/1) ... [2020-07-20 05:48:00,056 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:59" (1/1) ... [2020-07-20 05:48:00,064 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-20 05:48:00,065 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-20 05:48:00,065 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-20 05:48:00,065 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-20 05:48:00,066 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:59" (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:48:00,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-20 05:48:00,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-20 05:48:00,124 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-20 05:48:00,124 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-20 05:48:00,124 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-20 05:48:00,124 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-20 05:48:00,124 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-20 05:48:00,125 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-20 05:48:00,126 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-20 05:48:00,126 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-20 05:48:00,126 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-20 05:48:00,127 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-20 05:48:00,127 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-20 05:48:00,127 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-20 05:48:00,127 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-20 05:48:00,128 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-20 05:48:00,128 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-20 05:48:00,129 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-20 05:48:00,129 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-20 05:48:00,129 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-20 05:48:00,129 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-20 05:48:00,129 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-20 05:48:00,129 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-20 05:48:00,130 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-20 05:48:00,130 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-20 05:48:00,131 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-20 05:48:00,131 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-20 05:48:00,131 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-20 05:48:00,131 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-20 05:48:00,131 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-20 05:48:00,132 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-20 05:48:00,132 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-20 05:48:00,132 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-20 05:48:00,132 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-20 05:48:00,133 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-20 05:48:00,133 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-20 05:48:00,133 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-20 05:48:00,133 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-20 05:48:00,133 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-20 05:48:00,133 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-20 05:48:00,134 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-20 05:48:00,134 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-20 05:48:00,134 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-20 05:48:00,134 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-20 05:48:00,134 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-20 05:48:00,134 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-20 05:48:00,134 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-20 05:48:00,135 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-20 05:48:00,135 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-20 05:48:00,135 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-20 05:48:00,135 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-20 05:48:00,135 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-20 05:48:00,135 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-20 05:48:00,136 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-20 05:48:00,136 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-20 05:48:00,136 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-20 05:48:00,136 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-20 05:48:00,136 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-07-20 05:48:00,136 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-20 05:48:00,137 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-20 05:48:00,137 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-20 05:48:00,138 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-20 05:48:00,138 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-20 05:48:00,138 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-20 05:48:00,138 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-20 05:48:00,138 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-20 05:48:00,138 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-20 05:48:00,139 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-20 05:48:00,139 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-20 05:48:00,140 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-20 05:48:00,140 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-20 05:48:00,140 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-20 05:48:00,141 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-20 05:48:00,141 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-20 05:48:00,141 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-20 05:48:00,141 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-20 05:48:00,141 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-20 05:48:00,142 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-20 05:48:00,142 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-20 05:48:00,143 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-20 05:48:00,143 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-20 05:48:00,143 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-20 05:48:00,144 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-20 05:48:00,144 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-20 05:48:00,144 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-20 05:48:00,144 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-20 05:48:00,144 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-20 05:48:00,145 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-20 05:48:00,146 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-20 05:48:00,146 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-20 05:48:00,146 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-20 05:48:00,146 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-20 05:48:00,146 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-20 05:48:00,146 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-20 05:48:00,146 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-20 05:48:00,147 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-20 05:48:00,147 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-20 05:48:00,147 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-20 05:48:00,147 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-20 05:48:00,147 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-20 05:48:00,147 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-20 05:48:00,147 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-20 05:48:00,148 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-20 05:48:00,148 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-20 05:48:00,148 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-20 05:48:00,148 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-20 05:48:00,148 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-20 05:48:00,148 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-20 05:48:00,148 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-20 05:48:00,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-20 05:48:00,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-20 05:48:00,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-20 05:48:00,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-20 05:48:00,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-20 05:48:00,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-20 05:48:00,857 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-20 05:48:00,857 INFO L295 CfgBuilder]: Removed 30 assume(true) statements. [2020-07-20 05:48:00,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:48:00 BoogieIcfgContainer [2020-07-20 05:48:00,863 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-20 05:48:00,864 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-20 05:48:00,865 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-20 05:48:00,868 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-20 05:48:00,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 05:47:59" (1/3) ... [2020-07-20 05:48:00,869 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@192098b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:48:00, skipping insertion in model container [2020-07-20 05:48:00,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:59" (2/3) ... [2020-07-20 05:48:00,870 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@192098b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:48:00, skipping insertion in model container [2020-07-20 05:48:00,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:48:00" (3/3) ... [2020-07-20 05:48:00,872 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-01-2.i [2020-07-20 05:48:00,883 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-20 05:48:00,891 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2020-07-20 05:48:00,906 INFO L251 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2020-07-20 05:48:00,928 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-20 05:48:00,929 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-20 05:48:00,929 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-20 05:48:00,929 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-20 05:48:00,929 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-20 05:48:00,930 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-20 05:48:00,930 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-20 05:48:00,931 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-20 05:48:00,955 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states. [2020-07-20 05:48:00,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-20 05:48:00,961 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:48:00,962 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:48:00,963 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:48:00,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:48:00,970 INFO L82 PathProgramCache]: Analyzing trace with hash 11193106, now seen corresponding path program 1 times [2020-07-20 05:48:00,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:48:00,980 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823091885] [2020-07-20 05:48:00,981 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1267b6ad [2020-07-20 05:48:01,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:48:01,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:48:01,191 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:48:01,192 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823091885] [2020-07-20 05:48:01,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 05:48:01,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-20 05:48:01,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122097976] [2020-07-20 05:48:01,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-20 05:48:01,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:48:01,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-20 05:48:01,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-20 05:48:01,226 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 4 states. [2020-07-20 05:48:01,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:48:01,493 INFO L93 Difference]: Finished difference Result 188 states and 306 transitions. [2020-07-20 05:48:01,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-20 05:48:01,495 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-07-20 05:48:01,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:48:01,507 INFO L225 Difference]: With dead ends: 188 [2020-07-20 05:48:01,507 INFO L226 Difference]: Without dead ends: 100 [2020-07-20 05:48:01,512 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-20 05:48:01,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2020-07-20 05:48:01,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 82. [2020-07-20 05:48:01,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-07-20 05:48:01,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2020-07-20 05:48:01,563 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 8 [2020-07-20 05:48:01,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:48:01,563 INFO L479 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2020-07-20 05:48:01,563 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-20 05:48:01,563 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2020-07-20 05:48:01,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-20 05:48:01,564 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:48:01,564 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:48:01,565 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-20 05:48:01,565 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:48:01,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:48:01,566 INFO L82 PathProgramCache]: Analyzing trace with hash -648207140, now seen corresponding path program 1 times [2020-07-20 05:48:01,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:48:01,566 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881565992] [2020-07-20 05:48:01,566 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1267b6ad [2020-07-20 05:48:01,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:48:01,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:48:01,633 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:48:01,634 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881565992] [2020-07-20 05:48:01,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 05:48:01,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-20 05:48:01,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50109580] [2020-07-20 05:48:01,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-20 05:48:01,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:48:01,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-20 05:48:01,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-20 05:48:01,638 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand 4 states. [2020-07-20 05:48:01,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:48:01,792 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2020-07-20 05:48:01,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-20 05:48:01,793 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-07-20 05:48:01,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:48:01,794 INFO L225 Difference]: With dead ends: 85 [2020-07-20 05:48:01,794 INFO L226 Difference]: Without dead ends: 83 [2020-07-20 05:48:01,795 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-20 05:48:01,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-07-20 05:48:01,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2020-07-20 05:48:01,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-07-20 05:48:01,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 93 transitions. [2020-07-20 05:48:01,809 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 93 transitions. Word has length 14 [2020-07-20 05:48:01,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:48:01,810 INFO L479 AbstractCegarLoop]: Abstraction has 83 states and 93 transitions. [2020-07-20 05:48:01,810 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-20 05:48:01,810 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2020-07-20 05:48:01,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-20 05:48:01,811 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:48:01,811 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:48:01,811 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-20 05:48:01,811 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:48:01,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:48:01,812 INFO L82 PathProgramCache]: Analyzing trace with hash -648205218, now seen corresponding path program 1 times [2020-07-20 05:48:01,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:48:01,812 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699362628] [2020-07-20 05:48:01,813 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1267b6ad [2020-07-20 05:48:01,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:48:01,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:48:01,932 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:48:01,933 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699362628] [2020-07-20 05:48:01,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 05:48:01,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 05:48:01,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498201116] [2020-07-20 05:48:01,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 05:48:01,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:48:01,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 05:48:01,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 05:48:01,935 INFO L87 Difference]: Start difference. First operand 83 states and 93 transitions. Second operand 5 states. [2020-07-20 05:48:02,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:48:02,168 INFO L93 Difference]: Finished difference Result 140 states and 157 transitions. [2020-07-20 05:48:02,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 05:48:02,169 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-20 05:48:02,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:48:02,171 INFO L225 Difference]: With dead ends: 140 [2020-07-20 05:48:02,171 INFO L226 Difference]: Without dead ends: 138 [2020-07-20 05:48:02,172 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:48:02,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-07-20 05:48:02,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 85. [2020-07-20 05:48:02,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-07-20 05:48:02,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 96 transitions. [2020-07-20 05:48:02,182 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 96 transitions. Word has length 14 [2020-07-20 05:48:02,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:48:02,182 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 96 transitions. [2020-07-20 05:48:02,182 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 05:48:02,182 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 96 transitions. [2020-07-20 05:48:02,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-20 05:48:02,183 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:48:02,183 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:48:02,184 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-20 05:48:02,184 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:48:02,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:48:02,184 INFO L82 PathProgramCache]: Analyzing trace with hash -646358176, now seen corresponding path program 1 times [2020-07-20 05:48:02,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:48:02,185 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908625082] [2020-07-20 05:48:02,185 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1267b6ad [2020-07-20 05:48:02,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:48:02,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:48:02,267 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:48:02,268 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908625082] [2020-07-20 05:48:02,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 05:48:02,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 05:48:02,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466337158] [2020-07-20 05:48:02,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 05:48:02,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:48:02,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 05:48:02,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-20 05:48:02,270 INFO L87 Difference]: Start difference. First operand 85 states and 96 transitions. Second operand 5 states. [2020-07-20 05:48:02,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:48:02,448 INFO L93 Difference]: Finished difference Result 85 states and 96 transitions. [2020-07-20 05:48:02,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-20 05:48:02,451 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-20 05:48:02,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:48:02,452 INFO L225 Difference]: With dead ends: 85 [2020-07-20 05:48:02,452 INFO L226 Difference]: Without dead ends: 83 [2020-07-20 05:48:02,453 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-20 05:48:02,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-07-20 05:48:02,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2020-07-20 05:48:02,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-07-20 05:48:02,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2020-07-20 05:48:02,472 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 14 [2020-07-20 05:48:02,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:48:02,472 INFO L479 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2020-07-20 05:48:02,473 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 05:48:02,473 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2020-07-20 05:48:02,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-20 05:48:02,474 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:48:02,474 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:48:02,474 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-20 05:48:02,475 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:48:02,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:48:02,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1093009051, now seen corresponding path program 1 times [2020-07-20 05:48:02,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:48:02,476 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460951456] [2020-07-20 05:48:02,476 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1267b6ad [2020-07-20 05:48:02,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:48:02,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:48:02,561 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:48:02,562 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460951456] [2020-07-20 05:48:02,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 05:48:02,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-20 05:48:02,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573710770] [2020-07-20 05:48:02,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-20 05:48:02,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:48:02,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-20 05:48:02,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-20 05:48:02,564 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand 4 states. [2020-07-20 05:48:02,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:48:02,705 INFO L93 Difference]: Finished difference Result 83 states and 94 transitions. [2020-07-20 05:48:02,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-20 05:48:02,705 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-07-20 05:48:02,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:48:02,707 INFO L225 Difference]: With dead ends: 83 [2020-07-20 05:48:02,707 INFO L226 Difference]: Without dead ends: 79 [2020-07-20 05:48:02,707 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-20 05:48:02,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-07-20 05:48:02,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2020-07-20 05:48:02,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-07-20 05:48:02,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2020-07-20 05:48:02,714 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 19 [2020-07-20 05:48:02,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:48:02,715 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2020-07-20 05:48:02,715 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-20 05:48:02,715 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2020-07-20 05:48:02,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-20 05:48:02,716 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:48:02,716 INFO L422 BasicCegarLoop]: trace histogram [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:02,716 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-20 05:48:02,716 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:48:02,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:48:02,717 INFO L82 PathProgramCache]: Analyzing trace with hash -476453587, now seen corresponding path program 1 times [2020-07-20 05:48:02,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:48:02,717 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587505461] [2020-07-20 05:48:02,717 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1267b6ad [2020-07-20 05:48:02,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:48:02,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:48:02,792 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:48:02,793 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587505461] [2020-07-20 05:48:02,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 05:48:02,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 05:48:02,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112445877] [2020-07-20 05:48:02,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 05:48:02,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:48:02,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 05:48:02,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 05:48:02,796 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand 5 states. [2020-07-20 05:48:02,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:48:02,964 INFO L93 Difference]: Finished difference Result 136 states and 152 transitions. [2020-07-20 05:48:02,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-20 05:48:02,965 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-07-20 05:48:02,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:48:02,967 INFO L225 Difference]: With dead ends: 136 [2020-07-20 05:48:02,967 INFO L226 Difference]: Without dead ends: 116 [2020-07-20 05:48:02,970 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:48:02,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-07-20 05:48:02,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 75. [2020-07-20 05:48:02,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-07-20 05:48:02,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2020-07-20 05:48:02,978 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 20 [2020-07-20 05:48:02,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:48:02,978 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2020-07-20 05:48:02,979 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 05:48:02,979 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2020-07-20 05:48:02,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-20 05:48:02,980 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:48:02,980 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:48:02,980 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-20 05:48:02,980 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:48:02,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:48:02,981 INFO L82 PathProgramCache]: Analyzing trace with hash 337242584, now seen corresponding path program 1 times [2020-07-20 05:48:02,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:48:02,981 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175475655] [2020-07-20 05:48:02,981 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1267b6ad [2020-07-20 05:48:02,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:48:03,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:48:03,021 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:48:03,022 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175475655] [2020-07-20 05:48:03,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 05:48:03,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-20 05:48:03,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117522924] [2020-07-20 05:48:03,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-20 05:48:03,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:48:03,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-20 05:48:03,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-20 05:48:03,024 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand 4 states. [2020-07-20 05:48:03,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:48:03,149 INFO L93 Difference]: Finished difference Result 141 states and 161 transitions. [2020-07-20 05:48:03,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-20 05:48:03,149 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-07-20 05:48:03,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:48:03,151 INFO L225 Difference]: With dead ends: 141 [2020-07-20 05:48:03,151 INFO L226 Difference]: Without dead ends: 99 [2020-07-20 05:48:03,152 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-20 05:48:03,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-07-20 05:48:03,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 78. [2020-07-20 05:48:03,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-07-20 05:48:03,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2020-07-20 05:48:03,158 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 24 [2020-07-20 05:48:03,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:48:03,158 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2020-07-20 05:48:03,159 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-20 05:48:03,159 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2020-07-20 05:48:03,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-20 05:48:03,159 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:48:03,160 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:48:03,160 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-20 05:48:03,160 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:48:03,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:48:03,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1864575058, now seen corresponding path program 1 times [2020-07-20 05:48:03,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:48:03,161 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361343903] [2020-07-20 05:48:03,161 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1267b6ad [2020-07-20 05:48:03,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:48:03,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:48:03,204 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:48:03,204 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361343903] [2020-07-20 05:48:03,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 05:48:03,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-20 05:48:03,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931636733] [2020-07-20 05:48:03,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-20 05:48:03,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:48:03,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-20 05:48:03,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-20 05:48:03,206 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand 4 states. [2020-07-20 05:48:03,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:48:03,317 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2020-07-20 05:48:03,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-20 05:48:03,317 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-07-20 05:48:03,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:48:03,318 INFO L225 Difference]: With dead ends: 78 [2020-07-20 05:48:03,318 INFO L226 Difference]: Without dead ends: 76 [2020-07-20 05:48:03,319 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-20 05:48:03,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-07-20 05:48:03,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2020-07-20 05:48:03,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-07-20 05:48:03,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2020-07-20 05:48:03,325 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 25 [2020-07-20 05:48:03,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:48:03,326 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2020-07-20 05:48:03,326 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-20 05:48:03,326 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2020-07-20 05:48:03,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-20 05:48:03,327 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:48:03,327 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:48:03,327 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-20 05:48:03,328 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:48:03,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:48:03,328 INFO L82 PathProgramCache]: Analyzing trace with hash -660297045, now seen corresponding path program 1 times [2020-07-20 05:48:03,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:48:03,329 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321924895] [2020-07-20 05:48:03,329 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1267b6ad [2020-07-20 05:48:03,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:48:03,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:48:03,412 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:48:03,413 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321924895] [2020-07-20 05:48:03,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 05:48:03,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 05:48:03,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297425546] [2020-07-20 05:48:03,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 05:48:03,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:48:03,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 05:48:03,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 05:48:03,418 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand 5 states. [2020-07-20 05:48:03,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:48:03,639 INFO L93 Difference]: Finished difference Result 194 states and 222 transitions. [2020-07-20 05:48:03,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-20 05:48:03,639 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-07-20 05:48:03,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:48:03,641 INFO L225 Difference]: With dead ends: 194 [2020-07-20 05:48:03,641 INFO L226 Difference]: Without dead ends: 130 [2020-07-20 05:48:03,642 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:48:03,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2020-07-20 05:48:03,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 78. [2020-07-20 05:48:03,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-07-20 05:48:03,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2020-07-20 05:48:03,656 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 27 [2020-07-20 05:48:03,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:48:03,659 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2020-07-20 05:48:03,659 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 05:48:03,660 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2020-07-20 05:48:03,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-20 05:48:03,660 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:48:03,661 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:48:03,661 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-20 05:48:03,661 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:48:03,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:48:03,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1681365399, now seen corresponding path program 1 times [2020-07-20 05:48:03,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:48:03,662 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020014907] [2020-07-20 05:48:03,664 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1267b6ad [2020-07-20 05:48:03,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:48:03,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:48:03,731 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:48:03,731 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020014907] [2020-07-20 05:48:03,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 05:48:03,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 05:48:03,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336091629] [2020-07-20 05:48:03,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 05:48:03,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:48:03,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 05:48:03,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-20 05:48:03,734 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand 5 states. [2020-07-20 05:48:03,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:48:03,883 INFO L93 Difference]: Finished difference Result 79 states and 90 transitions. [2020-07-20 05:48:03,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-20 05:48:03,883 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-07-20 05:48:03,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:48:03,884 INFO L225 Difference]: With dead ends: 79 [2020-07-20 05:48:03,884 INFO L226 Difference]: Without dead ends: 77 [2020-07-20 05:48:03,885 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-20 05:48:03,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-07-20 05:48:03,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2020-07-20 05:48:03,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-07-20 05:48:03,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2020-07-20 05:48:03,893 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 27 [2020-07-20 05:48:03,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:48:03,894 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2020-07-20 05:48:03,894 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 05:48:03,894 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2020-07-20 05:48:03,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-20 05:48:03,895 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:48:03,895 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:48:03,895 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-20 05:48:03,895 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:48:03,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:48:03,896 INFO L82 PathProgramCache]: Analyzing trace with hash -840739825, now seen corresponding path program 1 times [2020-07-20 05:48:03,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:48:03,896 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180707628] [2020-07-20 05:48:03,896 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1267b6ad [2020-07-20 05:48:03,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:48:03,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:48:03,964 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:48:03,964 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180707628] [2020-07-20 05:48:03,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 05:48:03,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-20 05:48:03,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138234125] [2020-07-20 05:48:03,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-20 05:48:03,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:48:03,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-20 05:48:03,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-20 05:48:03,966 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand 6 states. [2020-07-20 05:48:04,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:48:04,280 INFO L93 Difference]: Finished difference Result 182 states and 209 transitions. [2020-07-20 05:48:04,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-20 05:48:04,281 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2020-07-20 05:48:04,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:48:04,282 INFO L225 Difference]: With dead ends: 182 [2020-07-20 05:48:04,282 INFO L226 Difference]: Without dead ends: 139 [2020-07-20 05:48:04,283 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-07-20 05:48:04,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-07-20 05:48:04,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 86. [2020-07-20 05:48:04,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-07-20 05:48:04,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2020-07-20 05:48:04,291 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 98 transitions. Word has length 28 [2020-07-20 05:48:04,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:48:04,291 INFO L479 AbstractCegarLoop]: Abstraction has 86 states and 98 transitions. [2020-07-20 05:48:04,291 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-20 05:48:04,291 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 98 transitions. [2020-07-20 05:48:04,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-20 05:48:04,292 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:48:04,292 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:48:04,293 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-20 05:48:04,293 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:48:04,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:48:04,293 INFO L82 PathProgramCache]: Analyzing trace with hash -941335665, now seen corresponding path program 1 times [2020-07-20 05:48:04,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:48:04,294 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927266082] [2020-07-20 05:48:04,294 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1267b6ad [2020-07-20 05:48:04,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:48:04,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:48:04,483 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:48:04,484 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927266082] [2020-07-20 05:48:04,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 05:48:04,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-20 05:48:04,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818241728] [2020-07-20 05:48:04,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-20 05:48:04,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:48:04,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-20 05:48:04,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-07-20 05:48:04,486 INFO L87 Difference]: Start difference. First operand 86 states and 98 transitions. Second operand 8 states. [2020-07-20 05:48:05,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:48:05,139 INFO L93 Difference]: Finished difference Result 231 states and 258 transitions. [2020-07-20 05:48:05,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-20 05:48:05,142 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2020-07-20 05:48:05,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:48:05,146 INFO L225 Difference]: With dead ends: 231 [2020-07-20 05:48:05,146 INFO L226 Difference]: Without dead ends: 229 [2020-07-20 05:48:05,147 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2020-07-20 05:48:05,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2020-07-20 05:48:05,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 98. [2020-07-20 05:48:05,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-07-20 05:48:05,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 112 transitions. [2020-07-20 05:48:05,157 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 112 transitions. Word has length 28 [2020-07-20 05:48:05,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:48:05,157 INFO L479 AbstractCegarLoop]: Abstraction has 98 states and 112 transitions. [2020-07-20 05:48:05,157 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-20 05:48:05,157 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2020-07-20 05:48:05,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-20 05:48:05,159 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:48:05,159 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:48:05,159 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-20 05:48:05,159 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:48:05,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:48:05,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1932526751, now seen corresponding path program 1 times [2020-07-20 05:48:05,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:48:05,160 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392948002] [2020-07-20 05:48:05,160 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1267b6ad [2020-07-20 05:48:05,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:48:05,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:48:05,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-20 05:48:05,216 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392948002] [2020-07-20 05:48:05,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 05:48:05,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 05:48:05,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909854081] [2020-07-20 05:48:05,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 05:48:05,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:48:05,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 05:48:05,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 05:48:05,218 INFO L87 Difference]: Start difference. First operand 98 states and 112 transitions. Second operand 5 states. [2020-07-20 05:48:05,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:48:05,431 INFO L93 Difference]: Finished difference Result 145 states and 166 transitions. [2020-07-20 05:48:05,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 05:48:05,432 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-07-20 05:48:05,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:48:05,433 INFO L225 Difference]: With dead ends: 145 [2020-07-20 05:48:05,433 INFO L226 Difference]: Without dead ends: 127 [2020-07-20 05:48:05,434 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:48:05,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-07-20 05:48:05,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 119. [2020-07-20 05:48:05,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-07-20 05:48:05,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 141 transitions. [2020-07-20 05:48:05,442 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 141 transitions. Word has length 30 [2020-07-20 05:48:05,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:48:05,443 INFO L479 AbstractCegarLoop]: Abstraction has 119 states and 141 transitions. [2020-07-20 05:48:05,443 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 05:48:05,443 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 141 transitions. [2020-07-20 05:48:05,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-20 05:48:05,444 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:48:05,444 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:48:05,445 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-20 05:48:05,445 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:48:05,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:48:05,445 INFO L82 PathProgramCache]: Analyzing trace with hash -250794977, now seen corresponding path program 1 times [2020-07-20 05:48:05,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:48:05,446 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241127404] [2020-07-20 05:48:05,446 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1267b6ad [2020-07-20 05:48:05,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:48:05,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:48:05,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-20 05:48:05,485 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241127404] [2020-07-20 05:48:05,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 05:48:05,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-20 05:48:05,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015805496] [2020-07-20 05:48:05,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-20 05:48:05,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:48:05,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-20 05:48:05,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-20 05:48:05,487 INFO L87 Difference]: Start difference. First operand 119 states and 141 transitions. Second operand 4 states. [2020-07-20 05:48:05,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:48:05,656 INFO L93 Difference]: Finished difference Result 119 states and 141 transitions. [2020-07-20 05:48:05,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-20 05:48:05,657 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2020-07-20 05:48:05,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:48:05,658 INFO L225 Difference]: With dead ends: 119 [2020-07-20 05:48:05,659 INFO L226 Difference]: Without dead ends: 117 [2020-07-20 05:48:05,659 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-20 05:48:05,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-07-20 05:48:05,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2020-07-20 05:48:05,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-07-20 05:48:05,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 139 transitions. [2020-07-20 05:48:05,670 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 139 transitions. Word has length 30 [2020-07-20 05:48:05,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:48:05,670 INFO L479 AbstractCegarLoop]: Abstraction has 117 states and 139 transitions. [2020-07-20 05:48:05,670 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-20 05:48:05,671 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 139 transitions. [2020-07-20 05:48:05,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-20 05:48:05,673 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:48:05,673 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:48:05,673 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-20 05:48:05,673 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:48:05,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:48:05,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1485208190, now seen corresponding path program 1 times [2020-07-20 05:48:05,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:48:05,675 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223195911] [2020-07-20 05:48:05,675 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1267b6ad [2020-07-20 05:48:05,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:48:05,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:48:05,888 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:48:05,889 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223195911] [2020-07-20 05:48:05,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 05:48:05,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-20 05:48:05,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871602380] [2020-07-20 05:48:05,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-20 05:48:05,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:48:05,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-20 05:48:05,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-07-20 05:48:05,890 INFO L87 Difference]: Start difference. First operand 117 states and 139 transitions. Second operand 8 states. [2020-07-20 05:48:06,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:48:06,513 INFO L93 Difference]: Finished difference Result 240 states and 275 transitions. [2020-07-20 05:48:06,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-20 05:48:06,513 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2020-07-20 05:48:06,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:48:06,515 INFO L225 Difference]: With dead ends: 240 [2020-07-20 05:48:06,515 INFO L226 Difference]: Without dead ends: 238 [2020-07-20 05:48:06,516 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2020-07-20 05:48:06,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2020-07-20 05:48:06,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 120. [2020-07-20 05:48:06,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-07-20 05:48:06,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 142 transitions. [2020-07-20 05:48:06,525 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 142 transitions. Word has length 31 [2020-07-20 05:48:06,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:48:06,526 INFO L479 AbstractCegarLoop]: Abstraction has 120 states and 142 transitions. [2020-07-20 05:48:06,526 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-20 05:48:06,526 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 142 transitions. [2020-07-20 05:48:06,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-20 05:48:06,527 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:48:06,527 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:48:06,528 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-20 05:48:06,528 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:48:06,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:48:06,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1679328926, now seen corresponding path program 1 times [2020-07-20 05:48:06,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:48:06,529 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437073171] [2020-07-20 05:48:06,529 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1267b6ad [2020-07-20 05:48:06,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:48:06,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:48:06,617 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:48:06,617 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437073171] [2020-07-20 05:48:06,620 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434161474] [2020-07-20 05:48:06,620 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7ed88683 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:48:06,784 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7ed88683 issued 2 check-sat command(s) [2020-07-20 05:48:06,785 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 05:48:06,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 19 conjunts are in the unsatisfiable core [2020-07-20 05:48:06,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 05:48:06,884 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 11 treesize of output 7 [2020-07-20 05:48:06,885 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 05:48:06,895 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:06,899 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 11 treesize of output 7 [2020-07-20 05:48:06,900 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 05:48:06,906 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:06,907 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 05:48:06,908 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2020-07-20 05:48:06,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 05:48:06,944 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-07-20 05:48:06,945 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 05:48:06,956 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:06,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 05:48:06,963 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-07-20 05:48:06,964 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 05:48:06,974 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:06,974 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 05:48:06,975 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2020-07-20 05:48:07,033 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 22 treesize of output 10 [2020-07-20 05:48:07,034 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 05:48:07,042 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:07,046 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:07,046 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 1 case distinctions, treesize of input 22 treesize of output 10 [2020-07-20 05:48:07,047 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 05:48:07,052 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:07,052 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:07,053 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:7 [2020-07-20 05:48:07,061 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:48:07,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 05:48:07,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2020-07-20 05:48:07,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542128445] [2020-07-20 05:48:07,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-20 05:48:07,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:48:07,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-20 05:48:07,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-07-20 05:48:07,064 INFO L87 Difference]: Start difference. First operand 120 states and 142 transitions. Second operand 9 states. [2020-07-20 05:48:07,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:48:07,432 INFO L93 Difference]: Finished difference Result 208 states and 242 transitions. [2020-07-20 05:48:07,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-20 05:48:07,433 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2020-07-20 05:48:07,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:48:07,434 INFO L225 Difference]: With dead ends: 208 [2020-07-20 05:48:07,434 INFO L226 Difference]: Without dead ends: 146 [2020-07-20 05:48:07,435 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2020-07-20 05:48:07,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2020-07-20 05:48:07,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 122. [2020-07-20 05:48:07,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-07-20 05:48:07,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 142 transitions. [2020-07-20 05:48:07,454 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 142 transitions. Word has length 33 [2020-07-20 05:48:07,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:48:07,454 INFO L479 AbstractCegarLoop]: Abstraction has 122 states and 142 transitions. [2020-07-20 05:48:07,454 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-20 05:48:07,455 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 142 transitions. [2020-07-20 05:48:07,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-20 05:48:07,455 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:48:07,456 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:48:07,660 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-07-20 05:48:07,661 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:48:07,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:48:07,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1814124928, now seen corresponding path program 1 times [2020-07-20 05:48:07,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:48:07,662 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524371258] [2020-07-20 05:48:07,663 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1267b6ad [2020-07-20 05:48:07,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:48:07,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:48:07,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 05:48:07,756 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524371258] [2020-07-20 05:48:07,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 05:48:07,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-20 05:48:07,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463607001] [2020-07-20 05:48:07,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-20 05:48:07,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:48:07,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-20 05:48:07,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-20 05:48:07,763 INFO L87 Difference]: Start difference. First operand 122 states and 142 transitions. Second operand 7 states. [2020-07-20 05:48:08,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:48:08,100 INFO L93 Difference]: Finished difference Result 198 states and 225 transitions. [2020-07-20 05:48:08,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-20 05:48:08,101 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-07-20 05:48:08,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:48:08,103 INFO L225 Difference]: With dead ends: 198 [2020-07-20 05:48:08,103 INFO L226 Difference]: Without dead ends: 178 [2020-07-20 05:48:08,104 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-07-20 05:48:08,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2020-07-20 05:48:08,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 132. [2020-07-20 05:48:08,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-07-20 05:48:08,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 153 transitions. [2020-07-20 05:48:08,118 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 153 transitions. Word has length 33 [2020-07-20 05:48:08,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:48:08,118 INFO L479 AbstractCegarLoop]: Abstraction has 132 states and 153 transitions. [2020-07-20 05:48:08,118 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-20 05:48:08,118 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 153 transitions. [2020-07-20 05:48:08,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-20 05:48:08,120 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:48:08,121 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:48:08,121 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-07-20 05:48:08,121 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:48:08,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:48:08,121 INFO L82 PathProgramCache]: Analyzing trace with hash 2032979646, now seen corresponding path program 1 times [2020-07-20 05:48:08,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:48:08,123 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395488215] [2020-07-20 05:48:08,123 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1267b6ad [2020-07-20 05:48:08,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:48:08,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:48:08,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-20 05:48:08,191 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395488215] [2020-07-20 05:48:08,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 05:48:08,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-20 05:48:08,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387253075] [2020-07-20 05:48:08,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-20 05:48:08,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:48:08,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-20 05:48:08,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-20 05:48:08,193 INFO L87 Difference]: Start difference. First operand 132 states and 153 transitions. Second operand 6 states. [2020-07-20 05:48:08,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:48:08,471 INFO L93 Difference]: Finished difference Result 182 states and 208 transitions. [2020-07-20 05:48:08,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-20 05:48:08,471 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2020-07-20 05:48:08,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:48:08,472 INFO L225 Difference]: With dead ends: 182 [2020-07-20 05:48:08,473 INFO L226 Difference]: Without dead ends: 166 [2020-07-20 05:48:08,473 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-20 05:48:08,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2020-07-20 05:48:08,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 152. [2020-07-20 05:48:08,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-07-20 05:48:08,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 179 transitions. [2020-07-20 05:48:08,484 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 179 transitions. Word has length 33 [2020-07-20 05:48:08,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:48:08,484 INFO L479 AbstractCegarLoop]: Abstraction has 152 states and 179 transitions. [2020-07-20 05:48:08,484 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-20 05:48:08,484 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 179 transitions. [2020-07-20 05:48:08,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-07-20 05:48:08,485 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:48:08,485 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:48:08,485 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-07-20 05:48:08,486 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:48:08,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:48:08,486 INFO L82 PathProgramCache]: Analyzing trace with hash 270360779, now seen corresponding path program 1 times [2020-07-20 05:48:08,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:48:08,487 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860066429] [2020-07-20 05:48:08,487 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1267b6ad [2020-07-20 05:48:08,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:48:08,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:48:08,589 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 05:48:08,590 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860066429] [2020-07-20 05:48:08,590 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352577280] [2020-07-20 05:48:08,590 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@68999ddb 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:48:08,701 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@68999ddb issued 1 check-sat command(s) [2020-07-20 05:48:08,701 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 05:48:08,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 13 conjunts are in the unsatisfiable core [2020-07-20 05:48:08,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 05:48:08,717 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 11 treesize of output 7 [2020-07-20 05:48:08,717 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 05:48:08,722 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:08,728 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 11 treesize of output 7 [2020-07-20 05:48:08,728 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 05:48:08,733 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:08,733 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 05:48:08,734 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2020-07-20 05:48:08,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 05:48:08,748 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-07-20 05:48:08,750 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 05:48:08,759 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:08,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 05:48:08,770 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-07-20 05:48:08,771 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 05:48:08,780 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:08,780 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 05:48:08,781 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2020-07-20 05:48:08,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 05:48:08,815 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:48:08,816 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 05:48:08,824 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:08,828 INFO L350 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2020-07-20 05:48:08,828 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:48:08,829 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 05:48:08,833 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:08,833 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:48:08,833 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:7 [2020-07-20 05:48:08,840 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-20 05:48:08,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 05:48:08,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 8 [2020-07-20 05:48:08,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410381455] [2020-07-20 05:48:08,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-20 05:48:08,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:48:08,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-20 05:48:08,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-20 05:48:08,842 INFO L87 Difference]: Start difference. First operand 152 states and 179 transitions. Second operand 8 states. [2020-07-20 05:48:09,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:48:09,251 INFO L93 Difference]: Finished difference Result 248 states and 283 transitions. [2020-07-20 05:48:09,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-20 05:48:09,251 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2020-07-20 05:48:09,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:48:09,253 INFO L225 Difference]: With dead ends: 248 [2020-07-20 05:48:09,253 INFO L226 Difference]: Without dead ends: 210 [2020-07-20 05:48:09,256 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2020-07-20 05:48:09,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2020-07-20 05:48:09,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 169. [2020-07-20 05:48:09,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2020-07-20 05:48:09,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 202 transitions. [2020-07-20 05:48:09,268 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 202 transitions. Word has length 36 [2020-07-20 05:48:09,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:48:09,269 INFO L479 AbstractCegarLoop]: Abstraction has 169 states and 202 transitions. [2020-07-20 05:48:09,269 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-20 05:48:09,269 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 202 transitions. [2020-07-20 05:48:09,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-07-20 05:48:09,270 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:48:09,270 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:48:09,484 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:48:09,485 INFO L427 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:48:09,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:48:09,488 INFO L82 PathProgramCache]: Analyzing trace with hash -620993698, now seen corresponding path program 1 times [2020-07-20 05:48:09,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:48:09,489 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581537271] [2020-07-20 05:48:09,489 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1267b6ad [2020-07-20 05:48:09,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:48:09,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:48:09,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 05:48:09,561 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581537271] [2020-07-20 05:48:09,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 05:48:09,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-20 05:48:09,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545539669] [2020-07-20 05:48:09,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-20 05:48:09,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:48:09,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-20 05:48:09,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-20 05:48:09,563 INFO L87 Difference]: Start difference. First operand 169 states and 202 transitions. Second operand 4 states. [2020-07-20 05:48:09,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:48:09,707 INFO L93 Difference]: Finished difference Result 354 states and 437 transitions. [2020-07-20 05:48:09,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-20 05:48:09,707 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-07-20 05:48:09,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:48:09,709 INFO L225 Difference]: With dead ends: 354 [2020-07-20 05:48:09,709 INFO L226 Difference]: Without dead ends: 258 [2020-07-20 05:48:09,710 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-20 05:48:09,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2020-07-20 05:48:09,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 218. [2020-07-20 05:48:09,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-07-20 05:48:09,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 262 transitions. [2020-07-20 05:48:09,726 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 262 transitions. Word has length 36 [2020-07-20 05:48:09,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:48:09,727 INFO L479 AbstractCegarLoop]: Abstraction has 218 states and 262 transitions. [2020-07-20 05:48:09,727 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-20 05:48:09,727 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 262 transitions. [2020-07-20 05:48:09,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-20 05:48:09,728 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:48:09,728 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:48:09,728 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-07-20 05:48:09,729 INFO L427 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:48:09,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:48:09,729 INFO L82 PathProgramCache]: Analyzing trace with hash -366933706, now seen corresponding path program 1 times [2020-07-20 05:48:09,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:48:09,729 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245909960] [2020-07-20 05:48:09,730 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1267b6ad [2020-07-20 05:48:09,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:48:10,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:48:10,050 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:10,051 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245909960] [2020-07-20 05:48:10,051 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379030312] [2020-07-20 05:48:10,051 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@326b3c9e 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,198 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@326b3c9e issued 3 check-sat command(s) [2020-07-20 05:48:10,198 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 05:48:10,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 29 conjunts are in the unsatisfiable core [2020-07-20 05:48:10,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 05:48:10,214 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 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-20 05:48:10,214 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 05:48:10,216 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:10,216 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-20 05:48:10,217 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-07-20 05:48:10,239 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:48:10,240 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 05:48:10,247 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:10,252 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:48:10,253 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 05:48:10,260 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:10,261 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 05:48:10,261 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:24 [2020-07-20 05:48:10,345 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:10,345 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:10,346 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 05:48:10,370 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:10,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 05:48:10,382 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 0 case distinctions, treesize of input 37 treesize of output 27 [2020-07-20 05:48:10,383 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 05:48:10,403 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:10,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 05:48:10,409 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 0 case distinctions, treesize of input 37 treesize of output 27 [2020-07-20 05:48:10,410 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-20 05:48:10,426 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:10,427 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-20 05:48:10,428 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:86, output treesize:54 [2020-07-20 05:48:10,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 05:48:10,580 INFO L350 Elim1Store]: treesize reduction 46, result has 65.2 percent of original size [2020-07-20 05:48:10,580 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 82 treesize of output 128 [2020-07-20 05:48:10,586 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 3, 2, 1] term [2020-07-20 05:48:10,587 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-20 05:48:10,590 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 05:48:10,649 INFO L624 ElimStorePlain]: treesize reduction 64, result has 59.2 percent of original size [2020-07-20 05:48:10,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 05:48:10,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 05:48:10,658 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 49 treesize of output 50 [2020-07-20 05:48:10,659 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 05:48:10,677 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:10,679 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-20 05:48:10,680 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:101, output treesize:85 [2020-07-20 05:48:12,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 05:48:12,901 INFO L350 Elim1Store]: treesize reduction 10, result has 85.1 percent of original size [2020-07-20 05:48:12,902 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 75 treesize of output 92 [2020-07-20 05:48:12,904 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-07-20 05:48:12,905 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-07-20 05:48:12,909 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-07-20 05:48:12,910 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-07-20 05:48:12,911 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:12,944 INFO L624 ElimStorePlain]: treesize reduction 26, result has 66.7 percent of original size [2020-07-20 05:48:12,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 05:48:12,959 INFO L350 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2020-07-20 05:48:12,959 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 16 [2020-07-20 05:48:12,960 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 05:48:12,969 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 05:48:12,970 INFO L544 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 05:48:12,971 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:103, output treesize:7 [2020-07-20 05:48:12,985 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:12,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 05:48:12,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2020-07-20 05:48:12,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463127723] [2020-07-20 05:48:12,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-20 05:48:12,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:48:12,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-20 05:48:12,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=186, Unknown=1, NotChecked=0, Total=240 [2020-07-20 05:48:12,987 INFO L87 Difference]: Start difference. First operand 218 states and 262 transitions. Second operand 16 states. [2020-07-20 05:48:48,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:48:48,903 INFO L93 Difference]: Finished difference Result 521 states and 619 transitions. [2020-07-20 05:48:48,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-07-20 05:48:48,904 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 40 [2020-07-20 05:48:48,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:48:48,906 INFO L225 Difference]: With dead ends: 521 [2020-07-20 05:48:48,906 INFO L226 Difference]: Without dead ends: 429 [2020-07-20 05:48:48,908 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=256, Invalid=797, Unknown=3, NotChecked=0, Total=1056 [2020-07-20 05:48:48,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2020-07-20 05:48:48,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 247. [2020-07-20 05:48:48,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2020-07-20 05:48:48,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 297 transitions. [2020-07-20 05:48:48,930 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 297 transitions. Word has length 40 [2020-07-20 05:48:48,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:48:48,932 INFO L479 AbstractCegarLoop]: Abstraction has 247 states and 297 transitions. [2020-07-20 05:48:48,932 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-20 05:48:48,932 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 297 transitions. [2020-07-20 05:48:48,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-20 05:48:48,933 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:48:48,933 INFO L422 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1] [2020-07-20 05:48:49,146 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:48:49,147 INFO L427 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:48:49,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:48:49,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1717014481, now seen corresponding path program 1 times [2020-07-20 05:48:49,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:48:49,149 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968874788] [2020-07-20 05:48:49,149 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1267b6ad [2020-07-20 05:48:49,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-20 05:48:49,176 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 05:48:49,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-20 05:48:49,193 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 05:48:49,235 INFO L174 FreeRefinementEngine]: Strategy CAMEL_SMT_AM found a feasible trace [2020-07-20 05:48:49,236 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-20 05:48:49,238 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-07-20 05:48:49,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 05:48:49 BoogieIcfgContainer [2020-07-20 05:48:49,305 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-20 05:48:49,306 INFO L168 Benchmark]: Toolchain (without parser) took 49984.54 ms. Allocated memory was 142.6 MB in the beginning and 341.3 MB in the end (delta: 198.7 MB). Free memory was 103.2 MB in the beginning and 173.6 MB in the end (delta: -70.4 MB). Peak memory consumption was 128.3 MB. Max. memory is 7.1 GB. [2020-07-20 05:48:49,306 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 142.6 MB. Free memory was 122.8 MB in the beginning and 122.6 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:49,307 INFO L168 Benchmark]: CACSL2BoogieTranslator took 659.89 ms. Allocated memory was 142.6 MB in the beginning and 205.0 MB in the end (delta: 62.4 MB). Free memory was 102.8 MB in the beginning and 172.5 MB in the end (delta: -69.7 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2020-07-20 05:48:49,307 INFO L168 Benchmark]: Boogie Preprocessor took 79.41 ms. Allocated memory is still 205.0 MB. Free memory was 172.5 MB in the beginning and 169.1 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2020-07-20 05:48:49,307 INFO L168 Benchmark]: RCFGBuilder took 798.16 ms. Allocated memory is still 205.0 MB. Free memory was 169.1 MB in the beginning and 113.3 MB in the end (delta: 55.8 MB). Peak memory consumption was 55.8 MB. Max. memory is 7.1 GB. [2020-07-20 05:48:49,308 INFO L168 Benchmark]: TraceAbstraction took 48440.27 ms. Allocated memory was 205.0 MB in the beginning and 341.3 MB in the end (delta: 136.3 MB). Free memory was 112.6 MB in the beginning and 173.6 MB in the end (delta: -61.0 MB). Peak memory consumption was 75.3 MB. Max. memory is 7.1 GB. [2020-07-20 05:48:49,310 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 142.6 MB. Free memory was 122.8 MB in the beginning and 122.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 659.89 ms. Allocated memory was 142.6 MB in the beginning and 205.0 MB in the end (delta: 62.4 MB). Free memory was 102.8 MB in the beginning and 172.5 MB in the end (delta: -69.7 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 79.41 ms. Allocated memory is still 205.0 MB. Free memory was 172.5 MB in the beginning and 169.1 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 798.16 ms. Allocated memory is still 205.0 MB. Free memory was 169.1 MB in the beginning and 113.3 MB in the end (delta: 55.8 MB). Peak memory consumption was 55.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 48440.27 ms. Allocated memory was 205.0 MB in the beginning and 341.3 MB in the end (delta: 136.3 MB). Free memory was 112.6 MB in the beginning and 173.6 MB in the end (delta: -61.0 MB). Peak memory consumption was 75.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1025]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L991] SLL* list = malloc(sizeof(SLL)); [L992] list->next = ((void*)0) VAL [list={-1:0}, malloc(sizeof(SLL))={-1:0}] [L993] COND FALSE !(!(list != ((void*)0))) VAL [list={-1:0}, malloc(sizeof(SLL))={-1:0}] [L993] COND FALSE !(__VERIFIER_nondet_int()) [L993] list->inner = malloc(sizeof(SLL)) [L993] EXPR list->inner [L993] list->inner->next = ((void*)0) [L993] EXPR list->inner [L993] list->inner->inner = ((void*)0) [L993] EXPR list->inner [L993] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={-1:0}, list->inner={-2:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}] [L993] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L995] SLL* end = list; VAL [end={-1:0}, list={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}] [L998] COND FALSE !(__VERIFIER_nondet_int()) [L1008] end = ((void*)0) [L1009] end = list VAL [end={-1:0}, list={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}] [L1012] COND FALSE !(!(((void*)0) != end)) VAL [end={-1:0}, list={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}] [L1014] COND TRUE ((void*)0) != end [L1016] int len = 0; [L1017] EXPR end->inner [L1017] SLL* inner = end->inner; [L1018] COND TRUE ((void*)0) != inner VAL [end={-1:0}, inner={-2:0}, len=0, list={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}] [L1020] COND TRUE len == 0 [L1021] len = 1 VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}] [L1024] COND FALSE !(!(((void*)0) != inner)) VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}] [L1025] EXPR inner->inner VAL [end={-1:0}, inner={-2:0}, inner->inner={0:0}, len=1, list={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}] [L1025] COND FALSE !(!(((void*)0) == inner->inner)) [L1026] EXPR inner->next VAL [end={-1:0}, inner={-2:0}, inner->next={0:0}, len=1, list={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}] [L1026] COND FALSE !(!(((void*)0) == inner->next)) [L1027] EXPR inner->inner [L1027] inner = inner->inner [L1028] COND TRUE len == 1 [L1029] EXPR inner->inner [L1029] inner = inner->inner [L1018] COND TRUE ((void*)0) != inner VAL [end={-1:0}, inner={12:3}, len=1, list={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}] [L1020] COND FALSE !(len == 0) [L1023] len = 2 VAL [end={-1:0}, inner={12:3}, len=2, list={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}] [L1024] COND FALSE !(!(((void*)0) != inner)) VAL [end={-1:0}, inner={12:3}, len=2, list={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}] [L1025] EXPR inner->inner VAL [end={-1:0}, inner={12:3}, inner->inner={9:11}, len=2, list={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}] [L1025] COND TRUE !(((void*)0) == inner->inner) [L1025] __VERIFIER_error() VAL [end={-1:0}, inner={12:3}, len=2, list={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 89 locations, 13 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 48.3s, OverallIterations: 22, TraceHistogramMax: 2, AutomataDifference: 41.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1629 SDtfs, 2299 SDslu, 3185 SDs, 0 SdLazy, 3690 SolverSat, 243 SolverUnsat, 18 SolverUnknown, 0 SolverNotchecked, 34.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 294 GetRequests, 161 SyntacticMatches, 1 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 8.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=247occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 849 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 699 NumberOfCodeBlocks, 647 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 635 ConstructedInterpolants, 16 QuantifiedInterpolants, 228796 SizeOfPredicates, 29 NumberOfNonLiveVariables, 261 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 24 InterpolantComputations, 18 PerfectInterpolantSequences, 10/19 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! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...