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/mempurity-32bit-Automizer_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test15_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-20 22:22:03,861 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-20 22:22:03,863 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-20 22:22:03,876 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-20 22:22:03,877 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-20 22:22:03,878 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-20 22:22:03,879 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-20 22:22:03,880 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-20 22:22:03,883 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-20 22:22:03,884 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-20 22:22:03,884 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-20 22:22:03,885 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-20 22:22:03,886 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-20 22:22:03,887 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-20 22:22:03,887 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-20 22:22:03,890 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-20 22:22:03,892 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-20 22:22:03,894 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-20 22:22:03,895 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-20 22:22:03,896 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-20 22:22:03,899 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-20 22:22:03,899 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-20 22:22:03,899 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-20 22:22:03,900 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-20 22:22:03,901 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-20 22:22:03,902 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-20 22:22:03,902 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-20 22:22:03,903 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-20 22:22:03,903 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-20 22:22:03,903 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-20 22:22:03,904 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-20 22:22:03,904 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Camel+AI_EQ.epf [2018-01-20 22:22:03,914 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-20 22:22:03,914 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-20 22:22:03,915 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-20 22:22:03,915 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-20 22:22:03,915 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-20 22:22:03,916 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-20 22:22:03,916 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-20 22:22:03,916 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-20 22:22:03,916 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-20 22:22:03,917 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-20 22:22:03,917 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-20 22:22:03,917 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-20 22:22:03,917 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-20 22:22:03,917 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-20 22:22:03,918 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-20 22:22:03,918 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-20 22:22:03,918 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-20 22:22:03,918 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-20 22:22:03,918 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-20 22:22:03,918 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-20 22:22:03,919 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-20 22:22:03,919 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-20 22:22:03,919 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-20 22:22:03,919 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-20 22:22:03,919 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-20 22:22:03,920 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-20 22:22:03,920 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-20 22:22:03,920 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-20 22:22:03,920 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-20 22:22:03,920 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-20 22:22:03,921 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-20 22:22:03,921 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-20 22:22:03,921 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-20 22:22:03,921 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-20 22:22:03,921 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-20 22:22:03,922 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-20 22:22:03,922 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-20 22:22:03,957 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-20 22:22:03,971 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-20 22:22:03,975 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-20 22:22:03,977 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-20 22:22:03,977 INFO L276 PluginConnector]: CDTParser initialized [2018-01-20 22:22:03,978 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test15_true-valid-memsafety_true-termination.i [2018-01-20 22:22:04,204 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-20 22:22:04,210 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-20 22:22:04,211 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-20 22:22:04,211 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-20 22:22:04,218 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-20 22:22:04,219 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 10:22:04" (1/1) ... [2018-01-20 22:22:04,222 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c4b3da0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:22:04, skipping insertion in model container [2018-01-20 22:22:04,222 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 10:22:04" (1/1) ... [2018-01-20 22:22:04,241 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 22:22:04,294 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 22:22:04,428 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 22:22:04,459 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 22:22:04,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:22:04 WrapperNode [2018-01-20 22:22:04,473 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-20 22:22:04,474 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-20 22:22:04,474 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-20 22:22:04,474 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-20 22:22:04,485 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:22:04" (1/1) ... [2018-01-20 22:22:04,485 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:22:04" (1/1) ... [2018-01-20 22:22:04,497 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:22:04" (1/1) ... [2018-01-20 22:22:04,497 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:22:04" (1/1) ... [2018-01-20 22:22:04,506 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:22:04" (1/1) ... [2018-01-20 22:22:04,510 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:22:04" (1/1) ... [2018-01-20 22:22:04,513 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:22:04" (1/1) ... [2018-01-20 22:22:04,516 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-20 22:22:04,517 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-20 22:22:04,517 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-20 22:22:04,517 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-20 22:22:04,518 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:22:04" (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-20 22:22:04,570 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-20 22:22:04,570 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-20 22:22:04,570 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2018-01-20 22:22:04,570 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-20 22:22:04,570 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2018-01-20 22:22:04,570 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2018-01-20 22:22:04,570 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2018-01-20 22:22:04,570 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_hid_get_drvdata [2018-01-20 22:22:04,571 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_hid_set_drvdata [2018-01-20 22:22:04,571 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_arvo_init_arvo_device_struct [2018-01-20 22:22:04,571 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_arvo_init_specials [2018-01-20 22:22:04,571 INFO L136 BoogieDeclarations]: Found implementation of procedure lvd_arvo_remove_specials [2018-01-20 22:22:04,571 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_arvo_probe [2018-01-20 22:22:04,571 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_arvo_remove [2018-01-20 22:22:04,571 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-20 22:22:04,571 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-20 22:22:04,571 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-20 22:22:04,571 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-20 22:22:04,572 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-20 22:22:04,572 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-20 22:22:04,572 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-20 22:22:04,572 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-20 22:22:04,572 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-20 22:22:04,572 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2018-01-20 22:22:04,573 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2018-01-20 22:22:04,573 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-20 22:22:04,573 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-01-20 22:22:04,573 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-20 22:22:04,573 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-20 22:22:04,574 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2018-01-20 22:22:04,574 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-20 22:22:04,574 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2018-01-20 22:22:04,574 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2018-01-20 22:22:04,574 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2018-01-20 22:22:04,574 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_hid_get_drvdata [2018-01-20 22:22:04,574 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_hid_set_drvdata [2018-01-20 22:22:04,575 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_arvo_init_arvo_device_struct [2018-01-20 22:22:04,575 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_arvo_init_specials [2018-01-20 22:22:04,575 INFO L128 BoogieDeclarations]: Found specification of procedure lvd_arvo_remove_specials [2018-01-20 22:22:04,575 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_arvo_probe [2018-01-20 22:22:04,575 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_arvo_remove [2018-01-20 22:22:04,575 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-20 22:22:04,576 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-20 22:22:04,576 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-20 22:22:04,576 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-20 22:22:05,032 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-20 22:22:05,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:22:05 BoogieIcfgContainer [2018-01-20 22:22:05,033 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-20 22:22:05,034 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-20 22:22:05,034 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-20 22:22:05,036 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-20 22:22:05,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.01 10:22:04" (1/3) ... [2018-01-20 22:22:05,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c651995 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:22:05, skipping insertion in model container [2018-01-20 22:22:05,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:22:04" (2/3) ... [2018-01-20 22:22:05,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c651995 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:22:05, skipping insertion in model container [2018-01-20 22:22:05,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:22:05" (3/3) ... [2018-01-20 22:22:05,041 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test15_true-valid-memsafety_true-termination.i [2018-01-20 22:22:05,050 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-20 22:22:05,058 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2018-01-20 22:22:05,099 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:22:05,099 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:22:05,099 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:22:05,099 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:22:05,099 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:22:05,099 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:22:05,099 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:22:05,100 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-20 22:22:05,100 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:22:05,119 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2018-01-20 22:22:05,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-20 22:22:05,126 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:22:05,126 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:22:05,127 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-20 22:22:05,130 INFO L82 PathProgramCache]: Analyzing trace with hash -98013340, now seen corresponding path program 1 times [2018-01-20 22:22:05,132 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:22:05,132 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:22:05,182 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:05,182 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:22:05,182 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:05,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:22:05,238 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:22:05,423 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-20 22:22:05,425 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:22:05,426 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:22:05,428 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 22:22:05,441 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 22:22:05,441 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 22:22:05,444 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 3 states. [2018-01-20 22:22:05,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:22:05,643 INFO L93 Difference]: Finished difference Result 154 states and 168 transitions. [2018-01-20 22:22:05,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 22:22:05,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-01-20 22:22:05,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:22:05,652 INFO L225 Difference]: With dead ends: 154 [2018-01-20 22:22:05,652 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 22:22:05,658 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 22:22:05,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 22:22:05,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 22:22:05,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 22:22:05,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 22:22:05,677 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2018-01-20 22:22:05,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:22:05,677 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 22:22:05,677 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 22:22:05,677 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 22:22:05,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 22:22:05,681 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-20 22:22:05,766 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 1533 1535) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:22:05,766 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 1533 1535) no Hoare annotation was computed. [2018-01-20 22:22:05,766 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 1533 1535) no Hoare annotation was computed. [2018-01-20 22:22:05,766 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 1533 1535) no Hoare annotation was computed. [2018-01-20 22:22:05,767 INFO L401 ceAbstractionStarter]: For program point L1490(line 1490) no Hoare annotation was computed. [2018-01-20 22:22:05,767 INFO L401 ceAbstractionStarter]: For program point L1486'(line 1486) no Hoare annotation was computed. [2018-01-20 22:22:05,767 INFO L401 ceAbstractionStarter]: For program point L1486''(line 1486) no Hoare annotation was computed. [2018-01-20 22:22:05,767 INFO L397 ceAbstractionStarter]: At program point lvd_arvo_remove_specialsENTRY(lines 1483 1491) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:22:05,767 INFO L401 ceAbstractionStarter]: For program point L1484'(line 1484) no Hoare annotation was computed. [2018-01-20 22:22:05,767 INFO L401 ceAbstractionStarter]: For program point lvd_arvo_remove_specialsFINAL(lines 1483 1491) no Hoare annotation was computed. [2018-01-20 22:22:05,767 INFO L401 ceAbstractionStarter]: For program point L1486(line 1486) no Hoare annotation was computed. [2018-01-20 22:22:05,768 INFO L401 ceAbstractionStarter]: For program point L1489'(line 1489) no Hoare annotation was computed. [2018-01-20 22:22:05,768 INFO L401 ceAbstractionStarter]: For program point L1484(line 1484) no Hoare annotation was computed. [2018-01-20 22:22:05,768 INFO L397 ceAbstractionStarter]: At program point L1489(line 1489) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:22:05,768 INFO L401 ceAbstractionStarter]: For program point lvd_arvo_remove_specialsErr0EnsuresViolation(lines 1483 1491) no Hoare annotation was computed. [2018-01-20 22:22:05,768 INFO L401 ceAbstractionStarter]: For program point lvd_arvo_remove_specialsEXIT(lines 1483 1491) no Hoare annotation was computed. [2018-01-20 22:22:05,768 INFO L397 ceAbstractionStarter]: At program point L1505(line 1505) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:22:05,768 INFO L397 ceAbstractionStarter]: At program point ldv_arvo_removeENTRY(lines 1504 1506) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:22:05,769 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_removeFINAL(lines 1504 1506) no Hoare annotation was computed. [2018-01-20 22:22:05,769 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_removeErr0EnsuresViolation(lines 1504 1506) no Hoare annotation was computed. [2018-01-20 22:22:05,769 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_removeEXIT(lines 1504 1506) no Hoare annotation was computed. [2018-01-20 22:22:05,769 INFO L397 ceAbstractionStarter]: At program point ldv_mallocENTRY(lines 1072 1078) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:22:05,769 INFO L401 ceAbstractionStarter]: For program point L1073(lines 1073 1077) no Hoare annotation was computed. [2018-01-20 22:22:05,769 INFO L401 ceAbstractionStarter]: For program point L1074'(line 1074) no Hoare annotation was computed. [2018-01-20 22:22:05,769 INFO L401 ceAbstractionStarter]: For program point ldv_mallocEXIT(lines 1072 1078) no Hoare annotation was computed. [2018-01-20 22:22:05,769 INFO L401 ceAbstractionStarter]: For program point ldv_mallocErr0EnsuresViolation(lines 1072 1078) no Hoare annotation was computed. [2018-01-20 22:22:05,769 INFO L401 ceAbstractionStarter]: For program point ldv_mallocFINAL(lines 1072 1078) no Hoare annotation was computed. [2018-01-20 22:22:05,769 INFO L401 ceAbstractionStarter]: For program point L1074(line 1074) no Hoare annotation was computed. [2018-01-20 22:22:05,770 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 1535) no Hoare annotation was computed. [2018-01-20 22:22:05,770 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 1535) no Hoare annotation was computed. [2018-01-20 22:22:05,770 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 1535) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:22:05,770 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 1535) no Hoare annotation was computed. [2018-01-20 22:22:05,770 INFO L401 ceAbstractionStarter]: For program point L1463'(line 1463) no Hoare annotation was computed. [2018-01-20 22:22:05,770 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_init_specialsErr0EnsuresViolation(lines 1460 1481) no Hoare annotation was computed. [2018-01-20 22:22:05,770 INFO L401 ceAbstractionStarter]: For program point L1465'(line 1465) no Hoare annotation was computed. [2018-01-20 22:22:05,770 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_init_specialsFINAL(lines 1460 1481) no Hoare annotation was computed. [2018-01-20 22:22:05,771 INFO L397 ceAbstractionStarter]: At program point ldv_arvo_init_specialsENTRY(lines 1460 1481) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:22:05,771 INFO L397 ceAbstractionStarter]: At program point L1476(line 1476) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:22:05,771 INFO L397 ceAbstractionStarter]: At program point L1474(line 1474) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:22:05,771 INFO L397 ceAbstractionStarter]: At program point L1472(line 1472) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:22:05,771 INFO L401 ceAbstractionStarter]: For program point L1473(lines 1473 1475) no Hoare annotation was computed. [2018-01-20 22:22:05,771 INFO L401 ceAbstractionStarter]: For program point L1479(line 1479) no Hoare annotation was computed. [2018-01-20 22:22:05,771 INFO L401 ceAbstractionStarter]: For program point L1464''(line 1464) no Hoare annotation was computed. [2018-01-20 22:22:05,771 INFO L401 ceAbstractionStarter]: For program point L1464'(line 1464) no Hoare annotation was computed. [2018-01-20 22:22:05,772 INFO L401 ceAbstractionStarter]: For program point L1476'(line 1476) no Hoare annotation was computed. [2018-01-20 22:22:05,772 INFO L401 ceAbstractionStarter]: For program point L1472'(line 1472) no Hoare annotation was computed. [2018-01-20 22:22:05,772 INFO L397 ceAbstractionStarter]: At program point L1465(line 1465) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:22:05,772 INFO L401 ceAbstractionStarter]: For program point L1463(line 1463) no Hoare annotation was computed. [2018-01-20 22:22:05,772 INFO L401 ceAbstractionStarter]: For program point L1464(line 1464) no Hoare annotation was computed. [2018-01-20 22:22:05,772 INFO L401 ceAbstractionStarter]: For program point L1468'(line 1468) no Hoare annotation was computed. [2018-01-20 22:22:05,772 INFO L401 ceAbstractionStarter]: For program point L1469(lines 1469 1471) no Hoare annotation was computed. [2018-01-20 22:22:05,773 INFO L397 ceAbstractionStarter]: At program point L1468(line 1468) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:22:05,773 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_init_specialsEXIT(lines 1460 1481) no Hoare annotation was computed. [2018-01-20 22:22:05,773 INFO L404 ceAbstractionStarter]: At program point ldv_dev_set_drvdataENTRY(lines 1196 1199) the Hoare annotation is: true [2018-01-20 22:22:05,773 INFO L401 ceAbstractionStarter]: For program point ldv_dev_set_drvdataEXIT(lines 1196 1199) no Hoare annotation was computed. [2018-01-20 22:22:05,773 INFO L401 ceAbstractionStarter]: For program point ldv_dev_set_drvdataFINAL(lines 1196 1199) no Hoare annotation was computed. [2018-01-20 22:22:05,773 INFO L401 ceAbstractionStarter]: For program point ldv_dev_set_drvdataErr0EnsuresViolation(lines 1196 1199) no Hoare annotation was computed. [2018-01-20 22:22:05,773 INFO L401 ceAbstractionStarter]: For program point L1198(line 1198) no Hoare annotation was computed. [2018-01-20 22:22:05,773 INFO L404 ceAbstractionStarter]: At program point ldv_hid_set_drvdataENTRY(lines 1444 1447) the Hoare annotation is: true [2018-01-20 22:22:05,774 INFO L401 ceAbstractionStarter]: For program point ldv_hid_set_drvdataEXIT(lines 1444 1447) no Hoare annotation was computed. [2018-01-20 22:22:05,774 INFO L401 ceAbstractionStarter]: For program point ldv_hid_set_drvdataErr0EnsuresViolation(lines 1444 1447) no Hoare annotation was computed. [2018-01-20 22:22:05,774 INFO L404 ceAbstractionStarter]: At program point L1446(line 1446) the Hoare annotation is: true [2018-01-20 22:22:05,774 INFO L401 ceAbstractionStarter]: For program point ldv_hid_set_drvdataFINAL(lines 1444 1447) no Hoare annotation was computed. [2018-01-20 22:22:05,774 INFO L401 ceAbstractionStarter]: For program point L1081(line 1081) no Hoare annotation was computed. [2018-01-20 22:22:05,774 INFO L401 ceAbstractionStarter]: For program point L1081''(line 1081) no Hoare annotation was computed. [2018-01-20 22:22:05,774 INFO L401 ceAbstractionStarter]: For program point ldv_zallocEXIT(lines 1080 1082) no Hoare annotation was computed. [2018-01-20 22:22:05,774 INFO L401 ceAbstractionStarter]: For program point ldv_zallocErr0EnsuresViolation(lines 1080 1082) no Hoare annotation was computed. [2018-01-20 22:22:05,775 INFO L404 ceAbstractionStarter]: At program point L1081'(line 1081) the Hoare annotation is: true [2018-01-20 22:22:05,775 INFO L397 ceAbstractionStarter]: At program point ldv_zallocENTRY(lines 1080 1082) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:22:05,775 INFO L401 ceAbstractionStarter]: For program point ldv_zallocFINAL(lines 1080 1082) no Hoare annotation was computed. [2018-01-20 22:22:05,775 INFO L401 ceAbstractionStarter]: For program point ldv_nonpositiveFINAL(lines 1057 1061) no Hoare annotation was computed. [2018-01-20 22:22:05,775 INFO L401 ceAbstractionStarter]: For program point ldv_nonpositiveErr0EnsuresViolation(lines 1057 1061) no Hoare annotation was computed. [2018-01-20 22:22:05,775 INFO L401 ceAbstractionStarter]: For program point L1059(lines 1059 1060) no Hoare annotation was computed. [2018-01-20 22:22:05,775 INFO L404 ceAbstractionStarter]: At program point ldv_nonpositiveENTRY(lines 1057 1061) the Hoare annotation is: true [2018-01-20 22:22:05,775 INFO L401 ceAbstractionStarter]: For program point ldv_nonpositiveEXIT(lines 1057 1061) no Hoare annotation was computed. [2018-01-20 22:22:05,775 INFO L401 ceAbstractionStarter]: For program point L1441'(line 1441) no Hoare annotation was computed. [2018-01-20 22:22:05,776 INFO L404 ceAbstractionStarter]: At program point ldv_hid_get_drvdataENTRY(lines 1439 1442) the Hoare annotation is: true [2018-01-20 22:22:05,776 INFO L401 ceAbstractionStarter]: For program point ldv_hid_get_drvdataFINAL(lines 1439 1442) no Hoare annotation was computed. [2018-01-20 22:22:05,776 INFO L404 ceAbstractionStarter]: At program point L1441(line 1441) the Hoare annotation is: true [2018-01-20 22:22:05,776 INFO L401 ceAbstractionStarter]: For program point ldv_hid_get_drvdataErr0EnsuresViolation(lines 1439 1442) no Hoare annotation was computed. [2018-01-20 22:22:05,776 INFO L401 ceAbstractionStarter]: For program point ldv_hid_get_drvdataEXIT(lines 1439 1442) no Hoare annotation was computed. [2018-01-20 22:22:05,776 INFO L404 ceAbstractionStarter]: At program point ldv_dev_get_drvdataENTRY(lines 1191 1194) the Hoare annotation is: true [2018-01-20 22:22:05,776 INFO L401 ceAbstractionStarter]: For program point L1193(line 1193) no Hoare annotation was computed. [2018-01-20 22:22:05,776 INFO L401 ceAbstractionStarter]: For program point ldv_dev_get_drvdataEXIT(lines 1191 1194) no Hoare annotation was computed. [2018-01-20 22:22:05,776 INFO L401 ceAbstractionStarter]: For program point L1193'(line 1193) no Hoare annotation was computed. [2018-01-20 22:22:05,776 INFO L401 ceAbstractionStarter]: For program point ldv_dev_get_drvdataFINAL(lines 1191 1194) no Hoare annotation was computed. [2018-01-20 22:22:05,777 INFO L401 ceAbstractionStarter]: For program point ldv_dev_get_drvdataErr0EnsuresViolation(lines 1191 1194) no Hoare annotation was computed. [2018-01-20 22:22:05,777 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 1535) the Hoare annotation is: true [2018-01-20 22:22:05,777 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 1535) no Hoare annotation was computed. [2018-01-20 22:22:05,777 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 1535) the Hoare annotation is: true [2018-01-20 22:22:05,777 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 1535) no Hoare annotation was computed. [2018-01-20 22:22:05,777 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 1535) no Hoare annotation was computed. [2018-01-20 22:22:05,777 INFO L404 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-01-20 22:22:05,777 INFO L401 ceAbstractionStarter]: For program point #Ultimate.meminitEXIT(line -1) no Hoare annotation was computed. [2018-01-20 22:22:05,777 INFO L404 ceAbstractionStarter]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: true [2018-01-20 22:22:05,777 INFO L401 ceAbstractionStarter]: For program point #Ultimate.meminitFINAL(line -1) no Hoare annotation was computed. [2018-01-20 22:22:05,777 INFO L397 ceAbstractionStarter]: At program point ldv_arvo_probeENTRY(lines 1493 1502) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:22:05,778 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_probeErr0EnsuresViolation(lines 1493 1502) no Hoare annotation was computed. [2018-01-20 22:22:05,778 INFO L401 ceAbstractionStarter]: For program point L1495'(line 1495) no Hoare annotation was computed. [2018-01-20 22:22:05,778 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_probeFINAL(lines 1493 1502) no Hoare annotation was computed. [2018-01-20 22:22:05,778 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_probeEXIT(lines 1493 1502) no Hoare annotation was computed. [2018-01-20 22:22:05,778 INFO L401 ceAbstractionStarter]: For program point L1496(lines 1496 1498) no Hoare annotation was computed. [2018-01-20 22:22:05,778 INFO L397 ceAbstractionStarter]: At program point L1497(line 1497) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:22:05,778 INFO L397 ceAbstractionStarter]: At program point L1495(line 1495) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:22:05,778 INFO L401 ceAbstractionStarter]: For program point L1510(line 1510) no Hoare annotation was computed. [2018-01-20 22:22:05,778 INFO L401 ceAbstractionStarter]: For program point L1516'(line 1516) no Hoare annotation was computed. [2018-01-20 22:22:05,778 INFO L401 ceAbstractionStarter]: For program point L1513''(line 1513) no Hoare annotation was computed. [2018-01-20 22:22:05,778 INFO L401 ceAbstractionStarter]: For program point entry_pointEXIT(lines 1508 1531) no Hoare annotation was computed. [2018-01-20 22:22:05,778 INFO L401 ceAbstractionStarter]: For program point L1516''(line 1516) no Hoare annotation was computed. [2018-01-20 22:22:05,778 INFO L401 ceAbstractionStarter]: For program point L1524'(line 1524) no Hoare annotation was computed. [2018-01-20 22:22:05,779 INFO L401 ceAbstractionStarter]: For program point L1514'(line 1514) no Hoare annotation was computed. [2018-01-20 22:22:05,779 INFO L401 ceAbstractionStarter]: For program point L1517(line 1517) no Hoare annotation was computed. [2018-01-20 22:22:05,779 INFO L401 ceAbstractionStarter]: For program point L1516(line 1516) no Hoare annotation was computed. [2018-01-20 22:22:05,779 INFO L397 ceAbstractionStarter]: At program point entry_pointENTRY(lines 1508 1531) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:22:05,779 INFO L397 ceAbstractionStarter]: At program point L1513(line 1513) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:22:05,779 INFO L401 ceAbstractionStarter]: For program point L1514(line 1514) no Hoare annotation was computed. [2018-01-20 22:22:05,779 INFO L397 ceAbstractionStarter]: At program point L1511(line 1511) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:22:05,780 INFO L401 ceAbstractionStarter]: For program point L1512(line 1512) no Hoare annotation was computed. [2018-01-20 22:22:05,780 INFO L401 ceAbstractionStarter]: For program point L1519(line 1519) no Hoare annotation was computed. [2018-01-20 22:22:05,780 INFO L397 ceAbstractionStarter]: At program point L1520(line 1520) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:22:05,780 INFO L401 ceAbstractionStarter]: For program point entry_pointErr0EnsuresViolation(lines 1508 1531) no Hoare annotation was computed. [2018-01-20 22:22:05,780 INFO L397 ceAbstractionStarter]: At program point L1517'(line 1517) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:22:05,780 INFO L401 ceAbstractionStarter]: For program point L1511'(line 1511) no Hoare annotation was computed. [2018-01-20 22:22:05,780 INFO L401 ceAbstractionStarter]: For program point L1513'(line 1513) no Hoare annotation was computed. [2018-01-20 22:22:05,781 INFO L404 ceAbstractionStarter]: At program point L1528(line 1528) the Hoare annotation is: true [2018-01-20 22:22:05,781 INFO L404 ceAbstractionStarter]: At program point L1526(line 1526) the Hoare annotation is: true [2018-01-20 22:22:05,781 INFO L401 ceAbstractionStarter]: For program point L1519'(lines 1519 1521) no Hoare annotation was computed. [2018-01-20 22:22:05,781 INFO L401 ceAbstractionStarter]: For program point L1524(line 1524) no Hoare annotation was computed. [2018-01-20 22:22:05,781 INFO L401 ceAbstractionStarter]: For program point L1516'''(line 1516) no Hoare annotation was computed. [2018-01-20 22:22:05,781 INFO L404 ceAbstractionStarter]: At program point L1525(lines 1525 1526) the Hoare annotation is: true [2018-01-20 22:22:05,781 INFO L401 ceAbstractionStarter]: For program point L1523(lines 1523 1524) no Hoare annotation was computed. [2018-01-20 22:22:05,781 INFO L401 ceAbstractionStarter]: For program point L1509(line 1509) no Hoare annotation was computed. [2018-01-20 22:22:05,781 INFO L401 ceAbstractionStarter]: For program point L1454'(line 1454) no Hoare annotation was computed. [2018-01-20 22:22:05,781 INFO L401 ceAbstractionStarter]: For program point L1455'(line 1455) no Hoare annotation was computed. [2018-01-20 22:22:05,781 INFO L404 ceAbstractionStarter]: At program point ldv_arvo_init_arvo_device_structENTRY(lines 1453 1458) the Hoare annotation is: true [2018-01-20 22:22:05,781 INFO L401 ceAbstractionStarter]: For program point L1456(line 1456) no Hoare annotation was computed. [2018-01-20 22:22:05,782 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_init_arvo_device_structFINAL(lines 1453 1458) no Hoare annotation was computed. [2018-01-20 22:22:05,782 INFO L404 ceAbstractionStarter]: At program point L1457(line 1457) the Hoare annotation is: true [2018-01-20 22:22:05,782 INFO L401 ceAbstractionStarter]: For program point L1454(line 1454) no Hoare annotation was computed. [2018-01-20 22:22:05,782 INFO L401 ceAbstractionStarter]: For program point L1455(line 1455) no Hoare annotation was computed. [2018-01-20 22:22:05,782 INFO L401 ceAbstractionStarter]: For program point L1456'(line 1456) no Hoare annotation was computed. [2018-01-20 22:22:05,782 INFO L401 ceAbstractionStarter]: For program point L1457'(line 1457) no Hoare annotation was computed. [2018-01-20 22:22:05,782 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_init_arvo_device_structEXIT(lines 1453 1458) no Hoare annotation was computed. [2018-01-20 22:22:05,782 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_init_arvo_device_structErr0EnsuresViolation(lines 1453 1458) no Hoare annotation was computed. [2018-01-20 22:22:05,786 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:22:05,787 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:22:05,787 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:22:05,787 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:22:05,787 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:22:05,787 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:22:05,787 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:22:05,787 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == lvd_arvo_remove_specialsErr0EnsuresViolation======== [2018-01-20 22:22:05,788 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:22:05,791 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2018-01-20 22:22:05,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-01-20 22:22:05,795 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:22:05,796 INFO L322 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:22:05,796 INFO L371 AbstractCegarLoop]: === Iteration 1 === [lvd_arvo_remove_specialsErr0EnsuresViolation]=== [2018-01-20 22:22:05,796 INFO L82 PathProgramCache]: Analyzing trace with hash -930138460, now seen corresponding path program 1 times [2018-01-20 22:22:05,796 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:22:05,796 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:22:05,798 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:05,798 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:22:05,798 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:05,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:22:05,826 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:22:05,958 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-20 22:22:05,958 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:22:05,958 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-20 22:22:05,970 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:22:06,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:22:06,047 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:22:06,083 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-20 22:22:06,110 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-20 22:22:06,111 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2018-01-20 22:22:06,111 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-20 22:22:06,112 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-20 22:22:06,112 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-20 22:22:06,112 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 6 states. [2018-01-20 22:22:06,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:22:06,494 INFO L93 Difference]: Finished difference Result 279 states and 321 transitions. [2018-01-20 22:22:06,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-20 22:22:06,494 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2018-01-20 22:22:06,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:22:06,498 INFO L225 Difference]: With dead ends: 279 [2018-01-20 22:22:06,499 INFO L226 Difference]: Without dead ends: 118 [2018-01-20 22:22:06,500 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-01-20 22:22:06,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-01-20 22:22:06,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2018-01-20 22:22:06,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-01-20 22:22:06,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 127 transitions. [2018-01-20 22:22:06,523 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 127 transitions. Word has length 71 [2018-01-20 22:22:06,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:22:06,523 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 127 transitions. [2018-01-20 22:22:06,523 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-20 22:22:06,523 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 127 transitions. [2018-01-20 22:22:06,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-01-20 22:22:06,527 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:22:06,527 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 22:22:06,528 INFO L371 AbstractCegarLoop]: === Iteration 2 === [lvd_arvo_remove_specialsErr0EnsuresViolation]=== [2018-01-20 22:22:06,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1020427369, now seen corresponding path program 1 times [2018-01-20 22:22:06,528 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:22:06,528 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:22:06,529 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:06,530 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:22:06,530 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:06,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:22:06,552 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:22:06,606 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-20 22:22:06,606 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:22:06,606 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-20 22:22:06,612 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:22:06,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:22:06,676 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:22:06,707 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc2.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#t~malloc2.base| 1)) (<= (select |c_old(#valid)| |ldv_malloc_#t~malloc2.base|) 0))) is different from true [2018-01-20 22:22:06,728 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-20 22:22:06,750 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-20 22:22:06,750 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2018-01-20 22:22:06,752 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 22:22:06,753 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 22:22:06,753 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2018-01-20 22:22:06,753 INFO L87 Difference]: Start difference. First operand 117 states and 127 transitions. Second operand 5 states. [2018-01-20 22:22:06,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:22:06,830 INFO L93 Difference]: Finished difference Result 124 states and 134 transitions. [2018-01-20 22:22:06,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-20 22:22:06,831 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2018-01-20 22:22:06,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:22:06,831 INFO L225 Difference]: With dead ends: 124 [2018-01-20 22:22:06,832 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 22:22:06,833 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2018-01-20 22:22:06,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 22:22:06,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 22:22:06,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 22:22:06,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 22:22:06,834 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 86 [2018-01-20 22:22:06,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:22:06,834 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 22:22:06,834 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 22:22:06,834 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 22:22:06,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 22:22:06,835 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-20 22:22:06,881 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 1533 1535) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:22:06,881 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 1533 1535) no Hoare annotation was computed. [2018-01-20 22:22:06,881 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 1533 1535) no Hoare annotation was computed. [2018-01-20 22:22:06,881 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 1533 1535) no Hoare annotation was computed. [2018-01-20 22:22:06,881 INFO L401 ceAbstractionStarter]: For program point L1490(line 1490) no Hoare annotation was computed. [2018-01-20 22:22:06,881 INFO L401 ceAbstractionStarter]: For program point L1486'(line 1486) no Hoare annotation was computed. [2018-01-20 22:22:06,881 INFO L401 ceAbstractionStarter]: For program point L1486''(line 1486) no Hoare annotation was computed. [2018-01-20 22:22:06,881 INFO L397 ceAbstractionStarter]: At program point lvd_arvo_remove_specialsENTRY(lines 1483 1491) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:22:06,881 INFO L401 ceAbstractionStarter]: For program point L1484'(line 1484) no Hoare annotation was computed. [2018-01-20 22:22:06,882 INFO L401 ceAbstractionStarter]: For program point lvd_arvo_remove_specialsFINAL(lines 1483 1491) no Hoare annotation was computed. [2018-01-20 22:22:06,882 INFO L401 ceAbstractionStarter]: For program point L1486(line 1486) no Hoare annotation was computed. [2018-01-20 22:22:06,882 INFO L401 ceAbstractionStarter]: For program point L1489'(line 1489) no Hoare annotation was computed. [2018-01-20 22:22:06,882 INFO L401 ceAbstractionStarter]: For program point L1484(line 1484) no Hoare annotation was computed. [2018-01-20 22:22:06,882 INFO L397 ceAbstractionStarter]: At program point L1489(line 1489) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:22:06,882 INFO L401 ceAbstractionStarter]: For program point lvd_arvo_remove_specialsErr0EnsuresViolation(lines 1483 1491) no Hoare annotation was computed. [2018-01-20 22:22:06,882 INFO L401 ceAbstractionStarter]: For program point lvd_arvo_remove_specialsEXIT(lines 1483 1491) no Hoare annotation was computed. [2018-01-20 22:22:06,882 INFO L397 ceAbstractionStarter]: At program point L1505(line 1505) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:22:06,883 INFO L397 ceAbstractionStarter]: At program point ldv_arvo_removeENTRY(lines 1504 1506) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:22:06,883 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_removeFINAL(lines 1504 1506) no Hoare annotation was computed. [2018-01-20 22:22:06,883 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_removeErr0EnsuresViolation(lines 1504 1506) no Hoare annotation was computed. [2018-01-20 22:22:06,883 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_removeEXIT(lines 1504 1506) no Hoare annotation was computed. [2018-01-20 22:22:06,883 INFO L397 ceAbstractionStarter]: At program point ldv_mallocENTRY(lines 1072 1078) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:22:06,883 INFO L401 ceAbstractionStarter]: For program point L1073(lines 1073 1077) no Hoare annotation was computed. [2018-01-20 22:22:06,883 INFO L401 ceAbstractionStarter]: For program point L1074'(line 1074) no Hoare annotation was computed. [2018-01-20 22:22:06,883 INFO L401 ceAbstractionStarter]: For program point ldv_mallocEXIT(lines 1072 1078) no Hoare annotation was computed. [2018-01-20 22:22:06,884 INFO L401 ceAbstractionStarter]: For program point ldv_mallocErr0EnsuresViolation(lines 1072 1078) no Hoare annotation was computed. [2018-01-20 22:22:06,884 INFO L401 ceAbstractionStarter]: For program point ldv_mallocFINAL(lines 1072 1078) no Hoare annotation was computed. [2018-01-20 22:22:06,884 INFO L401 ceAbstractionStarter]: For program point L1074(line 1074) no Hoare annotation was computed. [2018-01-20 22:22:06,884 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 1535) no Hoare annotation was computed. [2018-01-20 22:22:06,884 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 1535) no Hoare annotation was computed. [2018-01-20 22:22:06,884 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 1535) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:22:06,884 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 1535) no Hoare annotation was computed. [2018-01-20 22:22:06,884 INFO L401 ceAbstractionStarter]: For program point L1463'(line 1463) no Hoare annotation was computed. [2018-01-20 22:22:06,884 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_init_specialsErr0EnsuresViolation(lines 1460 1481) no Hoare annotation was computed. [2018-01-20 22:22:06,885 INFO L401 ceAbstractionStarter]: For program point L1465'(line 1465) no Hoare annotation was computed. [2018-01-20 22:22:06,885 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_init_specialsFINAL(lines 1460 1481) no Hoare annotation was computed. [2018-01-20 22:22:06,885 INFO L397 ceAbstractionStarter]: At program point ldv_arvo_init_specialsENTRY(lines 1460 1481) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:22:06,885 INFO L397 ceAbstractionStarter]: At program point L1476(line 1476) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:22:06,885 INFO L397 ceAbstractionStarter]: At program point L1474(line 1474) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:22:06,885 INFO L397 ceAbstractionStarter]: At program point L1472(line 1472) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:22:06,885 INFO L401 ceAbstractionStarter]: For program point L1473(lines 1473 1475) no Hoare annotation was computed. [2018-01-20 22:22:06,885 INFO L401 ceAbstractionStarter]: For program point L1479(line 1479) no Hoare annotation was computed. [2018-01-20 22:22:06,885 INFO L401 ceAbstractionStarter]: For program point L1464''(line 1464) no Hoare annotation was computed. [2018-01-20 22:22:06,885 INFO L401 ceAbstractionStarter]: For program point L1464'(line 1464) no Hoare annotation was computed. [2018-01-20 22:22:06,886 INFO L401 ceAbstractionStarter]: For program point L1476'(line 1476) no Hoare annotation was computed. [2018-01-20 22:22:06,886 INFO L401 ceAbstractionStarter]: For program point L1472'(line 1472) no Hoare annotation was computed. [2018-01-20 22:22:06,886 INFO L397 ceAbstractionStarter]: At program point L1465(line 1465) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:22:06,886 INFO L401 ceAbstractionStarter]: For program point L1463(line 1463) no Hoare annotation was computed. [2018-01-20 22:22:06,886 INFO L401 ceAbstractionStarter]: For program point L1464(line 1464) no Hoare annotation was computed. [2018-01-20 22:22:06,886 INFO L401 ceAbstractionStarter]: For program point L1468'(line 1468) no Hoare annotation was computed. [2018-01-20 22:22:06,886 INFO L401 ceAbstractionStarter]: For program point L1469(lines 1469 1471) no Hoare annotation was computed. [2018-01-20 22:22:06,886 INFO L397 ceAbstractionStarter]: At program point L1468(line 1468) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:22:06,886 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_init_specialsEXIT(lines 1460 1481) no Hoare annotation was computed. [2018-01-20 22:22:06,886 INFO L404 ceAbstractionStarter]: At program point ldv_dev_set_drvdataENTRY(lines 1196 1199) the Hoare annotation is: true [2018-01-20 22:22:06,886 INFO L401 ceAbstractionStarter]: For program point ldv_dev_set_drvdataEXIT(lines 1196 1199) no Hoare annotation was computed. [2018-01-20 22:22:06,887 INFO L401 ceAbstractionStarter]: For program point ldv_dev_set_drvdataFINAL(lines 1196 1199) no Hoare annotation was computed. [2018-01-20 22:22:06,887 INFO L401 ceAbstractionStarter]: For program point ldv_dev_set_drvdataErr0EnsuresViolation(lines 1196 1199) no Hoare annotation was computed. [2018-01-20 22:22:06,887 INFO L401 ceAbstractionStarter]: For program point L1198(line 1198) no Hoare annotation was computed. [2018-01-20 22:22:06,887 INFO L404 ceAbstractionStarter]: At program point ldv_hid_set_drvdataENTRY(lines 1444 1447) the Hoare annotation is: true [2018-01-20 22:22:06,887 INFO L401 ceAbstractionStarter]: For program point ldv_hid_set_drvdataEXIT(lines 1444 1447) no Hoare annotation was computed. [2018-01-20 22:22:06,887 INFO L401 ceAbstractionStarter]: For program point ldv_hid_set_drvdataErr0EnsuresViolation(lines 1444 1447) no Hoare annotation was computed. [2018-01-20 22:22:06,887 INFO L404 ceAbstractionStarter]: At program point L1446(line 1446) the Hoare annotation is: true [2018-01-20 22:22:06,887 INFO L401 ceAbstractionStarter]: For program point ldv_hid_set_drvdataFINAL(lines 1444 1447) no Hoare annotation was computed. [2018-01-20 22:22:06,887 INFO L401 ceAbstractionStarter]: For program point L1081(line 1081) no Hoare annotation was computed. [2018-01-20 22:22:06,887 INFO L401 ceAbstractionStarter]: For program point L1081''(line 1081) no Hoare annotation was computed. [2018-01-20 22:22:06,888 INFO L401 ceAbstractionStarter]: For program point ldv_zallocEXIT(lines 1080 1082) no Hoare annotation was computed. [2018-01-20 22:22:06,888 INFO L401 ceAbstractionStarter]: For program point ldv_zallocErr0EnsuresViolation(lines 1080 1082) no Hoare annotation was computed. [2018-01-20 22:22:06,888 INFO L404 ceAbstractionStarter]: At program point L1081'(line 1081) the Hoare annotation is: true [2018-01-20 22:22:06,888 INFO L397 ceAbstractionStarter]: At program point ldv_zallocENTRY(lines 1080 1082) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:22:06,888 INFO L401 ceAbstractionStarter]: For program point ldv_zallocFINAL(lines 1080 1082) no Hoare annotation was computed. [2018-01-20 22:22:06,888 INFO L401 ceAbstractionStarter]: For program point ldv_nonpositiveFINAL(lines 1057 1061) no Hoare annotation was computed. [2018-01-20 22:22:06,888 INFO L401 ceAbstractionStarter]: For program point ldv_nonpositiveErr0EnsuresViolation(lines 1057 1061) no Hoare annotation was computed. [2018-01-20 22:22:06,888 INFO L401 ceAbstractionStarter]: For program point L1059(lines 1059 1060) no Hoare annotation was computed. [2018-01-20 22:22:06,889 INFO L404 ceAbstractionStarter]: At program point ldv_nonpositiveENTRY(lines 1057 1061) the Hoare annotation is: true [2018-01-20 22:22:06,889 INFO L401 ceAbstractionStarter]: For program point ldv_nonpositiveEXIT(lines 1057 1061) no Hoare annotation was computed. [2018-01-20 22:22:06,889 INFO L401 ceAbstractionStarter]: For program point L1441'(line 1441) no Hoare annotation was computed. [2018-01-20 22:22:06,889 INFO L404 ceAbstractionStarter]: At program point ldv_hid_get_drvdataENTRY(lines 1439 1442) the Hoare annotation is: true [2018-01-20 22:22:06,889 INFO L401 ceAbstractionStarter]: For program point ldv_hid_get_drvdataFINAL(lines 1439 1442) no Hoare annotation was computed. [2018-01-20 22:22:06,889 INFO L404 ceAbstractionStarter]: At program point L1441(line 1441) the Hoare annotation is: true [2018-01-20 22:22:06,889 INFO L401 ceAbstractionStarter]: For program point ldv_hid_get_drvdataErr0EnsuresViolation(lines 1439 1442) no Hoare annotation was computed. [2018-01-20 22:22:06,889 INFO L401 ceAbstractionStarter]: For program point ldv_hid_get_drvdataEXIT(lines 1439 1442) no Hoare annotation was computed. [2018-01-20 22:22:06,889 INFO L404 ceAbstractionStarter]: At program point ldv_dev_get_drvdataENTRY(lines 1191 1194) the Hoare annotation is: true [2018-01-20 22:22:06,890 INFO L401 ceAbstractionStarter]: For program point L1193(line 1193) no Hoare annotation was computed. [2018-01-20 22:22:06,890 INFO L401 ceAbstractionStarter]: For program point ldv_dev_get_drvdataEXIT(lines 1191 1194) no Hoare annotation was computed. [2018-01-20 22:22:06,890 INFO L401 ceAbstractionStarter]: For program point L1193'(line 1193) no Hoare annotation was computed. [2018-01-20 22:22:06,890 INFO L401 ceAbstractionStarter]: For program point ldv_dev_get_drvdataFINAL(lines 1191 1194) no Hoare annotation was computed. [2018-01-20 22:22:06,890 INFO L401 ceAbstractionStarter]: For program point ldv_dev_get_drvdataErr0EnsuresViolation(lines 1191 1194) no Hoare annotation was computed. [2018-01-20 22:22:06,890 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 1535) the Hoare annotation is: true [2018-01-20 22:22:06,890 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 1535) no Hoare annotation was computed. [2018-01-20 22:22:06,890 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 1535) the Hoare annotation is: true [2018-01-20 22:22:06,890 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 1535) no Hoare annotation was computed. [2018-01-20 22:22:06,890 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 1535) no Hoare annotation was computed. [2018-01-20 22:22:06,890 INFO L404 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-01-20 22:22:06,890 INFO L401 ceAbstractionStarter]: For program point #Ultimate.meminitEXIT(line -1) no Hoare annotation was computed. [2018-01-20 22:22:06,890 INFO L404 ceAbstractionStarter]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: true [2018-01-20 22:22:06,890 INFO L401 ceAbstractionStarter]: For program point #Ultimate.meminitFINAL(line -1) no Hoare annotation was computed. [2018-01-20 22:22:06,891 INFO L397 ceAbstractionStarter]: At program point ldv_arvo_probeENTRY(lines 1493 1502) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:22:06,891 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_probeErr0EnsuresViolation(lines 1493 1502) no Hoare annotation was computed. [2018-01-20 22:22:06,891 INFO L401 ceAbstractionStarter]: For program point L1495'(line 1495) no Hoare annotation was computed. [2018-01-20 22:22:06,891 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_probeFINAL(lines 1493 1502) no Hoare annotation was computed. [2018-01-20 22:22:06,891 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_probeEXIT(lines 1493 1502) no Hoare annotation was computed. [2018-01-20 22:22:06,891 INFO L401 ceAbstractionStarter]: For program point L1496(lines 1496 1498) no Hoare annotation was computed. [2018-01-20 22:22:06,891 INFO L397 ceAbstractionStarter]: At program point L1497(line 1497) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:22:06,891 INFO L397 ceAbstractionStarter]: At program point L1495(line 1495) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:22:06,891 INFO L401 ceAbstractionStarter]: For program point L1510(line 1510) no Hoare annotation was computed. [2018-01-20 22:22:06,891 INFO L401 ceAbstractionStarter]: For program point L1516'(line 1516) no Hoare annotation was computed. [2018-01-20 22:22:06,891 INFO L401 ceAbstractionStarter]: For program point L1513''(line 1513) no Hoare annotation was computed. [2018-01-20 22:22:06,891 INFO L401 ceAbstractionStarter]: For program point entry_pointEXIT(lines 1508 1531) no Hoare annotation was computed. [2018-01-20 22:22:06,891 INFO L401 ceAbstractionStarter]: For program point L1516''(line 1516) no Hoare annotation was computed. [2018-01-20 22:22:06,891 INFO L401 ceAbstractionStarter]: For program point L1524'(line 1524) no Hoare annotation was computed. [2018-01-20 22:22:06,891 INFO L401 ceAbstractionStarter]: For program point L1514'(line 1514) no Hoare annotation was computed. [2018-01-20 22:22:06,892 INFO L401 ceAbstractionStarter]: For program point L1517(line 1517) no Hoare annotation was computed. [2018-01-20 22:22:06,892 INFO L401 ceAbstractionStarter]: For program point L1516(line 1516) no Hoare annotation was computed. [2018-01-20 22:22:06,892 INFO L397 ceAbstractionStarter]: At program point entry_pointENTRY(lines 1508 1531) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:22:06,892 INFO L397 ceAbstractionStarter]: At program point L1513(line 1513) the Hoare annotation is: false [2018-01-20 22:22:06,892 INFO L401 ceAbstractionStarter]: For program point L1514(line 1514) no Hoare annotation was computed. [2018-01-20 22:22:06,892 INFO L397 ceAbstractionStarter]: At program point L1511(line 1511) the Hoare annotation is: false [2018-01-20 22:22:06,892 INFO L401 ceAbstractionStarter]: For program point L1512(line 1512) no Hoare annotation was computed. [2018-01-20 22:22:06,892 INFO L401 ceAbstractionStarter]: For program point L1519(line 1519) no Hoare annotation was computed. [2018-01-20 22:22:06,893 INFO L397 ceAbstractionStarter]: At program point L1520(line 1520) the Hoare annotation is: false [2018-01-20 22:22:06,893 INFO L401 ceAbstractionStarter]: For program point entry_pointErr0EnsuresViolation(lines 1508 1531) no Hoare annotation was computed. [2018-01-20 22:22:06,893 INFO L397 ceAbstractionStarter]: At program point L1517'(line 1517) the Hoare annotation is: false [2018-01-20 22:22:06,893 INFO L401 ceAbstractionStarter]: For program point L1511'(line 1511) no Hoare annotation was computed. [2018-01-20 22:22:06,893 INFO L401 ceAbstractionStarter]: For program point L1513'(line 1513) no Hoare annotation was computed. [2018-01-20 22:22:06,893 INFO L404 ceAbstractionStarter]: At program point L1528(line 1528) the Hoare annotation is: true [2018-01-20 22:22:06,893 INFO L404 ceAbstractionStarter]: At program point L1526(line 1526) the Hoare annotation is: true [2018-01-20 22:22:06,893 INFO L401 ceAbstractionStarter]: For program point L1519'(lines 1519 1521) no Hoare annotation was computed. [2018-01-20 22:22:06,894 INFO L401 ceAbstractionStarter]: For program point L1524(line 1524) no Hoare annotation was computed. [2018-01-20 22:22:06,894 INFO L401 ceAbstractionStarter]: For program point L1516'''(line 1516) no Hoare annotation was computed. [2018-01-20 22:22:06,894 INFO L404 ceAbstractionStarter]: At program point L1525(lines 1525 1526) the Hoare annotation is: true [2018-01-20 22:22:06,894 INFO L401 ceAbstractionStarter]: For program point L1523(lines 1523 1524) no Hoare annotation was computed. [2018-01-20 22:22:06,894 INFO L401 ceAbstractionStarter]: For program point L1509(line 1509) no Hoare annotation was computed. [2018-01-20 22:22:06,894 INFO L401 ceAbstractionStarter]: For program point L1454'(line 1454) no Hoare annotation was computed. [2018-01-20 22:22:06,894 INFO L401 ceAbstractionStarter]: For program point L1455'(line 1455) no Hoare annotation was computed. [2018-01-20 22:22:06,894 INFO L404 ceAbstractionStarter]: At program point ldv_arvo_init_arvo_device_structENTRY(lines 1453 1458) the Hoare annotation is: true [2018-01-20 22:22:06,894 INFO L401 ceAbstractionStarter]: For program point L1456(line 1456) no Hoare annotation was computed. [2018-01-20 22:22:06,894 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_init_arvo_device_structFINAL(lines 1453 1458) no Hoare annotation was computed. [2018-01-20 22:22:06,895 INFO L404 ceAbstractionStarter]: At program point L1457(line 1457) the Hoare annotation is: true [2018-01-20 22:22:06,895 INFO L401 ceAbstractionStarter]: For program point L1454(line 1454) no Hoare annotation was computed. [2018-01-20 22:22:06,895 INFO L401 ceAbstractionStarter]: For program point L1455(line 1455) no Hoare annotation was computed. [2018-01-20 22:22:06,895 INFO L401 ceAbstractionStarter]: For program point L1456'(line 1456) no Hoare annotation was computed. [2018-01-20 22:22:06,895 INFO L401 ceAbstractionStarter]: For program point L1457'(line 1457) no Hoare annotation was computed. [2018-01-20 22:22:06,895 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_init_arvo_device_structEXIT(lines 1453 1458) no Hoare annotation was computed. [2018-01-20 22:22:06,895 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_init_arvo_device_structErr0EnsuresViolation(lines 1453 1458) no Hoare annotation was computed. [2018-01-20 22:22:06,898 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:22:06,898 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:22:06,898 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:22:06,898 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:22:06,898 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:22:06,898 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:22:06,898 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:22:06,899 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_arvo_removeErr0EnsuresViolation======== [2018-01-20 22:22:06,899 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:22:06,901 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2018-01-20 22:22:06,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-01-20 22:22:06,903 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:22:06,904 INFO L322 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:22:06,904 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_arvo_removeErr0EnsuresViolation]=== [2018-01-20 22:22:06,904 INFO L82 PathProgramCache]: Analyzing trace with hash -509857275, now seen corresponding path program 1 times [2018-01-20 22:22:06,904 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:22:06,904 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:22:06,906 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:06,906 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:22:06,906 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:06,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:22:06,921 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:22:07,012 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-20 22:22:07,013 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:22:07,013 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-20 22:22:07,026 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:22:07,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:22:07,086 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:22:07,122 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-20 22:22:07,156 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-20 22:22:07,157 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2018-01-20 22:22:07,157 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-20 22:22:07,158 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-20 22:22:07,158 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-20 22:22:07,158 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 6 states. [2018-01-20 22:22:07,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:22:07,443 INFO L93 Difference]: Finished difference Result 279 states and 321 transitions. [2018-01-20 22:22:07,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-20 22:22:07,443 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2018-01-20 22:22:07,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:22:07,444 INFO L225 Difference]: With dead ends: 279 [2018-01-20 22:22:07,444 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 22:22:07,445 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-01-20 22:22:07,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 22:22:07,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 22:22:07,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 22:22:07,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 22:22:07,446 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 73 [2018-01-20 22:22:07,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:22:07,446 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 22:22:07,446 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-20 22:22:07,446 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 22:22:07,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 22:22:07,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-20 22:22:07,536 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 1533 1535) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:22:07,537 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 1533 1535) no Hoare annotation was computed. [2018-01-20 22:22:07,537 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 1533 1535) no Hoare annotation was computed. [2018-01-20 22:22:07,537 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 1533 1535) no Hoare annotation was computed. [2018-01-20 22:22:07,537 INFO L401 ceAbstractionStarter]: For program point L1490(line 1490) no Hoare annotation was computed. [2018-01-20 22:22:07,537 INFO L401 ceAbstractionStarter]: For program point L1486'(line 1486) no Hoare annotation was computed. [2018-01-20 22:22:07,537 INFO L401 ceAbstractionStarter]: For program point L1486''(line 1486) no Hoare annotation was computed. [2018-01-20 22:22:07,537 INFO L397 ceAbstractionStarter]: At program point lvd_arvo_remove_specialsENTRY(lines 1483 1491) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:22:07,537 INFO L401 ceAbstractionStarter]: For program point L1484'(line 1484) no Hoare annotation was computed. [2018-01-20 22:22:07,537 INFO L401 ceAbstractionStarter]: For program point lvd_arvo_remove_specialsFINAL(lines 1483 1491) no Hoare annotation was computed. [2018-01-20 22:22:07,537 INFO L401 ceAbstractionStarter]: For program point L1486(line 1486) no Hoare annotation was computed. [2018-01-20 22:22:07,537 INFO L401 ceAbstractionStarter]: For program point L1489'(line 1489) no Hoare annotation was computed. [2018-01-20 22:22:07,537 INFO L401 ceAbstractionStarter]: For program point L1484(line 1484) no Hoare annotation was computed. [2018-01-20 22:22:07,537 INFO L397 ceAbstractionStarter]: At program point L1489(line 1489) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:22:07,538 INFO L401 ceAbstractionStarter]: For program point lvd_arvo_remove_specialsErr0EnsuresViolation(lines 1483 1491) no Hoare annotation was computed. [2018-01-20 22:22:07,538 INFO L401 ceAbstractionStarter]: For program point lvd_arvo_remove_specialsEXIT(lines 1483 1491) no Hoare annotation was computed. [2018-01-20 22:22:07,538 INFO L397 ceAbstractionStarter]: At program point L1505(line 1505) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:22:07,538 INFO L397 ceAbstractionStarter]: At program point ldv_arvo_removeENTRY(lines 1504 1506) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:22:07,538 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_removeFINAL(lines 1504 1506) no Hoare annotation was computed. [2018-01-20 22:22:07,538 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_removeErr0EnsuresViolation(lines 1504 1506) no Hoare annotation was computed. [2018-01-20 22:22:07,538 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_removeEXIT(lines 1504 1506) no Hoare annotation was computed. [2018-01-20 22:22:07,538 INFO L397 ceAbstractionStarter]: At program point ldv_mallocENTRY(lines 1072 1078) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:22:07,538 INFO L401 ceAbstractionStarter]: For program point L1073(lines 1073 1077) no Hoare annotation was computed. [2018-01-20 22:22:07,538 INFO L401 ceAbstractionStarter]: For program point L1074'(line 1074) no Hoare annotation was computed. [2018-01-20 22:22:07,538 INFO L401 ceAbstractionStarter]: For program point ldv_mallocEXIT(lines 1072 1078) no Hoare annotation was computed. [2018-01-20 22:22:07,538 INFO L401 ceAbstractionStarter]: For program point ldv_mallocErr0EnsuresViolation(lines 1072 1078) no Hoare annotation was computed. [2018-01-20 22:22:07,538 INFO L401 ceAbstractionStarter]: For program point ldv_mallocFINAL(lines 1072 1078) no Hoare annotation was computed. [2018-01-20 22:22:07,538 INFO L401 ceAbstractionStarter]: For program point L1074(line 1074) no Hoare annotation was computed. [2018-01-20 22:22:07,538 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 1535) no Hoare annotation was computed. [2018-01-20 22:22:07,538 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 1535) no Hoare annotation was computed. [2018-01-20 22:22:07,539 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 1535) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:22:07,539 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 1535) no Hoare annotation was computed. [2018-01-20 22:22:07,539 INFO L401 ceAbstractionStarter]: For program point L1463'(line 1463) no Hoare annotation was computed. [2018-01-20 22:22:07,539 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_init_specialsErr0EnsuresViolation(lines 1460 1481) no Hoare annotation was computed. [2018-01-20 22:22:07,539 INFO L401 ceAbstractionStarter]: For program point L1465'(line 1465) no Hoare annotation was computed. [2018-01-20 22:22:07,539 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_init_specialsFINAL(lines 1460 1481) no Hoare annotation was computed. [2018-01-20 22:22:07,539 INFO L397 ceAbstractionStarter]: At program point ldv_arvo_init_specialsENTRY(lines 1460 1481) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:22:07,539 INFO L397 ceAbstractionStarter]: At program point L1476(line 1476) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:22:07,539 INFO L397 ceAbstractionStarter]: At program point L1474(line 1474) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:22:07,539 INFO L397 ceAbstractionStarter]: At program point L1472(line 1472) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:22:07,539 INFO L401 ceAbstractionStarter]: For program point L1473(lines 1473 1475) no Hoare annotation was computed. [2018-01-20 22:22:07,539 INFO L401 ceAbstractionStarter]: For program point L1479(line 1479) no Hoare annotation was computed. [2018-01-20 22:22:07,539 INFO L401 ceAbstractionStarter]: For program point L1464''(line 1464) no Hoare annotation was computed. [2018-01-20 22:22:07,539 INFO L401 ceAbstractionStarter]: For program point L1464'(line 1464) no Hoare annotation was computed. [2018-01-20 22:22:07,540 INFO L401 ceAbstractionStarter]: For program point L1476'(line 1476) no Hoare annotation was computed. [2018-01-20 22:22:07,540 INFO L401 ceAbstractionStarter]: For program point L1472'(line 1472) no Hoare annotation was computed. [2018-01-20 22:22:07,540 INFO L397 ceAbstractionStarter]: At program point L1465(line 1465) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:22:07,540 INFO L401 ceAbstractionStarter]: For program point L1463(line 1463) no Hoare annotation was computed. [2018-01-20 22:22:07,540 INFO L401 ceAbstractionStarter]: For program point L1464(line 1464) no Hoare annotation was computed. [2018-01-20 22:22:07,540 INFO L401 ceAbstractionStarter]: For program point L1468'(line 1468) no Hoare annotation was computed. [2018-01-20 22:22:07,540 INFO L401 ceAbstractionStarter]: For program point L1469(lines 1469 1471) no Hoare annotation was computed. [2018-01-20 22:22:07,540 INFO L397 ceAbstractionStarter]: At program point L1468(line 1468) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:22:07,540 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_init_specialsEXIT(lines 1460 1481) no Hoare annotation was computed. [2018-01-20 22:22:07,540 INFO L404 ceAbstractionStarter]: At program point ldv_dev_set_drvdataENTRY(lines 1196 1199) the Hoare annotation is: true [2018-01-20 22:22:07,540 INFO L401 ceAbstractionStarter]: For program point ldv_dev_set_drvdataEXIT(lines 1196 1199) no Hoare annotation was computed. [2018-01-20 22:22:07,540 INFO L401 ceAbstractionStarter]: For program point ldv_dev_set_drvdataFINAL(lines 1196 1199) no Hoare annotation was computed. [2018-01-20 22:22:07,540 INFO L401 ceAbstractionStarter]: For program point ldv_dev_set_drvdataErr0EnsuresViolation(lines 1196 1199) no Hoare annotation was computed. [2018-01-20 22:22:07,540 INFO L401 ceAbstractionStarter]: For program point L1198(line 1198) no Hoare annotation was computed. [2018-01-20 22:22:07,540 INFO L404 ceAbstractionStarter]: At program point ldv_hid_set_drvdataENTRY(lines 1444 1447) the Hoare annotation is: true [2018-01-20 22:22:07,541 INFO L401 ceAbstractionStarter]: For program point ldv_hid_set_drvdataEXIT(lines 1444 1447) no Hoare annotation was computed. [2018-01-20 22:22:07,541 INFO L401 ceAbstractionStarter]: For program point ldv_hid_set_drvdataErr0EnsuresViolation(lines 1444 1447) no Hoare annotation was computed. [2018-01-20 22:22:07,541 INFO L404 ceAbstractionStarter]: At program point L1446(line 1446) the Hoare annotation is: true [2018-01-20 22:22:07,541 INFO L401 ceAbstractionStarter]: For program point ldv_hid_set_drvdataFINAL(lines 1444 1447) no Hoare annotation was computed. [2018-01-20 22:22:07,541 INFO L401 ceAbstractionStarter]: For program point L1081(line 1081) no Hoare annotation was computed. [2018-01-20 22:22:07,541 INFO L401 ceAbstractionStarter]: For program point L1081''(line 1081) no Hoare annotation was computed. [2018-01-20 22:22:07,541 INFO L401 ceAbstractionStarter]: For program point ldv_zallocEXIT(lines 1080 1082) no Hoare annotation was computed. [2018-01-20 22:22:07,541 INFO L401 ceAbstractionStarter]: For program point ldv_zallocErr0EnsuresViolation(lines 1080 1082) no Hoare annotation was computed. [2018-01-20 22:22:07,541 INFO L404 ceAbstractionStarter]: At program point L1081'(line 1081) the Hoare annotation is: true [2018-01-20 22:22:07,541 INFO L397 ceAbstractionStarter]: At program point ldv_zallocENTRY(lines 1080 1082) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:22:07,541 INFO L401 ceAbstractionStarter]: For program point ldv_zallocFINAL(lines 1080 1082) no Hoare annotation was computed. [2018-01-20 22:22:07,541 INFO L401 ceAbstractionStarter]: For program point ldv_nonpositiveFINAL(lines 1057 1061) no Hoare annotation was computed. [2018-01-20 22:22:07,541 INFO L401 ceAbstractionStarter]: For program point ldv_nonpositiveErr0EnsuresViolation(lines 1057 1061) no Hoare annotation was computed. [2018-01-20 22:22:07,541 INFO L401 ceAbstractionStarter]: For program point L1059(lines 1059 1060) no Hoare annotation was computed. [2018-01-20 22:22:07,541 INFO L404 ceAbstractionStarter]: At program point ldv_nonpositiveENTRY(lines 1057 1061) the Hoare annotation is: true [2018-01-20 22:22:07,542 INFO L401 ceAbstractionStarter]: For program point ldv_nonpositiveEXIT(lines 1057 1061) no Hoare annotation was computed. [2018-01-20 22:22:07,542 INFO L401 ceAbstractionStarter]: For program point L1441'(line 1441) no Hoare annotation was computed. [2018-01-20 22:22:07,542 INFO L404 ceAbstractionStarter]: At program point ldv_hid_get_drvdataENTRY(lines 1439 1442) the Hoare annotation is: true [2018-01-20 22:22:07,542 INFO L401 ceAbstractionStarter]: For program point ldv_hid_get_drvdataFINAL(lines 1439 1442) no Hoare annotation was computed. [2018-01-20 22:22:07,542 INFO L404 ceAbstractionStarter]: At program point L1441(line 1441) the Hoare annotation is: true [2018-01-20 22:22:07,542 INFO L401 ceAbstractionStarter]: For program point ldv_hid_get_drvdataErr0EnsuresViolation(lines 1439 1442) no Hoare annotation was computed. [2018-01-20 22:22:07,542 INFO L401 ceAbstractionStarter]: For program point ldv_hid_get_drvdataEXIT(lines 1439 1442) no Hoare annotation was computed. [2018-01-20 22:22:07,542 INFO L404 ceAbstractionStarter]: At program point ldv_dev_get_drvdataENTRY(lines 1191 1194) the Hoare annotation is: true [2018-01-20 22:22:07,542 INFO L401 ceAbstractionStarter]: For program point L1193(line 1193) no Hoare annotation was computed. [2018-01-20 22:22:07,542 INFO L401 ceAbstractionStarter]: For program point ldv_dev_get_drvdataEXIT(lines 1191 1194) no Hoare annotation was computed. [2018-01-20 22:22:07,542 INFO L401 ceAbstractionStarter]: For program point L1193'(line 1193) no Hoare annotation was computed. [2018-01-20 22:22:07,542 INFO L401 ceAbstractionStarter]: For program point ldv_dev_get_drvdataFINAL(lines 1191 1194) no Hoare annotation was computed. [2018-01-20 22:22:07,542 INFO L401 ceAbstractionStarter]: For program point ldv_dev_get_drvdataErr0EnsuresViolation(lines 1191 1194) no Hoare annotation was computed. [2018-01-20 22:22:07,542 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 1535) the Hoare annotation is: true [2018-01-20 22:22:07,542 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 1535) no Hoare annotation was computed. [2018-01-20 22:22:07,542 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 1535) the Hoare annotation is: true [2018-01-20 22:22:07,543 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 1535) no Hoare annotation was computed. [2018-01-20 22:22:07,543 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 1535) no Hoare annotation was computed. [2018-01-20 22:22:07,543 INFO L404 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-01-20 22:22:07,543 INFO L401 ceAbstractionStarter]: For program point #Ultimate.meminitEXIT(line -1) no Hoare annotation was computed. [2018-01-20 22:22:07,543 INFO L404 ceAbstractionStarter]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: true [2018-01-20 22:22:07,543 INFO L401 ceAbstractionStarter]: For program point #Ultimate.meminitFINAL(line -1) no Hoare annotation was computed. [2018-01-20 22:22:07,543 INFO L397 ceAbstractionStarter]: At program point ldv_arvo_probeENTRY(lines 1493 1502) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:22:07,543 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_probeErr0EnsuresViolation(lines 1493 1502) no Hoare annotation was computed. [2018-01-20 22:22:07,543 INFO L401 ceAbstractionStarter]: For program point L1495'(line 1495) no Hoare annotation was computed. [2018-01-20 22:22:07,543 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_probeFINAL(lines 1493 1502) no Hoare annotation was computed. [2018-01-20 22:22:07,543 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_probeEXIT(lines 1493 1502) no Hoare annotation was computed. [2018-01-20 22:22:07,543 INFO L401 ceAbstractionStarter]: For program point L1496(lines 1496 1498) no Hoare annotation was computed. [2018-01-20 22:22:07,543 INFO L397 ceAbstractionStarter]: At program point L1497(line 1497) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:22:07,543 INFO L397 ceAbstractionStarter]: At program point L1495(line 1495) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:22:07,543 INFO L401 ceAbstractionStarter]: For program point L1510(line 1510) no Hoare annotation was computed. [2018-01-20 22:22:07,544 INFO L401 ceAbstractionStarter]: For program point L1516'(line 1516) no Hoare annotation was computed. [2018-01-20 22:22:07,544 INFO L401 ceAbstractionStarter]: For program point L1513''(line 1513) no Hoare annotation was computed. [2018-01-20 22:22:07,544 INFO L401 ceAbstractionStarter]: For program point entry_pointEXIT(lines 1508 1531) no Hoare annotation was computed. [2018-01-20 22:22:07,544 INFO L401 ceAbstractionStarter]: For program point L1516''(line 1516) no Hoare annotation was computed. [2018-01-20 22:22:07,544 INFO L401 ceAbstractionStarter]: For program point L1524'(line 1524) no Hoare annotation was computed. [2018-01-20 22:22:07,544 INFO L401 ceAbstractionStarter]: For program point L1514'(line 1514) no Hoare annotation was computed. [2018-01-20 22:22:07,544 INFO L401 ceAbstractionStarter]: For program point L1517(line 1517) no Hoare annotation was computed. [2018-01-20 22:22:07,544 INFO L401 ceAbstractionStarter]: For program point L1516(line 1516) no Hoare annotation was computed. [2018-01-20 22:22:07,544 INFO L397 ceAbstractionStarter]: At program point entry_pointENTRY(lines 1508 1531) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 22:22:07,544 INFO L397 ceAbstractionStarter]: At program point L1513(line 1513) the Hoare annotation is: false [2018-01-20 22:22:07,544 INFO L401 ceAbstractionStarter]: For program point L1514(line 1514) no Hoare annotation was computed. [2018-01-20 22:22:07,544 INFO L397 ceAbstractionStarter]: At program point L1511(line 1511) the Hoare annotation is: false [2018-01-20 22:22:07,544 INFO L401 ceAbstractionStarter]: For program point L1512(line 1512) no Hoare annotation was computed. [2018-01-20 22:22:07,544 INFO L401 ceAbstractionStarter]: For program point L1519(line 1519) no Hoare annotation was computed. [2018-01-20 22:22:07,544 INFO L397 ceAbstractionStarter]: At program point L1520(line 1520) the Hoare annotation is: false [2018-01-20 22:22:07,544 INFO L401 ceAbstractionStarter]: For program point entry_pointErr0EnsuresViolation(lines 1508 1531) no Hoare annotation was computed. [2018-01-20 22:22:07,545 INFO L397 ceAbstractionStarter]: At program point L1517'(line 1517) the Hoare annotation is: false [2018-01-20 22:22:07,545 INFO L401 ceAbstractionStarter]: For program point L1511'(line 1511) no Hoare annotation was computed. [2018-01-20 22:22:07,545 INFO L401 ceAbstractionStarter]: For program point L1513'(line 1513) no Hoare annotation was computed. [2018-01-20 22:22:07,545 INFO L404 ceAbstractionStarter]: At program point L1528(line 1528) the Hoare annotation is: true [2018-01-20 22:22:07,545 INFO L404 ceAbstractionStarter]: At program point L1526(line 1526) the Hoare annotation is: true [2018-01-20 22:22:07,545 INFO L401 ceAbstractionStarter]: For program point L1519'(lines 1519 1521) no Hoare annotation was computed. [2018-01-20 22:22:07,545 INFO L401 ceAbstractionStarter]: For program point L1524(line 1524) no Hoare annotation was computed. [2018-01-20 22:22:07,545 INFO L401 ceAbstractionStarter]: For program point L1516'''(line 1516) no Hoare annotation was computed. [2018-01-20 22:22:07,545 INFO L404 ceAbstractionStarter]: At program point L1525(lines 1525 1526) the Hoare annotation is: true [2018-01-20 22:22:07,545 INFO L401 ceAbstractionStarter]: For program point L1523(lines 1523 1524) no Hoare annotation was computed. [2018-01-20 22:22:07,546 INFO L401 ceAbstractionStarter]: For program point L1509(line 1509) no Hoare annotation was computed. [2018-01-20 22:22:07,546 INFO L401 ceAbstractionStarter]: For program point L1454'(line 1454) no Hoare annotation was computed. [2018-01-20 22:22:07,546 INFO L401 ceAbstractionStarter]: For program point L1455'(line 1455) no Hoare annotation was computed. [2018-01-20 22:22:07,546 INFO L404 ceAbstractionStarter]: At program point ldv_arvo_init_arvo_device_structENTRY(lines 1453 1458) the Hoare annotation is: true [2018-01-20 22:22:07,546 INFO L401 ceAbstractionStarter]: For program point L1456(line 1456) no Hoare annotation was computed. [2018-01-20 22:22:07,546 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_init_arvo_device_structFINAL(lines 1453 1458) no Hoare annotation was computed. [2018-01-20 22:22:07,546 INFO L404 ceAbstractionStarter]: At program point L1457(line 1457) the Hoare annotation is: true [2018-01-20 22:22:07,546 INFO L401 ceAbstractionStarter]: For program point L1454(line 1454) no Hoare annotation was computed. [2018-01-20 22:22:07,546 INFO L401 ceAbstractionStarter]: For program point L1455(line 1455) no Hoare annotation was computed. [2018-01-20 22:22:07,546 INFO L401 ceAbstractionStarter]: For program point L1456'(line 1456) no Hoare annotation was computed. [2018-01-20 22:22:07,546 INFO L401 ceAbstractionStarter]: For program point L1457'(line 1457) no Hoare annotation was computed. [2018-01-20 22:22:07,546 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_init_arvo_device_structEXIT(lines 1453 1458) no Hoare annotation was computed. [2018-01-20 22:22:07,546 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_init_arvo_device_structErr0EnsuresViolation(lines 1453 1458) no Hoare annotation was computed. [2018-01-20 22:22:07,548 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:22:07,548 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:22:07,548 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:22:07,548 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:22:07,548 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:22:07,548 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:22:07,548 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:22:07,548 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_mallocErr0EnsuresViolation======== [2018-01-20 22:22:07,548 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:22:07,549 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2018-01-20 22:22:07,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-20 22:22:07,550 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:22:07,550 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:22:07,550 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-20 22:22:07,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1044988527, now seen corresponding path program 1 times [2018-01-20 22:22:07,550 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:22:07,550 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:22:07,551 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:07,551 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:22:07,551 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:07,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:22:07,556 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:22:07,568 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-20 22:22:07,568 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:22:07,568 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:22:07,568 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 22:22:07,569 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 22:22:07,569 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 22:22:07,569 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 3 states. [2018-01-20 22:22:07,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:22:07,654 INFO L93 Difference]: Finished difference Result 154 states and 168 transitions. [2018-01-20 22:22:07,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 22:22:07,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-01-20 22:22:07,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:22:07,655 INFO L225 Difference]: With dead ends: 154 [2018-01-20 22:22:07,655 INFO L226 Difference]: Without dead ends: 21 [2018-01-20 22:22:07,656 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 22:22:07,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-01-20 22:22:07,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-01-20 22:22:07,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-01-20 22:22:07,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-01-20 22:22:07,660 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 10 [2018-01-20 22:22:07,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:22:07,660 INFO L432 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-01-20 22:22:07,660 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 22:22:07,660 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-01-20 22:22:07,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-20 22:22:07,661 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:22:07,661 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:22:07,661 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-20 22:22:07,661 INFO L82 PathProgramCache]: Analyzing trace with hash -788462575, now seen corresponding path program 1 times [2018-01-20 22:22:07,661 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:22:07,661 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:22:07,662 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:07,663 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:22:07,663 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:07,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:22:07,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:22:07,693 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 22:22:07,699 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:22:07,700 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:22:07,710 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:22:07,710 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:22:07,710 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:22:07,710 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:22:07,710 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:22:07,710 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:22:07,710 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:22:07,710 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-20 22:22:07,710 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:22:07,711 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2018-01-20 22:22:07,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-20 22:22:07,712 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:22:07,712 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-20 22:22:07,712 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-20 22:22:07,712 INFO L82 PathProgramCache]: Analyzing trace with hash 232304, now seen corresponding path program 1 times [2018-01-20 22:22:07,712 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:22:07,712 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:22:07,713 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:07,713 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:22:07,714 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:07,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:22:07,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:22:07,718 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 22:22:07,719 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:22:07,721 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:22:07,721 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:22:07,721 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:22:07,721 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:22:07,721 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:22:07,721 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:22:07,722 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:22:07,722 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_arvo_init_specialsErr0EnsuresViolation======== [2018-01-20 22:22:07,722 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:22:07,723 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2018-01-20 22:22:07,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-20 22:22:07,725 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:22:07,725 INFO L322 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2018-01-20 22:22:07,725 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_arvo_init_specialsErr0EnsuresViolation]=== [2018-01-20 22:22:07,726 INFO L82 PathProgramCache]: Analyzing trace with hash -66861931, now seen corresponding path program 1 times [2018-01-20 22:22:07,726 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:22:07,726 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:22:07,727 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:07,727 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:22:07,727 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:07,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:22:07,738 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:22:07,781 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-20 22:22:07,782 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:22:07,782 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-20 22:22:07,787 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:22:07,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:22:07,825 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:22:07,839 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-20 22:22:07,860 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-20 22:22:07,861 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2018-01-20 22:22:07,861 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-20 22:22:07,861 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-20 22:22:07,861 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-20 22:22:07,861 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 6 states. [2018-01-20 22:22:08,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:22:08,074 INFO L93 Difference]: Finished difference Result 279 states and 321 transitions. [2018-01-20 22:22:08,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-20 22:22:08,075 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-01-20 22:22:08,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:22:08,076 INFO L225 Difference]: With dead ends: 279 [2018-01-20 22:22:08,076 INFO L226 Difference]: Without dead ends: 74 [2018-01-20 22:22:08,076 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-01-20 22:22:08,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-20 22:22:08,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-01-20 22:22:08,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-20 22:22:08,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2018-01-20 22:22:08,082 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 54 [2018-01-20 22:22:08,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:22:08,083 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2018-01-20 22:22:08,083 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-20 22:22:08,083 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2018-01-20 22:22:08,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-01-20 22:22:08,084 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:22:08,084 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 22:22:08,084 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ldv_arvo_init_specialsErr0EnsuresViolation]=== [2018-01-20 22:22:08,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1740034391, now seen corresponding path program 1 times [2018-01-20 22:22:08,084 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:22:08,084 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:22:08,085 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:08,085 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:22:08,085 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:08,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:22:08,095 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:22:08,148 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-20 22:22:08,148 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:22:08,148 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-20 22:22:08,154 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:22:08,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:22:08,190 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:22:08,195 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc2.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#t~malloc2.base| 1)) (<= (select |c_old(#valid)| |ldv_malloc_#t~malloc2.base|) 0))) is different from true [2018-01-20 22:22:08,206 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-20 22:22:08,226 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-20 22:22:08,226 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2018-01-20 22:22:08,227 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 22:22:08,227 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 22:22:08,227 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2018-01-20 22:22:08,227 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand 5 states. [2018-01-20 22:22:08,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:22:08,255 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2018-01-20 22:22:08,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-20 22:22:08,255 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2018-01-20 22:22:08,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:22:08,256 INFO L225 Difference]: With dead ends: 81 [2018-01-20 22:22:08,256 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 22:22:08,256 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2018-01-20 22:22:08,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 22:22:08,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 22:22:08,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 22:22:08,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 22:22:08,257 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 79 [2018-01-20 22:22:08,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:22:08,257 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 22:22:08,257 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 22:22:08,257 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 22:22:08,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 22:22:08,259 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:22:08,259 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:22:08,259 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:22:08,259 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:22:08,259 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:22:08,259 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:22:08,259 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:22:08,259 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_dev_set_drvdataErr0EnsuresViolation======== [2018-01-20 22:22:08,259 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:22:08,260 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2018-01-20 22:22:08,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-20 22:22:08,261 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:22:08,261 INFO L322 BasicCegarLoop]: trace histogram [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] [2018-01-20 22:22:08,261 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_dev_set_drvdataErr0EnsuresViolation]=== [2018-01-20 22:22:08,261 INFO L82 PathProgramCache]: Analyzing trace with hash -429635641, now seen corresponding path program 1 times [2018-01-20 22:22:08,262 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:22:08,262 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:22:08,262 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:08,262 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:22:08,263 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:08,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:22:08,271 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:22:08,317 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-20 22:22:08,321 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:22:08,322 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-20 22:22:08,332 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:22:08,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:22:08,366 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:22:08,370 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-20 22:22:08,395 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-20 22:22:08,395 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [5] total 5 [2018-01-20 22:22:08,396 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 22:22:08,396 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 22:22:08,396 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 22:22:08,396 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 5 states. [2018-01-20 22:22:08,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:22:08,423 INFO L93 Difference]: Finished difference Result 280 states and 315 transitions. [2018-01-20 22:22:08,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 22:22:08,424 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-01-20 22:22:08,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:22:08,424 INFO L225 Difference]: With dead ends: 280 [2018-01-20 22:22:08,424 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 22:22:08,425 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 22:22:08,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 22:22:08,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 22:22:08,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 22:22:08,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 22:22:08,426 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2018-01-20 22:22:08,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:22:08,426 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 22:22:08,426 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 22:22:08,426 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 22:22:08,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 22:22:08,428 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:22:08,428 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:22:08,428 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:22:08,429 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:22:08,429 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:22:08,429 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:22:08,429 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:22:08,429 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_hid_set_drvdataErr0EnsuresViolation======== [2018-01-20 22:22:08,429 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:22:08,431 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2018-01-20 22:22:08,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-20 22:22:08,432 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:22:08,432 INFO L322 BasicCegarLoop]: trace histogram [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-20 22:22:08,432 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_hid_set_drvdataErr0EnsuresViolation]=== [2018-01-20 22:22:08,432 INFO L82 PathProgramCache]: Analyzing trace with hash -562985946, now seen corresponding path program 1 times [2018-01-20 22:22:08,432 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:22:08,433 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:22:08,434 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:08,434 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:22:08,434 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:08,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:22:08,443 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:22:08,489 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-20 22:22:08,489 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:22:08,490 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-20 22:22:08,500 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:22:08,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:22:08,543 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:22:08,549 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-20 22:22:08,584 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-20 22:22:08,584 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [5] total 5 [2018-01-20 22:22:08,584 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 22:22:08,585 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 22:22:08,585 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 22:22:08,585 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 5 states. [2018-01-20 22:22:08,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:22:08,618 INFO L93 Difference]: Finished difference Result 280 states and 315 transitions. [2018-01-20 22:22:08,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 22:22:08,618 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2018-01-20 22:22:08,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:22:08,619 INFO L225 Difference]: With dead ends: 280 [2018-01-20 22:22:08,619 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 22:22:08,620 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 22:22:08,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 22:22:08,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 22:22:08,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 22:22:08,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 22:22:08,621 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2018-01-20 22:22:08,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:22:08,621 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 22:22:08,621 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 22:22:08,621 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 22:22:08,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 22:22:08,623 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:22:08,623 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:22:08,623 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:22:08,623 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:22:08,623 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:22:08,623 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:22:08,623 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:22:08,623 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_zallocErr0EnsuresViolation======== [2018-01-20 22:22:08,624 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:22:08,625 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2018-01-20 22:22:08,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-01-20 22:22:08,626 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:22:08,626 INFO L322 BasicCegarLoop]: trace histogram [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, 1, 1] [2018-01-20 22:22:08,627 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_zallocErr0EnsuresViolation]=== [2018-01-20 22:22:08,627 INFO L82 PathProgramCache]: Analyzing trace with hash -48449455, now seen corresponding path program 1 times [2018-01-20 22:22:08,627 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:22:08,627 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:22:08,628 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:08,628 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:22:08,628 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:08,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:22:08,637 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:22:08,677 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-20 22:22:08,677 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:22:08,677 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-20 22:22:08,686 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:22:08,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:22:08,734 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:22:08,778 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-20 22:22:08,812 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-20 22:22:08,812 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2018-01-20 22:22:08,813 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 22:22:08,813 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 22:22:08,813 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 22:22:08,813 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 5 states. [2018-01-20 22:22:08,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:22:08,846 INFO L93 Difference]: Finished difference Result 280 states and 315 transitions. [2018-01-20 22:22:08,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 22:22:08,846 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-01-20 22:22:08,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:22:08,847 INFO L225 Difference]: With dead ends: 280 [2018-01-20 22:22:08,847 INFO L226 Difference]: Without dead ends: 50 [2018-01-20 22:22:08,848 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 22:22:08,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-20 22:22:08,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-01-20 22:22:08,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-20 22:22:08,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-01-20 22:22:08,854 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 53 [2018-01-20 22:22:08,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:22:08,854 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-01-20 22:22:08,854 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 22:22:08,854 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-01-20 22:22:08,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-20 22:22:08,855 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:22:08,855 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:22:08,855 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ldv_zallocErr0EnsuresViolation]=== [2018-01-20 22:22:08,856 INFO L82 PathProgramCache]: Analyzing trace with hash 319882607, now seen corresponding path program 1 times [2018-01-20 22:22:08,856 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:22:08,856 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:22:08,857 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:08,857 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:22:08,857 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:08,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:22:08,867 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:22:08,900 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-20 22:22:08,900 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:22:08,901 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-20 22:22:08,912 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:22:08,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:22:08,950 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:22:08,965 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc2.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#t~malloc2.base| 1)) (<= (select |c_old(#valid)| |ldv_malloc_#t~malloc2.base|) 0))) is different from true [2018-01-20 22:22:08,977 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-20 22:22:08,999 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-20 22:22:09,023 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2018-01-20 22:22:09,024 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 22:22:09,024 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 22:22:09,024 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2018-01-20 22:22:09,024 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 5 states. [2018-01-20 22:22:09,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:22:09,061 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-01-20 22:22:09,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-20 22:22:09,062 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2018-01-20 22:22:09,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:22:09,062 INFO L225 Difference]: With dead ends: 57 [2018-01-20 22:22:09,063 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 22:22:09,063 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2018-01-20 22:22:09,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 22:22:09,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 22:22:09,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 22:22:09,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 22:22:09,064 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 55 [2018-01-20 22:22:09,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:22:09,064 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 22:22:09,064 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 22:22:09,064 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 22:22:09,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 22:22:09,066 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:22:09,066 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:22:09,066 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:22:09,066 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:22:09,066 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:22:09,066 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:22:09,066 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:22:09,067 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_nonpositiveErr0EnsuresViolation======== [2018-01-20 22:22:09,067 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:22:09,068 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2018-01-20 22:22:09,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-01-20 22:22:09,069 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:22:09,070 INFO L322 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:22:09,070 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_nonpositiveErr0EnsuresViolation]=== [2018-01-20 22:22:09,070 INFO L82 PathProgramCache]: Analyzing trace with hash -205702625, now seen corresponding path program 1 times [2018-01-20 22:22:09,070 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:22:09,070 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:22:09,071 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:09,071 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:22:09,071 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:09,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:22:09,081 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:22:09,162 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-20 22:22:09,162 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:22:09,162 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-20 22:22:09,176 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:22:09,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:22:09,216 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:22:09,222 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-20 22:22:09,255 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-20 22:22:09,255 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [5] total 5 [2018-01-20 22:22:09,256 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 22:22:09,256 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 22:22:09,256 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 22:22:09,256 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 5 states. [2018-01-20 22:22:09,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:22:09,284 INFO L93 Difference]: Finished difference Result 280 states and 315 transitions. [2018-01-20 22:22:09,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 22:22:09,284 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-01-20 22:22:09,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:22:09,285 INFO L225 Difference]: With dead ends: 280 [2018-01-20 22:22:09,285 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 22:22:09,286 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 22:22:09,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 22:22:09,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 22:22:09,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 22:22:09,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 22:22:09,287 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 68 [2018-01-20 22:22:09,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:22:09,287 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 22:22:09,287 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 22:22:09,287 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 22:22:09,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 22:22:09,289 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:22:09,289 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:22:09,289 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:22:09,290 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:22:09,290 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:22:09,290 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:22:09,290 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:22:09,290 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_hid_get_drvdataErr0EnsuresViolation======== [2018-01-20 22:22:09,290 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:22:09,292 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2018-01-20 22:22:09,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-20 22:22:09,294 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:22:09,294 INFO L322 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 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-20 22:22:09,294 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_hid_get_drvdataErr0EnsuresViolation]=== [2018-01-20 22:22:09,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1619559385, now seen corresponding path program 1 times [2018-01-20 22:22:09,294 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:22:09,294 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:22:09,296 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:09,296 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:22:09,296 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:09,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:22:09,306 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:22:09,377 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-20 22:22:09,378 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:22:09,378 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-20 22:22:09,383 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:22:09,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:22:09,419 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:22:09,424 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-20 22:22:09,446 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-20 22:22:09,446 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [5] total 5 [2018-01-20 22:22:09,446 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 22:22:09,446 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 22:22:09,447 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 22:22:09,447 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 5 states. [2018-01-20 22:22:09,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:22:09,478 INFO L93 Difference]: Finished difference Result 280 states and 315 transitions. [2018-01-20 22:22:09,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 22:22:09,479 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2018-01-20 22:22:09,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:22:09,479 INFO L225 Difference]: With dead ends: 280 [2018-01-20 22:22:09,479 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 22:22:09,480 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 22:22:09,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 22:22:09,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 22:22:09,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 22:22:09,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 22:22:09,480 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 80 [2018-01-20 22:22:09,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:22:09,480 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 22:22:09,480 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 22:22:09,480 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 22:22:09,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 22:22:09,482 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:22:09,482 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:22:09,482 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:22:09,482 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:22:09,482 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:22:09,482 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:22:09,482 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:22:09,482 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_dev_get_drvdataErr0EnsuresViolation======== [2018-01-20 22:22:09,482 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:22:09,483 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2018-01-20 22:22:09,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-01-20 22:22:09,484 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:22:09,484 INFO L322 BasicCegarLoop]: trace histogram [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, 1, 1, 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-20 22:22:09,484 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_dev_get_drvdataErr0EnsuresViolation]=== [2018-01-20 22:22:09,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1006649024, now seen corresponding path program 1 times [2018-01-20 22:22:09,485 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:22:09,485 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:22:09,486 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:09,486 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:22:09,486 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:09,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:22:09,494 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:22:09,565 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-20 22:22:09,565 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:22:09,565 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-20 22:22:09,571 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:22:09,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:22:09,609 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:22:09,614 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-20 22:22:09,635 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-20 22:22:09,635 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [5] total 5 [2018-01-20 22:22:09,635 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 22:22:09,635 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 22:22:09,635 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 22:22:09,636 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 5 states. [2018-01-20 22:22:09,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:22:09,665 INFO L93 Difference]: Finished difference Result 280 states and 315 transitions. [2018-01-20 22:22:09,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 22:22:09,665 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2018-01-20 22:22:09,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:22:09,666 INFO L225 Difference]: With dead ends: 280 [2018-01-20 22:22:09,666 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 22:22:09,667 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 22:22:09,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 22:22:09,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 22:22:09,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 22:22:09,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 22:22:09,667 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 77 [2018-01-20 22:22:09,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:22:09,668 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 22:22:09,668 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 22:22:09,668 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 22:22:09,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 22:22:09,670 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:22:09,670 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:22:09,670 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:22:09,670 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:22:09,670 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:22:09,670 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:22:09,671 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:22:09,671 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-20 22:22:09,671 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:22:09,672 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2018-01-20 22:22:09,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-20 22:22:09,673 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:22:09,673 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:22:09,673 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:22:09,673 INFO L82 PathProgramCache]: Analyzing trace with hash 298466484, now seen corresponding path program 1 times [2018-01-20 22:22:09,673 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:22:09,674 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:22:09,675 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:09,675 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:22:09,675 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:09,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:22:09,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:22:09,691 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 22:22:09,692 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:22:09,693 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:22:09,693 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:22:09,694 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:22:09,694 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:22:09,696 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:22:09,697 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:22:09,697 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:22:09,697 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:22:09,697 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:22:09,697 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:22:09,697 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:22:09,697 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_arvo_probeErr0EnsuresViolation======== [2018-01-20 22:22:09,697 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:22:09,699 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2018-01-20 22:22:09,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-20 22:22:09,700 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:22:09,700 INFO L322 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:22:09,700 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_arvo_probeErr0EnsuresViolation]=== [2018-01-20 22:22:09,700 INFO L82 PathProgramCache]: Analyzing trace with hash 352036426, now seen corresponding path program 1 times [2018-01-20 22:22:09,700 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:22:09,700 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:22:09,701 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:09,701 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:22:09,702 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:09,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:22:09,710 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:22:09,783 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-20 22:22:09,783 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:22:09,784 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-20 22:22:09,791 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:22:09,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:22:09,836 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:22:09,847 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-20 22:22:09,867 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-20 22:22:09,867 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2018-01-20 22:22:09,868 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-20 22:22:09,868 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-20 22:22:09,868 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-20 22:22:09,868 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 6 states. [2018-01-20 22:22:10,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:22:10,128 INFO L93 Difference]: Finished difference Result 279 states and 321 transitions. [2018-01-20 22:22:10,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-20 22:22:10,129 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2018-01-20 22:22:10,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:22:10,129 INFO L225 Difference]: With dead ends: 279 [2018-01-20 22:22:10,129 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 22:22:10,130 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-01-20 22:22:10,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 22:22:10,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 22:22:10,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 22:22:10,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 22:22:10,130 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2018-01-20 22:22:10,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:22:10,131 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 22:22:10,131 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-20 22:22:10,131 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 22:22:10,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 22:22:10,132 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:22:10,133 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:22:10,133 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:22:10,133 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:22:10,133 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:22:10,133 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:22:10,133 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:22:10,133 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == entry_pointErr0EnsuresViolation======== [2018-01-20 22:22:10,133 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:22:10,134 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2018-01-20 22:22:10,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-20 22:22:10,135 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:22:10,135 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:22:10,135 INFO L371 AbstractCegarLoop]: === Iteration 1 === [entry_pointErr0EnsuresViolation]=== [2018-01-20 22:22:10,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1707362669, now seen corresponding path program 1 times [2018-01-20 22:22:10,135 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:22:10,135 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:22:10,136 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:10,137 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:22:10,137 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:10,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:22:10,140 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:22:10,164 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-20 22:22:10,164 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:22:10,164 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:22:10,164 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 22:22:10,164 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 22:22:10,164 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 22:22:10,165 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 3 states. [2018-01-20 22:22:10,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:22:10,280 INFO L93 Difference]: Finished difference Result 154 states and 168 transitions. [2018-01-20 22:22:10,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 22:22:10,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-01-20 22:22:10,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:22:10,282 INFO L225 Difference]: With dead ends: 154 [2018-01-20 22:22:10,282 INFO L226 Difference]: Without dead ends: 129 [2018-01-20 22:22:10,283 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 22:22:10,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-01-20 22:22:10,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 124. [2018-01-20 22:22:10,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-01-20 22:22:10,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 137 transitions. [2018-01-20 22:22:10,294 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 137 transitions. Word has length 14 [2018-01-20 22:22:10,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:22:10,294 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 137 transitions. [2018-01-20 22:22:10,295 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 22:22:10,295 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 137 transitions. [2018-01-20 22:22:10,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-20 22:22:10,295 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:22:10,295 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:22:10,295 INFO L371 AbstractCegarLoop]: === Iteration 2 === [entry_pointErr0EnsuresViolation]=== [2018-01-20 22:22:10,296 INFO L82 PathProgramCache]: Analyzing trace with hash -2053518524, now seen corresponding path program 1 times [2018-01-20 22:22:10,296 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:22:10,296 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:22:10,297 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:10,297 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:22:10,297 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:10,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:22:10,302 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:22:10,358 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-20 22:22:10,358 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:22:10,358 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-20 22:22:10,364 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:22:10,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:22:10,374 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:22:10,391 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-20 22:22:10,410 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:22:10,410 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2018-01-20 22:22:10,410 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-20 22:22:10,410 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-20 22:22:10,410 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-20 22:22:10,410 INFO L87 Difference]: Start difference. First operand 124 states and 137 transitions. Second operand 9 states. [2018-01-20 22:22:10,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:22:10,426 INFO L93 Difference]: Finished difference Result 243 states and 270 transitions. [2018-01-20 22:22:10,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 22:22:10,427 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-01-20 22:22:10,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:22:10,429 INFO L225 Difference]: With dead ends: 243 [2018-01-20 22:22:10,429 INFO L226 Difference]: Without dead ends: 126 [2018-01-20 22:22:10,430 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-20 22:22:10,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-01-20 22:22:10,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-01-20 22:22:10,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-01-20 22:22:10,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 140 transitions. [2018-01-20 22:22:10,441 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 140 transitions. Word has length 22 [2018-01-20 22:22:10,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:22:10,442 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 140 transitions. [2018-01-20 22:22:10,442 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-20 22:22:10,442 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 140 transitions. [2018-01-20 22:22:10,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-20 22:22:10,443 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:22:10,443 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:22:10,443 INFO L371 AbstractCegarLoop]: === Iteration 3 === [entry_pointErr0EnsuresViolation]=== [2018-01-20 22:22:10,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1956784614, now seen corresponding path program 1 times [2018-01-20 22:22:10,443 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:22:10,443 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:22:10,444 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:10,444 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:22:10,444 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:10,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:22:10,450 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:22:10,492 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:22:10,492 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:22:10,492 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:22:10,501 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:22:10,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:22:10,514 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:22:10,517 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc2.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#t~malloc2.base| 1)) (<= (select |c_old(#valid)| |ldv_malloc_#t~malloc2.base|) 0))) is different from true [2018-01-20 22:22:10,521 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-20 22:22:10,541 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-20 22:22:10,541 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2018-01-20 22:22:10,541 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 22:22:10,542 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 22:22:10,542 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2018-01-20 22:22:10,542 INFO L87 Difference]: Start difference. First operand 126 states and 140 transitions. Second operand 5 states. [2018-01-20 22:22:10,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:22:10,561 INFO L93 Difference]: Finished difference Result 133 states and 147 transitions. [2018-01-20 22:22:10,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-20 22:22:10,561 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-01-20 22:22:10,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:22:10,562 INFO L225 Difference]: With dead ends: 133 [2018-01-20 22:22:10,562 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 22:22:10,562 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2018-01-20 22:22:10,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 22:22:10,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 22:22:10,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 22:22:10,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 22:22:10,563 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2018-01-20 22:22:10,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:22:10,563 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 22:22:10,563 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 22:22:10,563 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 22:22:10,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 22:22:10,565 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:22:10,565 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:22:10,565 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:22:10,565 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:22:10,565 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:22:10,565 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:22:10,565 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:22:10,565 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_arvo_init_arvo_device_structErr0EnsuresViolation======== [2018-01-20 22:22:10,565 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:22:10,567 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2018-01-20 22:22:10,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-01-20 22:22:10,569 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:22:10,569 INFO L322 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:22:10,569 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_arvo_init_arvo_device_structErr0EnsuresViolation]=== [2018-01-20 22:22:10,569 INFO L82 PathProgramCache]: Analyzing trace with hash 831609464, now seen corresponding path program 1 times [2018-01-20 22:22:10,569 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:22:10,569 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:22:10,570 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:10,571 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:22:10,571 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:10,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:22:10,579 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:22:10,639 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-20 22:22:10,639 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:22:10,639 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:22:10,647 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:22:10,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:22:10,680 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:22:10,684 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-20 22:22:10,705 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-20 22:22:10,705 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [5] total 5 [2018-01-20 22:22:10,705 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 22:22:10,705 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 22:22:10,706 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 22:22:10,706 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 5 states. [2018-01-20 22:22:10,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:22:10,722 INFO L93 Difference]: Finished difference Result 280 states and 315 transitions. [2018-01-20 22:22:10,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 22:22:10,723 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2018-01-20 22:22:10,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:22:10,723 INFO L225 Difference]: With dead ends: 280 [2018-01-20 22:22:10,723 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 22:22:10,725 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 22:22:10,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 22:22:10,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 22:22:10,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 22:22:10,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 22:22:10,725 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 71 [2018-01-20 22:22:10,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:22:10,726 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 22:22:10,726 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 22:22:10,726 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 22:22:10,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 22:22:10,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.01 10:22:10 BoogieIcfgContainer [2018-01-20 22:22:10,731 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-20 22:22:10,732 INFO L168 Benchmark]: Toolchain (without parser) took 6527.40 ms. Allocated memory was 298.3 MB in the beginning and 541.6 MB in the end (delta: 243.3 MB). Free memory was 257.2 MB in the beginning and 418.8 MB in the end (delta: -161.6 MB). Peak memory consumption was 81.7 MB. Max. memory is 5.3 GB. [2018-01-20 22:22:10,734 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 298.3 MB. Free memory is still 264.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-20 22:22:10,734 INFO L168 Benchmark]: CACSL2BoogieTranslator took 262.95 ms. Allocated memory is still 298.3 MB. Free memory was 257.2 MB in the beginning and 242.2 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 5.3 GB. [2018-01-20 22:22:10,735 INFO L168 Benchmark]: Boogie Preprocessor took 42.59 ms. Allocated memory is still 298.3 MB. Free memory was 242.2 MB in the beginning and 240.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-20 22:22:10,735 INFO L168 Benchmark]: RCFGBuilder took 515.77 ms. Allocated memory is still 298.3 MB. Free memory was 240.2 MB in the beginning and 204.2 MB in the end (delta: 36.0 MB). Peak memory consumption was 36.0 MB. Max. memory is 5.3 GB. [2018-01-20 22:22:10,736 INFO L168 Benchmark]: TraceAbstraction took 5697.79 ms. Allocated memory was 298.3 MB in the beginning and 541.6 MB in the end (delta: 243.3 MB). Free memory was 204.2 MB in the beginning and 418.8 MB in the end (delta: -214.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 5.3 GB. [2018-01-20 22:22:10,738 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.20 ms. Allocated memory is still 298.3 MB. Free memory is still 264.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 262.95 ms. Allocated memory is still 298.3 MB. Free memory was 257.2 MB in the beginning and 242.2 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 42.59 ms. Allocated memory is still 298.3 MB. Free memory was 242.2 MB in the beginning and 240.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 515.77 ms. Allocated memory is still 298.3 MB. Free memory was 240.2 MB in the beginning and 204.2 MB in the end (delta: 36.0 MB). Peak memory consumption was 36.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 5697.79 ms. Allocated memory was 298.3 MB in the beginning and 541.6 MB in the end (delta: 243.3 MB). Free memory was 204.2 MB in the beginning and 418.8 MB in the end (delta: -214.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1533]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 17 procedures, 144 locations, 16 error locations. SAFE Result, 0.6s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 118 SDtfs, 83 SDslu, 4 SDs, 0 SdLazy, 49 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=0, 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, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 39 LocationsWithAnnotation, 43 PreInvPairs, 46 NumberOfFragments, 83 HoareAnnotationTreeSize, 43 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 39 FomulaSimplificationsInter, 22 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 16 NumberOfCodeBlocks, 16 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 555 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1483]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: lvd_arvo_remove_specialsErr0EnsuresViolation CFG has 17 procedures, 144 locations, 16 error locations. SAFE Result, 1.1s OverallTime, 2 OverallIterations, 3 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 126 SDtfs, 88 SDslu, 267 SDs, 0 SdLazy, 251 SolverSat, 50 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 169 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=0, 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, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 39 LocationsWithAnnotation, 73 PreInvPairs, 79 NumberOfFragments, 47 HoareAnnotationTreeSize, 73 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 39 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 314 NumberOfCodeBlocks, 314 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 310 ConstructedInterpolants, 2 QuantifiedInterpolants, 30480 SizeOfPredicates, 3 NumberOfNonLiveVariables, 666 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 36/48 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1504]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: ldv_arvo_removeErr0EnsuresViolation CFG has 17 procedures, 144 locations, 16 error locations. SAFE Result, 0.6s OverallTime, 1 OverallIterations, 3 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 116 SDtfs, 84 SDslu, 263 SDs, 0 SdLazy, 237 SolverSat, 44 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=0, 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, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 39 LocationsWithAnnotation, 73 PreInvPairs, 83 NumberOfFragments, 83 HoareAnnotationTreeSize, 73 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 39 FomulaSimplificationsInter, 22 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 146 NumberOfCodeBlocks, 146 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 144 ConstructedInterpolants, 0 QuantifiedInterpolants, 13680 SizeOfPredicates, 0 NumberOfNonLiveVariables, 307 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 20/24 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1072]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1534] CALL entry_point() [L1509] CALL ldv_malloc(sizeof(struct ldv_hid_device)) VAL [\old(size)=12] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=12, malloc(size)={14:0}, size=12] [L1074] return malloc(size); VAL [\old(size)=12, \result={14:0}, malloc(size)={14:0}, size=12] - StatisticsResult: Ultimate Automizer benchmark data for error location: ldv_mallocErr0EnsuresViolation CFG has 17 procedures, 144 locations, 16 error locations. UNSAFE Result, 0.1s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 118 SDtfs, 87 SDslu, 4 SDs, 0 SdLazy, 49 SolverSat, 40 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=0, 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, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 22 NumberOfCodeBlocks, 22 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 135 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 17 procedures, 144 locations, 16 error locations. UNSAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=0, 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, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1460]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: ldv_arvo_init_specialsErr0EnsuresViolation CFG has 17 procedures, 144 locations, 16 error locations. SAFE Result, 0.5s OverallTime, 2 OverallIterations, 3 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 126 SDtfs, 87 SDslu, 267 SDs, 0 SdLazy, 251 SolverSat, 50 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 145 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=0, 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, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 266 NumberOfCodeBlocks, 266 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 262 ConstructedInterpolants, 2 QuantifiedInterpolants, 23288 SizeOfPredicates, 3 NumberOfNonLiveVariables, 564 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 36/48 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1196]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: ldv_dev_set_drvdataErr0EnsuresViolation CFG has 17 procedures, 144 locations, 16 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 3 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 150 SDtfs, 4 SDslu, 445 SDs, 0 SdLazy, 11 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=0, 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, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 98 NumberOfCodeBlocks, 98 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 96 ConstructedInterpolants, 0 QuantifiedInterpolants, 5760 SizeOfPredicates, 0 NumberOfNonLiveVariables, 241 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 20/24 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1444]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: ldv_hid_set_drvdataErr0EnsuresViolation CFG has 17 procedures, 144 locations, 16 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 3 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 150 SDtfs, 4 SDslu, 445 SDs, 0 SdLazy, 11 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=0, 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, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 102 NumberOfCodeBlocks, 102 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 100 ConstructedInterpolants, 0 QuantifiedInterpolants, 6200 SizeOfPredicates, 0 NumberOfNonLiveVariables, 243 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 20/24 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1080]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: ldv_zallocErr0EnsuresViolation CFG has 17 procedures, 144 locations, 16 error locations. SAFE Result, 0.4s OverallTime, 2 OverallIterations, 3 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 160 SDtfs, 6 SDslu, 449 SDs, 0 SdLazy, 25 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 106 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=0, 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, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 216 NumberOfCodeBlocks, 216 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 212 ConstructedInterpolants, 2 QuantifiedInterpolants, 16004 SizeOfPredicates, 5 NumberOfNonLiveVariables, 484 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 36/48 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1057]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: ldv_nonpositiveErr0EnsuresViolation CFG has 17 procedures, 144 locations, 16 error locations. SAFE Result, 0.2s OverallTime, 1 OverallIterations, 3 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 150 SDtfs, 4 SDslu, 445 SDs, 0 SdLazy, 11 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=0, 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, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 136 NumberOfCodeBlocks, 136 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 134 ConstructedInterpolants, 0 QuantifiedInterpolants, 10586 SizeOfPredicates, 0 NumberOfNonLiveVariables, 289 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 20/24 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1439]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: ldv_hid_get_drvdataErr0EnsuresViolation CFG has 17 procedures, 144 locations, 16 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 3 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 150 SDtfs, 4 SDslu, 445 SDs, 0 SdLazy, 11 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=0, 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, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 160 NumberOfCodeBlocks, 160 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 158 ConstructedInterpolants, 0 QuantifiedInterpolants, 14378 SizeOfPredicates, 0 NumberOfNonLiveVariables, 341 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 20/24 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1191]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: ldv_dev_get_drvdataErr0EnsuresViolation CFG has 17 procedures, 144 locations, 16 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 3 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 150 SDtfs, 4 SDslu, 445 SDs, 0 SdLazy, 11 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=0, 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, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 154 NumberOfCodeBlocks, 154 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 152 ConstructedInterpolants, 0 QuantifiedInterpolants, 13376 SizeOfPredicates, 0 NumberOfNonLiveVariables, 332 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 20/24 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1534] CALL entry_point() [L1509] CALL, EXPR ldv_malloc(sizeof(struct ldv_hid_device)) VAL [\old(size)=12] [L1073] COND FALSE !(__VERIFIER_nondet_int()) [L1076] RET return 0; VAL [\old(size)=12, \result={0:0}, size=12] [L1509] EXPR ldv_malloc(sizeof(struct ldv_hid_device)) VAL [ldv_malloc(sizeof(struct ldv_hid_device))={0:0}] [L1509] struct ldv_hid_device *hdev = (struct ldv_hid_device *)ldv_malloc(sizeof(struct ldv_hid_device)); [L1510] COND TRUE, RET !hdev VAL [hdev={0:0}] [L1534] entry_point() - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 17 procedures, 144 locations, 16 error locations. UNSAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=0, 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, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 18 NumberOfCodeBlocks, 18 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1493]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: ldv_arvo_probeErr0EnsuresViolation CFG has 17 procedures, 144 locations, 16 error locations. SAFE Result, 0.4s OverallTime, 1 OverallIterations, 3 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 116 SDtfs, 81 SDslu, 263 SDs, 0 SdLazy, 237 SolverSat, 44 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=0, 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, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 116 NumberOfCodeBlocks, 116 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 114 ConstructedInterpolants, 0 QuantifiedInterpolants, 9576 SizeOfPredicates, 0 NumberOfNonLiveVariables, 258 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 20/24 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1508]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: entry_pointErr0EnsuresViolation CFG has 17 procedures, 144 locations, 16 error locations. SAFE Result, 0.4s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 264 SDtfs, 86 SDslu, 813 SDs, 0 SdLazy, 80 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=0, 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, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 106 NumberOfCodeBlocks, 106 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 101 ConstructedInterpolants, 2 QuantifiedInterpolants, 4207 SizeOfPredicates, 4 NumberOfNonLiveVariables, 212 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 8/16 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1453]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: ldv_arvo_init_arvo_device_structErr0EnsuresViolation CFG has 17 procedures, 144 locations, 16 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 3 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 150 SDtfs, 4 SDslu, 445 SDs, 0 SdLazy, 11 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=0, 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, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 142 NumberOfCodeBlocks, 142 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 140 ConstructedInterpolants, 0 QuantifiedInterpolants, 11480 SizeOfPredicates, 0 NumberOfNonLiveVariables, 296 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 20/24 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - InvariantResult [Line: 1525]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1526]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1474]: Loop Invariant Derived loop invariant: \valid == \old(\valid) - InvariantResult [Line: 1528]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1497]: Loop Invariant Derived loop invariant: \valid == \old(\valid) RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test15_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-20_22-22-10-753.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test15_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-20_22-22-10-753.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test15_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-20_22-22-10-753.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test15_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-20_22-22-10-753.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test15_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-20_22-22-10-753.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test15_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-4-2018-01-20_22-22-10-753.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test15_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-5-2018-01-20_22-22-10-753.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test15_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-6-2018-01-20_22-22-10-753.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test15_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-7-2018-01-20_22-22-10-753.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test15_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-8-2018-01-20_22-22-10-753.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test15_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-9-2018-01-20_22-22-10-753.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test15_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-10-2018-01-20_22-22-10-753.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test15_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-11-2018-01-20_22-22-10-753.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test15_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-12-2018-01-20_22-22-10-753.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test15_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-13-2018-01-20_22-22-10-753.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test15_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-14-2018-01-20_22-22-10-753.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test15_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-15-2018-01-20_22-22-10-753.csv Received shutdown request...