java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test15_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-acfac67 [2018-01-28 22:24:43,096 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-28 22:24:43,098 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-28 22:24:43,113 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-28 22:24:43,113 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-28 22:24:43,114 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-28 22:24:43,115 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-28 22:24:43,117 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-28 22:24:43,119 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-28 22:24:43,119 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-28 22:24:43,120 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-28 22:24:43,120 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-28 22:24:43,121 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-28 22:24:43,122 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-28 22:24:43,122 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-28 22:24:43,125 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-28 22:24:43,127 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-28 22:24:43,129 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-28 22:24:43,130 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-28 22:24:43,131 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-28 22:24:43,134 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-28 22:24:43,134 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-28 22:24:43,134 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-28 22:24:43,135 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-28 22:24:43,136 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-28 22:24:43,137 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-28 22:24:43,137 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-28 22:24:43,138 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-28 22:24:43,138 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-28 22:24:43,138 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-28 22:24:43,139 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-28 22:24:43,139 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-28 22:24:43,149 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-28 22:24:43,149 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-28 22:24:43,150 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-28 22:24:43,150 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-28 22:24:43,150 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-28 22:24:43,150 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-28 22:24:43,150 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-28 22:24:43,151 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-28 22:24:43,151 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-28 22:24:43,151 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-28 22:24:43,152 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-28 22:24:43,152 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-28 22:24:43,152 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-28 22:24:43,152 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-28 22:24:43,152 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-28 22:24:43,153 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-28 22:24:43,153 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-28 22:24:43,153 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-28 22:24:43,153 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-28 22:24:43,153 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-28 22:24:43,154 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-28 22:24:43,154 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-28 22:24:43,154 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-28 22:24:43,154 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-28 22:24:43,154 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-28 22:24:43,155 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-28 22:24:43,155 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-28 22:24:43,155 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-28 22:24:43,155 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-28 22:24:43,155 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-28 22:24:43,155 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-28 22:24:43,156 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-28 22:24:43,157 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-28 22:24:43,157 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-28 22:24:43,191 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-28 22:24:43,204 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-28 22:24:43,208 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-28 22:24:43,209 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-28 22:24:43,210 INFO L276 PluginConnector]: CDTParser initialized [2018-01-28 22:24:43,210 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test15_false-valid-memtrack.i [2018-01-28 22:24:43,414 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-28 22:24:43,421 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-28 22:24:43,422 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-28 22:24:43,422 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-28 22:24:43,427 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-28 22:24:43,428 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 10:24:43" (1/1) ... [2018-01-28 22:24:43,431 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ca3c60c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:24:43, skipping insertion in model container [2018-01-28 22:24:43,431 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 10:24:43" (1/1) ... [2018-01-28 22:24:43,449 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 22:24:43,501 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 22:24:43,619 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 22:24:43,643 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 22:24:43,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:24:43 WrapperNode [2018-01-28 22:24:43,656 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-28 22:24:43,658 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-28 22:24:43,658 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-28 22:24:43,658 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-28 22:24:43,670 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:24:43" (1/1) ... [2018-01-28 22:24:43,670 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:24:43" (1/1) ... [2018-01-28 22:24:43,680 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:24:43" (1/1) ... [2018-01-28 22:24:43,680 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:24:43" (1/1) ... [2018-01-28 22:24:43,690 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:24:43" (1/1) ... [2018-01-28 22:24:43,693 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:24:43" (1/1) ... [2018-01-28 22:24:43,695 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:24:43" (1/1) ... [2018-01-28 22:24:43,697 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-28 22:24:43,697 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-28 22:24:43,698 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-28 22:24:43,698 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-28 22:24:43,699 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:24:43" (1/1) ... No working directory specified, using /storage/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 [2018-01-28 22:24:43,750 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-28 22:24:43,750 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-28 22:24:43,750 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2018-01-28 22:24:43,750 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2018-01-28 22:24:43,750 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2018-01-28 22:24:43,750 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2018-01-28 22:24:43,751 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_hid_get_drvdata [2018-01-28 22:24:43,751 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_hid_set_drvdata [2018-01-28 22:24:43,751 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_arvo_init_arvo_device_struct [2018-01-28 22:24:43,751 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_arvo_init_specials_unsafe [2018-01-28 22:24:43,751 INFO L136 BoogieDeclarations]: Found implementation of procedure lvd_arvo_remove_specials [2018-01-28 22:24:43,751 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_arvo_probe_unsafe [2018-01-28 22:24:43,751 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_arvo_remove [2018-01-28 22:24:43,751 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-28 22:24:43,751 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-28 22:24:43,751 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-28 22:24:43,752 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-28 22:24:43,752 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-28 22:24:43,752 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-28 22:24:43,752 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-28 22:24:43,752 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-28 22:24:43,752 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-28 22:24:43,753 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2018-01-28 22:24:43,753 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2018-01-28 22:24:43,753 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-01-28 22:24:43,753 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-28 22:24:43,753 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-28 22:24:43,753 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2018-01-28 22:24:43,754 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2018-01-28 22:24:43,754 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2018-01-28 22:24:43,754 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2018-01-28 22:24:43,754 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_hid_get_drvdata [2018-01-28 22:24:43,754 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_hid_set_drvdata [2018-01-28 22:24:43,754 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_arvo_init_arvo_device_struct [2018-01-28 22:24:43,755 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_arvo_init_specials_unsafe [2018-01-28 22:24:43,755 INFO L128 BoogieDeclarations]: Found specification of procedure lvd_arvo_remove_specials [2018-01-28 22:24:43,755 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_arvo_probe_unsafe [2018-01-28 22:24:43,755 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_arvo_remove [2018-01-28 22:24:43,755 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-28 22:24:43,755 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-28 22:24:43,755 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-28 22:24:43,756 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-28 22:24:44,314 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-28 22:24:44,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 10:24:44 BoogieIcfgContainer [2018-01-28 22:24:44,347 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-28 22:24:44,348 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-28 22:24:44,348 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-28 22:24:44,351 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-28 22:24:44,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 10:24:43" (1/3) ... [2018-01-28 22:24:44,352 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b8ce83c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 10:24:44, skipping insertion in model container [2018-01-28 22:24:44,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:24:43" (2/3) ... [2018-01-28 22:24:44,352 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b8ce83c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 10:24:44, skipping insertion in model container [2018-01-28 22:24:44,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 10:24:44" (3/3) ... [2018-01-28 22:24:44,354 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test15_false-valid-memtrack.i [2018-01-28 22:24:44,360 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-28 22:24:44,366 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 45 error locations. [2018-01-28 22:24:44,418 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-28 22:24:44,418 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-28 22:24:44,418 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-28 22:24:44,419 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-28 22:24:44,419 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-28 22:24:44,419 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-28 22:24:44,419 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-28 22:24:44,419 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-28 22:24:44,420 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-28 22:24:44,440 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states. [2018-01-28 22:24:44,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-28 22:24:44,447 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:24:44,448 INFO L330 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] [2018-01-28 22:24:44,448 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-01-28 22:24:44,451 INFO L82 PathProgramCache]: Analyzing trace with hash -2027403499, now seen corresponding path program 1 times [2018-01-28 22:24:44,453 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:24:44,453 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:24:44,499 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:24:44,499 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:24:44,499 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:24:44,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:24:44,559 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:24:44,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:24:44,780 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:24:44,780 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 22:24:44,782 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:24:44,797 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:24:44,798 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:24:44,800 INFO L87 Difference]: Start difference. First operand 214 states. Second operand 6 states. [2018-01-28 22:24:44,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:24:44,896 INFO L93 Difference]: Finished difference Result 221 states and 233 transitions. [2018-01-28 22:24:44,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 22:24:44,897 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-28 22:24:44,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:24:44,911 INFO L225 Difference]: With dead ends: 221 [2018-01-28 22:24:44,912 INFO L226 Difference]: Without dead ends: 211 [2018-01-28 22:24:44,915 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:24:44,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-01-28 22:24:44,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-01-28 22:24:44,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-01-28 22:24:44,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 223 transitions. [2018-01-28 22:24:44,962 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 223 transitions. Word has length 24 [2018-01-28 22:24:44,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:24:44,964 INFO L432 AbstractCegarLoop]: Abstraction has 211 states and 223 transitions. [2018-01-28 22:24:44,964 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:24:44,964 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 223 transitions. [2018-01-28 22:24:44,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-28 22:24:44,966 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:24:44,966 INFO L330 BasicCegarLoop]: trace histogram [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] [2018-01-28 22:24:44,966 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-01-28 22:24:44,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1672177160, now seen corresponding path program 1 times [2018-01-28 22:24:44,967 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:24:44,967 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:24:44,968 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:24:44,968 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:24:44,968 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:24:44,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:24:44,999 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:24:45,084 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-28 22:24:45,084 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:24:45,085 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 22:24:45,086 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:24:45,087 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:24:45,087 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:24:45,087 INFO L87 Difference]: Start difference. First operand 211 states and 223 transitions. Second operand 6 states. [2018-01-28 22:24:45,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:24:45,189 INFO L93 Difference]: Finished difference Result 218 states and 229 transitions. [2018-01-28 22:24:45,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 22:24:45,190 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-01-28 22:24:45,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:24:45,193 INFO L225 Difference]: With dead ends: 218 [2018-01-28 22:24:45,193 INFO L226 Difference]: Without dead ends: 211 [2018-01-28 22:24:45,194 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:24:45,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-01-28 22:24:45,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-01-28 22:24:45,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-01-28 22:24:45,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 222 transitions. [2018-01-28 22:24:45,216 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 222 transitions. Word has length 36 [2018-01-28 22:24:45,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:24:45,216 INFO L432 AbstractCegarLoop]: Abstraction has 211 states and 222 transitions. [2018-01-28 22:24:45,216 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:24:45,216 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 222 transitions. [2018-01-28 22:24:45,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-28 22:24:45,218 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:24:45,218 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:24:45,218 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-01-28 22:24:45,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1663834073, now seen corresponding path program 1 times [2018-01-28 22:24:45,219 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:24:45,219 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:24:45,220 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:24:45,221 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:24:45,221 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:24:45,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:24:45,254 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:24:45,466 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-01-28 22:24:45,466 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:24:45,466 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:24:45,481 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:24:45,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:24:45,538 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:24:45,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-28 22:24:45,573 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:24:45,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:24:45,575 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-28 22:24:45,643 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:24:45,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-01-28 22:24:45,647 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:24:45,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:24:45,650 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-28 22:24:45,730 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:24:45,732 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:24:45,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-28 22:24:45,734 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:24:45,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:24:45,744 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-01-28 22:24:45,771 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-28 22:24:45,804 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:24:45,805 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 11 [2018-01-28 22:24:45,805 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-28 22:24:45,805 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-28 22:24:45,806 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-01-28 22:24:45,806 INFO L87 Difference]: Start difference. First operand 211 states and 222 transitions. Second operand 12 states. [2018-01-28 22:24:46,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:24:46,677 INFO L93 Difference]: Finished difference Result 267 states and 285 transitions. [2018-01-28 22:24:46,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-28 22:24:46,677 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 47 [2018-01-28 22:24:46,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:24:46,682 INFO L225 Difference]: With dead ends: 267 [2018-01-28 22:24:46,682 INFO L226 Difference]: Without dead ends: 262 [2018-01-28 22:24:46,683 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2018-01-28 22:24:46,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-01-28 22:24:46,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 229. [2018-01-28 22:24:46,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-01-28 22:24:46,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 246 transitions. [2018-01-28 22:24:46,709 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 246 transitions. Word has length 47 [2018-01-28 22:24:46,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:24:46,710 INFO L432 AbstractCegarLoop]: Abstraction has 229 states and 246 transitions. [2018-01-28 22:24:46,710 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-28 22:24:46,710 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 246 transitions. [2018-01-28 22:24:46,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-28 22:24:46,711 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:24:46,711 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:24:46,711 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-01-28 22:24:46,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1663834072, now seen corresponding path program 1 times [2018-01-28 22:24:46,712 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:24:46,712 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:24:46,713 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:24:46,713 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:24:46,713 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:24:46,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:24:46,741 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:24:46,943 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-01-28 22:24:46,944 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:24:46,944 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:24:46,956 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:24:46,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:24:46,990 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:24:47,027 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-28 22:24:47,055 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-28 22:24:47,055 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 10 [2018-01-28 22:24:47,055 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-28 22:24:47,055 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-28 22:24:47,055 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-01-28 22:24:47,056 INFO L87 Difference]: Start difference. First operand 229 states and 246 transitions. Second operand 10 states. [2018-01-28 22:24:47,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:24:47,188 INFO L93 Difference]: Finished difference Result 459 states and 500 transitions. [2018-01-28 22:24:47,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 22:24:47,189 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 47 [2018-01-28 22:24:47,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:24:47,191 INFO L225 Difference]: With dead ends: 459 [2018-01-28 22:24:47,192 INFO L226 Difference]: Without dead ends: 233 [2018-01-28 22:24:47,194 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-01-28 22:24:47,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-01-28 22:24:47,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 230. [2018-01-28 22:24:47,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-01-28 22:24:47,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 247 transitions. [2018-01-28 22:24:47,213 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 247 transitions. Word has length 47 [2018-01-28 22:24:47,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:24:47,213 INFO L432 AbstractCegarLoop]: Abstraction has 230 states and 247 transitions. [2018-01-28 22:24:47,213 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-28 22:24:47,214 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 247 transitions. [2018-01-28 22:24:47,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-01-28 22:24:47,215 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:24:47,215 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:24:47,216 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-01-28 22:24:47,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1691691042, now seen corresponding path program 1 times [2018-01-28 22:24:47,216 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:24:47,216 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:24:47,217 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:24:47,217 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:24:47,218 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:24:47,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:24:47,245 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:24:47,508 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-01-28 22:24:47,508 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:24:47,508 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:24:47,514 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:24:47,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:24:47,564 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:24:47,643 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 46 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-28 22:24:47,676 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:24:47,676 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2018-01-28 22:24:47,676 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-28 22:24:47,676 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-28 22:24:47,677 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-01-28 22:24:47,677 INFO L87 Difference]: Start difference. First operand 230 states and 247 transitions. Second operand 13 states. [2018-01-28 22:24:47,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:24:47,956 INFO L93 Difference]: Finished difference Result 464 states and 505 transitions. [2018-01-28 22:24:47,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 22:24:47,957 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 59 [2018-01-28 22:24:47,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:24:47,959 INFO L225 Difference]: With dead ends: 464 [2018-01-28 22:24:47,959 INFO L226 Difference]: Without dead ends: 237 [2018-01-28 22:24:47,961 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-01-28 22:24:47,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-01-28 22:24:47,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 234. [2018-01-28 22:24:47,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-01-28 22:24:47,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 251 transitions. [2018-01-28 22:24:47,977 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 251 transitions. Word has length 59 [2018-01-28 22:24:47,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:24:47,977 INFO L432 AbstractCegarLoop]: Abstraction has 234 states and 251 transitions. [2018-01-28 22:24:47,977 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-28 22:24:47,977 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 251 transitions. [2018-01-28 22:24:47,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-01-28 22:24:47,979 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:24:47,979 INFO L330 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:24:47,979 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-01-28 22:24:47,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1295335708, now seen corresponding path program 2 times [2018-01-28 22:24:47,979 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:24:47,979 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:24:47,981 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:24:47,981 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:24:47,981 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:24:48,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:24:48,015 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:24:48,201 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-01-28 22:24:48,201 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:24:48,201 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:24:48,209 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 22:24:48,226 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 22:24:48,243 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 22:24:48,256 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 22:24:48,260 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:24:48,458 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 60 proven. 6 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-01-28 22:24:48,490 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:24:48,490 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-01-28 22:24:48,491 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-28 22:24:48,491 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-28 22:24:48,491 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-01-28 22:24:48,491 INFO L87 Difference]: Start difference. First operand 234 states and 251 transitions. Second operand 15 states. [2018-01-28 22:24:48,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:24:48,646 INFO L93 Difference]: Finished difference Result 472 states and 513 transitions. [2018-01-28 22:24:48,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-28 22:24:48,646 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 71 [2018-01-28 22:24:48,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:24:48,648 INFO L225 Difference]: With dead ends: 472 [2018-01-28 22:24:48,649 INFO L226 Difference]: Without dead ends: 241 [2018-01-28 22:24:48,650 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2018-01-28 22:24:48,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-01-28 22:24:48,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 238. [2018-01-28 22:24:48,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-01-28 22:24:48,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 255 transitions. [2018-01-28 22:24:48,667 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 255 transitions. Word has length 71 [2018-01-28 22:24:48,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:24:48,668 INFO L432 AbstractCegarLoop]: Abstraction has 238 states and 255 transitions. [2018-01-28 22:24:48,668 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-28 22:24:48,668 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 255 transitions. [2018-01-28 22:24:48,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-01-28 22:24:48,669 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:24:48,669 INFO L330 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:24:48,669 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-01-28 22:24:48,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1614197526, now seen corresponding path program 3 times [2018-01-28 22:24:48,670 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:24:48,670 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:24:48,671 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:24:48,671 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 22:24:48,671 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:24:48,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:24:48,703 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:24:49,021 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-01-28 22:24:49,022 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:24:49,022 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:24:49,032 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-28 22:24:49,049 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 22:24:49,056 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 22:24:49,063 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 22:24:49,066 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 22:24:49,071 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:24:49,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2018-01-28 22:24:49,090 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:24:49,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-01-28 22:24:49,110 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:24:49,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-01-28 22:24:49,130 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:24:49,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-01-28 22:24:49,132 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:24:49,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:24:49,150 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:56, output treesize:52 [2018-01-28 22:24:49,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2018-01-28 22:24:49,698 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:24:49,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-01-28 22:24:49,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:24:49,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2018-01-28 22:24:49,754 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:24:49,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2018-01-28 22:24:49,764 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:24:49,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-01-28 22:24:49,772 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:41, output treesize:29 [2018-01-28 22:24:49,982 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:24:49,983 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:24:49,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-01-28 22:24:49,984 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:24:50,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-01-28 22:24:50,037 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:24:50,068 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:24:50,069 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:24:50,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 47 [2018-01-28 22:24:50,071 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:24:50,136 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:24:50,137 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:24:50,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-01-28 22:24:50,138 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:24:50,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-01-28 22:24:50,169 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:67, output treesize:49 [2018-01-28 22:24:50,270 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 104 proven. 54 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-01-28 22:24:50,303 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:24:50,303 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15] total 24 [2018-01-28 22:24:50,303 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-28 22:24:50,303 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-28 22:24:50,304 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=474, Unknown=2, NotChecked=0, Total=552 [2018-01-28 22:24:50,304 INFO L87 Difference]: Start difference. First operand 238 states and 255 transitions. Second operand 24 states. [2018-01-28 22:24:57,650 WARN L143 SmtUtils]: Spent 4036ms on a formula simplification that was a NOOP. DAG size: 57 [2018-01-28 22:24:59,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:24:59,745 INFO L93 Difference]: Finished difference Result 537 states and 589 transitions. [2018-01-28 22:24:59,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-28 22:24:59,745 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 83 [2018-01-28 22:24:59,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:24:59,747 INFO L225 Difference]: With dead ends: 537 [2018-01-28 22:24:59,747 INFO L226 Difference]: Without dead ends: 302 [2018-01-28 22:24:59,748 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=286, Invalid=1601, Unknown=5, NotChecked=0, Total=1892 [2018-01-28 22:24:59,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-01-28 22:24:59,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 254. [2018-01-28 22:24:59,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-01-28 22:24:59,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 276 transitions. [2018-01-28 22:24:59,782 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 276 transitions. Word has length 83 [2018-01-28 22:24:59,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:24:59,782 INFO L432 AbstractCegarLoop]: Abstraction has 254 states and 276 transitions. [2018-01-28 22:24:59,782 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-28 22:24:59,783 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 276 transitions. [2018-01-28 22:24:59,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-01-28 22:24:59,784 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:24:59,784 INFO L330 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:24:59,784 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-01-28 22:24:59,785 INFO L82 PathProgramCache]: Analyzing trace with hash -2134332011, now seen corresponding path program 1 times [2018-01-28 22:24:59,785 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:24:59,785 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:24:59,786 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:24:59,786 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 22:24:59,786 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:24:59,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:24:59,811 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:24:59,942 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2018-01-28 22:24:59,943 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:24:59,975 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:24:59,980 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:25:00,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:25:00,031 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:25:00,058 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2018-01-28 22:25:00,081 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:25:00,082 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-01-28 22:25:00,082 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:25:00,082 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:25:00,082 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:25:00,083 INFO L87 Difference]: Start difference. First operand 254 states and 276 transitions. Second operand 6 states. [2018-01-28 22:25:00,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:25:00,121 INFO L93 Difference]: Finished difference Result 254 states and 276 transitions. [2018-01-28 22:25:00,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 22:25:00,123 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2018-01-28 22:25:00,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:25:00,125 INFO L225 Difference]: With dead ends: 254 [2018-01-28 22:25:00,125 INFO L226 Difference]: Without dead ends: 253 [2018-01-28 22:25:00,126 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 97 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:25:00,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-01-28 22:25:00,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2018-01-28 22:25:00,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-01-28 22:25:00,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 275 transitions. [2018-01-28 22:25:00,147 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 275 transitions. Word has length 101 [2018-01-28 22:25:00,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:25:00,147 INFO L432 AbstractCegarLoop]: Abstraction has 253 states and 275 transitions. [2018-01-28 22:25:00,147 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:25:00,147 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 275 transitions. [2018-01-28 22:25:00,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-01-28 22:25:00,149 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:25:00,149 INFO L330 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:25:00,149 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-01-28 22:25:00,149 INFO L82 PathProgramCache]: Analyzing trace with hash -2134332010, now seen corresponding path program 1 times [2018-01-28 22:25:00,149 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:25:00,150 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:25:00,151 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:25:00,151 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:25:00,151 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:25:00,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:25:00,169 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:25:00,256 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2018-01-28 22:25:00,257 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:25:00,257 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-28 22:25:00,257 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 22:25:00,257 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 22:25:00,257 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-28 22:25:00,258 INFO L87 Difference]: Start difference. First operand 253 states and 275 transitions. Second operand 7 states. [2018-01-28 22:25:00,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:25:00,334 INFO L93 Difference]: Finished difference Result 259 states and 280 transitions. [2018-01-28 22:25:00,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 22:25:00,335 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 101 [2018-01-28 22:25:00,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:25:00,337 INFO L225 Difference]: With dead ends: 259 [2018-01-28 22:25:00,337 INFO L226 Difference]: Without dead ends: 251 [2018-01-28 22:25:00,337 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-01-28 22:25:00,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-01-28 22:25:00,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2018-01-28 22:25:00,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-01-28 22:25:00,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 272 transitions. [2018-01-28 22:25:00,366 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 272 transitions. Word has length 101 [2018-01-28 22:25:00,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:25:00,367 INFO L432 AbstractCegarLoop]: Abstraction has 251 states and 272 transitions. [2018-01-28 22:25:00,367 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-28 22:25:00,367 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 272 transitions. [2018-01-28 22:25:00,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-01-28 22:25:00,369 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:25:00,369 INFO L330 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:25:00,369 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-01-28 22:25:00,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1736953633, now seen corresponding path program 1 times [2018-01-28 22:25:00,370 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:25:00,370 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:25:00,371 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:25:00,371 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:25:00,371 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:25:00,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:25:00,394 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:25:00,486 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2018-01-28 22:25:00,486 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:25:00,486 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 22:25:00,487 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 22:25:00,487 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 22:25:00,487 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-28 22:25:00,487 INFO L87 Difference]: Start difference. First operand 251 states and 272 transitions. Second operand 7 states. [2018-01-28 22:25:00,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:25:00,771 INFO L93 Difference]: Finished difference Result 251 states and 272 transitions. [2018-01-28 22:25:00,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-28 22:25:00,771 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-01-28 22:25:00,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:25:00,773 INFO L225 Difference]: With dead ends: 251 [2018-01-28 22:25:00,773 INFO L226 Difference]: Without dead ends: 250 [2018-01-28 22:25:00,773 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-01-28 22:25:00,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-01-28 22:25:00,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2018-01-28 22:25:00,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-01-28 22:25:00,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 271 transitions. [2018-01-28 22:25:00,794 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 271 transitions. Word has length 102 [2018-01-28 22:25:00,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:25:00,794 INFO L432 AbstractCegarLoop]: Abstraction has 250 states and 271 transitions. [2018-01-28 22:25:00,794 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-28 22:25:00,794 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 271 transitions. [2018-01-28 22:25:00,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-01-28 22:25:00,795 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:25:00,795 INFO L330 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:25:00,795 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-01-28 22:25:00,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1736953632, now seen corresponding path program 1 times [2018-01-28 22:25:00,795 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:25:00,795 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:25:00,796 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:25:00,796 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:25:00,796 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:25:00,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:25:00,815 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:25:01,088 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2018-01-28 22:25:01,088 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:25:01,088 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-28 22:25:01,088 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 22:25:01,089 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 22:25:01,089 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-28 22:25:01,089 INFO L87 Difference]: Start difference. First operand 250 states and 271 transitions. Second operand 9 states. [2018-01-28 22:25:01,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:25:01,480 INFO L93 Difference]: Finished difference Result 250 states and 271 transitions. [2018-01-28 22:25:01,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 22:25:01,480 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2018-01-28 22:25:01,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:25:01,482 INFO L225 Difference]: With dead ends: 250 [2018-01-28 22:25:01,482 INFO L226 Difference]: Without dead ends: 249 [2018-01-28 22:25:01,483 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-01-28 22:25:01,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-01-28 22:25:01,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2018-01-28 22:25:01,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-01-28 22:25:01,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 270 transitions. [2018-01-28 22:25:01,512 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 270 transitions. Word has length 102 [2018-01-28 22:25:01,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:25:01,513 INFO L432 AbstractCegarLoop]: Abstraction has 249 states and 270 transitions. [2018-01-28 22:25:01,513 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 22:25:01,513 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 270 transitions. [2018-01-28 22:25:01,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-01-28 22:25:01,514 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:25:01,515 INFO L330 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:25:01,515 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-01-28 22:25:01,515 INFO L82 PathProgramCache]: Analyzing trace with hash 180418712, now seen corresponding path program 1 times [2018-01-28 22:25:01,515 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:25:01,515 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:25:01,516 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:25:01,516 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:25:01,516 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:25:01,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:25:01,552 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:25:01,826 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2018-01-28 22:25:01,827 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:25:01,827 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:25:01,855 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:25:01,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:25:01,912 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:25:01,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-28 22:25:01,931 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:25:01,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-28 22:25:01,950 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:25:01,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:25:01,993 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-28 22:25:06,693 WARN L146 SmtUtils]: Spent 158ms on a formula simplification. DAG size of input: 116 DAG size of output 35 [2018-01-28 22:25:06,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 46 [2018-01-28 22:25:06,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-28 22:25:06,815 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:25:06,829 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:25:06,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 37 [2018-01-28 22:25:06,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-28 22:25:06,865 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:25:06,872 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:25:06,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 50 [2018-01-28 22:25:06,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-28 22:25:06,898 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-28 22:25:06,907 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:25:06,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 46 [2018-01-28 22:25:06,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-28 22:25:06,931 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-28 22:25:06,939 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:25:06,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-01-28 22:25:06,959 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 10 variables, input treesize:103, output treesize:76 [2018-01-28 22:25:07,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2018-01-28 22:25:07,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-01-28 22:25:07,111 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:25:07,126 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:25:07,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2018-01-28 22:25:07,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-01-28 22:25:07,167 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:25:07,177 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:25:07,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2018-01-28 22:25:07,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2018-01-28 22:25:07,212 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-28 22:25:07,221 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:25:07,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2018-01-28 22:25:07,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-01-28 22:25:07,247 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-28 22:25:07,254 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:25:07,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-01-28 22:25:07,271 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 12 variables, input treesize:112, output treesize:52 [2018-01-28 22:25:07,402 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 160 proven. 28 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-01-28 22:25:07,422 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:25:07,423 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15] total 24 [2018-01-28 22:25:07,423 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-28 22:25:07,423 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-28 22:25:07,423 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=488, Unknown=2, NotChecked=0, Total=552 [2018-01-28 22:25:07,423 INFO L87 Difference]: Start difference. First operand 249 states and 270 transitions. Second operand 24 states. [2018-01-28 22:25:10,249 WARN L146 SmtUtils]: Spent 248ms on a formula simplification. DAG size of input: 37 DAG size of output 34 [2018-01-28 22:25:10,696 WARN L146 SmtUtils]: Spent 183ms on a formula simplification. DAG size of input: 70 DAG size of output 64 [2018-01-28 22:25:18,847 WARN L143 SmtUtils]: Spent 8100ms on a formula simplification that was a NOOP. DAG size: 39 [2018-01-28 22:25:26,951 WARN L143 SmtUtils]: Spent 8060ms on a formula simplification that was a NOOP. DAG size: 42 [2018-01-28 22:25:35,100 WARN L143 SmtUtils]: Spent 8063ms on a formula simplification that was a NOOP. DAG size: 39 [2018-01-28 22:25:45,486 WARN L143 SmtUtils]: Spent 8056ms on a formula simplification that was a NOOP. DAG size: 36 [2018-01-28 22:25:46,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:25:46,019 INFO L93 Difference]: Finished difference Result 508 states and 553 transitions. [2018-01-28 22:25:46,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-28 22:25:46,019 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 105 [2018-01-28 22:25:46,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:25:46,021 INFO L225 Difference]: With dead ends: 508 [2018-01-28 22:25:46,021 INFO L226 Difference]: Without dead ends: 275 [2018-01-28 22:25:46,022 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 95 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 38.7s TimeCoverageRelationStatistics Valid=239, Invalid=1651, Unknown=2, NotChecked=0, Total=1892 [2018-01-28 22:25:46,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-01-28 22:25:46,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 257. [2018-01-28 22:25:46,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-01-28 22:25:46,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 281 transitions. [2018-01-28 22:25:46,047 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 281 transitions. Word has length 105 [2018-01-28 22:25:46,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:25:46,047 INFO L432 AbstractCegarLoop]: Abstraction has 257 states and 281 transitions. [2018-01-28 22:25:46,047 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-28 22:25:46,048 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 281 transitions. [2018-01-28 22:25:46,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-01-28 22:25:46,048 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:25:46,049 INFO L330 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:25:46,049 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-01-28 22:25:46,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1589141483, now seen corresponding path program 1 times [2018-01-28 22:25:46,049 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:25:46,049 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:25:46,050 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:25:46,050 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:25:46,050 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:25:46,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:25:46,081 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:25:46,399 WARN L146 SmtUtils]: Spent 158ms on a formula simplification. DAG size of input: 30 DAG size of output 24 [2018-01-28 22:25:46,480 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 97 proven. 163 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2018-01-28 22:25:46,480 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:25:46,481 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:25:46,488 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:25:46,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:25:46,531 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:25:46,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-28 22:25:46,545 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:25:46,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-28 22:25:46,562 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:25:46,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:25:46,578 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-28 22:25:48,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 46 [2018-01-28 22:25:48,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-28 22:25:48,090 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:25:48,098 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:25:48,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 37 [2018-01-28 22:25:48,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-28 22:25:48,126 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:25:48,133 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:25:48,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 50 [2018-01-28 22:25:48,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-28 22:25:48,159 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-28 22:25:48,168 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:25:48,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 46 [2018-01-28 22:25:48,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-28 22:25:48,192 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-28 22:25:48,200 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:25:48,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-01-28 22:25:48,226 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 10 variables, input treesize:103, output treesize:76 [2018-01-28 22:25:48,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2018-01-28 22:25:48,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-01-28 22:25:48,374 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:25:48,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:25:48,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2018-01-28 22:25:48,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-01-28 22:25:48,404 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:25:48,410 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:25:48,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2018-01-28 22:25:48,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2018-01-28 22:25:48,432 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-28 22:25:48,439 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:25:48,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2018-01-28 22:25:48,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-01-28 22:25:48,458 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-28 22:25:48,463 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:25:48,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-01-28 22:25:48,478 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 12 variables, input treesize:112, output treesize:52 [2018-01-28 22:25:48,573 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 215 proven. 45 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2018-01-28 22:25:48,594 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:25:48,594 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16] total 26 [2018-01-28 22:25:48,594 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-28 22:25:48,595 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-28 22:25:48,595 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=551, Unknown=0, NotChecked=0, Total=650 [2018-01-28 22:25:48,595 INFO L87 Difference]: Start difference. First operand 257 states and 281 transitions. Second operand 26 states. [2018-01-28 22:25:50,722 WARN L146 SmtUtils]: Spent 2031ms on a formula simplification. DAG size of input: 28 DAG size of output 25 [2018-01-28 22:25:51,404 WARN L146 SmtUtils]: Spent 185ms on a formula simplification. DAG size of input: 68 DAG size of output 61 [2018-01-28 22:25:52,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:25:52,589 INFO L93 Difference]: Finished difference Result 520 states and 574 transitions. [2018-01-28 22:25:52,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-28 22:25:52,590 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 113 [2018-01-28 22:25:52,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:25:52,591 INFO L225 Difference]: With dead ends: 520 [2018-01-28 22:25:52,591 INFO L226 Difference]: Without dead ends: 261 [2018-01-28 22:25:52,593 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=157, Invalid=899, Unknown=0, NotChecked=0, Total=1056 [2018-01-28 22:25:52,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-01-28 22:25:52,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 256. [2018-01-28 22:25:52,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-01-28 22:25:52,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 277 transitions. [2018-01-28 22:25:52,634 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 277 transitions. Word has length 113 [2018-01-28 22:25:52,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:25:52,635 INFO L432 AbstractCegarLoop]: Abstraction has 256 states and 277 transitions. [2018-01-28 22:25:52,635 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-28 22:25:52,635 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 277 transitions. [2018-01-28 22:25:52,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-01-28 22:25:52,636 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:25:52,636 INFO L330 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:25:52,637 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-01-28 22:25:52,637 INFO L82 PathProgramCache]: Analyzing trace with hash -971802483, now seen corresponding path program 2 times [2018-01-28 22:25:52,637 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:25:52,637 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:25:52,638 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:25:52,638 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:25:52,638 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:25:52,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:25:52,683 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:25:53,069 INFO L134 CoverageAnalysis]: Checked inductivity of 696 backedges. 164 proven. 230 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2018-01-28 22:25:53,069 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:25:53,069 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:25:53,075 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 22:25:53,099 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 22:25:53,123 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 22:25:53,128 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 22:25:53,133 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:25:53,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-28 22:25:53,142 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:25:53,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-28 22:25:53,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:25:53,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:25:53,166 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-28 22:25:53,835 WARN L146 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 99 DAG size of output 35 [2018-01-28 22:25:54,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 49 [2018-01-28 22:25:54,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-28 22:25:54,099 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:25:54,127 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:25:54,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 53 [2018-01-28 22:25:54,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-28 22:25:54,254 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:25:54,292 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:25:54,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 40 [2018-01-28 22:25:54,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-28 22:25:54,326 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-28 22:25:54,335 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:25:54,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 49 [2018-01-28 22:25:54,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-28 22:25:54,363 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-28 22:25:54,373 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:25:54,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-01-28 22:25:54,396 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 12 variables, input treesize:109, output treesize:76 [2018-01-28 22:25:54,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2018-01-28 22:25:54,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-01-28 22:25:54,513 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:25:54,527 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:25:54,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2018-01-28 22:25:54,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-01-28 22:25:54,573 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:25:54,583 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:25:54,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2018-01-28 22:25:54,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2018-01-28 22:25:54,617 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-28 22:25:54,627 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:25:54,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2018-01-28 22:25:54,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-01-28 22:25:54,679 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-28 22:25:54,686 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:25:54,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-01-28 22:25:54,710 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 12 variables, input treesize:112, output treesize:52 [2018-01-28 22:25:56,780 WARN L143 SmtUtils]: Spent 2018ms on a formula simplification that was a NOOP. DAG size: 34 [2018-01-28 22:25:56,819 INFO L134 CoverageAnalysis]: Checked inductivity of 696 backedges. 328 proven. 66 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2018-01-28 22:25:56,840 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:25:56,840 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17] total 28 [2018-01-28 22:25:56,840 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-28 22:25:56,840 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-28 22:25:56,841 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=639, Unknown=0, NotChecked=0, Total=756 [2018-01-28 22:25:56,841 INFO L87 Difference]: Start difference. First operand 256 states and 277 transitions. Second operand 28 states. [2018-01-28 22:25:57,805 WARN L146 SmtUtils]: Spent 161ms on a formula simplification. DAG size of input: 71 DAG size of output 64 [2018-01-28 22:25:58,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:25:58,546 INFO L93 Difference]: Finished difference Result 518 states and 567 transitions. [2018-01-28 22:25:58,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-28 22:25:58,578 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 129 [2018-01-28 22:25:58,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:25:58,579 INFO L225 Difference]: With dead ends: 518 [2018-01-28 22:25:58,580 INFO L226 Difference]: Without dead ends: 265 [2018-01-28 22:25:58,581 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=169, Invalid=953, Unknown=0, NotChecked=0, Total=1122 [2018-01-28 22:25:58,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-01-28 22:25:58,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 260. [2018-01-28 22:25:58,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-01-28 22:25:58,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 281 transitions. [2018-01-28 22:25:58,624 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 281 transitions. Word has length 129 [2018-01-28 22:25:58,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:25:58,625 INFO L432 AbstractCegarLoop]: Abstraction has 260 states and 281 transitions. [2018-01-28 22:25:58,625 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-28 22:25:58,625 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 281 transitions. [2018-01-28 22:25:58,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-01-28 22:25:58,626 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:25:58,626 INFO L330 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:25:58,626 INFO L371 AbstractCegarLoop]: === Iteration 15 === [ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-01-28 22:25:58,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1534878201, now seen corresponding path program 3 times [2018-01-28 22:25:58,627 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:25:58,627 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:25:58,628 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:25:58,628 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 22:25:58,628 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:25:58,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:25:58,674 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:25:59,041 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 46 DAG size of output 40 [2018-01-28 22:25:59,347 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 917 trivial. 0 not checked. [2018-01-28 22:25:59,347 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:25:59,348 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:25:59,355 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-28 22:25:59,381 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 22:25:59,397 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 22:25:59,417 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 22:25:59,432 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 22:25:59,438 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:25:59,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-01-28 22:25:59,458 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:25:59,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-01-28 22:25:59,461 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:25:59,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-01-28 22:25:59,478 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:25:59,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-01-28 22:25:59,495 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:25:59,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:25:59,510 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-28 22:25:59,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-01-28 22:25:59,767 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:25:59,782 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:25:59,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-01-28 22:25:59,783 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:25:59,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-01-28 22:25:59,796 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:25:59,813 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:25:59,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-01-28 22:25:59,815 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:25:59,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-01-28 22:25:59,828 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:53, output treesize:39 [2018-01-28 22:26:00,003 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:00,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 41 [2018-01-28 22:26:00,005 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:00,034 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:00,035 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:00,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 53 [2018-01-28 22:26:00,035 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:00,068 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:00,069 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:00,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 41 [2018-01-28 22:26:00,070 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:00,100 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:00,101 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:00,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 43 [2018-01-28 22:26:00,102 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:00,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-28 22:26:00,128 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:79, output treesize:69 [2018-01-28 22:26:00,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2018-01-28 22:26:00,293 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:00,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2018-01-28 22:26:00,305 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:00,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-01-28 22:26:00,317 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:00,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2018-01-28 22:26:00,329 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:00,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-01-28 22:26:00,337 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:41, output treesize:29 [2018-01-28 22:26:08,603 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:08,604 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:08,605 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:08,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2018-01-28 22:26:08,606 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:08,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2018-01-28 22:26:08,678 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:08,749 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:08,750 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:08,751 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:08,752 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:08,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2018-01-28 22:26:08,753 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:08,843 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:08,846 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:08,846 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:08,847 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:08,849 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:08,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 82 [2018-01-28 22:26:08,850 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:08,945 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:08,946 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:08,947 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:08,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 63 [2018-01-28 22:26:08,949 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:09,046 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:09,047 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:09,049 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:09,050 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:09,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 82 [2018-01-28 22:26:09,051 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:09,146 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:09,147 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:09,147 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:09,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 47 [2018-01-28 22:26:09,148 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:09,219 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:09,220 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:09,221 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:09,221 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:09,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 49 [2018-01-28 22:26:09,222 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:09,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 8 dim-1 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2018-01-28 22:26:09,282 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 16 variables, input treesize:213, output treesize:165 [2018-01-28 22:26:09,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 49 [2018-01-28 22:26:09,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-28 22:26:09,408 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:09,425 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:26:09,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 55 [2018-01-28 22:26:09,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-28 22:26:09,517 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:09,530 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:26:09,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 51 [2018-01-28 22:26:09,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-28 22:26:09,605 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:09,616 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:26:09,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 49 [2018-01-28 22:26:09,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-28 22:26:09,685 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:09,695 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:26:09,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 4 dim-2 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2018-01-28 22:26:09,758 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 16 variables, input treesize:217, output treesize:213 [2018-01-28 22:26:13,889 WARN L143 SmtUtils]: Spent 4068ms on a formula simplification that was a NOOP. DAG size: 80 [2018-01-28 22:26:13,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2018-01-28 22:26:13,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2018-01-28 22:26:13,908 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:26:13,917 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:26:13,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2018-01-28 22:26:13,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-01-28 22:26:13,977 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:26:13,987 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:26:14,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 57 [2018-01-28 22:26:14,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2018-01-28 22:26:14,046 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:26:14,057 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:26:14,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 43 [2018-01-28 22:26:14,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-01-28 22:26:14,116 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:26:14,130 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:26:14,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 4 dim-2 vars, End of recursive call: 16 dim-0 vars, and 4 xjuncts. [2018-01-28 22:26:14,189 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 20 variables, input treesize:213, output treesize:165 [2018-01-28 22:26:26,482 WARN L146 SmtUtils]: Spent 10177ms on a formula simplification. DAG size of input: 91 DAG size of output 71 [2018-01-28 22:26:26,606 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 2 proven. 442 refuted. 0 times theorem prover too weak. 489 trivial. 0 not checked. [2018-01-28 22:26:26,626 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:26:26,626 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18] total 29 [2018-01-28 22:26:26,627 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-28 22:26:26,627 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-28 22:26:26,627 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=743, Unknown=9, NotChecked=0, Total=870 [2018-01-28 22:26:26,627 INFO L87 Difference]: Start difference. First operand 260 states and 281 transitions. Second operand 30 states. [2018-01-28 22:26:27,085 WARN L146 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 102 DAG size of output 50 [2018-01-28 22:26:27,758 WARN L146 SmtUtils]: Spent 161ms on a formula simplification. DAG size of input: 88 DAG size of output 56 [2018-01-28 22:26:28,167 WARN L146 SmtUtils]: Spent 357ms on a formula simplification. DAG size of input: 117 DAG size of output 104 [2018-01-28 22:26:28,352 WARN L146 SmtUtils]: Spent 146ms on a formula simplification. DAG size of input: 93 DAG size of output 88 [2018-01-28 22:26:28,645 WARN L146 SmtUtils]: Spent 197ms on a formula simplification. DAG size of input: 89 DAG size of output 87 [2018-01-28 22:26:30,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:26:30,688 INFO L93 Difference]: Finished difference Result 324 states and 343 transitions. [2018-01-28 22:26:30,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-28 22:26:30,688 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 141 [2018-01-28 22:26:30,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:26:30,690 INFO L225 Difference]: With dead ends: 324 [2018-01-28 22:26:30,690 INFO L226 Difference]: Without dead ends: 323 [2018-01-28 22:26:30,691 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 125 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 27.4s TimeCoverageRelationStatistics Valid=310, Invalid=1843, Unknown=9, NotChecked=0, Total=2162 [2018-01-28 22:26:30,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-01-28 22:26:30,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 259. [2018-01-28 22:26:30,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-01-28 22:26:30,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 280 transitions. [2018-01-28 22:26:30,746 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 280 transitions. Word has length 141 [2018-01-28 22:26:30,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:26:30,747 INFO L432 AbstractCegarLoop]: Abstraction has 259 states and 280 transitions. [2018-01-28 22:26:30,747 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-28 22:26:30,747 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 280 transitions. [2018-01-28 22:26:30,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-01-28 22:26:30,748 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:26:30,749 INFO L330 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:26:30,749 INFO L371 AbstractCegarLoop]: === Iteration 16 === [ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-01-28 22:26:30,749 INFO L82 PathProgramCache]: Analyzing trace with hash 896335029, now seen corresponding path program 1 times [2018-01-28 22:26:30,749 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:26:30,749 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:26:30,750 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:26:30,750 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 22:26:30,750 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:26:30,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:26:30,779 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:26:30,897 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 933 trivial. 0 not checked. [2018-01-28 22:26:30,897 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:26:30,897 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 22:26:30,898 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 22:26:30,898 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 22:26:30,898 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-28 22:26:30,898 INFO L87 Difference]: Start difference. First operand 259 states and 280 transitions. Second operand 7 states. [2018-01-28 22:26:31,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:26:31,119 INFO L93 Difference]: Finished difference Result 269 states and 291 transitions. [2018-01-28 22:26:31,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 22:26:31,119 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 149 [2018-01-28 22:26:31,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:26:31,121 INFO L225 Difference]: With dead ends: 269 [2018-01-28 22:26:31,121 INFO L226 Difference]: Without dead ends: 268 [2018-01-28 22:26:31,122 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-28 22:26:31,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-01-28 22:26:31,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 258. [2018-01-28 22:26:31,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-01-28 22:26:31,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 279 transitions. [2018-01-28 22:26:31,163 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 279 transitions. Word has length 149 [2018-01-28 22:26:31,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:26:31,164 INFO L432 AbstractCegarLoop]: Abstraction has 258 states and 279 transitions. [2018-01-28 22:26:31,164 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-28 22:26:31,164 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 279 transitions. [2018-01-28 22:26:31,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-01-28 22:26:31,165 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:26:31,165 INFO L330 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:26:31,165 INFO L371 AbstractCegarLoop]: === Iteration 17 === [ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-01-28 22:26:31,165 INFO L82 PathProgramCache]: Analyzing trace with hash 896335030, now seen corresponding path program 1 times [2018-01-28 22:26:31,166 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:26:31,166 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:26:31,166 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:26:31,167 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:26:31,167 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:26:31,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:26:31,199 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:26:31,433 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 925 trivial. 0 not checked. [2018-01-28 22:26:31,433 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:26:31,433 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:26:31,439 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:26:31,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:26:31,508 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:26:31,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-28 22:26:31,516 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:31,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-28 22:26:31,533 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:31,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:26:31,551 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-28 22:26:32,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 46 [2018-01-28 22:26:32,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-28 22:26:32,482 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:32,491 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:26:32,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 37 [2018-01-28 22:26:32,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-28 22:26:32,524 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:32,531 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:26:32,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 50 [2018-01-28 22:26:32,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-28 22:26:32,588 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:32,606 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:26:32,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 46 [2018-01-28 22:26:32,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-28 22:26:32,642 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:32,656 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:26:32,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-01-28 22:26:32,684 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 10 variables, input treesize:103, output treesize:76 [2018-01-28 22:26:32,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2018-01-28 22:26:32,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2018-01-28 22:26:32,770 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:32,777 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:26:32,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2018-01-28 22:26:32,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-01-28 22:26:32,803 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:32,809 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:26:32,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2018-01-28 22:26:32,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-01-28 22:26:32,834 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:32,844 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:26:32,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2018-01-28 22:26:32,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-01-28 22:26:32,867 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:32,874 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:26:32,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-01-28 22:26:32,893 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 12 variables, input treesize:112, output treesize:52 [2018-01-28 22:26:33,008 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 436 proven. 91 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2018-01-28 22:26:33,028 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:26:33,028 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 18] total 27 [2018-01-28 22:26:33,028 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-28 22:26:33,028 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-28 22:26:33,028 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=632, Unknown=0, NotChecked=0, Total=702 [2018-01-28 22:26:33,029 INFO L87 Difference]: Start difference. First operand 258 states and 279 transitions. Second operand 27 states. [2018-01-28 22:26:35,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:26:35,327 INFO L93 Difference]: Finished difference Result 523 states and 568 transitions. [2018-01-28 22:26:35,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-01-28 22:26:35,327 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 149 [2018-01-28 22:26:35,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:26:35,329 INFO L225 Difference]: With dead ends: 523 [2018-01-28 22:26:35,329 INFO L226 Difference]: Without dead ends: 281 [2018-01-28 22:26:35,330 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=172, Invalid=1720, Unknown=0, NotChecked=0, Total=1892 [2018-01-28 22:26:35,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-01-28 22:26:35,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 266. [2018-01-28 22:26:35,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-01-28 22:26:35,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 290 transitions. [2018-01-28 22:26:35,365 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 290 transitions. Word has length 149 [2018-01-28 22:26:35,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:26:35,365 INFO L432 AbstractCegarLoop]: Abstraction has 266 states and 290 transitions. [2018-01-28 22:26:35,365 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-28 22:26:35,366 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 290 transitions. [2018-01-28 22:26:35,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-01-28 22:26:35,367 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:26:35,367 INFO L330 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:26:35,367 INFO L371 AbstractCegarLoop]: === Iteration 18 === [ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-01-28 22:26:35,367 INFO L82 PathProgramCache]: Analyzing trace with hash 358242101, now seen corresponding path program 1 times [2018-01-28 22:26:35,367 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:26:35,367 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:26:35,368 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:26:35,368 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:26:35,368 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:26:35,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:26:35,400 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:26:35,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1020 backedges. 225 proven. 337 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2018-01-28 22:26:35,914 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:26:35,939 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:26:35,946 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:26:35,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:26:36,004 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:26:36,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-01-28 22:26:36,010 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:36,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-01-28 22:26:36,026 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:36,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-01-28 22:26:36,040 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:36,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-01-28 22:26:36,041 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:36,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:26:36,054 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-28 22:26:37,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-28 22:26:37,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:37,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2018-01-28 22:26:37,097 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:37,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-01-28 22:26:37,107 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:37,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-01-28 22:26:37,115 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:37,123 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-01-28 22:26:37,123 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:41, output treesize:29 [2018-01-28 22:26:37,275 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:37,276 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:37,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 76 [2018-01-28 22:26:37,276 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:37,355 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:37,356 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:37,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 56 [2018-01-28 22:26:37,357 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:37,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 55 [2018-01-28 22:26:37,427 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:37,495 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:37,495 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:37,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2018-01-28 22:26:37,496 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:37,564 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:37,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 53 [2018-01-28 22:26:37,565 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:37,632 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:37,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 51 [2018-01-28 22:26:37,634 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:37,695 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:37,695 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:37,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 49 [2018-01-28 22:26:37,696 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:37,755 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:37,755 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:37,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2018-01-28 22:26:37,756 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:37,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 8 dim-1 vars, End of recursive call: 16 dim-0 vars, and 4 xjuncts. [2018-01-28 22:26:37,811 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 24 variables, input treesize:259, output treesize:181 [2018-01-28 22:26:38,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1020 backedges. 469 proven. 338 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2018-01-28 22:26:38,085 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:26:38,085 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 37 [2018-01-28 22:26:38,086 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-01-28 22:26:38,086 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-01-28 22:26:38,086 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1156, Unknown=0, NotChecked=0, Total=1332 [2018-01-28 22:26:38,086 INFO L87 Difference]: Start difference. First operand 266 states and 290 transitions. Second operand 37 states. [2018-01-28 22:26:39,633 WARN L146 SmtUtils]: Spent 128ms on a formula simplification. DAG size of input: 82 DAG size of output 74 [2018-01-28 22:26:39,958 WARN L146 SmtUtils]: Spent 224ms on a formula simplification. DAG size of input: 99 DAG size of output 91 [2018-01-28 22:26:40,566 WARN L143 SmtUtils]: Spent 122ms on a formula simplification that was a NOOP. DAG size: 135 [2018-01-28 22:26:43,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:26:43,698 INFO L93 Difference]: Finished difference Result 566 states and 605 transitions. [2018-01-28 22:26:43,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-01-28 22:26:43,698 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 157 [2018-01-28 22:26:43,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:26:43,699 INFO L225 Difference]: With dead ends: 566 [2018-01-28 22:26:43,700 INFO L226 Difference]: Without dead ends: 312 [2018-01-28 22:26:43,701 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 142 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 788 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=385, Invalid=2585, Unknown=0, NotChecked=0, Total=2970 [2018-01-28 22:26:43,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-01-28 22:26:43,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 266. [2018-01-28 22:26:43,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-01-28 22:26:43,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 289 transitions. [2018-01-28 22:26:43,746 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 289 transitions. Word has length 157 [2018-01-28 22:26:43,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:26:43,746 INFO L432 AbstractCegarLoop]: Abstraction has 266 states and 289 transitions. [2018-01-28 22:26:43,746 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-01-28 22:26:43,746 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 289 transitions. [2018-01-28 22:26:43,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-01-28 22:26:43,747 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:26:43,747 INFO L330 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:26:43,747 INFO L371 AbstractCegarLoop]: === Iteration 19 === [ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-01-28 22:26:43,747 INFO L82 PathProgramCache]: Analyzing trace with hash 2074058675, now seen corresponding path program 2 times [2018-01-28 22:26:43,748 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:26:43,748 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:26:43,748 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:26:43,748 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:26:43,748 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:26:43,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:26:43,777 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:26:44,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1111 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2018-01-28 22:26:44,156 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:26:44,156 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:26:44,164 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 22:26:44,192 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 22:26:44,195 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 22:26:44,200 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:26:44,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-28 22:26:44,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-28 22:26:44,222 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:44,223 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:26:44,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:26:44,226 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-01-28 22:26:44,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-01-28 22:26:44,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-01-28 22:26:44,293 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:44,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:26:44,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:26:44,295 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2018-01-28 22:26:44,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1111 trivial. 0 not checked. [2018-01-28 22:26:44,379 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-28 22:26:44,379 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 23 [2018-01-28 22:26:44,380 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-28 22:26:44,380 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-28 22:26:44,380 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2018-01-28 22:26:44,381 INFO L87 Difference]: Start difference. First operand 266 states and 289 transitions. Second operand 23 states. [2018-01-28 22:26:45,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:26:45,070 INFO L93 Difference]: Finished difference Result 528 states and 577 transitions. [2018-01-28 22:26:45,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-28 22:26:45,071 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 161 [2018-01-28 22:26:45,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:26:45,072 INFO L225 Difference]: With dead ends: 528 [2018-01-28 22:26:45,072 INFO L226 Difference]: Without dead ends: 265 [2018-01-28 22:26:45,073 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=127, Invalid=929, Unknown=0, NotChecked=0, Total=1056 [2018-01-28 22:26:45,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-01-28 22:26:45,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 260. [2018-01-28 22:26:45,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-01-28 22:26:45,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 281 transitions. [2018-01-28 22:26:45,121 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 281 transitions. Word has length 161 [2018-01-28 22:26:45,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:26:45,121 INFO L432 AbstractCegarLoop]: Abstraction has 260 states and 281 transitions. [2018-01-28 22:26:45,122 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-28 22:26:45,122 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 281 transitions. [2018-01-28 22:26:45,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-01-28 22:26:45,123 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:26:45,123 INFO L330 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:26:45,123 INFO L371 AbstractCegarLoop]: === Iteration 20 === [ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-01-28 22:26:45,123 INFO L82 PathProgramCache]: Analyzing trace with hash 103823282, now seen corresponding path program 1 times [2018-01-28 22:26:45,123 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:26:45,123 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:26:45,124 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:26:45,124 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 22:26:45,125 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:26:45,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:26:45,165 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:26:45,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1206 backedges. 560 proven. 120 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2018-01-28 22:26:45,566 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:26:45,566 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:26:45,571 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:26:45,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:26:45,623 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:26:45,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-01-28 22:26:45,626 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:45,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-01-28 22:26:45,640 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:45,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-01-28 22:26:45,654 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:45,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-01-28 22:26:45,655 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:45,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:26:45,668 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-28 22:26:46,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-01-28 22:26:46,755 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:46,768 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:46,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-01-28 22:26:46,769 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:46,781 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:46,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-01-28 22:26:46,781 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:46,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2018-01-28 22:26:46,791 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:46,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-01-28 22:26:46,801 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:53, output treesize:39 [2018-01-28 22:26:47,036 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:47,037 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:47,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 70 [2018-01-28 22:26:47,038 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:47,135 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:47,136 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:47,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 62 [2018-01-28 22:26:47,137 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:47,231 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:47,232 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:47,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 65 [2018-01-28 22:26:47,233 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:47,343 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:47,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 53 [2018-01-28 22:26:47,345 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:47,438 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:47,439 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:47,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 53 [2018-01-28 22:26:47,439 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:47,523 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:47,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 64 [2018-01-28 22:26:47,525 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:47,612 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:47,613 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:47,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 55 [2018-01-28 22:26:47,614 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:47,691 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:47,692 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:47,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 64 [2018-01-28 22:26:47,692 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:47,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 8 dim-1 vars, End of recursive call: 16 dim-0 vars, and 4 xjuncts. [2018-01-28 22:26:47,758 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 24 variables, input treesize:233, output treesize:203 [2018-01-28 22:26:48,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2018-01-28 22:26:48,036 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:48,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2018-01-28 22:26:48,047 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:48,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2018-01-28 22:26:48,057 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:48,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-01-28 22:26:48,067 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:48,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-01-28 22:26:48,075 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:41, output treesize:29 [2018-01-28 22:26:48,394 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:48,394 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:48,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 85 [2018-01-28 22:26:48,398 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:48,739 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:48,740 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:48,762 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:48,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 70 [2018-01-28 22:26:48,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:49,053 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:49,054 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:49,055 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:49,058 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:49,059 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:49,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 90 [2018-01-28 22:26:49,061 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:49,354 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:49,355 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:49,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 76 [2018-01-28 22:26:49,358 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:49,640 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:49,640 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:49,641 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:49,642 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:49,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 59 [2018-01-28 22:26:49,642 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:49,927 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:49,928 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:49,929 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:49,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 61 [2018-01-28 22:26:49,929 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:50,205 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:50,206 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:50,207 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:50,207 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:50,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 67 [2018-01-28 22:26:50,208 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:50,470 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:50,471 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:50,472 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:50,472 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:50,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 62 [2018-01-28 22:26:50,473 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:50,732 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:50,733 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:50,734 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:50,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 79 [2018-01-28 22:26:50,735 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:50,989 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:50,990 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:50,991 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:50,992 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:50,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 99 [2018-01-28 22:26:50,993 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:51,253 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:51,254 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:51,255 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:51,256 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:51,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 94 [2018-01-28 22:26:51,257 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:51,502 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:51,503 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:51,504 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:51,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 68 [2018-01-28 22:26:51,504 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:51,737 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:51,737 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:51,738 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:51,739 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:51,740 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:51,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 101 [2018-01-28 22:26:51,741 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:52,021 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:52,022 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:52,022 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:52,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 59 [2018-01-28 22:26:52,023 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:52,236 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:52,237 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:52,239 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:52,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 82 [2018-01-28 22:26:52,240 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:52,449 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:52,450 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:52,451 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:52,451 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:26:52,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 68 [2018-01-28 22:26:52,452 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:52,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 40 dim-0 vars, 16 dim-1 vars, End of recursive call: 40 dim-0 vars, and 8 xjuncts. [2018-01-28 22:26:52,656 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 56 variables, input treesize:557, output treesize:461 [2018-01-28 22:26:53,126 WARN L143 SmtUtils]: Spent 278ms on a formula simplification that was a NOOP. DAG size: 237 [2018-01-28 22:26:53,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 70 [2018-01-28 22:26:53,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-28 22:26:53,140 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:53,156 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:26:53,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 70 [2018-01-28 22:26:53,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-28 22:26:53,529 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:53,545 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:26:53,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 61 [2018-01-28 22:26:53,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-28 22:26:53,906 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-28 22:26:53,920 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. Received shutdown request... [2018-01-28 22:26:54,095 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-28 22:26:54,096 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-28 22:26:54,100 WARN L185 ceAbstractionStarter]: Timeout [2018-01-28 22:26:54,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 10:26:54 BoogieIcfgContainer [2018-01-28 22:26:54,100 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-28 22:26:54,101 INFO L168 Benchmark]: Toolchain (without parser) took 130685.82 ms. Allocated memory was 308.8 MB in the beginning and 629.7 MB in the end (delta: 320.9 MB). Free memory was 267.8 MB in the beginning and 586.1 MB in the end (delta: -318.3 MB). Peak memory consumption was 292.7 MB. Max. memory is 5.3 GB. [2018-01-28 22:26:54,102 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 308.8 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-28 22:26:54,102 INFO L168 Benchmark]: CACSL2BoogieTranslator took 234.31 ms. Allocated memory is still 308.8 MB. Free memory was 267.8 MB in the beginning and 252.7 MB in the end (delta: 15.2 MB). Peak memory consumption was 15.2 MB. Max. memory is 5.3 GB. [2018-01-28 22:26:54,102 INFO L168 Benchmark]: Boogie Preprocessor took 39.66 ms. Allocated memory is still 308.8 MB. Free memory was 252.7 MB in the beginning and 250.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-28 22:26:54,102 INFO L168 Benchmark]: RCFGBuilder took 650.17 ms. Allocated memory is still 308.8 MB. Free memory was 250.7 MB in the beginning and 206.5 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 5.3 GB. [2018-01-28 22:26:54,103 INFO L168 Benchmark]: TraceAbstraction took 129751.65 ms. Allocated memory was 308.8 MB in the beginning and 629.7 MB in the end (delta: 320.9 MB). Free memory was 205.5 MB in the beginning and 586.1 MB in the end (delta: -380.6 MB). Peak memory consumption was 230.4 MB. Max. memory is 5.3 GB. [2018-01-28 22:26:54,105 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 308.8 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 234.31 ms. Allocated memory is still 308.8 MB. Free memory was 267.8 MB in the beginning and 252.7 MB in the end (delta: 15.2 MB). Peak memory consumption was 15.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 39.66 ms. Allocated memory is still 308.8 MB. Free memory was 252.7 MB in the beginning and 250.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 650.17 ms. Allocated memory is still 308.8 MB. Free memory was 250.7 MB in the beginning and 206.5 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 129751.65 ms. Allocated memory was 308.8 MB in the beginning and 629.7 MB in the end (delta: 320.9 MB). Free memory was 205.5 MB in the beginning and 586.1 MB in the end (delta: -380.6 MB). Peak memory consumption was 230.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1198). Cancelled while BasicCegarLoop was analyzing trace of length 166 with TraceHistMax 24, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 247. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1198). Cancelled while BasicCegarLoop was analyzing trace of length 166 with TraceHistMax 24, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 247. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1193). Cancelled while BasicCegarLoop was analyzing trace of length 166 with TraceHistMax 24, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 247. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1193). Cancelled while BasicCegarLoop was analyzing trace of length 166 with TraceHistMax 24, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 247. - TimeoutResultAtElement [Line: 1533]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1533). Cancelled while BasicCegarLoop was analyzing trace of length 166 with TraceHistMax 24, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 247. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1516). Cancelled while BasicCegarLoop was analyzing trace of length 166 with TraceHistMax 24, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 247. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1526). Cancelled while BasicCegarLoop was analyzing trace of length 166 with TraceHistMax 24, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 247. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1513). Cancelled while BasicCegarLoop was analyzing trace of length 166 with TraceHistMax 24, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 247. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1513). Cancelled while BasicCegarLoop was analyzing trace of length 166 with TraceHistMax 24, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 247. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1524). Cancelled while BasicCegarLoop was analyzing trace of length 166 with TraceHistMax 24, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 247. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1516). Cancelled while BasicCegarLoop was analyzing trace of length 166 with TraceHistMax 24, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 247. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1517). Cancelled while BasicCegarLoop was analyzing trace of length 166 with TraceHistMax 24, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 247. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1524). Cancelled while BasicCegarLoop was analyzing trace of length 166 with TraceHistMax 24, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 247. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1514). Cancelled while BasicCegarLoop was analyzing trace of length 166 with TraceHistMax 24, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 247. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1528). Cancelled while BasicCegarLoop was analyzing trace of length 166 with TraceHistMax 24, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 247. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1516). Cancelled while BasicCegarLoop was analyzing trace of length 166 with TraceHistMax 24, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 247. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1524). Cancelled while BasicCegarLoop was analyzing trace of length 166 with TraceHistMax 24, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 247. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1526). Cancelled while BasicCegarLoop was analyzing trace of length 166 with TraceHistMax 24, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 247. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1528). Cancelled while BasicCegarLoop was analyzing trace of length 166 with TraceHistMax 24, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 247. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1516). Cancelled while BasicCegarLoop was analyzing trace of length 166 with TraceHistMax 24, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 247. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1514). Cancelled while BasicCegarLoop was analyzing trace of length 166 with TraceHistMax 24, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 247. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1517). Cancelled while BasicCegarLoop was analyzing trace of length 166 with TraceHistMax 24, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 247. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1524). Cancelled while BasicCegarLoop was analyzing trace of length 166 with TraceHistMax 24, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 247. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1454). Cancelled while BasicCegarLoop was analyzing trace of length 166 with TraceHistMax 24, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 247. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1455). Cancelled while BasicCegarLoop was analyzing trace of length 166 with TraceHistMax 24, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 247. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1456). Cancelled while BasicCegarLoop was analyzing trace of length 166 with TraceHistMax 24, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 247. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1456). Cancelled while BasicCegarLoop was analyzing trace of length 166 with TraceHistMax 24, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 247. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1454). Cancelled while BasicCegarLoop was analyzing trace of length 166 with TraceHistMax 24, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 247. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1455). Cancelled while BasicCegarLoop was analyzing trace of length 166 with TraceHistMax 24, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 247. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1486). Cancelled while BasicCegarLoop was analyzing trace of length 166 with TraceHistMax 24, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 247. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1484). Cancelled while BasicCegarLoop was analyzing trace of length 166 with TraceHistMax 24, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 247. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1484). Cancelled while BasicCegarLoop was analyzing trace of length 166 with TraceHistMax 24, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 247. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1490). Cancelled while BasicCegarLoop was analyzing trace of length 166 with TraceHistMax 24, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 247. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1490). Cancelled while BasicCegarLoop was analyzing trace of length 166 with TraceHistMax 24, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 247. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1486). Cancelled while BasicCegarLoop was analyzing trace of length 166 with TraceHistMax 24, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 247. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1486). Cancelled while BasicCegarLoop was analyzing trace of length 166 with TraceHistMax 24, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 247. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1486). Cancelled while BasicCegarLoop was analyzing trace of length 166 with TraceHistMax 24, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 247. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1464). Cancelled while BasicCegarLoop was analyzing trace of length 166 with TraceHistMax 24, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 247. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1463). Cancelled while BasicCegarLoop was analyzing trace of length 166 with TraceHistMax 24, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 247. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1464). Cancelled while BasicCegarLoop was analyzing trace of length 166 with TraceHistMax 24, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 247. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1464). Cancelled while BasicCegarLoop was analyzing trace of length 166 with TraceHistMax 24, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 247. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1464). Cancelled while BasicCegarLoop was analyzing trace of length 166 with TraceHistMax 24, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 247. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1463). Cancelled while BasicCegarLoop was analyzing trace of length 166 with TraceHistMax 24, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 247. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1479). Cancelled while BasicCegarLoop was analyzing trace of length 166 with TraceHistMax 24, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 247. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1479). Cancelled while BasicCegarLoop was analyzing trace of length 166 with TraceHistMax 24, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 247. - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 214 locations, 45 error locations. TIMEOUT Result, 129.6s OverallTime, 20 OverallIterations, 24 TraceHistogramMax, 69.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3476 SDtfs, 3886 SDslu, 29001 SDs, 0 SdLazy, 20129 SolverSat, 707 SolverUnsat, 40 SolverUnknown, 0 SolverNotchecked, 20.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1690 GetRequests, 1247 SyntacticMatches, 21 SemanticMatches, 422 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3046 ImplicationChecksByTransitivity, 87.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=266occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 19 MinimizatonAttempts, 258 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 48.8s InterpolantComputationTime, 3240 NumberOfCodeBlocks, 3024 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 3208 ConstructedInterpolants, 397 QuantifiedInterpolants, 3472241 SizeOfPredicates, 117 NumberOfNonLiveVariables, 3731 ConjunctsInSsa, 324 ConjunctsInUnsatCore, 32 InterpolantComputations, 8 PerfectInterpolantSequences, 11689/14351 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test15_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-28_22-26-54-111.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test15_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-28_22-26-54-111.csv Completed graceful shutdown