./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-drivers--isdn--mISDN--mISDN_dsp.ko-entry_point_true-unreach-call.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-drivers--isdn--mISDN--mISDN_dsp.ko-entry_point_true-unreach-call.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 2ea396948da43fd1e2fc400290cb69ba7b7ab941 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-13 10:10:43,703 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 10:10:43,706 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 10:10:43,726 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 10:10:43,728 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 10:10:43,729 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 10:10:43,731 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 10:10:43,734 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 10:10:43,736 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 10:10:43,738 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 10:10:43,739 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 10:10:43,739 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 10:10:43,741 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 10:10:43,743 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 10:10:43,745 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 10:10:43,747 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 10:10:43,748 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 10:10:43,751 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 10:10:43,754 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 10:10:43,757 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 10:10:43,759 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 10:10:43,761 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 10:10:43,765 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 10:10:43,766 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 10:10:43,766 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 10:10:43,768 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 10:10:43,769 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 10:10:43,771 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 10:10:43,772 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 10:10:43,774 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 10:10:43,775 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 10:10:43,776 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 10:10:43,776 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 10:10:43,776 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 10:10:43,778 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 10:10:43,780 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 10:10:43,780 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2019-01-13 10:10:43,811 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 10:10:43,812 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 10:10:43,815 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 10:10:43,815 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 10:10:43,816 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 10:10:43,816 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 10:10:43,816 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 10:10:43,816 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 10:10:43,816 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-13 10:10:43,817 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 10:10:43,817 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-13 10:10:43,817 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-13 10:10:43,817 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 10:10:43,817 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-13 10:10:43,819 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 10:10:43,819 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 10:10:43,821 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 10:10:43,821 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 10:10:43,822 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 10:10:43,822 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 10:10:43,822 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 10:10:43,822 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-13 10:10:43,822 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 10:10:43,823 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 10:10:43,823 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-13 10:10:43,824 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-13 10:10:43,824 INFO L133 SettingsManager]: * To the following directory=dump/ Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2ea396948da43fd1e2fc400290cb69ba7b7ab941 [2019-01-13 10:10:43,891 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 10:10:43,913 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 10:10:43,920 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 10:10:43,922 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 10:10:43,923 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 10:10:43,924 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-drivers--isdn--mISDN--mISDN_dsp.ko-entry_point_true-unreach-call.cil.out.i [2019-01-13 10:10:43,998 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e81157a57/2a2d49e647564bec833cc701e89e1ccb/FLAGdaf9edc97 [2019-01-13 10:10:45,161 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 10:10:45,164 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-drivers--isdn--mISDN--mISDN_dsp.ko-entry_point_true-unreach-call.cil.out.i [2019-01-13 10:10:45,244 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e81157a57/2a2d49e647564bec833cc701e89e1ccb/FLAGdaf9edc97 [2019-01-13 10:10:45,419 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e81157a57/2a2d49e647564bec833cc701e89e1ccb [2019-01-13 10:10:45,424 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 10:10:45,426 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-13 10:10:45,427 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 10:10:45,427 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 10:10:45,433 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 10:10:45,435 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 10:10:45" (1/1) ... [2019-01-13 10:10:45,440 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dac00a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:10:45, skipping insertion in model container [2019-01-13 10:10:45,441 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 10:10:45" (1/1) ... [2019-01-13 10:10:45,453 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 10:10:45,669 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 10:10:46,373 WARN L1127 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [5690] [2019-01-13 10:10:46,374 WARN L1127 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [5691-5692] [2019-01-13 10:10:50,279 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 10:10:51,601 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 10:10:51,739 WARN L1127 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [5690] [2019-01-13 10:10:51,740 WARN L1127 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [5691-5692] [2019-01-13 10:10:52,182 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 10:10:52,802 INFO L195 MainTranslator]: Completed translation [2019-01-13 10:10:52,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:10:52 WrapperNode [2019-01-13 10:10:52,804 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 10:10:52,805 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-13 10:10:52,805 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-13 10:10:52,806 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-13 10:10:52,819 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:10:52" (1/1) ... [2019-01-13 10:10:52,983 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:10:52" (1/1) ... [2019-01-13 10:10:53,538 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-13 10:10:53,539 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 10:10:53,539 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 10:10:53,539 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 10:10:53,557 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:10:52" (1/1) ... [2019-01-13 10:10:53,558 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:10:52" (1/1) ... [2019-01-13 10:10:53,605 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:10:52" (1/1) ... [2019-01-13 10:10:53,606 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:10:52" (1/1) ... [2019-01-13 10:10:53,750 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:10:52" (1/1) ... [2019-01-13 10:10:53,764 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:10:52" (1/1) ... [2019-01-13 10:10:53,804 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:10:52" (1/1) ... [2019-01-13 10:10:53,853 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 10:10:53,853 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 10:10:53,854 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 10:10:53,858 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 10:10:53,859 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:10:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 10:10:53,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 10:10:53,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-13 10:10:53,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 10:10:53,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-01-13 10:10:53,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-13 10:10:53,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 10:10:53,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-13 10:10:53,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-13 10:10:53,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-13 10:10:53,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 10:10:53,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 10:13:03,013 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 10:13:03,014 INFO L286 CfgBuilder]: Removed 185 assue(true) statements. [2019-01-13 10:13:03,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 10:13:03 BoogieIcfgContainer [2019-01-13 10:13:03,016 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 10:13:03,017 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 10:13:03,017 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 10:13:03,021 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 10:13:03,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 10:10:45" (1/3) ... [2019-01-13 10:13:03,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b79c2bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 10:13:03, skipping insertion in model container [2019-01-13 10:13:03,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:10:52" (2/3) ... [2019-01-13 10:13:03,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b79c2bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 10:13:03, skipping insertion in model container [2019-01-13 10:13:03,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 10:13:03" (3/3) ... [2019-01-13 10:13:03,026 INFO L112 eAbstractionObserver]: Analyzing ICFG 43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-drivers--isdn--mISDN--mISDN_dsp.ko-entry_point_true-unreach-call.cil.out.i [2019-01-13 10:13:03,037 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 10:13:03,049 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-01-13 10:13:03,071 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-01-13 10:13:03,130 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 10:13:03,131 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 10:13:03,131 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-13 10:13:03,131 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 10:13:03,131 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 10:13:03,132 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 10:13:03,132 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 10:13:03,132 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 10:13:03,132 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 10:13:03,157 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states. [2019-01-13 10:13:03,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-13 10:13:03,175 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 10:13:03,176 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 10:13:03,181 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 10:13:03,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 10:13:03,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1453471065, now seen corresponding path program 1 times [2019-01-13 10:13:03,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 10:13:03,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 10:13:03,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 10:13:03,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 10:13:03,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 10:13:04,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 10:13:04,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 10:13:04,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 10:13:04,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 10:13:04,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 10:13:04,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 10:13:04,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 10:13:04,755 INFO L87 Difference]: Start difference. First operand 270 states. Second operand 3 states. [2019-01-13 10:13:09,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 10:13:09,088 INFO L93 Difference]: Finished difference Result 756 states and 1092 transitions. [2019-01-13 10:13:09,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 10:13:09,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-01-13 10:13:09,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 10:13:09,137 INFO L225 Difference]: With dead ends: 756 [2019-01-13 10:13:09,137 INFO L226 Difference]: Without dead ends: 435 [2019-01-13 10:13:09,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 10:13:09,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-01-13 10:13:09,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 433. [2019-01-13 10:13:09,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2019-01-13 10:13:09,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 629 transitions. [2019-01-13 10:13:09,231 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 629 transitions. Word has length 19 [2019-01-13 10:13:09,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 10:13:09,232 INFO L480 AbstractCegarLoop]: Abstraction has 433 states and 629 transitions. [2019-01-13 10:13:09,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 10:13:09,232 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 629 transitions. [2019-01-13 10:13:09,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-13 10:13:09,234 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 10:13:09,235 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 10:13:09,235 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 10:13:09,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 10:13:09,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1291370835, now seen corresponding path program 1 times [2019-01-13 10:13:09,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 10:13:09,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 10:13:09,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 10:13:09,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 10:13:09,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 10:13:09,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 10:13:10,254 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 10:13:10,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 10:13:10,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 10:13:10,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 10:13:10,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 10:13:10,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 10:13:10,263 INFO L87 Difference]: Start difference. First operand 433 states and 629 transitions. Second operand 4 states. [2019-01-13 10:13:15,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 10:13:15,632 INFO L93 Difference]: Finished difference Result 981 states and 1429 transitions. [2019-01-13 10:13:15,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 10:13:15,634 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-01-13 10:13:15,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 10:13:15,639 INFO L225 Difference]: With dead ends: 981 [2019-01-13 10:13:15,640 INFO L226 Difference]: Without dead ends: 554 [2019-01-13 10:13:15,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 10:13:15,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2019-01-13 10:13:15,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 465. [2019-01-13 10:13:15,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-01-13 10:13:15,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 677 transitions. [2019-01-13 10:13:15,690 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 677 transitions. Word has length 32 [2019-01-13 10:13:15,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 10:13:15,690 INFO L480 AbstractCegarLoop]: Abstraction has 465 states and 677 transitions. [2019-01-13 10:13:15,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 10:13:15,690 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 677 transitions. [2019-01-13 10:13:15,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-13 10:13:15,694 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 10:13:15,694 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 10:13:15,694 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 10:13:15,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 10:13:15,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1685203592, now seen corresponding path program 1 times [2019-01-13 10:13:15,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 10:13:15,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 10:13:15,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 10:13:15,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 10:13:15,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 10:13:16,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 10:13:16,690 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 10:13:16,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 10:13:16,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 10:13:16,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 10:13:16,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 10:13:16,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 10:13:16,695 INFO L87 Difference]: Start difference. First operand 465 states and 677 transitions. Second operand 3 states. [2019-01-13 10:13:24,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 10:13:24,646 INFO L93 Difference]: Finished difference Result 910 states and 1325 transitions. [2019-01-13 10:13:24,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 10:13:24,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-01-13 10:13:24,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 10:13:24,654 INFO L225 Difference]: With dead ends: 910 [2019-01-13 10:13:24,654 INFO L226 Difference]: Without dead ends: 473 [2019-01-13 10:13:24,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 10:13:24,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2019-01-13 10:13:24,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 471. [2019-01-13 10:13:24,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2019-01-13 10:13:24,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 683 transitions. [2019-01-13 10:13:24,717 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 683 transitions. Word has length 33 [2019-01-13 10:13:24,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 10:13:24,717 INFO L480 AbstractCegarLoop]: Abstraction has 471 states and 683 transitions. [2019-01-13 10:13:24,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 10:13:24,720 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 683 transitions. [2019-01-13 10:13:24,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-13 10:13:24,727 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 10:13:24,728 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 10:13:24,728 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 10:13:24,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 10:13:24,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1115375226, now seen corresponding path program 1 times [2019-01-13 10:13:24,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 10:13:24,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 10:13:24,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 10:13:24,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 10:13:24,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 10:13:25,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 10:13:25,724 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-13 10:13:25,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 10:13:25,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 10:13:25,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 10:13:25,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 10:13:25,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 10:13:25,728 INFO L87 Difference]: Start difference. First operand 471 states and 683 transitions. Second operand 4 states. [2019-01-13 10:13:33,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 10:13:33,916 INFO L93 Difference]: Finished difference Result 920 states and 1333 transitions. [2019-01-13 10:13:33,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 10:13:33,917 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-01-13 10:13:33,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 10:13:33,921 INFO L225 Difference]: With dead ends: 920 [2019-01-13 10:13:33,921 INFO L226 Difference]: Without dead ends: 469 [2019-01-13 10:13:33,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 10:13:33,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2019-01-13 10:13:33,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 469. [2019-01-13 10:13:33,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2019-01-13 10:13:33,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 671 transitions. [2019-01-13 10:13:33,944 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 671 transitions. Word has length 37 [2019-01-13 10:13:33,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 10:13:33,944 INFO L480 AbstractCegarLoop]: Abstraction has 469 states and 671 transitions. [2019-01-13 10:13:33,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 10:13:33,944 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 671 transitions. [2019-01-13 10:13:33,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-13 10:13:33,948 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 10:13:33,948 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 10:13:33,949 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 10:13:33,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 10:13:33,949 INFO L82 PathProgramCache]: Analyzing trace with hash -208393568, now seen corresponding path program 1 times [2019-01-13 10:13:33,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 10:13:33,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 10:13:33,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 10:13:33,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 10:13:33,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 10:13:34,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 10:13:34,740 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-13 10:13:34,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 10:13:34,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 10:13:34,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 10:13:34,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 10:13:34,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 10:13:34,744 INFO L87 Difference]: Start difference. First operand 469 states and 671 transitions. Second operand 3 states. [2019-01-13 10:13:37,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 10:13:37,716 INFO L93 Difference]: Finished difference Result 952 states and 1363 transitions. [2019-01-13 10:13:37,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 10:13:37,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-01-13 10:13:37,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 10:13:37,720 INFO L225 Difference]: With dead ends: 952 [2019-01-13 10:13:37,720 INFO L226 Difference]: Without dead ends: 511 [2019-01-13 10:13:37,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 10:13:37,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-01-13 10:13:37,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 475. [2019-01-13 10:13:37,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475 states. [2019-01-13 10:13:37,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 677 transitions. [2019-01-13 10:13:37,742 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 677 transitions. Word has length 54 [2019-01-13 10:13:37,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 10:13:37,742 INFO L480 AbstractCegarLoop]: Abstraction has 475 states and 677 transitions. [2019-01-13 10:13:37,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 10:13:37,742 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 677 transitions. [2019-01-13 10:13:37,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-13 10:13:37,745 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 10:13:37,745 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 10:13:37,746 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 10:13:37,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 10:13:37,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1540908760, now seen corresponding path program 1 times [2019-01-13 10:13:37,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 10:13:37,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 10:13:37,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 10:13:37,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 10:13:37,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 10:13:38,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 10:13:38,555 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-13 10:13:38,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 10:13:38,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 10:13:38,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 10:13:38,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 10:13:38,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 10:13:38,559 INFO L87 Difference]: Start difference. First operand 475 states and 677 transitions. Second operand 3 states. [2019-01-13 10:13:38,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 10:13:38,922 INFO L93 Difference]: Finished difference Result 946 states and 1353 transitions. [2019-01-13 10:13:38,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 10:13:38,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-01-13 10:13:38,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 10:13:38,928 INFO L225 Difference]: With dead ends: 946 [2019-01-13 10:13:38,929 INFO L226 Difference]: Without dead ends: 499 [2019-01-13 10:13:38,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 10:13:38,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2019-01-13 10:13:38,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 483. [2019-01-13 10:13:38,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2019-01-13 10:13:38,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 685 transitions. [2019-01-13 10:13:38,956 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 685 transitions. Word has length 80 [2019-01-13 10:13:38,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 10:13:38,956 INFO L480 AbstractCegarLoop]: Abstraction has 483 states and 685 transitions. [2019-01-13 10:13:38,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 10:13:38,956 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 685 transitions. [2019-01-13 10:13:38,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-01-13 10:13:38,959 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 10:13:38,959 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 10:13:38,959 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 10:13:38,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 10:13:38,964 INFO L82 PathProgramCache]: Analyzing trace with hash -648736553, now seen corresponding path program 1 times [2019-01-13 10:13:38,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 10:13:38,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 10:13:38,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 10:13:38,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 10:13:38,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 10:13:39,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 10:13:40,242 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-13 10:13:40,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 10:13:40,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 10:13:40,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 10:13:40,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 10:13:40,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 10:13:40,254 INFO L87 Difference]: Start difference. First operand 483 states and 685 transitions. Second operand 3 states. [2019-01-13 10:13:41,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 10:13:41,261 INFO L93 Difference]: Finished difference Result 1385 states and 1961 transitions. [2019-01-13 10:13:41,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 10:13:41,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-01-13 10:13:41,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 10:13:41,274 INFO L225 Difference]: With dead ends: 1385 [2019-01-13 10:13:41,274 INFO L226 Difference]: Without dead ends: 930 [2019-01-13 10:13:41,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 10:13:41,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2019-01-13 10:13:41,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 499. [2019-01-13 10:13:41,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2019-01-13 10:13:41,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 705 transitions. [2019-01-13 10:13:41,326 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 705 transitions. Word has length 86 [2019-01-13 10:13:41,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 10:13:41,328 INFO L480 AbstractCegarLoop]: Abstraction has 499 states and 705 transitions. [2019-01-13 10:13:41,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 10:13:41,328 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 705 transitions. [2019-01-13 10:13:41,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-01-13 10:13:41,332 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 10:13:41,332 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 10:13:41,332 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 10:13:41,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 10:13:41,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1096891288, now seen corresponding path program 1 times [2019-01-13 10:13:41,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 10:13:41,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 10:13:41,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 10:13:41,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 10:13:41,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 10:13:41,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 10:13:42,519 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-13 10:13:42,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 10:13:42,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 10:13:42,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 10:13:42,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 10:13:42,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 10:13:42,523 INFO L87 Difference]: Start difference. First operand 499 states and 705 transitions. Second operand 3 states. [2019-01-13 10:13:45,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 10:13:45,523 INFO L93 Difference]: Finished difference Result 1012 states and 1429 transitions. [2019-01-13 10:13:45,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 10:13:45,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-01-13 10:13:45,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 10:13:45,534 INFO L225 Difference]: With dead ends: 1012 [2019-01-13 10:13:45,534 INFO L226 Difference]: Without dead ends: 541 [2019-01-13 10:13:45,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 10:13:45,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2019-01-13 10:13:45,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 503. [2019-01-13 10:13:45,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2019-01-13 10:13:45,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 709 transitions. [2019-01-13 10:13:45,567 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 709 transitions. Word has length 88 [2019-01-13 10:13:45,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 10:13:45,568 INFO L480 AbstractCegarLoop]: Abstraction has 503 states and 709 transitions. [2019-01-13 10:13:45,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 10:13:45,568 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 709 transitions. [2019-01-13 10:13:45,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-13 10:13:45,572 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 10:13:45,572 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 10:13:45,573 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 10:13:45,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 10:13:45,573 INFO L82 PathProgramCache]: Analyzing trace with hash 221787658, now seen corresponding path program 1 times [2019-01-13 10:13:45,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 10:13:45,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 10:13:45,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 10:13:45,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 10:13:45,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 10:13:46,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 10:13:46,878 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-13 10:13:46,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 10:13:46,879 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-01-13 10:13:46,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 10:13:54,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 10:13:54,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 10:13:54,669 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-13 10:13:54,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-13 10:13:54,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2019-01-13 10:13:54,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 10:13:54,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 10:13:54,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 10:13:54,804 INFO L87 Difference]: Start difference. First operand 503 states and 709 transitions. Second operand 5 states. [2019-01-13 10:13:58,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 10:13:58,361 INFO L93 Difference]: Finished difference Result 1070 states and 1509 transitions. [2019-01-13 10:13:58,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 10:13:58,363 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-01-13 10:13:58,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 10:13:58,367 INFO L225 Difference]: With dead ends: 1070 [2019-01-13 10:13:58,367 INFO L226 Difference]: Without dead ends: 0 [2019-01-13 10:13:58,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-13 10:13:58,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-13 10:13:58,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-13 10:13:58,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-13 10:13:58,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-13 10:13:58,373 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 98 [2019-01-13 10:13:58,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 10:13:58,373 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-13 10:13:58,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 10:13:58,374 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-13 10:13:58,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-13 10:13:58,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-13 10:13:58,921 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-13 10:13:59,690 INFO L448 ceAbstractionStarter]: For program point L11993(lines 11993 11996) no Hoare annotation was computed. [2019-01-13 10:13:59,690 INFO L448 ceAbstractionStarter]: For program point L11927(lines 11927 11933) no Hoare annotation was computed. [2019-01-13 10:13:59,690 INFO L448 ceAbstractionStarter]: For program point L11993-2(lines 11990 11996) no Hoare annotation was computed. [2019-01-13 10:13:59,690 INFO L448 ceAbstractionStarter]: For program point L7501(line 7501) no Hoare annotation was computed. [2019-01-13 10:13:59,690 INFO L444 ceAbstractionStarter]: At program point L7303(lines 7288 7309) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,691 INFO L448 ceAbstractionStarter]: For program point L7502(lines 7502 7534) no Hoare annotation was computed. [2019-01-13 10:13:59,691 INFO L444 ceAbstractionStarter]: At program point L11664-3(lines 11652 11668) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,691 INFO L444 ceAbstractionStarter]: At program point L11664(lines 11652 11668) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,691 INFO L444 ceAbstractionStarter]: At program point L11664-2(lines 11652 11668) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,691 INFO L444 ceAbstractionStarter]: At program point L11664-1(lines 11652 11668) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,691 INFO L444 ceAbstractionStarter]: At program point L13712(lines 13708 13714) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,691 INFO L448 ceAbstractionStarter]: For program point L13184(lines 13184 13188) no Hoare annotation was computed. [2019-01-13 10:13:59,692 INFO L448 ceAbstractionStarter]: For program point L11797(lines 11797 11800) no Hoare annotation was computed. [2019-01-13 10:13:59,692 INFO L448 ceAbstractionStarter]: For program point L13845(lines 13845 13848) no Hoare annotation was computed. [2019-01-13 10:13:59,692 INFO L451 ceAbstractionStarter]: At program point L13911(lines 13910 13912) the Hoare annotation is: true [2019-01-13 10:13:59,692 INFO L444 ceAbstractionStarter]: At program point L11863(lines 11838 11869) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,692 INFO L451 ceAbstractionStarter]: At program point L7569(lines 7472 7571) the Hoare annotation is: true [2019-01-13 10:13:59,692 INFO L444 ceAbstractionStarter]: At program point L7305(lines 7288 7309) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,692 INFO L448 ceAbstractionStarter]: For program point L11930(lines 11930 11933) no Hoare annotation was computed. [2019-01-13 10:13:59,693 INFO L444 ceAbstractionStarter]: At program point L5786(lines 5782 5788) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,693 INFO L444 ceAbstractionStarter]: At program point L11732(lines 11724 11737) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,693 INFO L451 ceAbstractionStarter]: At program point L5786-1(lines 5782 5788) the Hoare annotation is: true [2019-01-13 10:13:59,693 INFO L448 ceAbstractionStarter]: For program point L11930-2(lines 11927 11933) no Hoare annotation was computed. [2019-01-13 10:13:59,698 INFO L448 ceAbstractionStarter]: For program point L7504(lines 7504 7531) no Hoare annotation was computed. [2019-01-13 10:13:59,698 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 5925) no Hoare annotation was computed. [2019-01-13 10:13:59,698 INFO L444 ceAbstractionStarter]: At program point L11667-1(lines 11648 11669) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,698 INFO L444 ceAbstractionStarter]: At program point L11667(lines 11648 11669) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,700 INFO L444 ceAbstractionStarter]: At program point L11865(lines 11838 11869) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,700 INFO L448 ceAbstractionStarter]: For program point L7505(line 7505) no Hoare annotation was computed. [2019-01-13 10:13:59,700 INFO L444 ceAbstractionStarter]: At program point L11667-3(lines 11648 11669) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,700 INFO L444 ceAbstractionStarter]: At program point L11667-2(lines 11648 11669) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,700 INFO L448 ceAbstractionStarter]: For program point L11337(lines 11337 11340) no Hoare annotation was computed. [2019-01-13 10:13:59,700 INFO L448 ceAbstractionStarter]: For program point L11337-2(lines 11333 11342) no Hoare annotation was computed. [2019-01-13 10:13:59,701 INFO L444 ceAbstractionStarter]: At program point L12989(lines 12985 12991) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,702 INFO L448 ceAbstractionStarter]: For program point L7506(lines 7506 7511) no Hoare annotation was computed. [2019-01-13 10:13:59,703 INFO L444 ceAbstractionStarter]: At program point L11734(lines 11724 11737) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,703 INFO L444 ceAbstractionStarter]: At program point L7308(lines 7262 7352) the Hoare annotation is: (or (= ~dsp_poll~0 0) (= ~ldv_spin~0 0)) [2019-01-13 10:13:59,703 INFO L444 ceAbstractionStarter]: At program point L5921(lines 13819 13828) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,703 INFO L444 ceAbstractionStarter]: At program point L5921-1(lines 13842 13851) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,703 INFO L444 ceAbstractionStarter]: At program point L11999(lines 11898 12005) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,703 INFO L444 ceAbstractionStarter]: At program point L11868(lines 7328 7331) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,703 INFO L444 ceAbstractionStarter]: At program point L11802(lines 11761 11831) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,703 INFO L448 ceAbstractionStarter]: For program point L7244-2(lines 7244 7247) no Hoare annotation was computed. [2019-01-13 10:13:59,704 INFO L448 ceAbstractionStarter]: For program point L7244(lines 7244 7247) no Hoare annotation was computed. [2019-01-13 10:13:59,704 INFO L444 ceAbstractionStarter]: At program point L13190(lines 13174 13192) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,704 INFO L444 ceAbstractionStarter]: At program point L12001(lines 11898 12005) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,704 INFO L448 ceAbstractionStarter]: For program point L11341-1(line 11341) no Hoare annotation was computed. [2019-01-13 10:13:59,704 INFO L444 ceAbstractionStarter]: At program point L11341-2(lines 11329 11343) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,704 INFO L448 ceAbstractionStarter]: For program point L5924-1(line 5924) no Hoare annotation was computed. [2019-01-13 10:13:59,704 INFO L448 ceAbstractionStarter]: For program point L5924(line 5924) no Hoare annotation was computed. [2019-01-13 10:13:59,704 INFO L444 ceAbstractionStarter]: At program point L11804(lines 11761 11831) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,704 INFO L448 ceAbstractionStarter]: For program point L11936(lines 11936 11942) no Hoare annotation was computed. [2019-01-13 10:13:59,705 INFO L451 ceAbstractionStarter]: At program point L5793(lines 5790 5795) the Hoare annotation is: true [2019-01-13 10:13:59,705 INFO L451 ceAbstractionStarter]: At program point L5793-1(lines 5790 5795) the Hoare annotation is: true [2019-01-13 10:13:59,705 INFO L444 ceAbstractionStarter]: At program point L12004(lines 11892 12006) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,705 INFO L448 ceAbstractionStarter]: For program point L10617(lines 10617 10621) no Hoare annotation was computed. [2019-01-13 10:13:59,705 INFO L448 ceAbstractionStarter]: For program point L11939(lines 11939 11942) no Hoare annotation was computed. [2019-01-13 10:13:59,705 INFO L444 ceAbstractionStarter]: At program point L7711(lines 7706 7713) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,705 INFO L448 ceAbstractionStarter]: For program point L11939-2(lines 11936 11942) no Hoare annotation was computed. [2019-01-13 10:13:59,705 INFO L444 ceAbstractionStarter]: At program point L11807(lines 11761 11831) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,705 INFO L448 ceAbstractionStarter]: For program point L7513(line 7513) no Hoare annotation was computed. [2019-01-13 10:13:59,705 INFO L451 ceAbstractionStarter]: At program point L13922(lines 13921 13923) the Hoare annotation is: true [2019-01-13 10:13:59,706 INFO L448 ceAbstractionStarter]: For program point L7514(lines 7514 7527) no Hoare annotation was computed. [2019-01-13 10:13:59,708 INFO L451 ceAbstractionStarter]: At program point L13856(lines 13852 13858) the Hoare annotation is: true [2019-01-13 10:13:59,708 INFO L444 ceAbstractionStarter]: At program point L11810(lines 11761 11831) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,708 INFO L448 ceAbstractionStarter]: For program point L7516-2(lines 7514 7526) no Hoare annotation was computed. [2019-01-13 10:13:59,708 INFO L448 ceAbstractionStarter]: For program point L7516(lines 7516 7520) no Hoare annotation was computed. [2019-01-13 10:13:59,708 INFO L451 ceAbstractionStarter]: At program point L5931(lines 5930 5933) the Hoare annotation is: true [2019-01-13 10:13:59,709 INFO L451 ceAbstractionStarter]: At program point L5931-1(lines 5930 5933) the Hoare annotation is: true [2019-01-13 10:13:59,709 INFO L444 ceAbstractionStarter]: At program point L9763(lines 9759 9765) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,709 INFO L451 ceAbstractionStarter]: At program point L5931-2(lines 5930 5933) the Hoare annotation is: true [2019-01-13 10:13:59,709 INFO L444 ceAbstractionStarter]: At program point L11745(lines 11737 11750) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,709 INFO L451 ceAbstractionStarter]: At program point L10622(lines 10614 10624) the Hoare annotation is: true [2019-01-13 10:13:59,709 INFO L444 ceAbstractionStarter]: At program point L7253(lines 7179 7255) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,709 INFO L444 ceAbstractionStarter]: At program point L11812(lines 11761 11831) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,709 INFO L444 ceAbstractionStarter]: At program point L11747(lines 11737 11750) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,709 INFO L448 ceAbstractionStarter]: For program point L11945(lines 11945 11951) no Hoare annotation was computed. [2019-01-13 10:13:59,710 INFO L448 ceAbstractionStarter]: For program point L7189-2(lines 7189 7192) no Hoare annotation was computed. [2019-01-13 10:13:59,711 INFO L448 ceAbstractionStarter]: For program point L7189(line 7189) no Hoare annotation was computed. [2019-01-13 10:13:59,711 INFO L448 ceAbstractionStarter]: For program point L13136(lines 13136 13139) no Hoare annotation was computed. [2019-01-13 10:13:59,711 INFO L444 ceAbstractionStarter]: At program point L13863(lines 13859 13865) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,712 INFO L448 ceAbstractionStarter]: For program point L7323-1(line 7323) no Hoare annotation was computed. [2019-01-13 10:13:59,712 INFO L448 ceAbstractionStarter]: For program point L11948(lines 11948 11951) no Hoare annotation was computed. [2019-01-13 10:13:59,712 INFO L444 ceAbstractionStarter]: At program point L13930(lines 13929 13931) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,712 INFO L448 ceAbstractionStarter]: For program point L11948-2(lines 11945 11951) no Hoare annotation was computed. [2019-01-13 10:13:59,712 INFO L444 ceAbstractionStarter]: At program point L5804-1(lines 5801 5806) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,712 INFO L444 ceAbstractionStarter]: At program point L5804(lines 5801 5806) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,712 INFO L448 ceAbstractionStarter]: For program point L7324-2(line 7324) no Hoare annotation was computed. [2019-01-13 10:13:59,712 INFO L448 ceAbstractionStarter]: For program point L7324(line 7324) no Hoare annotation was computed. [2019-01-13 10:13:59,712 INFO L448 ceAbstractionStarter]: For program point L13072(lines 13072 13075) no Hoare annotation was computed. [2019-01-13 10:13:59,713 INFO L444 ceAbstractionStarter]: At program point L11685(lines 11677 11714) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,714 INFO L451 ceAbstractionStarter]: At program point L7523(lines 1 14029) the Hoare annotation is: true [2019-01-13 10:13:59,714 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-13 10:13:59,714 INFO L444 ceAbstractionStarter]: At program point L5938(lines 5935 5940) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,715 INFO L451 ceAbstractionStarter]: At program point L7722(lines 7714 7724) the Hoare annotation is: true [2019-01-13 10:13:59,715 INFO L444 ceAbstractionStarter]: At program point L6005(lines 5997 6007) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,715 INFO L448 ceAbstractionStarter]: For program point L11819(lines 11819 11822) no Hoare annotation was computed. [2019-01-13 10:13:59,715 INFO L444 ceAbstractionStarter]: At program point L10630-1(lines 10625 10632) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,715 INFO L448 ceAbstractionStarter]: For program point L11819-2(lines 11819 11822) no Hoare annotation was computed. [2019-01-13 10:13:59,715 INFO L444 ceAbstractionStarter]: At program point L10630(lines 10625 10632) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,715 INFO L444 ceAbstractionStarter]: At program point L11687(lines 11677 11714) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,715 INFO L448 ceAbstractionStarter]: For program point L7195(lines 7195 7199) no Hoare annotation was computed. [2019-01-13 10:13:59,716 INFO L444 ceAbstractionStarter]: At program point L13934(lines 13933 13935) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,716 INFO L444 ceAbstractionStarter]: At program point L7328(lines 7328 7331) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,716 INFO L448 ceAbstractionStarter]: For program point L11954(lines 11954 11960) no Hoare annotation was computed. [2019-01-13 10:13:59,716 INFO L448 ceAbstractionStarter]: For program point L13078(lines 13078 13081) no Hoare annotation was computed. [2019-01-13 10:13:59,716 INFO L444 ceAbstractionStarter]: At program point L13937-1(lines 13936 13938) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,716 INFO L448 ceAbstractionStarter]: For program point L7529(line 7529) no Hoare annotation was computed. [2019-01-13 10:13:59,716 INFO L448 ceAbstractionStarter]: For program point L7200-2(lines 7200 7203) no Hoare annotation was computed. [2019-01-13 10:13:59,716 INFO L448 ceAbstractionStarter]: For program point L13146(lines 13146 13150) no Hoare annotation was computed. [2019-01-13 10:13:59,716 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-13 10:13:59,716 INFO L448 ceAbstractionStarter]: For program point L7200(lines 7200 7203) no Hoare annotation was computed. [2019-01-13 10:13:59,717 INFO L448 ceAbstractionStarter]: For program point L-1-1(line -1) no Hoare annotation was computed. [2019-01-13 10:13:59,717 INFO L448 ceAbstractionStarter]: For program point L-1-2(line -1) no Hoare annotation was computed. [2019-01-13 10:13:59,717 INFO L448 ceAbstractionStarter]: For program point L-1-3(line -1) no Hoare annotation was computed. [2019-01-13 10:13:59,717 INFO L448 ceAbstractionStarter]: For program point L11957(lines 11957 11960) no Hoare annotation was computed. [2019-01-13 10:13:59,717 INFO L448 ceAbstractionStarter]: For program point L11957-2(lines 11954 11960) no Hoare annotation was computed. [2019-01-13 10:13:59,717 INFO L444 ceAbstractionStarter]: At program point L12948(lines 12945 12950) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,717 INFO L444 ceAbstractionStarter]: At program point L11825(lines 11761 11831) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,717 INFO L448 ceAbstractionStarter]: For program point L7267(lines 7267 7309) no Hoare annotation was computed. [2019-01-13 10:13:59,718 INFO L448 ceAbstractionStarter]: For program point L7334(lines 7334 7338) no Hoare annotation was computed. [2019-01-13 10:13:59,718 INFO L448 ceAbstractionStarter]: For program point L7268(lines 7268 7273) no Hoare annotation was computed. [2019-01-13 10:13:59,718 INFO L444 ceAbstractionStarter]: At program point L11827(lines 11761 11831) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,718 INFO L448 ceAbstractionStarter]: For program point L11365(lines 11365 11368) no Hoare annotation was computed. [2019-01-13 10:13:59,718 INFO L448 ceAbstractionStarter]: For program point L11365-2(lines 11365 11368) no Hoare annotation was computed. [2019-01-13 10:13:59,718 INFO L451 ceAbstractionStarter]: At program point L13215(lines 13200 13221) the Hoare annotation is: true [2019-01-13 10:13:59,718 INFO L444 ceAbstractionStarter]: At program point L6015(lines 6008 6017) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,718 INFO L444 ceAbstractionStarter]: At program point L11697(lines 11677 11714) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,718 INFO L451 ceAbstractionStarter]: At program point L13217(lines 13200 13221) the Hoare annotation is: true [2019-01-13 10:13:59,719 INFO L444 ceAbstractionStarter]: At program point L11830(lines 11754 11832) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,721 INFO L448 ceAbstractionStarter]: For program point L7536(line 7536) no Hoare annotation was computed. [2019-01-13 10:13:59,721 INFO L448 ceAbstractionStarter]: For program point L11963(lines 11963 11969) no Hoare annotation was computed. [2019-01-13 10:13:59,721 INFO L444 ceAbstractionStarter]: At program point L11699(lines 11677 11714) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,721 INFO L444 ceAbstractionStarter]: At program point L11369(lines 11344 11371) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,721 INFO L448 ceAbstractionStarter]: For program point L7538(line 7538) no Hoare annotation was computed. [2019-01-13 10:13:59,721 INFO L448 ceAbstractionStarter]: For program point L7274(lines 7274 7279) no Hoare annotation was computed. [2019-01-13 10:13:59,721 INFO L448 ceAbstractionStarter]: For program point L7340(lines 7340 7344) no Hoare annotation was computed. [2019-01-13 10:13:59,721 INFO L451 ceAbstractionStarter]: At program point L13154(lines 13135 13161) the Hoare annotation is: true [2019-01-13 10:13:59,722 INFO L451 ceAbstractionStarter]: At program point L13220(lines 1 14029) the Hoare annotation is: true [2019-01-13 10:13:59,722 INFO L448 ceAbstractionStarter]: For program point L5887(lines 5887 5894) no Hoare annotation was computed. [2019-01-13 10:13:59,722 INFO L444 ceAbstractionStarter]: At program point L13947(lines 13946 13948) the Hoare annotation is: (and (= ~ldv_state_variable_5~0 0) (= ~dsp_poll~0 0) (= 0 ~poll~0) (= ~ldv_spin~0 0)) [2019-01-13 10:13:59,722 INFO L444 ceAbstractionStarter]: At program point L14013(lines 14012 14014) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,722 INFO L444 ceAbstractionStarter]: At program point L12956(lines 12951 12958) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,722 INFO L448 ceAbstractionStarter]: For program point L13088(lines 13088 13092) no Hoare annotation was computed. [2019-01-13 10:13:59,722 INFO L448 ceAbstractionStarter]: For program point L7539(lines 7539 7542) no Hoare annotation was computed. [2019-01-13 10:13:59,722 INFO L448 ceAbstractionStarter]: For program point L11966-2(lines 11963 11969) no Hoare annotation was computed. [2019-01-13 10:13:59,723 INFO L448 ceAbstractionStarter]: For program point L11966(lines 11966 11969) no Hoare annotation was computed. [2019-01-13 10:13:59,723 INFO L448 ceAbstractionStarter]: For program point L11306(lines 11306 11311) no Hoare annotation was computed. [2019-01-13 10:13:59,723 INFO L448 ceAbstractionStarter]: For program point L11306-5(lines 11306 11311) no Hoare annotation was computed. [2019-01-13 10:13:59,723 INFO L444 ceAbstractionStarter]: At program point L13090(lines 13071 13116) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,723 INFO L451 ceAbstractionStarter]: At program point L13156(lines 13135 13161) the Hoare annotation is: true [2019-01-13 10:13:59,723 INFO L448 ceAbstractionStarter]: For program point L11306-2(lines 11306 11311) no Hoare annotation was computed. [2019-01-13 10:13:59,723 INFO L448 ceAbstractionStarter]: For program point L11306-3(lines 11306 11311) no Hoare annotation was computed. [2019-01-13 10:13:59,723 INFO L448 ceAbstractionStarter]: For program point L11637(lines 11637 11640) no Hoare annotation was computed. [2019-01-13 10:13:59,723 INFO L448 ceAbstractionStarter]: For program point L11637-3(lines 11637 11640) no Hoare annotation was computed. [2019-01-13 10:13:59,723 INFO L448 ceAbstractionStarter]: For program point L11637-2(lines 11637 11640) no Hoare annotation was computed. [2019-01-13 10:13:59,724 INFO L448 ceAbstractionStarter]: For program point L11769(lines 11769 11772) no Hoare annotation was computed. [2019-01-13 10:13:59,724 INFO L448 ceAbstractionStarter]: For program point L11769-2(lines 11769 11772) no Hoare annotation was computed. [2019-01-13 10:13:59,724 INFO L448 ceAbstractionStarter]: For program point L11637-5(lines 11637 11640) no Hoare annotation was computed. [2019-01-13 10:13:59,724 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5925) no Hoare annotation was computed. [2019-01-13 10:13:59,725 INFO L444 ceAbstractionStarter]: At program point L13885(lines 13884 13886) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,725 INFO L448 ceAbstractionStarter]: For program point L7544(line 7544) no Hoare annotation was computed. [2019-01-13 10:13:59,725 INFO L448 ceAbstractionStarter]: For program point L13226(lines 13226 13229) no Hoare annotation was computed. [2019-01-13 10:13:59,725 INFO L444 ceAbstractionStarter]: At program point L5893(lines 5880 5896) the Hoare annotation is: (and (= ~ldv_state_variable_5~0 0) (= ~dsp_poll~0 0) (= 0 ~poll~0) (= ~ldv_spin~0 0)) [2019-01-13 10:13:59,725 INFO L451 ceAbstractionStarter]: At program point L13160(lines 1 14029) the Hoare annotation is: true [2019-01-13 10:13:59,725 INFO L448 ceAbstractionStarter]: For program point L7545(lines 7545 7560) no Hoare annotation was computed. [2019-01-13 10:13:59,725 INFO L448 ceAbstractionStarter]: For program point L7215(lines 7215 7221) no Hoare annotation was computed. [2019-01-13 10:13:59,725 INFO L448 ceAbstractionStarter]: For program point L7281(lines 7281 7287) no Hoare annotation was computed. [2019-01-13 10:13:59,725 INFO L448 ceAbstractionStarter]: For program point L7215-2(lines 7215 7221) no Hoare annotation was computed. [2019-01-13 10:13:59,726 INFO L448 ceAbstractionStarter]: For program point L11972(lines 11972 11978) no Hoare annotation was computed. [2019-01-13 10:13:59,726 INFO L451 ceAbstractionStarter]: At program point L13954(lines 13953 13955) the Hoare annotation is: true [2019-01-13 10:13:59,726 INFO L444 ceAbstractionStarter]: At program point L14020(lines 14019 14021) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,726 INFO L444 ceAbstractionStarter]: At program point L11708(lines 11677 11714) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,726 INFO L448 ceAbstractionStarter]: For program point L13822(lines 13822 13825) no Hoare annotation was computed. [2019-01-13 10:13:59,726 INFO L444 ceAbstractionStarter]: At program point L11774(lines 11761 11831) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,726 INFO L444 ceAbstractionStarter]: At program point L13888(lines 13887 13889) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,726 INFO L448 ceAbstractionStarter]: For program point L7547(lines 7547 7557) no Hoare annotation was computed. [2019-01-13 10:13:59,726 INFO L444 ceAbstractionStarter]: At program point L10190(lines 10181 10202) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,727 INFO L444 ceAbstractionStarter]: At program point L11776(lines 11761 11831) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,727 INFO L444 ceAbstractionStarter]: At program point L11710(lines 11677 11714) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,729 INFO L448 ceAbstractionStarter]: For program point L7548(line 7548) no Hoare annotation was computed. [2019-01-13 10:13:59,729 INFO L448 ceAbstractionStarter]: For program point L13098(lines 13098 13102) no Hoare annotation was computed. [2019-01-13 10:13:59,729 INFO L448 ceAbstractionStarter]: For program point L10191(lines 10191 10194) no Hoare annotation was computed. [2019-01-13 10:13:59,729 INFO L444 ceAbstractionStarter]: At program point L13891(lines 13890 13892) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,729 INFO L448 ceAbstractionStarter]: For program point L11975-2(lines 11972 11978) no Hoare annotation was computed. [2019-01-13 10:13:59,730 INFO L451 ceAbstractionStarter]: At program point L13891-1(lines 13890 13892) the Hoare annotation is: true [2019-01-13 10:13:59,730 INFO L444 ceAbstractionStarter]: At program point L13957(lines 13956 13958) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,730 INFO L448 ceAbstractionStarter]: For program point L11975(lines 11975 11978) no Hoare annotation was computed. [2019-01-13 10:13:59,730 INFO L444 ceAbstractionStarter]: At program point L11645-1(lines 11372 11647) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,730 INFO L444 ceAbstractionStarter]: At program point L11645(lines 11372 11647) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,730 INFO L448 ceAbstractionStarter]: For program point L7549(lines 7549 7553) no Hoare annotation was computed. [2019-01-13 10:13:59,730 INFO L444 ceAbstractionStarter]: At program point L7351(lines 7257 7353) the Hoare annotation is: (or (= 0 (+ |ULTIMATE.start_dsp_init_#res| 22)) (= ~ldv_spin~0 0)) [2019-01-13 10:13:59,730 INFO L448 ceAbstractionStarter]: For program point L11315-1(lines 11315 11318) no Hoare annotation was computed. [2019-01-13 10:13:59,730 INFO L448 ceAbstractionStarter]: For program point L11315(lines 11315 11318) no Hoare annotation was computed. [2019-01-13 10:13:59,731 INFO L451 ceAbstractionStarter]: At program point L13231(lines 13223 13233) the Hoare annotation is: true [2019-01-13 10:13:59,731 INFO L444 ceAbstractionStarter]: At program point L10192(lines 10181 10202) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,731 INFO L444 ceAbstractionStarter]: At program point L14024-1(lines 14023 14025) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,731 INFO L444 ceAbstractionStarter]: At program point L14024(lines 14023 14025) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,731 INFO L444 ceAbstractionStarter]: At program point L13100(lines 13071 13116) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,731 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-13 10:13:59,731 INFO L444 ceAbstractionStarter]: At program point L11713(line 7323) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,731 INFO L448 ceAbstractionStarter]: For program point L14027(lines 14027 14029) no Hoare annotation was computed. [2019-01-13 10:13:59,732 INFO L448 ceAbstractionStarter]: For program point L14027-1(lines 14027 14029) no Hoare annotation was computed. [2019-01-13 10:13:59,732 INFO L444 ceAbstractionStarter]: At program point L11781(lines 11761 11831) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,732 INFO L448 ceAbstractionStarter]: For program point L11847-2(lines 11838 11869) no Hoare annotation was computed. [2019-01-13 10:13:59,732 INFO L448 ceAbstractionStarter]: For program point L11847(lines 11847 11850) no Hoare annotation was computed. [2019-01-13 10:13:59,732 INFO L444 ceAbstractionStarter]: At program point L10196(lines 10181 10202) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,732 INFO L448 ceAbstractionStarter]: For program point L7223(lines 7223 7227) no Hoare annotation was computed. [2019-01-13 10:13:59,732 INFO L448 ceAbstractionStarter]: For program point L7223-2(lines 7188 7254) no Hoare annotation was computed. [2019-01-13 10:13:59,732 INFO L448 ceAbstractionStarter]: For program point L10197(lines 10197 10200) no Hoare annotation was computed. [2019-01-13 10:13:59,732 INFO L444 ceAbstractionStarter]: At program point L11320(lines 11296 11327) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,732 INFO L444 ceAbstractionStarter]: At program point L11320-1(lines 11296 11327) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,733 INFO L448 ceAbstractionStarter]: For program point L11981(lines 11981 11987) no Hoare annotation was computed. [2019-01-13 10:13:59,733 INFO L444 ceAbstractionStarter]: At program point L13104(lines 13071 13116) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,734 INFO L448 ceAbstractionStarter]: For program point L7555(line 7555) no Hoare annotation was computed. [2019-01-13 10:13:59,734 INFO L444 ceAbstractionStarter]: At program point L11783(lines 11761 11831) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,734 INFO L444 ceAbstractionStarter]: At program point L10198(lines 10181 10202) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,734 INFO L444 ceAbstractionStarter]: At program point L13898(lines 13897 13899) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,734 INFO L444 ceAbstractionStarter]: At program point L13898-1(lines 13897 13899) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,734 INFO L444 ceAbstractionStarter]: At program point L11322(lines 11296 11327) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,734 INFO L444 ceAbstractionStarter]: At program point L13106(lines 13071 13116) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,734 INFO L444 ceAbstractionStarter]: At program point L11322-1(lines 11296 11327) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,734 INFO L448 ceAbstractionStarter]: For program point L11851-1(lines 11851 11854) no Hoare annotation was computed. [2019-01-13 10:13:59,734 INFO L444 ceAbstractionStarter]: At program point L13965(lines 13964 13966) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,735 INFO L448 ceAbstractionStarter]: For program point L7293-2(lines 7293 7301) no Hoare annotation was computed. [2019-01-13 10:13:59,735 INFO L448 ceAbstractionStarter]: For program point L7293(lines 7293 7301) no Hoare annotation was computed. [2019-01-13 10:13:59,735 INFO L448 ceAbstractionStarter]: For program point L11984(lines 11984 11987) no Hoare annotation was computed. [2019-01-13 10:13:59,735 INFO L448 ceAbstractionStarter]: For program point L11984-2(lines 11981 11987) no Hoare annotation was computed. [2019-01-13 10:13:59,735 INFO L448 ceAbstractionStarter]: For program point L7492(lines 7492 7564) no Hoare annotation was computed. [2019-01-13 10:13:59,735 INFO L448 ceAbstractionStarter]: For program point L7228-1(lines 7228 7231) no Hoare annotation was computed. [2019-01-13 10:13:59,735 INFO L444 ceAbstractionStarter]: At program point L13901(lines 7572 7579) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,735 INFO L448 ceAbstractionStarter]: For program point L7493(line 7493) no Hoare annotation was computed. [2019-01-13 10:13:59,735 INFO L444 ceAbstractionStarter]: At program point L11325-1(lines 11296 11327) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,735 INFO L444 ceAbstractionStarter]: At program point L11325(lines 11296 11327) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,736 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-13 10:13:59,736 INFO L451 ceAbstractionStarter]: At program point L13968(lines 13967 13969) the Hoare annotation is: true [2019-01-13 10:13:59,736 INFO L448 ceAbstractionStarter]: For program point L7362(lines 7362 7365) no Hoare annotation was computed. [2019-01-13 10:13:59,736 INFO L444 ceAbstractionStarter]: At program point L11326-2(lines 11290 11328) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,736 INFO L448 ceAbstractionStarter]: For program point L11326-1(line 11326) no Hoare annotation was computed. [2019-01-13 10:13:59,736 INFO L448 ceAbstractionStarter]: For program point L7362-2(lines 7362 7365) no Hoare annotation was computed. [2019-01-13 10:13:59,736 INFO L448 ceAbstractionStarter]: For program point L7296(lines 7296 7299) no Hoare annotation was computed. [2019-01-13 10:13:59,736 INFO L448 ceAbstractionStarter]: For program point L11326-4(line 11326) no Hoare annotation was computed. [2019-01-13 10:13:59,736 INFO L444 ceAbstractionStarter]: At program point L11326-5(lines 11290 11328) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,736 INFO L448 ceAbstractionStarter]: For program point L11657-5(lines 11657 11660) no Hoare annotation was computed. [2019-01-13 10:13:59,737 INFO L448 ceAbstractionStarter]: For program point L7495(line 7495) no Hoare annotation was computed. [2019-01-13 10:13:59,737 INFO L448 ceAbstractionStarter]: For program point L11657-7(lines 11657 11660) no Hoare annotation was computed. [2019-01-13 10:13:59,737 INFO L448 ceAbstractionStarter]: For program point L11657-1(lines 11657 11660) no Hoare annotation was computed. [2019-01-13 10:13:59,737 INFO L448 ceAbstractionStarter]: For program point L11657-3(lines 11657 11660) no Hoare annotation was computed. [2019-01-13 10:13:59,737 INFO L444 ceAbstractionStarter]: At program point L5778(lines 5773 5780) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,737 INFO L448 ceAbstractionStarter]: For program point L11724(lines 11724 11750) no Hoare annotation was computed. [2019-01-13 10:13:59,737 INFO L448 ceAbstractionStarter]: For program point L11790-2(lines 11790 11793) no Hoare annotation was computed. [2019-01-13 10:13:59,737 INFO L451 ceAbstractionStarter]: At program point L5778-3(lines 5773 5780) the Hoare annotation is: true [2019-01-13 10:13:59,737 INFO L444 ceAbstractionStarter]: At program point L5778-1(lines 5773 5780) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,738 INFO L444 ceAbstractionStarter]: At program point L11724-2(lines 11716 11753) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,738 INFO L444 ceAbstractionStarter]: At program point L5778-2(lines 5773 5780) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,738 INFO L448 ceAbstractionStarter]: For program point L7562(line 7562) no Hoare annotation was computed. [2019-01-13 10:13:59,738 INFO L448 ceAbstractionStarter]: For program point L11790(lines 11790 11793) no Hoare annotation was computed. [2019-01-13 10:13:59,738 INFO L444 ceAbstractionStarter]: At program point L13904(lines 13903 13905) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,738 INFO L448 ceAbstractionStarter]: For program point L7496(lines 7496 7499) no Hoare annotation was computed. [2019-01-13 10:13:59,738 INFO L444 ceAbstractionStarter]: At program point L11857(lines 11838 11869) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,738 INFO L448 ceAbstractionStarter]: For program point L11990(lines 11990 11996) no Hoare annotation was computed. [2019-01-13 10:13:59,738 INFO L444 ceAbstractionStarter]: At program point L11859(lines 11838 11869) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,738 INFO L444 ceAbstractionStarter]: At program point L7565(lines 7479 7570) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,739 INFO L448 ceAbstractionStarter]: For program point L7367(lines 7367 7370) no Hoare annotation was computed. [2019-01-13 10:13:59,742 INFO L448 ceAbstractionStarter]: For program point L7367-2(lines 7367 7370) no Hoare annotation was computed. [2019-01-13 10:13:59,742 INFO L444 ceAbstractionStarter]: At program point L13115(lines 13065 13117) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,742 INFO L444 ceAbstractionStarter]: At program point L11662-2(lines 11652 11668) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,742 INFO L444 ceAbstractionStarter]: At program point L11662-1(lines 11652 11668) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,742 INFO L444 ceAbstractionStarter]: At program point L11662-3(lines 11652 11668) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,742 INFO L444 ceAbstractionStarter]: At program point L11662(lines 11652 11668) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-13 10:13:59,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 10:13:59 BoogieIcfgContainer [2019-01-13 10:13:59,828 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 10:13:59,828 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 10:13:59,828 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 10:13:59,833 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 10:13:59,834 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 10:13:03" (3/4) ... [2019-01-13 10:13:59,846 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-13 10:13:59,931 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 284 nodes and edges [2019-01-13 10:13:59,943 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 109 nodes and edges [2019-01-13 10:13:59,955 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 47 nodes and edges [2019-01-13 10:13:59,967 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2019-01-13 10:13:59,978 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2019-01-13 10:13:59,982 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-13 10:13:59,988 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-13 10:14:00,062 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: 0 == \result + 22 || ldv_spin == 0 [2019-01-13 10:14:05,104 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 10:14:05,104 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 10:14:05,106 INFO L168 Benchmark]: Toolchain (without parser) took 199681.45 ms. Allocated memory was 1.0 GB in the beginning and 4.6 GB in the end (delta: 3.5 GB). Free memory was 928.2 MB in the beginning and 3.7 GB in the end (delta: -2.8 GB). Peak memory consumption was 4.1 GB. Max. memory is 11.5 GB. [2019-01-13 10:14:05,107 INFO L168 Benchmark]: CDTParser took 0.39 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 10:14:05,107 INFO L168 Benchmark]: CACSL2BoogieTranslator took 7377.51 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 314.0 MB). Free memory was 928.2 MB in the beginning and 734.0 MB in the end (delta: 194.3 MB). Peak memory consumption was 508.3 MB. Max. memory is 11.5 GB. [2019-01-13 10:14:05,109 INFO L168 Benchmark]: Boogie Procedure Inliner took 733.61 ms. Allocated memory was 1.3 GB in the beginning and 1.4 GB in the end (delta: 8.4 MB). Free memory was 734.0 MB in the beginning and 1.1 GB in the end (delta: -354.8 MB). Peak memory consumption was 134.2 MB. Max. memory is 11.5 GB. [2019-01-13 10:14:05,110 INFO L168 Benchmark]: Boogie Preprocessor took 313.97 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.6 MB). Peak memory consumption was 38.6 MB. Max. memory is 11.5 GB. [2019-01-13 10:14:05,112 INFO L168 Benchmark]: RCFGBuilder took 129162.80 ms. Allocated memory was 1.4 GB in the beginning and 4.6 GB in the end (delta: 3.2 GB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 43.2 MB). Peak memory consumption was 3.8 GB. Max. memory is 11.5 GB. [2019-01-13 10:14:05,112 INFO L168 Benchmark]: TraceAbstraction took 56810.88 ms. Allocated memory was 4.6 GB in the beginning and 4.6 GB in the end (delta: 32.0 MB). Free memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: -1.2 GB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 10:14:05,112 INFO L168 Benchmark]: Witness Printer took 5276.16 ms. Allocated memory was 4.6 GB in the beginning and 4.6 GB in the end (delta: -82.8 MB). Free memory was 2.2 GB in the beginning and 3.7 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2019-01-13 10:14:05,118 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.39 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 7377.51 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 314.0 MB). Free memory was 928.2 MB in the beginning and 734.0 MB in the end (delta: 194.3 MB). Peak memory consumption was 508.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 733.61 ms. Allocated memory was 1.3 GB in the beginning and 1.4 GB in the end (delta: 8.4 MB). Free memory was 734.0 MB in the beginning and 1.1 GB in the end (delta: -354.8 MB). Peak memory consumption was 134.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 313.97 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.6 MB). Peak memory consumption was 38.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 129162.80 ms. Allocated memory was 1.4 GB in the beginning and 4.6 GB in the end (delta: 3.2 GB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 43.2 MB). Peak memory consumption was 3.8 GB. Max. memory is 11.5 GB. * TraceAbstraction took 56810.88 ms. Allocated memory was 4.6 GB in the beginning and 4.6 GB in the end (delta: 32.0 MB). Free memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: -1.2 GB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 5276.16 ms. Allocated memory was 4.6 GB in the beginning and 4.6 GB in the end (delta: -82.8 MB). Free memory was 2.2 GB in the beginning and 3.7 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5925]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5925]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 14023]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 14012]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 11677]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 14023]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 12985]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 13946]: Loop Invariant Derived loop invariant: ((ldv_state_variable_5 == 0 && dsp_poll == 0) && 0 == poll) && ldv_spin == 0 - InvariantResult [Line: 13174]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 5930]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 12951]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 5930]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 11290]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 10181]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 11290]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 11737]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 11898]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 11724]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 13200]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 12945]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 5997]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 11761]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 5790]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5801]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 7257]: Loop Invariant Derived loop invariant: 0 == \result + 22 || ldv_spin == 0 - InvariantResult [Line: 11761]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 5790]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5801]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 11892]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 13897]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 13897]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 11296]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 11296]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 11677]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 13933]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 7572]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 13071]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 11761]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 11898]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 11724]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 11677]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 11677]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 7714]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7706]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 7479]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 13903]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 13936]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 11761]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 5935]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 11296]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 7323]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 11296]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 11344]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 11716]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 11838]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 13859]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 13071]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 7328]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 13884]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 6008]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 11761]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 11296]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 5773]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 11296]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 14019]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 13953]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 13964]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 5773]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5773]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 7288]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 5773]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 10181]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 13887]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 11761]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 11761]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 11329]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 5782]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 11677]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 11677]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 13842]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 11652]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 13956]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 13819]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 13967]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 11652]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 13708]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 13890]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 11838]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 13135]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 11652]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 13071]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 11652]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 13890]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 11761]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 5782]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 7262]: Loop Invariant Derived loop invariant: dsp_poll == 0 || ldv_spin == 0 - InvariantResult [Line: 11648]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 7179]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 11372]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 11648]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 11372]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 7328]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 11648]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 11838]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 13065]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 11648]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 10181]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 11761]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 13071]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 11737]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 7288]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 5880]: Loop Invariant Derived loop invariant: ((ldv_state_variable_5 == 0 && dsp_poll == 0) && 0 == poll) && ldv_spin == 0 - InvariantResult [Line: 13200]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 10614]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 13929]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 11761]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 10181]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 11761]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 13223]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9759]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 11652]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7472]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 10625]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 13135]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 13910]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 10625]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 13921]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 11652]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 5930]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 11838]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 11652]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 11754]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 11652]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 13852]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 270 locations, 2 error locations. SAFE Result, 56.6s OverallTime, 9 OverallIterations, 2 TraceHistogramMax, 36.9s AutomataDifference, 0.0s DeadEndRemovalTime, 1.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 3160 SDtfs, 1187 SDslu, 3992 SDs, 0 SdLazy, 156 SolverSat, 39 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 32.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 131 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=503occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 614 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 135 LocationsWithAnnotation, 135 PreInvPairs, 488 NumberOfFragments, 387 HoareAnnotationTreeSize, 135 FomulaSimplifications, 4161 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 135 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 1.1s SsaConstructionTime, 10.0s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 625 NumberOfCodeBlocks, 625 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 615 ConstructedInterpolants, 0 QuantifiedInterpolants, 71387 SizeOfPredicates, 0 NumberOfNonLiveVariables, 10671 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 57/58 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...