/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/ldv-regression/rule60_list2.c_1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-b8ad66e [2020-10-24 01:04:03,585 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 01:04:03,589 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 01:04:03,656 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 01:04:03,657 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 01:04:03,662 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 01:04:03,667 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 01:04:03,676 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 01:04:03,679 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 01:04:03,685 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 01:04:03,687 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 01:04:03,688 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 01:04:03,689 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 01:04:03,692 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 01:04:03,695 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 01:04:03,697 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 01:04:03,698 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 01:04:03,702 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 01:04:03,710 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 01:04:03,721 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 01:04:03,723 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 01:04:03,725 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 01:04:03,727 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 01:04:03,729 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 01:04:03,739 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 01:04:03,739 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 01:04:03,739 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 01:04:03,742 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 01:04:03,743 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 01:04:03,744 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 01:04:03,745 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 01:04:03,746 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 01:04:03,749 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 01:04:03,750 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 01:04:03,751 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 01:04:03,752 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 01:04:03,753 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 01:04:03,753 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 01:04:03,753 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 01:04:03,754 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 01:04:03,755 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 01:04:03,757 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-10-24 01:04:03,782 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 01:04:03,783 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 01:04:03,788 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 01:04:03,789 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 01:04:03,789 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-24 01:04:03,797 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 01:04:03,798 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 01:04:03,798 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 01:04:03,798 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 01:04:03,798 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 01:04:03,800 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 01:04:03,800 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 01:04:03,801 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 01:04:03,801 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 01:04:03,802 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 01:04:03,802 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-10-24 01:04:03,803 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 01:04:03,803 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 01:04:03,803 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 01:04:03,804 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 01:04:03,804 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-10-24 01:04:03,804 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 01:04:03,804 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-10-24 01:04:04,260 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 01:04:04,299 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 01:04:04,303 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 01:04:04,305 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 01:04:04,305 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 01:04:04,307 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/rule60_list2.c_1.i [2020-10-24 01:04:04,406 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d01c7754b/67ca5910539f42cdbe7f7de050021d52/FLAGc5ff332af [2020-10-24 01:04:05,180 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 01:04:05,180 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/rule60_list2.c_1.i [2020-10-24 01:04:05,200 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d01c7754b/67ca5910539f42cdbe7f7de050021d52/FLAGc5ff332af [2020-10-24 01:04:05,464 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d01c7754b/67ca5910539f42cdbe7f7de050021d52 [2020-10-24 01:04:05,468 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 01:04:05,477 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-24 01:04:05,484 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 01:04:05,484 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 01:04:05,489 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 01:04:05,490 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:04:05" (1/1) ... [2020-10-24 01:04:05,495 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@784cc18c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:04:05, skipping insertion in model container [2020-10-24 01:04:05,495 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:04:05" (1/1) ... [2020-10-24 01:04:05,506 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 01:04:05,573 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-24 01:04:06,072 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 01:04:06,085 INFO L203 MainTranslator]: Completed pre-run [2020-10-24 01:04:06,127 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 01:04:06,208 INFO L208 MainTranslator]: Completed translation [2020-10-24 01:04:06,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:04:06 WrapperNode [2020-10-24 01:04:06,209 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 01:04:06,210 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 01:04:06,210 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 01:04:06,210 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 01:04:06,227 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:04:06" (1/1) ... [2020-10-24 01:04:06,228 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:04:06" (1/1) ... [2020-10-24 01:04:06,261 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:04:06" (1/1) ... [2020-10-24 01:04:06,261 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:04:06" (1/1) ... [2020-10-24 01:04:06,320 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:04:06" (1/1) ... [2020-10-24 01:04:06,341 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:04:06" (1/1) ... [2020-10-24 01:04:06,350 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:04:06" (1/1) ... [2020-10-24 01:04:06,369 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 01:04:06,372 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 01:04:06,372 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 01:04:06,372 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 01:04:06,374 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:04:06" (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-10-24 01:04:06,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-24 01:04:06,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 01:04:06,483 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-24 01:04:06,483 INFO L138 BoogieDeclarations]: Found implementation of procedure __blast_assert [2020-10-24 01:04:06,484 INFO L138 BoogieDeclarations]: Found implementation of procedure __getMemory [2020-10-24 01:04:06,484 INFO L138 BoogieDeclarations]: Found implementation of procedure my_malloc [2020-10-24 01:04:06,484 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2020-10-24 01:04:06,485 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2020-10-24 01:04:06,485 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-24 01:04:06,485 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-24 01:04:06,485 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-24 01:04:06,485 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-24 01:04:06,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 01:04:06,486 INFO L130 BoogieDeclarations]: Found specification of procedure __blast_assert [2020-10-24 01:04:06,486 INFO L130 BoogieDeclarations]: Found specification of procedure __underflow [2020-10-24 01:04:06,487 INFO L130 BoogieDeclarations]: Found specification of procedure __uflow [2020-10-24 01:04:06,487 INFO L130 BoogieDeclarations]: Found specification of procedure __overflow [2020-10-24 01:04:06,487 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_getc [2020-10-24 01:04:06,487 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_putc [2020-10-24 01:04:06,488 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_feof [2020-10-24 01:04:06,489 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_ferror [2020-10-24 01:04:06,489 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_peekc_locked [2020-10-24 01:04:06,491 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_flockfile [2020-10-24 01:04:06,492 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_funlockfile [2020-10-24 01:04:06,492 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_ftrylockfile [2020-10-24 01:04:06,492 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_vfscanf [2020-10-24 01:04:06,492 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_vfprintf [2020-10-24 01:04:06,493 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_padn [2020-10-24 01:04:06,493 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_sgetn [2020-10-24 01:04:06,493 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_seekoff [2020-10-24 01:04:06,494 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_seekpos [2020-10-24 01:04:06,494 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_free_backup_area [2020-10-24 01:04:06,494 INFO L130 BoogieDeclarations]: Found specification of procedure remove [2020-10-24 01:04:06,494 INFO L130 BoogieDeclarations]: Found specification of procedure rename [2020-10-24 01:04:06,494 INFO L130 BoogieDeclarations]: Found specification of procedure renameat [2020-10-24 01:04:06,494 INFO L130 BoogieDeclarations]: Found specification of procedure tmpfile [2020-10-24 01:04:06,495 INFO L130 BoogieDeclarations]: Found specification of procedure tmpnam [2020-10-24 01:04:06,495 INFO L130 BoogieDeclarations]: Found specification of procedure tmpnam_r [2020-10-24 01:04:06,495 INFO L130 BoogieDeclarations]: Found specification of procedure tempnam [2020-10-24 01:04:06,495 INFO L130 BoogieDeclarations]: Found specification of procedure fclose [2020-10-24 01:04:06,495 INFO L130 BoogieDeclarations]: Found specification of procedure fflush [2020-10-24 01:04:06,496 INFO L130 BoogieDeclarations]: Found specification of procedure fflush_unlocked [2020-10-24 01:04:06,496 INFO L130 BoogieDeclarations]: Found specification of procedure fopen [2020-10-24 01:04:06,496 INFO L130 BoogieDeclarations]: Found specification of procedure freopen [2020-10-24 01:04:06,496 INFO L130 BoogieDeclarations]: Found specification of procedure fdopen [2020-10-24 01:04:06,496 INFO L130 BoogieDeclarations]: Found specification of procedure fmemopen [2020-10-24 01:04:06,497 INFO L130 BoogieDeclarations]: Found specification of procedure open_memstream [2020-10-24 01:04:06,497 INFO L130 BoogieDeclarations]: Found specification of procedure setbuf [2020-10-24 01:04:06,497 INFO L130 BoogieDeclarations]: Found specification of procedure setvbuf [2020-10-24 01:04:06,497 INFO L130 BoogieDeclarations]: Found specification of procedure setbuffer [2020-10-24 01:04:06,497 INFO L130 BoogieDeclarations]: Found specification of procedure setlinebuf [2020-10-24 01:04:06,497 INFO L130 BoogieDeclarations]: Found specification of procedure fprintf [2020-10-24 01:04:06,498 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2020-10-24 01:04:06,498 INFO L130 BoogieDeclarations]: Found specification of procedure sprintf [2020-10-24 01:04:06,498 INFO L130 BoogieDeclarations]: Found specification of procedure vfprintf [2020-10-24 01:04:06,498 INFO L130 BoogieDeclarations]: Found specification of procedure vprintf [2020-10-24 01:04:06,498 INFO L130 BoogieDeclarations]: Found specification of procedure vsprintf [2020-10-24 01:04:06,498 INFO L130 BoogieDeclarations]: Found specification of procedure snprintf [2020-10-24 01:04:06,499 INFO L130 BoogieDeclarations]: Found specification of procedure vsnprintf [2020-10-24 01:04:06,499 INFO L130 BoogieDeclarations]: Found specification of procedure vdprintf [2020-10-24 01:04:06,499 INFO L130 BoogieDeclarations]: Found specification of procedure dprintf [2020-10-24 01:04:06,499 INFO L130 BoogieDeclarations]: Found specification of procedure fscanf [2020-10-24 01:04:06,499 INFO L130 BoogieDeclarations]: Found specification of procedure scanf [2020-10-24 01:04:06,499 INFO L130 BoogieDeclarations]: Found specification of procedure sscanf [2020-10-24 01:04:06,500 INFO L130 BoogieDeclarations]: Found specification of procedure vfscanf [2020-10-24 01:04:06,500 INFO L130 BoogieDeclarations]: Found specification of procedure vscanf [2020-10-24 01:04:06,500 INFO L130 BoogieDeclarations]: Found specification of procedure vsscanf [2020-10-24 01:04:06,500 INFO L130 BoogieDeclarations]: Found specification of procedure fgetc [2020-10-24 01:04:06,500 INFO L130 BoogieDeclarations]: Found specification of procedure getc [2020-10-24 01:04:06,501 INFO L130 BoogieDeclarations]: Found specification of procedure getchar [2020-10-24 01:04:06,501 INFO L130 BoogieDeclarations]: Found specification of procedure getc_unlocked [2020-10-24 01:04:06,501 INFO L130 BoogieDeclarations]: Found specification of procedure getchar_unlocked [2020-10-24 01:04:06,502 INFO L130 BoogieDeclarations]: Found specification of procedure fgetc_unlocked [2020-10-24 01:04:06,502 INFO L130 BoogieDeclarations]: Found specification of procedure fputc [2020-10-24 01:04:06,502 INFO L130 BoogieDeclarations]: Found specification of procedure putc [2020-10-24 01:04:06,502 INFO L130 BoogieDeclarations]: Found specification of procedure putchar [2020-10-24 01:04:06,502 INFO L130 BoogieDeclarations]: Found specification of procedure fputc_unlocked [2020-10-24 01:04:06,503 INFO L130 BoogieDeclarations]: Found specification of procedure putc_unlocked [2020-10-24 01:04:06,503 INFO L130 BoogieDeclarations]: Found specification of procedure putchar_unlocked [2020-10-24 01:04:06,503 INFO L130 BoogieDeclarations]: Found specification of procedure getw [2020-10-24 01:04:06,504 INFO L130 BoogieDeclarations]: Found specification of procedure putw [2020-10-24 01:04:06,504 INFO L130 BoogieDeclarations]: Found specification of procedure fgets [2020-10-24 01:04:06,504 INFO L130 BoogieDeclarations]: Found specification of procedure gets [2020-10-24 01:04:06,504 INFO L130 BoogieDeclarations]: Found specification of procedure __getdelim [2020-10-24 01:04:06,505 INFO L130 BoogieDeclarations]: Found specification of procedure getdelim [2020-10-24 01:04:06,505 INFO L130 BoogieDeclarations]: Found specification of procedure getline [2020-10-24 01:04:06,506 INFO L130 BoogieDeclarations]: Found specification of procedure fputs [2020-10-24 01:04:06,506 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2020-10-24 01:04:06,507 INFO L130 BoogieDeclarations]: Found specification of procedure ungetc [2020-10-24 01:04:06,507 INFO L130 BoogieDeclarations]: Found specification of procedure fread [2020-10-24 01:04:06,508 INFO L130 BoogieDeclarations]: Found specification of procedure fwrite [2020-10-24 01:04:06,508 INFO L130 BoogieDeclarations]: Found specification of procedure fread_unlocked [2020-10-24 01:04:06,508 INFO L130 BoogieDeclarations]: Found specification of procedure fwrite_unlocked [2020-10-24 01:04:06,509 INFO L130 BoogieDeclarations]: Found specification of procedure fseek [2020-10-24 01:04:06,509 INFO L130 BoogieDeclarations]: Found specification of procedure ftell [2020-10-24 01:04:06,509 INFO L130 BoogieDeclarations]: Found specification of procedure rewind [2020-10-24 01:04:06,509 INFO L130 BoogieDeclarations]: Found specification of procedure fseeko [2020-10-24 01:04:06,509 INFO L130 BoogieDeclarations]: Found specification of procedure ftello [2020-10-24 01:04:06,509 INFO L130 BoogieDeclarations]: Found specification of procedure fgetpos [2020-10-24 01:04:06,510 INFO L130 BoogieDeclarations]: Found specification of procedure fsetpos [2020-10-24 01:04:06,510 INFO L130 BoogieDeclarations]: Found specification of procedure clearerr [2020-10-24 01:04:06,510 INFO L130 BoogieDeclarations]: Found specification of procedure feof [2020-10-24 01:04:06,510 INFO L130 BoogieDeclarations]: Found specification of procedure ferror [2020-10-24 01:04:06,510 INFO L130 BoogieDeclarations]: Found specification of procedure clearerr_unlocked [2020-10-24 01:04:06,510 INFO L130 BoogieDeclarations]: Found specification of procedure feof_unlocked [2020-10-24 01:04:06,511 INFO L130 BoogieDeclarations]: Found specification of procedure ferror_unlocked [2020-10-24 01:04:06,511 INFO L130 BoogieDeclarations]: Found specification of procedure perror [2020-10-24 01:04:06,511 INFO L130 BoogieDeclarations]: Found specification of procedure fileno [2020-10-24 01:04:06,511 INFO L130 BoogieDeclarations]: Found specification of procedure fileno_unlocked [2020-10-24 01:04:06,511 INFO L130 BoogieDeclarations]: Found specification of procedure popen [2020-10-24 01:04:06,511 INFO L130 BoogieDeclarations]: Found specification of procedure pclose [2020-10-24 01:04:06,512 INFO L130 BoogieDeclarations]: Found specification of procedure ctermid [2020-10-24 01:04:06,512 INFO L130 BoogieDeclarations]: Found specification of procedure flockfile [2020-10-24 01:04:06,512 INFO L130 BoogieDeclarations]: Found specification of procedure ftrylockfile [2020-10-24 01:04:06,512 INFO L130 BoogieDeclarations]: Found specification of procedure funlockfile [2020-10-24 01:04:06,512 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-10-24 01:04:06,513 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-10-24 01:04:06,513 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-10-24 01:04:06,513 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-10-24 01:04:06,513 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-10-24 01:04:06,515 INFO L130 BoogieDeclarations]: Found specification of procedure memalign [2020-10-24 01:04:06,515 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-10-24 01:04:06,515 INFO L130 BoogieDeclarations]: Found specification of procedure pvalloc [2020-10-24 01:04:06,515 INFO L130 BoogieDeclarations]: Found specification of procedure __default_morecore [2020-10-24 01:04:06,515 INFO L130 BoogieDeclarations]: Found specification of procedure mallinfo [2020-10-24 01:04:06,516 INFO L130 BoogieDeclarations]: Found specification of procedure mallopt [2020-10-24 01:04:06,516 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_trim [2020-10-24 01:04:06,516 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_usable_size [2020-10-24 01:04:06,516 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_stats [2020-10-24 01:04:06,516 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_info [2020-10-24 01:04:06,516 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_get_state [2020-10-24 01:04:06,517 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_set_state [2020-10-24 01:04:06,517 INFO L130 BoogieDeclarations]: Found specification of procedure __malloc_check_init [2020-10-24 01:04:06,517 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-24 01:04:06,517 INFO L130 BoogieDeclarations]: Found specification of procedure __getMemory [2020-10-24 01:04:06,517 INFO L130 BoogieDeclarations]: Found specification of procedure my_malloc [2020-10-24 01:04:06,518 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2020-10-24 01:04:06,518 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2020-10-24 01:04:06,518 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-24 01:04:06,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-24 01:04:06,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-24 01:04:06,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-10-24 01:04:06,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 01:04:06,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-24 01:04:06,524 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-10-24 01:04:06,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-24 01:04:06,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-24 01:04:06,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-24 01:04:07,159 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 01:04:07,159 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-10-24 01:04:07,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:04:07 BoogieIcfgContainer [2020-10-24 01:04:07,177 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 01:04:07,179 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 01:04:07,179 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 01:04:07,183 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 01:04:07,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 01:04:05" (1/3) ... [2020-10-24 01:04:07,185 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b70a9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:04:07, skipping insertion in model container [2020-10-24 01:04:07,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:04:06" (2/3) ... [2020-10-24 01:04:07,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b70a9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:04:07, skipping insertion in model container [2020-10-24 01:04:07,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:04:07" (3/3) ... [2020-10-24 01:04:07,188 INFO L111 eAbstractionObserver]: Analyzing ICFG rule60_list2.c_1.i [2020-10-24 01:04:07,204 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-24 01:04:07,210 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 01:04:07,227 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 01:04:07,257 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 01:04:07,257 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 01:04:07,257 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-24 01:04:07,258 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 01:04:07,258 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 01:04:07,258 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 01:04:07,258 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 01:04:07,258 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 01:04:07,279 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2020-10-24 01:04:07,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-24 01:04:07,290 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:04:07,291 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-10-24 01:04:07,291 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:04:07,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:04:07,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1653385351, now seen corresponding path program 1 times [2020-10-24 01:04:07,310 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:04:07,311 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [113572984] [2020-10-24 01:04:07,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:04:07,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:07,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:04:07,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:07,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 01:04:07,729 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [113572984] [2020-10-24 01:04:07,731 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 01:04:07,732 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-24 01:04:07,733 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118566025] [2020-10-24 01:04:07,738 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-24 01:04:07,739 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:04:07,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-24 01:04:07,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-24 01:04:07,766 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 7 states. [2020-10-24 01:04:08,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:04:08,679 INFO L93 Difference]: Finished difference Result 138 states and 168 transitions. [2020-10-24 01:04:08,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-24 01:04:08,681 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2020-10-24 01:04:08,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:04:08,693 INFO L225 Difference]: With dead ends: 138 [2020-10-24 01:04:08,693 INFO L226 Difference]: Without dead ends: 73 [2020-10-24 01:04:08,698 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-10-24 01:04:08,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-10-24 01:04:08,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2020-10-24 01:04:08,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-10-24 01:04:08,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2020-10-24 01:04:08,760 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 27 [2020-10-24 01:04:08,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:04:08,761 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2020-10-24 01:04:08,761 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-24 01:04:08,761 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2020-10-24 01:04:08,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-10-24 01:04:08,764 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:04:08,765 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2020-10-24 01:04:08,765 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-24 01:04:08,765 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:04:08,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:04:08,767 INFO L82 PathProgramCache]: Analyzing trace with hash 818741348, now seen corresponding path program 1 times [2020-10-24 01:04:08,767 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:04:08,767 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [481885009] [2020-10-24 01:04:08,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:04:08,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:09,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:04:09,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:09,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-24 01:04:09,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:09,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-24 01:04:09,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:09,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-10-24 01:04:09,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:09,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-24 01:04:09,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:09,282 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-10-24 01:04:09,282 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [481885009] [2020-10-24 01:04:09,282 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 01:04:09,283 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-24 01:04:09,283 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366690734] [2020-10-24 01:04:09,285 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-24 01:04:09,285 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:04:09,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-24 01:04:09,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-10-24 01:04:09,286 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand 9 states. [2020-10-24 01:04:09,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:04:09,650 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2020-10-24 01:04:09,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-24 01:04:09,651 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2020-10-24 01:04:09,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:04:09,654 INFO L225 Difference]: With dead ends: 106 [2020-10-24 01:04:09,654 INFO L226 Difference]: Without dead ends: 79 [2020-10-24 01:04:09,656 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-10-24 01:04:09,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-10-24 01:04:09,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2020-10-24 01:04:09,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-10-24 01:04:09,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2020-10-24 01:04:09,682 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 67 [2020-10-24 01:04:09,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:04:09,683 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2020-10-24 01:04:09,683 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-24 01:04:09,683 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2020-10-24 01:04:09,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-10-24 01:04:09,685 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:04:09,685 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 01:04:09,686 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-24 01:04:09,686 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:04:09,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:04:09,687 INFO L82 PathProgramCache]: Analyzing trace with hash -645962233, now seen corresponding path program 1 times [2020-10-24 01:04:09,687 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:04:09,687 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [445534625] [2020-10-24 01:04:09,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:04:09,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:09,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:04:09,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:09,858 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-24 01:04:09,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:09,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-24 01:04:09,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:09,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-10-24 01:04:09,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:09,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-24 01:04:09,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:09,997 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-10-24 01:04:09,997 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [445534625] [2020-10-24 01:04:09,998 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 01:04:09,998 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-10-24 01:04:09,998 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035821682] [2020-10-24 01:04:09,999 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-24 01:04:09,999 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:04:10,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-24 01:04:10,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-10-24 01:04:10,000 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand 9 states. [2020-10-24 01:04:10,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:04:10,437 INFO L93 Difference]: Finished difference Result 109 states and 122 transitions. [2020-10-24 01:04:10,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-24 01:04:10,439 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2020-10-24 01:04:10,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:04:10,441 INFO L225 Difference]: With dead ends: 109 [2020-10-24 01:04:10,441 INFO L226 Difference]: Without dead ends: 71 [2020-10-24 01:04:10,442 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-10-24 01:04:10,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-10-24 01:04:10,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67. [2020-10-24 01:04:10,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-10-24 01:04:10,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2020-10-24 01:04:10,459 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 67 [2020-10-24 01:04:10,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:04:10,460 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2020-10-24 01:04:10,460 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-24 01:04:10,460 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2020-10-24 01:04:10,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-10-24 01:04:10,462 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:04:10,462 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2020-10-24 01:04:10,463 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-24 01:04:10,463 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:04:10,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:04:10,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1821270998, now seen corresponding path program 1 times [2020-10-24 01:04:10,464 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:04:10,464 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [144653149] [2020-10-24 01:04:10,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:04:10,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:10,673 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:04:10,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:10,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-24 01:04:10,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:10,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-24 01:04:10,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:10,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-10-24 01:04:10,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:10,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-24 01:04:10,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:10,947 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-10-24 01:04:10,948 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [144653149] [2020-10-24 01:04:10,948 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 01:04:10,948 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-10-24 01:04:10,949 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329295486] [2020-10-24 01:04:10,949 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-10-24 01:04:10,949 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:04:10,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-24 01:04:10,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2020-10-24 01:04:10,951 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand 17 states. [2020-10-24 01:04:12,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:04:12,593 INFO L93 Difference]: Finished difference Result 116 states and 129 transitions. [2020-10-24 01:04:12,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-10-24 01:04:12,594 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2020-10-24 01:04:12,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:04:12,597 INFO L225 Difference]: With dead ends: 116 [2020-10-24 01:04:12,597 INFO L226 Difference]: Without dead ends: 112 [2020-10-24 01:04:12,599 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=150, Invalid=906, Unknown=0, NotChecked=0, Total=1056 [2020-10-24 01:04:12,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-10-24 01:04:12,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 94. [2020-10-24 01:04:12,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-10-24 01:04:12,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 107 transitions. [2020-10-24 01:04:12,635 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 107 transitions. Word has length 67 [2020-10-24 01:04:12,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:04:12,636 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 107 transitions. [2020-10-24 01:04:12,636 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-10-24 01:04:12,636 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 107 transitions. [2020-10-24 01:04:12,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-10-24 01:04:12,639 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:04:12,639 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 01:04:12,640 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-24 01:04:12,640 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:04:12,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:04:12,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1472109846, now seen corresponding path program 1 times [2020-10-24 01:04:12,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:04:12,641 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2127370274] [2020-10-24 01:04:12,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:04:12,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:12,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:04:12,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:12,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-24 01:04:12,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:12,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-24 01:04:12,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:13,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-10-24 01:04:13,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:13,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-24 01:04:13,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:13,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-10-24 01:04:13,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:13,115 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-24 01:04:13,115 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2127370274] [2020-10-24 01:04:13,116 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 01:04:13,116 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-10-24 01:04:13,116 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175649499] [2020-10-24 01:04:13,118 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-10-24 01:04:13,121 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:04:13,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-10-24 01:04:13,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2020-10-24 01:04:13,123 INFO L87 Difference]: Start difference. First operand 94 states and 107 transitions. Second operand 18 states. [2020-10-24 01:04:14,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:04:14,611 INFO L93 Difference]: Finished difference Result 120 states and 136 transitions. [2020-10-24 01:04:14,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-10-24 01:04:14,612 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 76 [2020-10-24 01:04:14,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:04:14,615 INFO L225 Difference]: With dead ends: 120 [2020-10-24 01:04:14,615 INFO L226 Difference]: Without dead ends: 110 [2020-10-24 01:04:14,617 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=173, Invalid=949, Unknown=0, NotChecked=0, Total=1122 [2020-10-24 01:04:14,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-10-24 01:04:14,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 100. [2020-10-24 01:04:14,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-10-24 01:04:14,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2020-10-24 01:04:14,664 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 76 [2020-10-24 01:04:14,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:04:14,665 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2020-10-24 01:04:14,665 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-10-24 01:04:14,665 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2020-10-24 01:04:14,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-10-24 01:04:14,667 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:04:14,667 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 01:04:14,668 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-24 01:04:14,668 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:04:14,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:04:14,669 INFO L82 PathProgramCache]: Analyzing trace with hash 2079566711, now seen corresponding path program 1 times [2020-10-24 01:04:14,669 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:04:14,669 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1022433028] [2020-10-24 01:04:14,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:04:14,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:14,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:04:14,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:14,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-24 01:04:14,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:14,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-24 01:04:14,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:14,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-10-24 01:04:14,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:15,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-24 01:04:15,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:15,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-10-24 01:04:15,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:15,245 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-24 01:04:15,246 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1022433028] [2020-10-24 01:04:15,247 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 01:04:15,248 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2020-10-24 01:04:15,248 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311848495] [2020-10-24 01:04:15,250 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-10-24 01:04:15,250 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:04:15,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-10-24 01:04:15,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=459, Unknown=0, NotChecked=0, Total=506 [2020-10-24 01:04:15,268 INFO L87 Difference]: Start difference. First operand 100 states and 113 transitions. Second operand 23 states. [2020-10-24 01:04:17,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:04:17,379 INFO L93 Difference]: Finished difference Result 119 states and 136 transitions. [2020-10-24 01:04:17,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-10-24 01:04:17,380 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 77 [2020-10-24 01:04:17,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:04:17,385 INFO L225 Difference]: With dead ends: 119 [2020-10-24 01:04:17,385 INFO L226 Difference]: Without dead ends: 111 [2020-10-24 01:04:17,387 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=210, Invalid=1682, Unknown=0, NotChecked=0, Total=1892 [2020-10-24 01:04:17,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-10-24 01:04:17,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2020-10-24 01:04:17,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-10-24 01:04:17,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 120 transitions. [2020-10-24 01:04:17,445 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 120 transitions. Word has length 77 [2020-10-24 01:04:17,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:04:17,447 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 120 transitions. [2020-10-24 01:04:17,447 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-10-24 01:04:17,447 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 120 transitions. [2020-10-24 01:04:17,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-10-24 01:04:17,459 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:04:17,459 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 01:04:17,460 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-24 01:04:17,460 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:04:17,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:04:17,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1754951300, now seen corresponding path program 1 times [2020-10-24 01:04:17,462 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:04:17,462 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1754130329] [2020-10-24 01:04:17,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:04:17,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:17,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:04:17,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:17,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-24 01:04:17,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:17,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-24 01:04:17,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:17,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-10-24 01:04:17,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:18,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-24 01:04:18,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:18,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-10-24 01:04:18,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:18,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2020-10-24 01:04:18,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:18,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-10-24 01:04:18,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:18,276 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-24 01:04:18,277 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1754130329] [2020-10-24 01:04:18,277 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 01:04:18,277 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2020-10-24 01:04:18,277 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111604623] [2020-10-24 01:04:18,278 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-10-24 01:04:18,278 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:04:18,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-10-24 01:04:18,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=498, Unknown=0, NotChecked=0, Total=552 [2020-10-24 01:04:18,279 INFO L87 Difference]: Start difference. First operand 109 states and 120 transitions. Second operand 24 states. [2020-10-24 01:04:20,378 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2020-10-24 01:04:20,710 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2020-10-24 01:04:21,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:04:21,052 INFO L93 Difference]: Finished difference Result 142 states and 151 transitions. [2020-10-24 01:04:21,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2020-10-24 01:04:21,053 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 91 [2020-10-24 01:04:21,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:04:21,055 INFO L225 Difference]: With dead ends: 142 [2020-10-24 01:04:21,055 INFO L226 Difference]: Without dead ends: 125 [2020-10-24 01:04:21,057 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=319, Invalid=2543, Unknown=0, NotChecked=0, Total=2862 [2020-10-24 01:04:21,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-10-24 01:04:21,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2020-10-24 01:04:21,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2020-10-24 01:04:21,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 134 transitions. [2020-10-24 01:04:21,093 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 134 transitions. Word has length 91 [2020-10-24 01:04:21,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:04:21,093 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 134 transitions. [2020-10-24 01:04:21,093 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-10-24 01:04:21,094 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 134 transitions. [2020-10-24 01:04:21,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-10-24 01:04:21,096 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:04:21,096 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 01:04:21,097 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-24 01:04:21,097 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:04:21,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:04:21,097 INFO L82 PathProgramCache]: Analyzing trace with hash -188247350, now seen corresponding path program 2 times [2020-10-24 01:04:21,098 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:04:21,099 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1751019927] [2020-10-24 01:04:21,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:04:21,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:21,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:04:21,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:21,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-24 01:04:21,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:21,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-24 01:04:21,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:21,383 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-10-24 01:04:21,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:21,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-24 01:04:21,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:21,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-10-24 01:04:21,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:21,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-10-24 01:04:21,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:21,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-10-24 01:04:21,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:21,692 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-24 01:04:21,693 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1751019927] [2020-10-24 01:04:21,693 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 01:04:21,693 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2020-10-24 01:04:21,694 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792327159] [2020-10-24 01:04:21,694 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-10-24 01:04:21,694 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:04:21,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-10-24 01:04:21,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=501, Unknown=0, NotChecked=0, Total=552 [2020-10-24 01:04:21,696 INFO L87 Difference]: Start difference. First operand 125 states and 134 transitions. Second operand 24 states. [2020-10-24 01:04:23,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:04:23,830 INFO L93 Difference]: Finished difference Result 141 states and 151 transitions. [2020-10-24 01:04:23,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-10-24 01:04:23,831 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 91 [2020-10-24 01:04:23,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:04:23,833 INFO L225 Difference]: With dead ends: 141 [2020-10-24 01:04:23,833 INFO L226 Difference]: Without dead ends: 135 [2020-10-24 01:04:23,835 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=232, Invalid=1748, Unknown=0, NotChecked=0, Total=1980 [2020-10-24 01:04:23,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-10-24 01:04:23,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2020-10-24 01:04:23,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-10-24 01:04:23,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 143 transitions. [2020-10-24 01:04:23,865 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 143 transitions. Word has length 91 [2020-10-24 01:04:23,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:04:23,865 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 143 transitions. [2020-10-24 01:04:23,865 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-10-24 01:04:23,866 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 143 transitions. [2020-10-24 01:04:23,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-10-24 01:04:23,867 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:04:23,867 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 01:04:23,867 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-24 01:04:23,868 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:04:23,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:04:23,868 INFO L82 PathProgramCache]: Analyzing trace with hash -462605947, now seen corresponding path program 1 times [2020-10-24 01:04:23,869 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:04:23,869 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [712238967] [2020-10-24 01:04:23,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:04:23,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:24,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:04:24,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:24,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-24 01:04:24,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:24,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-24 01:04:24,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:24,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-10-24 01:04:24,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:24,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-24 01:04:24,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:24,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-10-24 01:04:24,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:24,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2020-10-24 01:04:24,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:24,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-10-24 01:04:24,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:04:24,288 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-24 01:04:24,288 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [712238967] [2020-10-24 01:04:24,289 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 01:04:24,289 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-10-24 01:04:24,289 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67579628] [2020-10-24 01:04:24,290 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-10-24 01:04:24,290 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:04:24,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-10-24 01:04:24,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2020-10-24 01:04:24,291 INFO L87 Difference]: Start difference. First operand 134 states and 143 transitions. Second operand 19 states. [2020-10-24 01:04:26,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:04:26,081 INFO L93 Difference]: Finished difference Result 163 states and 172 transitions. [2020-10-24 01:04:26,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-10-24 01:04:26,082 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 92 [2020-10-24 01:04:26,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:04:26,084 INFO L225 Difference]: With dead ends: 163 [2020-10-24 01:04:26,086 INFO L226 Difference]: Without dead ends: 149 [2020-10-24 01:04:26,088 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=253, Invalid=1469, Unknown=0, NotChecked=0, Total=1722 [2020-10-24 01:04:26,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2020-10-24 01:04:26,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 133. [2020-10-24 01:04:26,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-10-24 01:04:26,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 141 transitions. [2020-10-24 01:04:26,126 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 141 transitions. Word has length 92 [2020-10-24 01:04:26,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:04:26,127 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 141 transitions. [2020-10-24 01:04:26,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-10-24 01:04:26,127 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 141 transitions. [2020-10-24 01:04:26,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-10-24 01:04:26,128 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:04:26,128 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 01:04:26,129 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-24 01:04:26,129 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:04:26,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:04:26,130 INFO L82 PathProgramCache]: Analyzing trace with hash -472690422, now seen corresponding path program 1 times [2020-10-24 01:04:26,130 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:04:26,131 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [543191113] [2020-10-24 01:04:26,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:04:26,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-24 01:04:26,154 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-24 01:04:26,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-24 01:04:26,180 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-24 01:04:26,267 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-10-24 01:04:26,268 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-24 01:04:26,268 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-24 01:04:26,335 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 62 could not be translated for associated CType STRUCT~~list_head?prev~*list_head?next~*list_head# [2020-10-24 01:04:26,336 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 61 could not be translated for associated CType STRUCT~~list_head?prev~*list_head?next~*list_head# [2020-10-24 01:04:26,344 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 62 could not be translated for associated CType STRUCT~~list_head?prev~*list_head?next~*list_head# [2020-10-24 01:04:26,344 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 61 could not be translated for associated CType STRUCT~~list_head?prev~*list_head?next~*list_head# [2020-10-24 01:04:26,347 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 62 could not be translated for associated CType STRUCT~~list_head?prev~*list_head?next~*list_head# [2020-10-24 01:04:26,347 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 61 could not be translated for associated CType STRUCT~~list_head?prev~*list_head?next~*list_head# [2020-10-24 01:04:26,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 01:04:26 BoogieIcfgContainer [2020-10-24 01:04:26,408 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 01:04:26,412 INFO L168 Benchmark]: Toolchain (without parser) took 20939.26 ms. Allocated memory was 125.8 MB in the beginning and 314.6 MB in the end (delta: 188.7 MB). Free memory was 101.8 MB in the beginning and 282.5 MB in the end (delta: -180.8 MB). Peak memory consumption was 186.3 MB. Max. memory is 8.0 GB. [2020-10-24 01:04:26,413 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 125.8 MB. Free memory was 103.6 MB in the beginning and 103.5 MB in the end (delta: 68.4 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-10-24 01:04:26,414 INFO L168 Benchmark]: CACSL2BoogieTranslator took 725.65 ms. Allocated memory is still 125.8 MB. Free memory was 101.1 MB in the beginning and 77.2 MB in the end (delta: 24.0 MB). Peak memory consumption was 23.1 MB. Max. memory is 8.0 GB. [2020-10-24 01:04:26,415 INFO L168 Benchmark]: Boogie Preprocessor took 161.16 ms. Allocated memory was 125.8 MB in the beginning and 151.0 MB in the end (delta: 25.2 MB). Free memory was 77.2 MB in the beginning and 133.6 MB in the end (delta: -56.4 MB). Peak memory consumption was 4.6 MB. Max. memory is 8.0 GB. [2020-10-24 01:04:26,418 INFO L168 Benchmark]: RCFGBuilder took 804.79 ms. Allocated memory is still 151.0 MB. Free memory was 133.6 MB in the beginning and 132.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 48.6 MB. Max. memory is 8.0 GB. [2020-10-24 01:04:26,419 INFO L168 Benchmark]: TraceAbstraction took 19229.39 ms. Allocated memory was 151.0 MB in the beginning and 314.6 MB in the end (delta: 163.6 MB). Free memory was 132.5 MB in the beginning and 282.5 MB in the end (delta: -150.1 MB). Peak memory consumption was 190.7 MB. Max. memory is 8.0 GB. [2020-10-24 01:04:26,426 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 125.8 MB. Free memory was 103.6 MB in the beginning and 103.5 MB in the end (delta: 68.4 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 725.65 ms. Allocated memory is still 125.8 MB. Free memory was 101.1 MB in the beginning and 77.2 MB in the end (delta: 24.0 MB). Peak memory consumption was 23.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 161.16 ms. Allocated memory was 125.8 MB in the beginning and 151.0 MB in the end (delta: 25.2 MB). Free memory was 77.2 MB in the beginning and 133.6 MB in the end (delta: -56.4 MB). Peak memory consumption was 4.6 MB. Max. memory is 8.0 GB. * RCFGBuilder took 804.79 ms. Allocated memory is still 151.0 MB. Free memory was 133.6 MB in the beginning and 132.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 48.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 19229.39 ms. Allocated memory was 151.0 MB in the beginning and 314.6 MB in the end (delta: 163.6 MB). Free memory was 132.5 MB in the beginning and 282.5 MB in the end (delta: -150.1 MB). Peak memory consumption was 190.7 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 62 could not be translated for associated CType STRUCT~~list_head?prev~*list_head?next~*list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 61 could not be translated for associated CType STRUCT~~list_head?prev~*list_head?next~*list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 62 could not be translated for associated CType STRUCT~~list_head?prev~*list_head?next~*list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 61 could not be translated for associated CType STRUCT~~list_head?prev~*list_head?next~*list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 62 could not be translated for associated CType STRUCT~~list_head?prev~*list_head?next~*list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 61 could not be translated for associated CType STRUCT~~list_head?prev~*list_head?next~*list_head# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L869] void * guard_malloc_counter = 0; VAL [\old(elem)=53, \old(elem)=49, \old(guard_malloc_counter)=51, \old(guard_malloc_counter)=60, \old(head)=null, \old(head)=null, elem={53:49}, guard_malloc_counter={0:0}, head={62:61}] [L889] struct list_head *elem = ((void *)0); VAL [\old(elem)=53, \old(elem)=49, \old(guard_malloc_counter)=60, \old(guard_malloc_counter)=51, \old(head)=null, \old(head)=null, elem={0:0}, guard_malloc_counter={0:0}, head={62:61}] [L902] static struct list_head head; VAL [\old(elem)=49, \old(elem)=53, \old(guard_malloc_counter)=51, \old(guard_malloc_counter)=60, \old(head)=null, \old(head)=null, elem={0:0}, guard_malloc_counter={0:0}, head={3:0}] [L905] struct list_head *dev1, *dev2; VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:0}, guard_malloc_counter={0:0}, head={3:0}] [L906] CALL, EXPR my_malloc(sizeof(*dev1)) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, \old(size)=8, elem={0:0}, guard_malloc_counter={0:0}, head={3:0}] [L881] CALL, EXPR __getMemory(size) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, \old(size)=8, elem={0:0}, guard_malloc_counter={0:0}, head={3:0}] [L873] (size > 0) ? (0) : __blast_assert () VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, \old(size)=8, elem={0:0}, guard_malloc_counter={0:0}, head={3:0}, size=8] [L874] guard_malloc_counter++ VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, \old(size)=8, elem={0:0}, guard_malloc_counter={0:1}, head={3:0}, size=8] [L875] COND FALSE !(!__VERIFIER_nondet_int()) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, \old(size)=8, __VERIFIER_nondet_int()=1, elem={0:0}, guard_malloc_counter={0:1}, head={3:0}, size=8] [L877] return (void *) guard_malloc_counter; VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, \old(size)=8, \result={0:1}, elem={0:0}, guard_malloc_counter={0:1}, head={3:0}, size=8] [L881] RET, EXPR __getMemory(size) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, \old(size)=8, __getMemory(size)={0:1}, elem={0:0}, guard_malloc_counter={0:1}, head={3:0}, size=8] [L881] return __getMemory(size); VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, \old(size)=8, \result={0:1}, __getMemory(size)={0:1}, elem={0:0}, guard_malloc_counter={0:1}, head={3:0}, size=8] [L906] RET, EXPR my_malloc(sizeof(*dev1)) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:0}, guard_malloc_counter={0:1}, head={3:0}, my_malloc(sizeof(*dev1))={0:1}] [L906] dev1 = my_malloc(sizeof(*dev1)) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, dev1={0:1}, elem={0:0}, guard_malloc_counter={0:1}, head={3:0}, my_malloc(sizeof(*dev1))={0:1}] [L907] CALL, EXPR my_malloc(sizeof(*dev2)) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=1, \old(guard_malloc_counter)=0, \old(size)=8, elem={0:0}, guard_malloc_counter={0:1}, head={3:0}] [L881] CALL, EXPR __getMemory(size) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=1, \old(guard_malloc_counter)=0, \old(size)=8, elem={0:0}, guard_malloc_counter={0:1}, head={3:0}] [L873] (size > 0) ? (0) : __blast_assert () VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=1, \old(guard_malloc_counter)=0, \old(size)=8, elem={0:0}, guard_malloc_counter={0:1}, head={3:0}, size=8] [L874] guard_malloc_counter++ VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=1, \old(guard_malloc_counter)=0, \old(size)=8, elem={0:0}, guard_malloc_counter={0:2}, head={3:0}, size=8] [L875] COND FALSE !(!__VERIFIER_nondet_int()) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=1, \old(guard_malloc_counter)=0, \old(size)=8, __VERIFIER_nondet_int()=1, elem={0:0}, guard_malloc_counter={0:2}, head={3:0}, size=8] [L877] return (void *) guard_malloc_counter; VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=1, \old(guard_malloc_counter)=0, \old(size)=8, \result={0:2}, elem={0:0}, guard_malloc_counter={0:2}, head={3:0}, size=8] [L881] RET, EXPR __getMemory(size) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=1, \old(guard_malloc_counter)=0, \old(size)=8, __getMemory(size)={0:2}, elem={0:0}, guard_malloc_counter={0:2}, head={3:0}, size=8] [L881] return __getMemory(size); VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=1, \old(size)=8, \result={0:2}, __getMemory(size)={0:2}, elem={0:0}, guard_malloc_counter={0:2}, head={3:0}, size=8] [L907] RET, EXPR my_malloc(sizeof(*dev2)) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, dev1={0:1}, elem={0:0}, guard_malloc_counter={0:2}, head={3:0}, my_malloc(sizeof(*dev2))={0:2}] [L907] dev2 = my_malloc(sizeof(*dev2)) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, dev1={0:1}, dev2={0:2}, elem={0:0}, guard_malloc_counter={0:2}, head={3:0}, my_malloc(sizeof(*dev2))={0:2}] [L908] COND TRUE dev1!=((void *)0) && dev2!=((void *)0) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, dev1={0:1}, dev2={0:2}, elem={0:0}, guard_malloc_counter={0:2}, head={3:0}] [L909] CALL list_add(dev2, &head) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:0}, guard_malloc_counter={0:2}, head={3:0}, head={3:0}, new={0:2}] [L892] (new!=elem) ? (0) : __blast_assert () VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:0}, guard_malloc_counter={0:2}, head={3:0}, head={3:0}, head={3:0}, new={0:2}, new={0:2}] [L893] COND FALSE !(__VERIFIER_nondet_int()) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, __VERIFIER_nondet_int()=0, elem={0:0}, guard_malloc_counter={0:2}, head={3:0}, head={3:0}, head={3:0}, new={0:2}, new={0:2}] [L909] RET list_add(dev2, &head) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, dev1={0:1}, dev2={0:2}, elem={0:0}, guard_malloc_counter={0:2}, head={3:0}] [L910] CALL list_add(dev1, &head) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:0}, guard_malloc_counter={0:2}, head={3:0}, head={3:0}, new={0:1}] [L892] (new!=elem) ? (0) : __blast_assert () VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:0}, guard_malloc_counter={0:2}, head={3:0}, head={3:0}, head={3:0}, new={0:1}, new={0:1}] [L893] COND TRUE __VERIFIER_nondet_int() VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, __VERIFIER_nondet_int()=1, elem={0:0}, guard_malloc_counter={0:2}, head={3:0}, head={3:0}, head={3:0}, new={0:1}, new={0:1}] [L894] elem = new VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:1}, guard_malloc_counter={0:2}, head={3:0}, head={3:0}, head={3:0}, new={0:1}, new={0:1}] [L910] RET list_add(dev1, &head) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, dev1={0:1}, dev2={0:2}, elem={0:1}, guard_malloc_counter={0:2}, head={3:0}] [L911] CALL list_del(dev2) VAL [\old(elem)=1, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:1}, entry={0:2}, guard_malloc_counter={0:2}, head={3:0}] [L898] COND FALSE !(entry==elem) VAL [\old(elem)=0, \old(elem)=1, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:1}, entry={0:2}, entry={0:2}, guard_malloc_counter={0:2}, head={3:0}] [L911] RET list_del(dev2) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, dev1={0:1}, dev2={0:2}, elem={0:1}, guard_malloc_counter={0:2}, head={3:0}] [L912] CALL list_add(dev2, &head) VAL [\old(elem)=0, \old(elem)=1, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:1}, guard_malloc_counter={0:2}, head={3:0}, head={3:0}, new={0:2}] [L892] (new!=elem) ? (0) : __blast_assert () VAL [\old(elem)=1, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:1}, guard_malloc_counter={0:2}, head={3:0}, head={3:0}, head={3:0}, new={0:2}, new={0:2}] [L893] COND FALSE !(__VERIFIER_nondet_int()) VAL [\old(elem)=1, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, __VERIFIER_nondet_int()=0, elem={0:1}, guard_malloc_counter={0:2}, head={3:0}, head={3:0}, head={3:0}, new={0:2}, new={0:2}] [L912] RET list_add(dev2, &head) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, dev1={0:1}, dev2={0:2}, elem={0:1}, guard_malloc_counter={0:2}, head={3:0}] [L915] CALL list_add(dev1, &head) VAL [\old(elem)=0, \old(elem)=1, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:1}, guard_malloc_counter={0:2}, head={3:0}, head={3:0}, new={0:1}] [L892] (new!=elem) ? (0) : __blast_assert () VAL [\old(elem)=1, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:1}, guard_malloc_counter={0:2}, head={3:0}, head={3:0}, head={3:0}, new={0:1}, new={0:1}] [L892] CALL __blast_assert () VAL [\old(elem)=0, \old(elem)=1, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:1}, guard_malloc_counter={0:2}, head={3:0}] [L8] CALL reach_error() VAL [\old(elem)=1, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:1}, guard_malloc_counter={0:2}, head={3:0}] [L3] __assert_fail("0", "rule60_list2.c_1.i", 3, "reach_error") VAL [\old(elem)=0, \old(elem)=1, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:1}, guard_malloc_counter={0:2}, head={3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 80 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 19.0s, OverallIterations: 10, TraceHistogramMax: 4, AutomataDifference: 13.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 585 SDtfs, 1054 SDslu, 2537 SDs, 0 SdLazy, 6586 SolverSat, 543 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 378 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1482 ImplicationChecksByTransitivity, 8.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=134occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 59 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 755 NumberOfCodeBlocks, 755 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 646 ConstructedInterpolants, 0 QuantifiedInterpolants, 216634 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 2 PerfectInterpolantSequences, 104/179 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...