./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_9edfe692-4492-401a-85e3-c9ab199993d4/bin/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_9edfe692-4492-401a-85e3-c9ab199993d4/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9edfe692-4492-401a-85e3-c9ab199993d4/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9edfe692-4492-401a-85e3-c9ab199993d4/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i -s /tmp/vcloud-vcloud-master/worker/run_dir_9edfe692-4492-401a-85e3-c9ab199993d4/bin/ukojak/config/svcomp-Reach-64bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9edfe692-4492-401a-85e3-c9ab199993d4/bin/ukojak --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 Kojak --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 0ed8e0fa33261c1c2fd13752cd4f971526e32b94 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_9edfe692-4492-401a-85e3-c9ab199993d4/bin/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_9edfe692-4492-401a-85e3-c9ab199993d4/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9edfe692-4492-401a-85e3-c9ab199993d4/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9edfe692-4492-401a-85e3-c9ab199993d4/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i -s /tmp/vcloud-vcloud-master/worker/run_dir_9edfe692-4492-401a-85e3-c9ab199993d4/bin/ukojak/config/svcomp-Reach-64bit-Kojak_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9edfe692-4492-401a-85e3-c9ab199993d4/bin/ukojak --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 Kojak --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 0ed8e0fa33261c1c2fd13752cd4f971526e32b94 ...................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: Sort BitVec not declared --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 10:35:53,609 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 10:35:53,611 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 10:35:53,625 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 10:35:53,626 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 10:35:53,627 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 10:35:53,629 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 10:35:53,637 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 10:35:53,642 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 10:35:53,646 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 10:35:53,647 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 10:35:53,648 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 10:35:53,648 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 10:35:53,651 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 10:35:53,652 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 10:35:53,653 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 10:35:53,654 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 10:35:53,655 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 10:35:53,657 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 10:35:53,661 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 10:35:53,665 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 10:35:53,666 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 10:35:53,669 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 10:35:53,670 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 10:35:53,673 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 10:35:53,673 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 10:35:53,673 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 10:35:53,675 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 10:35:53,675 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 10:35:53,676 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 10:35:53,676 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 10:35:53,677 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 10:35:53,677 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 10:35:53,678 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 10:35:53,679 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 10:35:53,679 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 10:35:53,680 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 10:35:53,680 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 10:35:53,680 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 10:35:53,681 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 10:35:53,682 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 10:35:53,683 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9edfe692-4492-401a-85e3-c9ab199993d4/bin/ukojak/config/svcomp-Reach-64bit-Kojak_Default.epf [2019-11-20 10:35:53,711 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 10:35:53,721 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 10:35:53,722 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-20 10:35:53,723 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2019-11-20 10:35:53,723 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 10:35:53,723 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 10:35:53,724 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 10:35:53,724 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 10:35:53,724 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 10:35:53,724 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 10:35:53,724 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 10:35:53,725 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 10:35:53,725 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 10:35:53,725 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 10:35:53,725 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 10:35:53,725 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2019-11-20 10:35:53,726 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2019-11-20 10:35:53,726 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 10:35:53,726 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 10:35:53,726 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-11-20 10:35:53,727 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 10:35:53,728 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 10:35:53,728 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 10:35:53,728 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2019-11-20 10:35:53,728 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 10:35:53,729 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 10:35:53,729 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 10:35:53,729 INFO L138 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_9edfe692-4492-401a-85e3-c9ab199993d4/bin/ukojak 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 -> Kojak 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 -> 0ed8e0fa33261c1c2fd13752cd4f971526e32b94 [2019-11-20 10:35:53,904 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 10:35:53,913 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 10:35:53,916 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 10:35:53,920 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 10:35:53,921 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 10:35:53,921 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9edfe692-4492-401a-85e3-c9ab199993d4/bin/ukojak/../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2019-11-20 10:35:53,975 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9edfe692-4492-401a-85e3-c9ab199993d4/bin/ukojak/data/711f4ee84/e9bebc5427f047d09e507ccd18a27b71/FLAGde6b7ffb0 [2019-11-20 10:35:54,558 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 10:35:54,559 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9edfe692-4492-401a-85e3-c9ab199993d4/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2019-11-20 10:35:54,584 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9edfe692-4492-401a-85e3-c9ab199993d4/bin/ukojak/data/711f4ee84/e9bebc5427f047d09e507ccd18a27b71/FLAGde6b7ffb0 [2019-11-20 10:35:54,994 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9edfe692-4492-401a-85e3-c9ab199993d4/bin/ukojak/data/711f4ee84/e9bebc5427f047d09e507ccd18a27b71 [2019-11-20 10:35:54,997 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 10:35:54,998 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 10:35:55,003 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 10:35:55,004 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 10:35:55,007 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 10:35:55,008 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:35:54" (1/1) ... [2019-11-20 10:35:55,011 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4be69960 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:55, skipping insertion in model container [2019-11-20 10:35:55,011 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:35:54" (1/1) ... [2019-11-20 10:35:55,018 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 10:35:55,114 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 10:35:56,150 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 10:35:56,181 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 10:35:56,390 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 10:35:56,470 INFO L192 MainTranslator]: Completed translation [2019-11-20 10:35:56,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:56 WrapperNode [2019-11-20 10:35:56,471 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 10:35:56,472 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 10:35:56,472 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 10:35:56,472 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 10:35:56,480 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:56" (1/1) ... [2019-11-20 10:35:56,527 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:56" (1/1) ... [2019-11-20 10:35:56,595 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 10:35:56,604 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 10:35:56,605 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 10:35:56,605 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 10:35:56,615 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:56" (1/1) ... [2019-11-20 10:35:56,615 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:56" (1/1) ... [2019-11-20 10:35:56,636 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:56" (1/1) ... [2019-11-20 10:35:56,637 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:56" (1/1) ... [2019-11-20 10:35:56,689 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:56" (1/1) ... [2019-11-20 10:35:56,698 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:56" (1/1) ... [2019-11-20 10:35:56,705 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:56" (1/1) ... [2019-11-20 10:35:56,727 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 10:35:56,739 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 10:35:56,739 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 10:35:56,739 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 10:35:56,740 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9edfe692-4492-401a-85e3-c9ab199993d4/bin/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (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:10000 [2019-11-20 10:35:56,820 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2019-11-20 10:35:56,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2019-11-20 10:35:56,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-20 10:35:56,821 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-11-20 10:35:56,821 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-11-20 10:35:56,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-20 10:35:56,824 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-20 10:35:56,824 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-11-20 10:35:56,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-11-20 10:35:56,824 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-11-20 10:35:56,824 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-11-20 10:35:56,826 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2019-11-20 10:35:56,826 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2019-11-20 10:35:56,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-20 10:35:56,827 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2019-11-20 10:35:56,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2019-11-20 10:35:56,827 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2019-11-20 10:35:56,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2019-11-20 10:35:56,827 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_disconnect [2019-11-20 10:35:56,828 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_disconnect [2019-11-20 10:35:56,828 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2019-11-20 10:35:56,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2019-11-20 10:35:56,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 10:35:56,829 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2019-11-20 10:35:56,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2019-11-20 10:35:56,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 10:35:56,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 10:35:56,830 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2019-11-20 10:35:56,830 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2019-11-20 10:35:56,830 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2019-11-20 10:35:56,831 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2019-11-20 10:35:56,831 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_7 [2019-11-20 10:35:56,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_7 [2019-11-20 10:35:56,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 10:35:56,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 10:35:56,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-20 10:35:56,832 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2019-11-20 10:35:56,832 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2019-11-20 10:35:56,832 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2019-11-20 10:35:56,832 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2019-11-20 10:35:56,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-20 10:35:56,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 10:35:56,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 10:35:57,508 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2019-11-20 10:35:59,674 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 10:35:59,674 INFO L285 CfgBuilder]: Removed 86 assume(true) statements. [2019-11-20 10:35:59,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:35:59 BoogieIcfgContainer [2019-11-20 10:35:59,676 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 10:35:59,676 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2019-11-20 10:35:59,676 INFO L271 PluginConnector]: Initializing CodeCheck... [2019-11-20 10:35:59,687 INFO L275 PluginConnector]: CodeCheck initialized [2019-11-20 10:35:59,687 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:35:59" (1/1) ... [2019-11-20 10:35:59,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:35:59,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:35:59,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 149 states and 205 transitions. [2019-11-20 10:35:59,745 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 205 transitions. [2019-11-20 10:35:59,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 10:35:59,751 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:35:59,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:00,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:36:00,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:00,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 154 states and 218 transitions. [2019-11-20 10:36:00,197 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 218 transitions. [2019-11-20 10:36:00,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 10:36:00,200 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:00,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:00,310 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 10:36:00,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:00,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 155 states and 219 transitions. [2019-11-20 10:36:00,342 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 219 transitions. [2019-11-20 10:36:00,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 10:36:00,345 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:00,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:00,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:36:00,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:00,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 158 states and 230 transitions. [2019-11-20 10:36:00,495 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 230 transitions. [2019-11-20 10:36:00,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 10:36:00,497 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:00,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:00,554 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:36:00,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:00,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 157 states and 226 transitions. [2019-11-20 10:36:00,579 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 226 transitions. [2019-11-20 10:36:00,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-20 10:36:00,581 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:00,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:00,668 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 10:36:00,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:00,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 168 states and 255 transitions. [2019-11-20 10:36:00,929 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 255 transitions. [2019-11-20 10:36:00,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-20 10:36:00,930 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:00,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:01,012 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:36:01,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:01,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 170 states and 257 transitions. [2019-11-20 10:36:01,083 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 257 transitions. [2019-11-20 10:36:01,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-20 10:36:01,085 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:01,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:01,177 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 10:36:01,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:01,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 182 states and 285 transitions. [2019-11-20 10:36:01,647 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 285 transitions. [2019-11-20 10:36:01,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-20 10:36:01,649 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:01,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:01,731 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:36:01,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:01,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 181 states and 279 transitions. [2019-11-20 10:36:01,780 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 279 transitions. [2019-11-20 10:36:01,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-20 10:36:01,781 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:01,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:01,925 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 10:36:02,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:02,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 194 states and 307 transitions. [2019-11-20 10:36:02,522 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 307 transitions. [2019-11-20 10:36:02,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-20 10:36:02,523 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:02,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:02,574 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 10:36:02,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:02,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 195 states and 307 transitions. [2019-11-20 10:36:02,592 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 307 transitions. [2019-11-20 10:36:02,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-20 10:36:02,593 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:02,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:02,683 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 10:36:03,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:03,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 209 states and 336 transitions. [2019-11-20 10:36:03,671 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 336 transitions. [2019-11-20 10:36:03,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-20 10:36:03,672 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:03,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:03,720 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 10:36:03,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:03,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 210 states and 336 transitions. [2019-11-20 10:36:03,735 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 336 transitions. [2019-11-20 10:36:03,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-20 10:36:03,736 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:03,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:03,777 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 10:36:03,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:03,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 214 states and 345 transitions. [2019-11-20 10:36:03,901 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 345 transitions. [2019-11-20 10:36:03,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-20 10:36:03,902 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:03,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:04,011 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 10:36:04,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:04,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 215 states and 345 transitions. [2019-11-20 10:36:04,031 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 345 transitions. [2019-11-20 10:36:04,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-20 10:36:04,034 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:04,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:04,083 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 10:36:04,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:04,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 216 states and 345 transitions. [2019-11-20 10:36:04,105 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 345 transitions. [2019-11-20 10:36:04,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-20 10:36:04,106 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:04,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:04,177 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:36:04,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:04,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 222 states and 360 transitions. [2019-11-20 10:36:04,299 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 360 transitions. [2019-11-20 10:36:04,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-20 10:36:04,299 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:04,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:04,367 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:36:04,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:04,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 223 states and 360 transitions. [2019-11-20 10:36:04,386 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 360 transitions. [2019-11-20 10:36:04,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-20 10:36:04,388 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:04,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:04,448 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:36:04,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:04,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 229 states and 377 transitions. [2019-11-20 10:36:04,664 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 377 transitions. [2019-11-20 10:36:04,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-20 10:36:04,665 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:04,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:04,712 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:36:04,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:04,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 230 states and 377 transitions. [2019-11-20 10:36:04,730 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 377 transitions. [2019-11-20 10:36:04,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-20 10:36:04,731 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:04,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:04,790 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:36:05,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:05,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 236 states and 394 transitions. [2019-11-20 10:36:05,017 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 394 transitions. [2019-11-20 10:36:05,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-20 10:36:05,018 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:05,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:05,069 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:36:05,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:05,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 237 states and 394 transitions. [2019-11-20 10:36:05,082 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 394 transitions. [2019-11-20 10:36:05,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-20 10:36:05,083 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:05,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:05,130 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 10:36:05,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:05,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 240 states and 407 transitions. [2019-11-20 10:36:05,799 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 407 transitions. [2019-11-20 10:36:05,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-20 10:36:05,800 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:05,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:05,871 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:36:06,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:06,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 246 states and 426 transitions. [2019-11-20 10:36:06,388 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 426 transitions. [2019-11-20 10:36:06,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-20 10:36:06,389 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:06,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:06,434 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:36:06,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:06,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 247 states and 426 transitions. [2019-11-20 10:36:06,446 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 426 transitions. [2019-11-20 10:36:06,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-20 10:36:06,448 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:06,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:06,580 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 10:36:07,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:07,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 252 states and 445 transitions. [2019-11-20 10:36:07,140 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 445 transitions. [2019-11-20 10:36:07,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-20 10:36:07,140 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:07,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:07,179 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 10:36:07,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:07,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 255 states and 458 transitions. [2019-11-20 10:36:07,705 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 458 transitions. [2019-11-20 10:36:07,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-20 10:36:07,706 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:07,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:07,750 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-20 10:36:08,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:08,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 261 states and 474 transitions. [2019-11-20 10:36:08,181 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 474 transitions. [2019-11-20 10:36:08,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-20 10:36:08,183 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:08,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:08,233 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-20 10:36:08,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:08,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 262 states and 474 transitions. [2019-11-20 10:36:08,460 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 474 transitions. [2019-11-20 10:36:08,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-20 10:36:08,464 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:08,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:08,516 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-20 10:36:09,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:09,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 268 states and 490 transitions. [2019-11-20 10:36:09,128 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 490 transitions. [2019-11-20 10:36:09,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-20 10:36:09,129 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:09,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:09,258 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 10:36:09,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:09,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 267 states and 473 transitions. [2019-11-20 10:36:09,371 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 473 transitions. [2019-11-20 10:36:09,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-20 10:36:09,378 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:09,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:09,419 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-20 10:36:09,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:09,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 268 states and 473 transitions. [2019-11-20 10:36:09,673 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 473 transitions. [2019-11-20 10:36:09,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-20 10:36:09,674 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:09,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:09,718 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 10:36:09,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:09,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 270 states and 476 transitions. [2019-11-20 10:36:09,865 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 476 transitions. [2019-11-20 10:36:09,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-20 10:36:09,867 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:09,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:09,913 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-20 10:36:10,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:10,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 276 states and 491 transitions. [2019-11-20 10:36:10,501 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 491 transitions. [2019-11-20 10:36:10,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-20 10:36:10,502 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:10,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:10,545 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-20 10:36:10,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:10,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 277 states and 491 transitions. [2019-11-20 10:36:10,822 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 491 transitions. [2019-11-20 10:36:10,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-20 10:36:10,823 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:10,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:10,868 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-20 10:36:10,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:10,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 279 states and 493 transitions. [2019-11-20 10:36:10,887 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 493 transitions. [2019-11-20 10:36:10,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-20 10:36:10,888 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:10,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:10,929 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-20 10:36:11,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:11,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 285 states and 509 transitions. [2019-11-20 10:36:11,411 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 509 transitions. [2019-11-20 10:36:11,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-20 10:36:11,413 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:11,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:11,454 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-20 10:36:11,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:11,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 287 states and 512 transitions. [2019-11-20 10:36:11,484 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 512 transitions. [2019-11-20 10:36:11,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-20 10:36:11,485 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:11,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:11,525 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-20 10:36:11,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:11,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 288 states and 512 transitions. [2019-11-20 10:36:11,760 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 512 transitions. [2019-11-20 10:36:11,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-20 10:36:11,761 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:11,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:11,801 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-20 10:36:11,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:11,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 290 states and 514 transitions. [2019-11-20 10:36:11,819 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 514 transitions. [2019-11-20 10:36:11,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-20 10:36:11,820 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:11,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:11,864 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 10:36:11,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:11,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 292 states and 517 transitions. [2019-11-20 10:36:11,891 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 517 transitions. [2019-11-20 10:36:11,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-20 10:36:11,894 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:11,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:11,944 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 10:36:11,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:11,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 294 states and 520 transitions. [2019-11-20 10:36:11,967 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 520 transitions. [2019-11-20 10:36:11,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-20 10:36:11,968 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:11,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:12,018 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 10:36:12,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:12,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 296 states and 523 transitions. [2019-11-20 10:36:12,040 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 523 transitions. [2019-11-20 10:36:12,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-20 10:36:12,041 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:12,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:12,082 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-20 10:36:12,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:12,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 298 states and 525 transitions. [2019-11-20 10:36:12,098 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 525 transitions. [2019-11-20 10:36:12,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-20 10:36:12,099 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:12,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:12,140 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-20 10:36:12,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:12,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 300 states and 527 transitions. [2019-11-20 10:36:12,159 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 527 transitions. [2019-11-20 10:36:12,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-20 10:36:12,161 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:12,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:12,224 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-20 10:36:12,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:12,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 306 states and 539 transitions. [2019-11-20 10:36:12,266 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 539 transitions. [2019-11-20 10:36:12,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-20 10:36:12,267 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:12,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:12,307 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 10:36:12,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:12,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 310 states and 548 transitions. [2019-11-20 10:36:12,576 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 548 transitions. [2019-11-20 10:36:12,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-20 10:36:12,579 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:12,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:12,618 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 10:36:12,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:12,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 312 states and 551 transitions. [2019-11-20 10:36:12,643 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 551 transitions. [2019-11-20 10:36:12,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-20 10:36:12,644 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:12,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:12,712 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-20 10:36:12,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:12,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 313 states and 552 transitions. [2019-11-20 10:36:12,724 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 552 transitions. [2019-11-20 10:36:12,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-20 10:36:12,725 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:12,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:12,777 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-20 10:36:12,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:12,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 319 states and 564 transitions. [2019-11-20 10:36:12,820 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 564 transitions. [2019-11-20 10:36:12,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-20 10:36:12,821 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:12,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:12,873 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-20 10:36:12,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:12,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 320 states and 564 transitions. [2019-11-20 10:36:12,889 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 564 transitions. [2019-11-20 10:36:12,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-20 10:36:12,890 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:12,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:12,927 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 10:36:12,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:12,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 322 states and 566 transitions. [2019-11-20 10:36:12,943 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 566 transitions. [2019-11-20 10:36:12,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-20 10:36:12,944 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:12,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:12,993 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-20 10:36:13,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:13,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 323 states and 567 transitions. [2019-11-20 10:36:13,004 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 567 transitions. [2019-11-20 10:36:13,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-20 10:36:13,005 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:13,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:13,055 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-20 10:36:13,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:13,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 329 states and 579 transitions. [2019-11-20 10:36:13,098 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 579 transitions. [2019-11-20 10:36:13,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-20 10:36:13,099 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:13,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:13,143 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-20 10:36:13,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:13,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 330 states and 579 transitions. [2019-11-20 10:36:13,160 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 579 transitions. [2019-11-20 10:36:13,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-20 10:36:13,161 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:13,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:13,208 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-20 10:36:13,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:13,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 331 states and 580 transitions. [2019-11-20 10:36:13,220 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 580 transitions. [2019-11-20 10:36:13,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-20 10:36:13,221 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:13,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:13,269 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-20 10:36:13,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:13,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 332 states and 580 transitions. [2019-11-20 10:36:13,513 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 580 transitions. [2019-11-20 10:36:13,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-20 10:36:13,514 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:13,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:13,563 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-20 10:36:13,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:13,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 338 states and 593 transitions. [2019-11-20 10:36:13,607 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 593 transitions. [2019-11-20 10:36:13,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-20 10:36:13,608 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:13,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:13,670 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-20 10:36:13,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:13,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 340 states and 598 transitions. [2019-11-20 10:36:13,860 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 598 transitions. [2019-11-20 10:36:13,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-20 10:36:13,861 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:13,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:13,921 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-20 10:36:13,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:13,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 341 states and 598 transitions. [2019-11-20 10:36:13,986 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 598 transitions. [2019-11-20 10:36:13,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-20 10:36:13,987 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:14,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:14,037 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-20 10:36:14,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:14,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 342 states and 599 transitions. [2019-11-20 10:36:14,049 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 599 transitions. [2019-11-20 10:36:14,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-20 10:36:14,050 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:14,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:14,094 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-20 10:36:14,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:14,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 343 states and 599 transitions. [2019-11-20 10:36:14,363 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 599 transitions. [2019-11-20 10:36:14,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-20 10:36:14,364 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:14,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:14,404 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-20 10:36:14,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:14,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 344 states and 599 transitions. [2019-11-20 10:36:14,419 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 599 transitions. [2019-11-20 10:36:14,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-20 10:36:14,420 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:14,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:14,465 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-20 10:36:14,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:14,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 345 states and 599 transitions. [2019-11-20 10:36:14,613 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 599 transitions. [2019-11-20 10:36:14,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-20 10:36:14,615 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:14,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:14,662 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-20 10:36:15,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:15,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 350 states and 606 transitions. [2019-11-20 10:36:15,265 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 606 transitions. [2019-11-20 10:36:15,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-20 10:36:15,268 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:15,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:15,323 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-20 10:36:15,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:15,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 351 states and 606 transitions. [2019-11-20 10:36:15,601 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 606 transitions. [2019-11-20 10:36:15,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-20 10:36:15,603 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:15,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:15,652 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-20 10:36:15,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:15,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 352 states and 606 transitions. [2019-11-20 10:36:15,666 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 606 transitions. [2019-11-20 10:36:15,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-20 10:36:15,668 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:15,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:15,713 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-20 10:36:16,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:16,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 357 states and 613 transitions. [2019-11-20 10:36:16,362 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 613 transitions. [2019-11-20 10:36:16,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-20 10:36:16,363 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:16,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:16,410 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-20 10:36:16,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:16,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 358 states and 613 transitions. [2019-11-20 10:36:16,707 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 613 transitions. [2019-11-20 10:36:16,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-20 10:36:16,709 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:16,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:16,753 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-20 10:36:17,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:17,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 363 states and 620 transitions. [2019-11-20 10:36:17,411 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 620 transitions. [2019-11-20 10:36:17,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-20 10:36:17,412 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:17,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:17,455 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-20 10:36:17,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:17,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 364 states and 620 transitions. [2019-11-20 10:36:17,778 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 620 transitions. [2019-11-20 10:36:17,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-20 10:36:17,779 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:17,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:17,822 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-20 10:36:18,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:18,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 367 states and 624 transitions. [2019-11-20 10:36:18,232 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 624 transitions. [2019-11-20 10:36:18,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-20 10:36:18,234 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:18,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:18,277 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-20 10:36:18,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:18,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 370 states and 627 transitions. [2019-11-20 10:36:18,481 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 627 transitions. [2019-11-20 10:36:18,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-20 10:36:18,482 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:18,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:18,528 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-20 10:36:18,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:18,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 372 states and 629 transitions. [2019-11-20 10:36:18,546 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 629 transitions. [2019-11-20 10:36:18,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-20 10:36:18,549 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:18,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:18,767 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-20 10:36:19,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:19,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 373 states and 633 transitions. [2019-11-20 10:36:19,142 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 633 transitions. [2019-11-20 10:36:19,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-20 10:36:19,143 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:19,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:19,212 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-20 10:36:19,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:19,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 373 states and 632 transitions. [2019-11-20 10:36:19,240 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 632 transitions. [2019-11-20 10:36:19,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-20 10:36:19,241 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:19,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:19,318 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 10:36:19,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:19,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 388 states and 658 transitions. [2019-11-20 10:36:19,357 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 658 transitions. [2019-11-20 10:36:19,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-20 10:36:19,359 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:19,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:19,444 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 10:36:19,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:19,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 393 states and 666 transitions. [2019-11-20 10:36:19,477 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 666 transitions. [2019-11-20 10:36:19,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-20 10:36:19,479 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:19,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:19,557 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 10:36:19,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:19,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 408 states and 692 transitions. [2019-11-20 10:36:19,614 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 692 transitions. [2019-11-20 10:36:19,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-20 10:36:19,616 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:19,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:19,690 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 10:36:19,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:19,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 413 states and 700 transitions. [2019-11-20 10:36:19,719 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 700 transitions. [2019-11-20 10:36:19,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-20 10:36:19,720 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:19,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:19,796 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 10:36:19,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:19,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 414 states and 701 transitions. [2019-11-20 10:36:19,815 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 701 transitions. [2019-11-20 10:36:19,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-20 10:36:19,817 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:19,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:19,924 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 10:36:19,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:19,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 415 states and 702 transitions. [2019-11-20 10:36:19,946 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 702 transitions. [2019-11-20 10:36:19,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-20 10:36:19,948 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:19,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:20,033 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 10:36:20,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:20,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 430 states and 728 transitions. [2019-11-20 10:36:20,112 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 728 transitions. [2019-11-20 10:36:20,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-20 10:36:20,114 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:20,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:20,256 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 10:36:20,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:20,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 435 states and 736 transitions. [2019-11-20 10:36:20,297 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 736 transitions. [2019-11-20 10:36:20,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 10:36:20,299 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:20,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:20,369 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 10:36:20,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:20,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 436 states and 737 transitions. [2019-11-20 10:36:20,392 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 737 transitions. [2019-11-20 10:36:20,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 10:36:20,393 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:20,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:20,461 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 10:36:20,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:20,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 437 states and 738 transitions. [2019-11-20 10:36:20,484 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 738 transitions. [2019-11-20 10:36:20,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-20 10:36:20,485 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:20,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:20,558 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 10:36:20,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:20,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 452 states and 764 transitions. [2019-11-20 10:36:20,621 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 764 transitions. [2019-11-20 10:36:20,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-20 10:36:20,623 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:20,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:20,690 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 10:36:20,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:20,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 457 states and 772 transitions. [2019-11-20 10:36:20,733 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 772 transitions. [2019-11-20 10:36:20,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 10:36:20,735 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:20,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:20,803 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 10:36:20,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:20,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 458 states and 773 transitions. [2019-11-20 10:36:20,834 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 773 transitions. [2019-11-20 10:36:20,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 10:36:20,836 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:20,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:20,907 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 10:36:20,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:20,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 459 states and 774 transitions. [2019-11-20 10:36:20,936 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 774 transitions. [2019-11-20 10:36:20,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 10:36:20,938 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:20,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:21,015 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 10:36:21,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:21,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 462 states and 778 transitions. [2019-11-20 10:36:21,032 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 778 transitions. [2019-11-20 10:36:21,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-20 10:36:21,034 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:21,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:21,114 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 10:36:21,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:21,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 463 states and 779 transitions. [2019-11-20 10:36:21,136 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 779 transitions. [2019-11-20 10:36:21,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-20 10:36:21,138 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:21,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:21,208 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 10:36:21,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:21,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 464 states and 780 transitions. [2019-11-20 10:36:21,229 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 780 transitions. [2019-11-20 10:36:21,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-20 10:36:21,230 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:21,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:21,299 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 10:36:21,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:21,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 467 states and 784 transitions. [2019-11-20 10:36:21,321 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 784 transitions. [2019-11-20 10:36:21,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-20 10:36:21,322 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:21,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:21,390 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 10:36:21,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:21,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 470 states and 788 transitions. [2019-11-20 10:36:21,411 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 788 transitions. [2019-11-20 10:36:21,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-20 10:36:21,412 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:21,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:21,492 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 10:36:21,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:21,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 473 states and 792 transitions. [2019-11-20 10:36:21,533 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 792 transitions. [2019-11-20 10:36:21,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-20 10:36:21,534 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:21,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:21,605 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-11-20 10:36:21,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:21,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 474 states and 792 transitions. [2019-11-20 10:36:21,626 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 792 transitions. [2019-11-20 10:36:21,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-20 10:36:21,627 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:21,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:21,694 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-11-20 10:36:21,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:21,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 475 states and 792 transitions. [2019-11-20 10:36:21,715 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 792 transitions. [2019-11-20 10:36:21,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-20 10:36:21,717 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:21,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:22,379 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-20 10:36:22,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:22,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 481 states and 801 transitions. [2019-11-20 10:36:22,583 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 801 transitions. [2019-11-20 10:36:22,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-20 10:36:22,584 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:22,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:22,682 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-11-20 10:36:22,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:22,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 482 states and 801 transitions. [2019-11-20 10:36:22,706 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 801 transitions. [2019-11-20 10:36:22,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-20 10:36:22,707 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:22,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:22,813 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-20 10:36:23,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:23,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 488 states and 811 transitions. [2019-11-20 10:36:23,318 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 811 transitions. [2019-11-20 10:36:23,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-20 10:36:23,319 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:23,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:23,428 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-11-20 10:36:23,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:23,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 489 states and 811 transitions. [2019-11-20 10:36:23,448 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 811 transitions. [2019-11-20 10:36:23,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-20 10:36:23,449 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:23,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:23,546 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-20 10:36:24,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:24,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 495 states and 821 transitions. [2019-11-20 10:36:24,102 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 821 transitions. [2019-11-20 10:36:24,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-20 10:36:24,105 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:24,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:24,189 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-20 10:36:24,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:24,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 501 states and 831 transitions. [2019-11-20 10:36:24,767 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 831 transitions. [2019-11-20 10:36:24,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-20 10:36:24,768 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:24,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:25,183 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-11-20 10:36:25,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:25,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 503 states and 834 transitions. [2019-11-20 10:36:25,490 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 834 transitions. [2019-11-20 10:36:25,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-20 10:36:25,492 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:25,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:25,573 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-11-20 10:36:25,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:25,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 505 states and 837 transitions. [2019-11-20 10:36:25,617 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 837 transitions. [2019-11-20 10:36:25,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-20 10:36:25,618 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:25,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:25,697 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-11-20 10:36:25,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:25,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 507 states and 840 transitions. [2019-11-20 10:36:25,735 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 840 transitions. [2019-11-20 10:36:25,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-20 10:36:25,736 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:25,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:25,816 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-11-20 10:36:25,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:25,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 509 states and 843 transitions. [2019-11-20 10:36:25,856 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 843 transitions. [2019-11-20 10:36:25,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-20 10:36:25,858 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:25,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:26,463 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-20 10:36:29,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:29,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 569 states and 981 transitions. [2019-11-20 10:36:29,586 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 981 transitions. [2019-11-20 10:36:29,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-20 10:36:29,588 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:29,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:29,700 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-20 10:36:30,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:30,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 577 states and 999 transitions. [2019-11-20 10:36:30,162 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 999 transitions. [2019-11-20 10:36:30,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-20 10:36:30,164 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:30,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:30,264 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-20 10:36:30,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:30,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 592 states and 1026 transitions. [2019-11-20 10:36:30,773 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 1026 transitions. [2019-11-20 10:36:30,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-20 10:36:30,775 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:30,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:30,925 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-20 10:36:30,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:30,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 593 states and 1027 transitions. [2019-11-20 10:36:30,960 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 1027 transitions. [2019-11-20 10:36:30,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-20 10:36:30,961 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:31,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:31,066 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-20 10:36:31,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:31,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1070 states to 594 states and 1028 transitions. [2019-11-20 10:36:31,096 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 1028 transitions. [2019-11-20 10:36:31,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-20 10:36:31,097 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:31,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:31,282 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-11-20 10:36:31,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:31,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1070 states to 595 states and 1028 transitions. [2019-11-20 10:36:31,307 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 1028 transitions. [2019-11-20 10:36:31,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-20 10:36:31,308 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:31,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:31,403 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-20 10:36:31,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:31,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 610 states and 1055 transitions. [2019-11-20 10:36:31,909 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 1055 transitions. [2019-11-20 10:36:31,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-20 10:36:31,911 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:31,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:32,005 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-20 10:36:32,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:32,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 625 states and 1082 transitions. [2019-11-20 10:36:32,531 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 1082 transitions. [2019-11-20 10:36:32,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-20 10:36:32,533 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:32,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:32,880 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-20 10:36:33,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:33,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 627 states and 1092 transitions. [2019-11-20 10:36:33,373 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 1092 transitions. [2019-11-20 10:36:33,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-20 10:36:33,374 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:33,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:33,779 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-20 10:36:35,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:35,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 631 states and 1103 transitions. [2019-11-20 10:36:35,199 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 1103 transitions. [2019-11-20 10:36:35,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-20 10:36:35,200 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:35,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:35,319 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-20 10:36:35,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:35,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 633 states and 1105 transitions. [2019-11-20 10:36:35,355 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 1105 transitions. [2019-11-20 10:36:35,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-20 10:36:35,356 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:35,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:35,459 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-20 10:36:35,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:36:35,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 637 states and 1111 transitions. [2019-11-20 10:36:35,490 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 1111 transitions. [2019-11-20 10:36:35,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-20 10:36:35,492 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:36:36,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:36,666 ERROR L603 CodeCheckObserver]: First Tracecheck threw exception Undeclared function symbol (const Int) [2019-11-20 10:36:36,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:36:36,971 INFO L255 TraceCheckSpWp]: Trace formula consists of 1445 conjuncts, 119 conjunts are in the unsatisfiable core [2019-11-20 10:36:36,988 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:36:37,051 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 10:36:37,052 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:36:37,058 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:36:37,058 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:36:37,059 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:10 [2019-11-20 10:36:37,527 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2019-11-20 10:36:37,527 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:36:37,539 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:36:37,540 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:36:37,540 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:16 [2019-11-20 10:36:38,889 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2019-11-20 10:36:38,889 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:36:38,893 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:36:38,894 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:36:38,894 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2019-11-20 10:36:40,368 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:36:40,369 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-20 10:36:40,370 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:36:40,413 INFO L567 ElimStorePlain]: treesize reduction 14, result has 69.6 percent of original size [2019-11-20 10:36:40,418 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-11-20 10:36:40,418 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:36:40,437 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:36:40,438 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:36:40,438 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:31 [2019-11-20 10:36:41,013 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-20 10:36:41,013 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:36:41,024 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:36:41,024 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 10:36:41,024 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-11-20 10:37:01,381 WARN L191 SmtUtils]: Spent 10.01 s on a formula simplification that was a NOOP. DAG size: 19 [2019-11-20 10:37:55,685 WARN L191 SmtUtils]: Spent 53.91 s on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2019-11-20 10:37:55,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:37:55,771 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:37:55,771 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 71 treesize of output 118 [2019-11-20 10:37:55,772 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:37:55,925 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-11-20 10:37:55,926 INFO L567 ElimStorePlain]: treesize reduction 28, result has 82.1 percent of original size [2019-11-20 10:37:55,927 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2019-11-20 10:37:55,928 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:126, output treesize:128 [2019-11-20 10:37:59,323 INFO L392 ElimStorePlain]: Different costs {1=[v_prenex_9], 3=[|v_#valid_BEFORE_CALL_5|]} [2019-11-20 10:37:59,333 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2019-11-20 10:37:59,334 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:37:59,377 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:37:59,382 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2019-11-20 10:37:59,383 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:37:59,417 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:37:59,418 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-11-20 10:37:59,419 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:91, output treesize:66 [2019-11-20 10:38:56,072 WARN L191 SmtUtils]: Spent 43.99 s on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-11-20 10:39:10,966 WARN L191 SmtUtils]: Spent 13.35 s on a formula simplification that was a NOOP. DAG size: 46 [2019-11-20 10:39:10,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:39:10,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:39:11,054 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:39:11,054 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 93 treesize of output 165 [2019-11-20 10:39:11,055 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:39:11,097 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:39:11,097 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 74 treesize of output 121 [2019-11-20 10:39:11,098 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:39:11,552 WARN L191 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 81 [2019-11-20 10:39:11,552 INFO L567 ElimStorePlain]: treesize reduction 70, result has 81.5 percent of original size [2019-11-20 10:39:11,554 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2019-11-20 10:39:11,555 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:301, output treesize:309 [2019-11-20 10:39:12,539 WARN L191 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 85 [2019-11-20 10:39:13,236 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-11-20 10:39:13,249 INFO L392 ElimStorePlain]: Different costs {1=[v_prenex_29], 3=[v_prenex_23, |v_#valid_BEFORE_CALL_9|], 6=[v_prenex_27]} [2019-11-20 10:39:13,265 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2019-11-20 10:39:13,266 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:39:13,397 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-11-20 10:39:13,398 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:39:13,406 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2019-11-20 10:39:13,406 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:39:13,534 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-11-20 10:39:13,534 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:39:13,545 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2019-11-20 10:39:13,545 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 10:39:13,654 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2019-11-20 10:39:13,654 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:39:13,662 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 74 [2019-11-20 10:39:13,663 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 10:39:13,760 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:39:13,762 INFO L496 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 4 dim-1 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2019-11-20 10:39:13,762 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:229, output treesize:169 [2019-11-20 10:39:24,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:39:24,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 10:39:24,766 INFO L392 ElimStorePlain]: Different costs {1=[v_prenex_37], 3=[v_prenex_35, v_prenex_39, v_prenex_38], 6=[v_prenex_34, v_prenex_43, |v_#valid_BEFORE_CALL_12|], 10=[v_prenex_36]} [2019-11-20 10:39:24,787 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2019-11-20 10:39:24,787 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:39:25,254 WARN L191 SmtUtils]: Spent 466.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2019-11-20 10:39:25,255 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:39:25,275 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:39:25,276 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 78 [2019-11-20 10:39:25,276 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:39:25,710 WARN L191 SmtUtils]: Spent 433.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2019-11-20 10:39:25,710 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:39:25,725 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 70 [2019-11-20 10:39:25,726 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 10:39:26,141 WARN L191 SmtUtils]: Spent 414.00 ms on a formula simplification that was a NOOP. DAG size: 165 [2019-11-20 10:39:26,141 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:39:26,153 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 70 [2019-11-20 10:39:26,154 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 10:39:26,516 WARN L191 SmtUtils]: Spent 361.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-11-20 10:39:26,516 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:39:26,541 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:39:26,542 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 100 [2019-11-20 10:39:26,542 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-20 10:39:26,902 WARN L191 SmtUtils]: Spent 360.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-11-20 10:39:26,903 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:39:26,917 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 88 [2019-11-20 10:39:26,918 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-20 10:39:27,274 WARN L191 SmtUtils]: Spent 355.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-11-20 10:39:27,274 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:39:27,306 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:39:27,307 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 100 [2019-11-20 10:39:27,307 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-20 10:39:27,668 WARN L191 SmtUtils]: Spent 359.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-11-20 10:39:27,668 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:39:27,711 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:39:27,711 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 104 treesize of output 126 [2019-11-20 10:39:27,712 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-20 10:39:28,193 WARN L191 SmtUtils]: Spent 480.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-11-20 10:39:28,193 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:39:28,196 INFO L496 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 8 dim-1 vars, End of recursive call: 24 dim-0 vars, and 8 xjuncts. [2019-11-20 10:39:28,196 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 20 variables, input treesize:649, output treesize:557 [2019-11-20 10:45:29,755 WARN L191 SmtUtils]: Spent 5.68 m on a formula simplification. DAG size of input: 221 DAG size of output: 130 [2019-11-20 10:46:50,607 WARN L191 SmtUtils]: Spent 1.34 m on a formula simplification that was a NOOP. DAG size: 130 [2019-11-20 10:47:00,657 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_15 Int) (v_prenex_70 Int) (v_prenex_72 Int) (v_prenex_71 Int)) (let ((.cse0 ((as const (Array Int Int)) 0))) (and (not (= v_prenex_72 v_prenex_71)) (= .cse0 (select |c_#memory_int| v_prenex_15)) (not (= v_prenex_70 0)) (not (= v_prenex_70 v_prenex_72)) (not (= v_prenex_70 v_prenex_71)) (= .cse0 (select |c_#memory_int| v_prenex_70)) (not (= v_prenex_15 v_prenex_72)) (not (= v_prenex_15 v_prenex_71)) (not (= 0 (mod v_prenex_71 18446744073709551616))) (not (= v_prenex_70 v_prenex_15)) (not (= (mod v_prenex_72 18446744073709551616) 0))))) (and (exists ((v_prenex_59 Int)) (and (= ((as const (Array Int Int)) 0) (select |c_#memory_int| v_prenex_59)) (not (= v_prenex_59 0)))) (exists ((v_prenex_48 Int) (v_prenex_47 Int)) (let ((.cse1 ((as const (Array Int Int)) 0))) (and (not (= v_prenex_47 v_prenex_48)) (not (= v_prenex_47 0)) (= .cse1 (select |c_#memory_int| v_prenex_48)) (= (select |c_#memory_int| v_prenex_47) .cse1))))) (exists ((v_prenex_4 Int) (v_prenex_69 Int) (v_prenex_68 Int)) (let ((.cse2 ((as const (Array Int Int)) 0))) (and (not (= 0 (mod v_prenex_69 18446744073709551616))) (= .cse2 (select |c_#memory_int| v_prenex_68)) (not (= v_prenex_68 0)) (not (= v_prenex_68 v_prenex_69)) (not (= v_prenex_68 v_prenex_4)) (= .cse2 (select |c_#memory_int| v_prenex_4)) (not (= v_prenex_69 v_prenex_4))))) (exists ((v_prenex_67 Int) (v_prenex_66 Int) (v_prenex_41 Int)) (let ((.cse3 ((as const (Array Int Int)) 0))) (and (not (= v_prenex_67 v_prenex_66)) (not (= v_prenex_67 v_prenex_41)) (not (= (mod v_prenex_66 18446744073709551616) 0)) (not (= v_prenex_41 v_prenex_66)) (not (= v_prenex_67 0)) (= .cse3 (select |c_#memory_int| v_prenex_41)) (= .cse3 (select |c_#memory_int| v_prenex_67))))) (exists ((v_prenex_42 Int) (v_ULTIMATE.start_usb_acecad_probe_~id.base_BEFORE_CALL_6 Int) (v_ULTIMATE.start_usb_acecad_probe_~acecad~3.base_BEFORE_CALL_2 Int)) (let ((.cse4 ((as const (Array Int Int)) 0))) (and (= .cse4 (select |c_#memory_int| v_prenex_42)) (not (= v_ULTIMATE.start_usb_acecad_probe_~id.base_BEFORE_CALL_6 0)) (= (select |c_#memory_int| v_ULTIMATE.start_usb_acecad_probe_~id.base_BEFORE_CALL_6) .cse4) (not (= v_ULTIMATE.start_usb_acecad_probe_~acecad~3.base_BEFORE_CALL_2 v_prenex_42)) (not (= v_ULTIMATE.start_usb_acecad_probe_~id.base_BEFORE_CALL_6 v_prenex_42)) (not (= v_ULTIMATE.start_usb_acecad_probe_~id.base_BEFORE_CALL_6 v_ULTIMATE.start_usb_acecad_probe_~acecad~3.base_BEFORE_CALL_2)) (not (= 0 (mod v_ULTIMATE.start_usb_acecad_probe_~acecad~3.base_BEFORE_CALL_2 18446744073709551616)))))) (exists ((v_prenex_58 Int) (v_prenex_57 Int) (v_ULTIMATE.start_usb_acecad_probe_~input_dev~0.base_BEFORE_CALL_1 Int) (v_prenex_21 Int)) (let ((.cse5 ((as const (Array Int Int)) 0))) (and (not (= v_prenex_58 v_prenex_21)) (not (= 0 (mod v_prenex_58 18446744073709551616))) (not (= v_prenex_57 0)) (not (= v_prenex_21 v_ULTIMATE.start_usb_acecad_probe_~input_dev~0.base_BEFORE_CALL_1)) (not (= v_prenex_57 v_prenex_21)) (not (= v_prenex_58 v_ULTIMATE.start_usb_acecad_probe_~input_dev~0.base_BEFORE_CALL_1)) (not (= v_prenex_57 v_ULTIMATE.start_usb_acecad_probe_~input_dev~0.base_BEFORE_CALL_1)) (not (= 0 (mod v_ULTIMATE.start_usb_acecad_probe_~input_dev~0.base_BEFORE_CALL_1 18446744073709551616))) (= .cse5 (select |c_#memory_int| v_prenex_57)) (= .cse5 (select |c_#memory_int| v_prenex_21)) (not (= v_prenex_57 v_prenex_58))))) (exists ((v_ULTIMATE.start_usb_acecad_probe_~dev~1.base_BEFORE_CALL_5 Int) (v_prenex_40 Int) (v_prenex_61 Int) (v_prenex_60 Int)) (let ((.cse6 ((as const (Array Int Int)) 0))) (and (not (= 0 (mod v_prenex_61 18446744073709551616))) (not (= v_prenex_60 v_prenex_40)) (not (= v_prenex_40 v_ULTIMATE.start_usb_acecad_probe_~dev~1.base_BEFORE_CALL_5)) (not (= v_prenex_60 v_prenex_61)) (not (= v_prenex_60 v_ULTIMATE.start_usb_acecad_probe_~dev~1.base_BEFORE_CALL_5)) (not (= v_prenex_61 v_prenex_40)) (not (= (mod v_ULTIMATE.start_usb_acecad_probe_~dev~1.base_BEFORE_CALL_5 18446744073709551616) 0)) (not (= v_prenex_60 0)) (= .cse6 (select |c_#memory_int| v_prenex_40)) (not (= v_prenex_61 v_ULTIMATE.start_usb_acecad_probe_~dev~1.base_BEFORE_CALL_5)) (= .cse6 (select |c_#memory_int| v_prenex_60))))) (exists ((v_prenex_16 Int) (v_prenex_63 Int) (v_prenex_62 Int) (v_prenex_65 Int) (v_prenex_64 Int)) (let ((.cse7 ((as const (Array Int Int)) 0))) (and (not (= v_prenex_65 v_prenex_64)) (= .cse7 (select |c_#memory_int| v_prenex_16)) (= .cse7 (select |c_#memory_int| v_prenex_63)) (not (= v_prenex_65 v_prenex_16)) (not (= 0 (mod v_prenex_65 18446744073709551616))) (not (= v_prenex_63 0)) (not (= v_prenex_62 v_prenex_64)) (not (= v_prenex_65 v_prenex_62)) (not (= v_prenex_63 v_prenex_62)) (not (= v_prenex_63 v_prenex_64)) (not (= v_prenex_16 v_prenex_62)) (not (= v_prenex_63 v_prenex_65)) (not (= (mod v_prenex_62 18446744073709551616) 0)) (not (= v_prenex_63 v_prenex_16)) (not (= v_prenex_16 v_prenex_64)) (not (= 0 (mod v_prenex_64 18446744073709551616))))))) is different from true [2019-11-20 10:47:16,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-11-20 10:47:16,669 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:47:16,670 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 96 [2019-11-20 10:47:16,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:47:16,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:47:16,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:47:16,681 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:291) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.CodeCheckObserver.createTraceCheck(CodeCheckObserver.java:614) at de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.CodeCheckObserver.process(CodeCheckObserver.java:453) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.CFGWalker.runObserver(CFGWalker.java:57) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.BaseWalker.runObserver(BaseWalker.java:93) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.BaseWalker.run(BaseWalker.java:86) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-20 10:47:16,685 INFO L168 Benchmark]: Toolchain (without parser) took 681687.09 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 939.3 MB in the beginning and 1.5 GB in the end (delta: -534.0 MB). Peak memory consumption was 607.4 MB. Max. memory is 11.5 GB. [2019-11-20 10:47:16,685 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 10:47:16,687 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1467.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -141.6 MB). Peak memory consumption was 37.4 MB. Max. memory is 11.5 GB. [2019-11-20 10:47:16,691 INFO L168 Benchmark]: Boogie Procedure Inliner took 132.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-20 10:47:16,695 INFO L168 Benchmark]: Boogie Preprocessor took 134.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 10:47:16,696 INFO L168 Benchmark]: RCFGBuilder took 2937.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -26.6 MB). Peak memory consumption was 203.5 MB. Max. memory is 11.5 GB. [2019-11-20 10:47:16,696 INFO L168 Benchmark]: CodeCheck took 677007.75 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 993.0 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -381.8 MB). Peak memory consumption was 611.2 MB. Max. memory is 11.5 GB. [2019-11-20 10:47:16,698 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1467.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -141.6 MB). Peak memory consumption was 37.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 132.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 134.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2937.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -26.6 MB). Peak memory consumption was 203.5 MB. Max. memory is 11.5 GB. * CodeCheck took 677007.75 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 993.0 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -381.8 MB). Peak memory consumption was 611.2 MB. Max. memory is 11.5 GB. RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-678e011 [2019-11-20 10:47:18,686 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 10:47:18,689 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 10:47:18,705 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 10:47:18,706 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 10:47:18,708 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 10:47:18,709 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 10:47:18,723 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 10:47:18,725 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 10:47:18,728 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 10:47:18,729 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 10:47:18,730 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 10:47:18,731 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 10:47:18,734 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 10:47:18,736 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 10:47:18,738 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 10:47:18,739 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 10:47:18,743 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 10:47:18,745 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 10:47:18,748 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 10:47:18,751 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 10:47:18,754 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 10:47:18,756 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 10:47:18,758 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 10:47:18,762 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 10:47:18,763 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 10:47:18,764 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 10:47:18,766 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 10:47:18,766 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 10:47:18,767 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 10:47:18,767 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 10:47:18,768 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 10:47:18,769 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 10:47:18,770 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 10:47:18,771 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 10:47:18,771 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 10:47:18,772 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 10:47:18,772 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 10:47:18,772 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 10:47:18,773 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 10:47:18,774 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 10:47:18,774 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9edfe692-4492-401a-85e3-c9ab199993d4/bin/ukojak/config/svcomp-Reach-64bit-Kojak_Bitvector.epf [2019-11-20 10:47:18,788 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 10:47:18,788 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 10:47:18,789 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-20 10:47:18,789 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2019-11-20 10:47:18,790 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 10:47:18,790 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 10:47:18,791 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 10:47:18,791 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 10:47:18,791 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 10:47:18,791 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 10:47:18,792 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 10:47:18,792 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 10:47:18,792 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 10:47:18,792 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 10:47:18,793 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 10:47:18,793 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 10:47:18,793 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2019-11-20 10:47:18,793 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2019-11-20 10:47:18,794 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 10:47:18,794 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 10:47:18,794 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-11-20 10:47:18,794 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 10:47:18,795 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 10:47:18,795 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 10:47:18,795 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-11-20 10:47:18,795 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 10:47:18,796 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 10:47:18,796 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2019-11-20 10:47:18,796 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 10:47:18,796 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2019-11-20 10:47:18,797 INFO L138 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_9edfe692-4492-401a-85e3-c9ab199993d4/bin/ukojak 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 -> Kojak 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 -> 0ed8e0fa33261c1c2fd13752cd4f971526e32b94 [2019-11-20 10:47:19,065 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 10:47:19,075 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 10:47:19,078 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 10:47:19,079 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 10:47:19,079 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 10:47:19,081 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9edfe692-4492-401a-85e3-c9ab199993d4/bin/ukojak/../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2019-11-20 10:47:19,136 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9edfe692-4492-401a-85e3-c9ab199993d4/bin/ukojak/data/0528bcd79/a69946482c7f4e10a78f8dd18820749a/FLAGeaf077a4d [2019-11-20 10:47:19,737 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 10:47:19,738 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9edfe692-4492-401a-85e3-c9ab199993d4/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2019-11-20 10:47:19,762 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9edfe692-4492-401a-85e3-c9ab199993d4/bin/ukojak/data/0528bcd79/a69946482c7f4e10a78f8dd18820749a/FLAGeaf077a4d [2019-11-20 10:47:19,960 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9edfe692-4492-401a-85e3-c9ab199993d4/bin/ukojak/data/0528bcd79/a69946482c7f4e10a78f8dd18820749a [2019-11-20 10:47:19,963 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 10:47:19,964 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 10:47:19,965 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 10:47:19,965 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 10:47:19,968 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 10:47:19,969 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:47:19" (1/1) ... [2019-11-20 10:47:19,975 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bc1a8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:19, skipping insertion in model container [2019-11-20 10:47:19,975 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:47:19" (1/1) ... [2019-11-20 10:47:19,981 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 10:47:20,055 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 10:47:21,135 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 10:47:21,185 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 10:47:21,349 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 10:47:21,423 INFO L192 MainTranslator]: Completed translation [2019-11-20 10:47:21,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:21 WrapperNode [2019-11-20 10:47:21,424 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 10:47:21,425 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 10:47:21,425 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 10:47:21,425 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 10:47:21,433 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:21" (1/1) ... [2019-11-20 10:47:21,478 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:21" (1/1) ... [2019-11-20 10:47:21,568 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 10:47:21,569 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 10:47:21,569 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 10:47:21,569 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 10:47:21,578 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:21" (1/1) ... [2019-11-20 10:47:21,578 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:21" (1/1) ... [2019-11-20 10:47:21,594 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:21" (1/1) ... [2019-11-20 10:47:21,595 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:21" (1/1) ... [2019-11-20 10:47:21,647 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:21" (1/1) ... [2019-11-20 10:47:21,671 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:21" (1/1) ... [2019-11-20 10:47:21,678 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:21" (1/1) ... [2019-11-20 10:47:21,695 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 10:47:21,695 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 10:47:21,703 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 10:47:21,703 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 10:47:21,704 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9edfe692-4492-401a-85e3-c9ab199993d4/bin/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (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:10000 [2019-11-20 10:47:21,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2019-11-20 10:47:21,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2019-11-20 10:47:21,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-20 10:47:21,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2019-11-20 10:47:21,765 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2019-11-20 10:47:21,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2019-11-20 10:47:21,765 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-11-20 10:47:21,766 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-11-20 10:47:21,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-20 10:47:21,767 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-20 10:47:21,767 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-11-20 10:47:21,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-11-20 10:47:21,767 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-11-20 10:47:21,767 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-11-20 10:47:21,768 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2019-11-20 10:47:21,768 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2019-11-20 10:47:21,768 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2019-11-20 10:47:21,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2019-11-20 10:47:21,769 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2019-11-20 10:47:21,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2019-11-20 10:47:21,770 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_disconnect [2019-11-20 10:47:21,770 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_disconnect [2019-11-20 10:47:21,770 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2019-11-20 10:47:21,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2019-11-20 10:47:21,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 10:47:21,771 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2019-11-20 10:47:21,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2019-11-20 10:47:21,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 10:47:21,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 10:47:21,772 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2019-11-20 10:47:21,772 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2019-11-20 10:47:21,772 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2019-11-20 10:47:21,772 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2019-11-20 10:47:21,772 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_7 [2019-11-20 10:47:21,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_7 [2019-11-20 10:47:21,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 10:47:21,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2019-11-20 10:47:21,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2019-11-20 10:47:21,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 10:47:21,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-20 10:47:21,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-20 10:47:21,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2019-11-20 10:47:21,774 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2019-11-20 10:47:21,775 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2019-11-20 10:47:21,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2019-11-20 10:47:21,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2019-11-20 10:47:21,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2019-11-20 10:47:21,775 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2019-11-20 10:47:21,775 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2019-11-20 10:47:21,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 10:47:21,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 10:47:22,382 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2019-11-20 10:47:47,614 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 10:47:47,614 INFO L285 CfgBuilder]: Removed 86 assume(true) statements. [2019-11-20 10:47:47,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:47:47 BoogieIcfgContainer [2019-11-20 10:47:47,616 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 10:47:47,616 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2019-11-20 10:47:47,616 INFO L271 PluginConnector]: Initializing CodeCheck... [2019-11-20 10:47:47,626 INFO L275 PluginConnector]: CodeCheck initialized [2019-11-20 10:47:47,626 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:47:47" (1/1) ... [2019-11-20 10:47:47,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:47:47,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:47:47,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 149 states and 205 transitions. [2019-11-20 10:47:47,685 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 205 transitions. [2019-11-20 10:47:47,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 10:47:47,692 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:47:47,741 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Sort BitVec not declared at de.uni_freiburg.informatik.ultimate.logic.NoopScript.sort(NoopScript.java:412) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.sort(WrapperScript.java:223) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.NonDeclaringTermTransferrer.transferSort(NonDeclaringTermTransferrer.java:111) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.DeclarableSortSymbol.defineOrDeclare(DeclarableSortSymbol.java:79) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.transferHistoryFromRecord(HistoryRecordingScript.java:145) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.transferHistoryFromRecord(HistoryRecordingScript.java:170) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.SmtFunctionsAndAxioms.transferAllSymbols(SmtFunctionsAndAxioms.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.CodeCheckObserver.process(CodeCheckObserver.java:448) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.CFGWalker.runObserver(CFGWalker.java:57) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.BaseWalker.runObserver(BaseWalker.java:93) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.BaseWalker.run(BaseWalker.java:86) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-20 10:47:47,747 INFO L168 Benchmark]: Toolchain (without parser) took 27781.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 191.4 MB). Free memory was 951.0 MB in the beginning and 867.1 MB in the end (delta: 84.0 MB). Peak memory consumption was 275.4 MB. Max. memory is 11.5 GB. [2019-11-20 10:47:47,748 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 10:47:47,749 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1459.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 191.4 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -167.5 MB). Peak memory consumption was 49.6 MB. Max. memory is 11.5 GB. [2019-11-20 10:47:47,754 INFO L168 Benchmark]: Boogie Procedure Inliner took 143.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-20 10:47:47,754 INFO L168 Benchmark]: Boogie Preprocessor took 126.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-20 10:47:47,755 INFO L168 Benchmark]: RCFGBuilder took 25920.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 874.0 MB in the end (delta: 230.6 MB). Peak memory consumption was 230.6 MB. Max. memory is 11.5 GB. [2019-11-20 10:47:47,755 INFO L168 Benchmark]: CodeCheck took 128.59 ms. Allocated memory is still 1.2 GB. Free memory was 874.0 MB in the beginning and 867.1 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-20 10:47:47,763 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - ExceptionOrErrorResult: SMTLIBException: Sort BitVec not declared de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: SMTLIBException: Sort BitVec not declared: de.uni_freiburg.informatik.ultimate.logic.NoopScript.sort(NoopScript.java:412) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1459.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 191.4 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -167.5 MB). Peak memory consumption was 49.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 143.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 126.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 25920.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 874.0 MB in the end (delta: 230.6 MB). Peak memory consumption was 230.6 MB. Max. memory is 11.5 GB. * CodeCheck took 128.59 ms. Allocated memory is still 1.2 GB. Free memory was 874.0 MB in the beginning and 867.1 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...