./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-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_344d34c0-40a3-4208-b71a-77bedcab816e/bin/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_344d34c0-40a3-4208-b71a-77bedcab816e/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_344d34c0-40a3-4208-b71a-77bedcab816e/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_344d34c0-40a3-4208-b71a-77bedcab816e/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i -s /tmp/vcloud-vcloud-master/worker/run_dir_344d34c0-40a3-4208-b71a-77bedcab816e/bin/ukojak/config/svcomp-Reach-64bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_344d34c0-40a3-4208-b71a-77bedcab816e/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 3198ee11c6ed540a48e3bca51463c154c984d782 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_344d34c0-40a3-4208-b71a-77bedcab816e/bin/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_344d34c0-40a3-4208-b71a-77bedcab816e/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_344d34c0-40a3-4208-b71a-77bedcab816e/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_344d34c0-40a3-4208-b71a-77bedcab816e/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i -s /tmp/vcloud-vcloud-master/worker/run_dir_344d34c0-40a3-4208-b71a-77bedcab816e/bin/ukojak/config/svcomp-Reach-64bit-Kojak_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_344d34c0-40a3-4208-b71a-77bedcab816e/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 3198ee11c6ed540a48e3bca51463c154c984d782 ...................................................................................................................................................................................................................................................... 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 03:47:25,870 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 03:47:25,872 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 03:47:25,884 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 03:47:25,884 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 03:47:25,885 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 03:47:25,886 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 03:47:25,889 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 03:47:25,891 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 03:47:25,891 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 03:47:25,892 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 03:47:25,894 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 03:47:25,894 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 03:47:25,895 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 03:47:25,896 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 03:47:25,897 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 03:47:25,898 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 03:47:25,899 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 03:47:25,901 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 03:47:25,903 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 03:47:25,905 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 03:47:25,906 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 03:47:25,907 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 03:47:25,908 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 03:47:25,911 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 03:47:25,911 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 03:47:25,911 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 03:47:25,912 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 03:47:25,913 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 03:47:25,914 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 03:47:25,914 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 03:47:25,915 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 03:47:25,916 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 03:47:25,916 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 03:47:25,917 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 03:47:25,918 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 03:47:25,918 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 03:47:25,919 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 03:47:25,919 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 03:47:25,920 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 03:47:25,920 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 03:47:25,921 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_344d34c0-40a3-4208-b71a-77bedcab816e/bin/ukojak/config/svcomp-Reach-64bit-Kojak_Default.epf [2019-11-20 03:47:25,934 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 03:47:25,935 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 03:47:25,936 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-20 03:47:25,936 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2019-11-20 03:47:25,936 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 03:47:25,937 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 03:47:25,937 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 03:47:25,937 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 03:47:25,937 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 03:47:25,938 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 03:47:25,938 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 03:47:25,938 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 03:47:25,938 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 03:47:25,939 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 03:47:25,939 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 03:47:25,939 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2019-11-20 03:47:25,939 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2019-11-20 03:47:25,940 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 03:47:25,940 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 03:47:25,940 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-11-20 03:47:25,940 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 03:47:25,941 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 03:47:25,941 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 03:47:25,941 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2019-11-20 03:47:25,941 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 03:47:25,942 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 03:47:25,942 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 03:47:25,942 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_344d34c0-40a3-4208-b71a-77bedcab816e/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 -> 3198ee11c6ed540a48e3bca51463c154c984d782 [2019-11-20 03:47:26,092 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 03:47:26,104 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 03:47:26,107 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 03:47:26,109 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 03:47:26,109 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 03:47:26,110 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_344d34c0-40a3-4208-b71a-77bedcab816e/bin/ukojak/../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2019-11-20 03:47:26,168 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_344d34c0-40a3-4208-b71a-77bedcab816e/bin/ukojak/data/e1a250083/c4f5cf1ec93943d7aaf8b932d08be1a1/FLAG589a113ee [2019-11-20 03:47:26,800 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 03:47:26,801 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_344d34c0-40a3-4208-b71a-77bedcab816e/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2019-11-20 03:47:26,832 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_344d34c0-40a3-4208-b71a-77bedcab816e/bin/ukojak/data/e1a250083/c4f5cf1ec93943d7aaf8b932d08be1a1/FLAG589a113ee [2019-11-20 03:47:26,922 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_344d34c0-40a3-4208-b71a-77bedcab816e/bin/ukojak/data/e1a250083/c4f5cf1ec93943d7aaf8b932d08be1a1 [2019-11-20 03:47:26,925 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 03:47:26,926 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 03:47:26,927 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 03:47:26,927 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 03:47:26,931 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 03:47:26,931 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:47:26" (1/1) ... [2019-11-20 03:47:26,934 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41e9f86b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:47:26, skipping insertion in model container [2019-11-20 03:47:26,934 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:47:26" (1/1) ... [2019-11-20 03:47:26,941 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 03:47:27,031 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 03:47:27,834 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:47:27,854 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 03:47:27,993 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:47:28,076 INFO L192 MainTranslator]: Completed translation [2019-11-20 03:47:28,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:47:28 WrapperNode [2019-11-20 03:47:28,077 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 03:47:28,080 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 03:47:28,080 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 03:47:28,081 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 03:47:28,088 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:47:28" (1/1) ... [2019-11-20 03:47:28,132 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:47:28" (1/1) ... [2019-11-20 03:47:28,212 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 03:47:28,212 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 03:47:28,213 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 03:47:28,219 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 03:47:28,228 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:47:28" (1/1) ... [2019-11-20 03:47:28,228 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:47:28" (1/1) ... [2019-11-20 03:47:28,246 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:47:28" (1/1) ... [2019-11-20 03:47:28,246 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:47:28" (1/1) ... [2019-11-20 03:47:28,275 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:47:28" (1/1) ... [2019-11-20 03:47:28,280 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:47:28" (1/1) ... [2019-11-20 03:47:28,287 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:47:28" (1/1) ... [2019-11-20 03:47:28,303 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 03:47:28,304 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 03:47:28,305 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 03:47:28,305 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 03:47:28,306 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:47:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_344d34c0-40a3-4208-b71a-77bedcab816e/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 03:47:28,376 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2019-11-20 03:47:28,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2019-11-20 03:47:28,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-20 03:47:28,377 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-11-20 03:47:28,377 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-11-20 03:47:28,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-20 03:47:28,378 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-20 03:47:28,378 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-11-20 03:47:28,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-11-20 03:47:28,379 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-11-20 03:47:28,379 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-11-20 03:47:28,380 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2019-11-20 03:47:28,381 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2019-11-20 03:47:28,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-20 03:47:28,381 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2019-11-20 03:47:28,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2019-11-20 03:47:28,382 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2019-11-20 03:47:28,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2019-11-20 03:47:28,382 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_disconnect [2019-11-20 03:47:28,382 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_disconnect [2019-11-20 03:47:28,382 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2019-11-20 03:47:28,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2019-11-20 03:47:28,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 03:47:28,383 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2019-11-20 03:47:28,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2019-11-20 03:47:28,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 03:47:28,384 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 03:47:28,384 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2019-11-20 03:47:28,384 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2019-11-20 03:47:28,384 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2019-11-20 03:47:28,385 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2019-11-20 03:47:28,385 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_7 [2019-11-20 03:47:28,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_7 [2019-11-20 03:47:28,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 03:47:28,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 03:47:28,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-20 03:47:28,386 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2019-11-20 03:47:28,387 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2019-11-20 03:47:28,387 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2019-11-20 03:47:28,387 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2019-11-20 03:47:28,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-20 03:47:28,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 03:47:28,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 03:47:28,907 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2019-11-20 03:47:31,219 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 03:47:31,219 INFO L285 CfgBuilder]: Removed 82 assume(true) statements. [2019-11-20 03:47:31,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:47:31 BoogieIcfgContainer [2019-11-20 03:47:31,220 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 03:47:31,221 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2019-11-20 03:47:31,221 INFO L271 PluginConnector]: Initializing CodeCheck... [2019-11-20 03:47:31,231 INFO L275 PluginConnector]: CodeCheck initialized [2019-11-20 03:47:31,231 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:47:31" (1/1) ... [2019-11-20 03:47:31,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:47:31,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:31,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 149 states and 205 transitions. [2019-11-20 03:47:31,293 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 205 transitions. [2019-11-20 03:47:31,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 03:47:31,298 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:31,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:31,604 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 03:47:31,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:31,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 154 states and 217 transitions. [2019-11-20 03:47:31,670 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 217 transitions. [2019-11-20 03:47:31,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 03:47:31,671 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:31,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:31,856 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 03:47:31,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:31,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 155 states and 218 transitions. [2019-11-20 03:47:31,877 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 218 transitions. [2019-11-20 03:47:31,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 03:47:31,879 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:31,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:31,989 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 03:47:32,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:32,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 154 states and 215 transitions. [2019-11-20 03:47:32,019 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 215 transitions. [2019-11-20 03:47:32,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 03:47:32,020 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:32,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:32,088 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 03:47:32,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:32,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 157 states and 225 transitions. [2019-11-20 03:47:32,206 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 225 transitions. [2019-11-20 03:47:32,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-20 03:47:32,208 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:32,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:32,287 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 03:47:32,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:32,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 159 states and 227 transitions. [2019-11-20 03:47:32,305 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 227 transitions. [2019-11-20 03:47:32,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-20 03:47:32,307 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:32,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:32,487 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 03:47:32,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:32,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 170 states and 255 transitions. [2019-11-20 03:47:32,819 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 255 transitions. [2019-11-20 03:47:32,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-20 03:47:32,821 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:32,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:32,937 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 03:47:33,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:33,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 182 states and 285 transitions. [2019-11-20 03:47:33,568 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 285 transitions. [2019-11-20 03:47:33,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-20 03:47:33,570 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:33,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:33,654 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 03:47:33,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:33,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 181 states and 279 transitions. [2019-11-20 03:47:33,709 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 279 transitions. [2019-11-20 03:47:33,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-20 03:47:33,710 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:33,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:33,833 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 03:47:34,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:34,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 194 states and 309 transitions. [2019-11-20 03:47:34,718 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 309 transitions. [2019-11-20 03:47:34,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-20 03:47:34,720 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:34,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:34,819 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 03:47:35,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:35,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 208 states and 340 transitions. [2019-11-20 03:47:35,880 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 340 transitions. [2019-11-20 03:47:35,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-20 03:47:35,881 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:35,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:35,941 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 03:47:35,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:35,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 209 states and 340 transitions. [2019-11-20 03:47:35,975 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 340 transitions. [2019-11-20 03:47:35,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-20 03:47:35,977 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:35,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:36,069 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 03:47:37,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:37,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 224 states and 372 transitions. [2019-11-20 03:47:37,394 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 372 transitions. [2019-11-20 03:47:37,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-20 03:47:37,400 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:37,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:37,447 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 03:47:37,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:37,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 228 states and 382 transitions. [2019-11-20 03:47:37,630 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 382 transitions. [2019-11-20 03:47:37,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-20 03:47:37,631 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:37,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:37,694 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 03:47:37,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:37,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 229 states and 382 transitions. [2019-11-20 03:47:37,730 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 382 transitions. [2019-11-20 03:47:37,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-20 03:47:37,731 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:37,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:37,791 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 03:47:37,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:37,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 230 states and 382 transitions. [2019-11-20 03:47:37,807 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 382 transitions. [2019-11-20 03:47:37,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-20 03:47:37,809 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:37,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:37,883 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 03:47:38,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:38,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 236 states and 399 transitions. [2019-11-20 03:47:38,092 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 399 transitions. [2019-11-20 03:47:38,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-20 03:47:38,093 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:38,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:38,183 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 03:47:38,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:38,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 237 states and 399 transitions. [2019-11-20 03:47:38,222 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 399 transitions. [2019-11-20 03:47:38,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-20 03:47:38,223 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:38,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:38,312 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 03:47:38,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:38,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 238 states and 399 transitions. [2019-11-20 03:47:38,328 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 399 transitions. [2019-11-20 03:47:38,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-20 03:47:38,329 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:38,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:38,400 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 03:47:38,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:38,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 244 states and 416 transitions. [2019-11-20 03:47:38,729 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 416 transitions. [2019-11-20 03:47:38,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-20 03:47:38,730 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:38,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:38,800 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 03:47:38,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:38,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 245 states and 416 transitions. [2019-11-20 03:47:38,831 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 416 transitions. [2019-11-20 03:47:38,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-20 03:47:38,832 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:38,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:38,883 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 03:47:38,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:38,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 246 states and 416 transitions. [2019-11-20 03:47:38,896 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 416 transitions. [2019-11-20 03:47:38,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-20 03:47:38,897 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:38,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:38,940 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 03:47:39,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:39,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 252 states and 433 transitions. [2019-11-20 03:47:39,172 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 433 transitions. [2019-11-20 03:47:39,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-20 03:47:39,173 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:39,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:39,222 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 03:47:39,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:39,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 253 states and 433 transitions. [2019-11-20 03:47:39,236 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 433 transitions. [2019-11-20 03:47:39,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-20 03:47:39,237 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:39,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:39,290 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 03:47:39,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:39,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 259 states and 450 transitions. [2019-11-20 03:47:39,590 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 450 transitions. [2019-11-20 03:47:39,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-20 03:47:39,591 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:39,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:39,635 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 03:47:40,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:40,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 262 states and 464 transitions. [2019-11-20 03:47:40,476 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 464 transitions. [2019-11-20 03:47:40,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-20 03:47:40,477 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:40,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:40,524 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 03:47:40,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:40,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 263 states and 464 transitions. [2019-11-20 03:47:40,540 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 464 transitions. [2019-11-20 03:47:40,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-20 03:47:40,541 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:40,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:40,592 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 03:47:41,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:41,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 269 states and 483 transitions. [2019-11-20 03:47:41,417 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 483 transitions. [2019-11-20 03:47:41,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-20 03:47:41,418 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:41,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:41,462 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 03:47:41,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:41,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 270 states and 483 transitions. [2019-11-20 03:47:41,475 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 483 transitions. [2019-11-20 03:47:41,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-20 03:47:41,476 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:41,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:41,627 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 03:47:42,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:42,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 275 states and 504 transitions. [2019-11-20 03:47:42,530 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 504 transitions. [2019-11-20 03:47:42,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-20 03:47:42,531 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:42,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:42,581 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 03:47:43,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:43,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 278 states and 518 transitions. [2019-11-20 03:47:43,241 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 518 transitions. [2019-11-20 03:47:43,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-20 03:47:43,242 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:43,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:43,300 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 03:47:43,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:43,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 284 states and 534 transitions. [2019-11-20 03:47:43,941 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 534 transitions. [2019-11-20 03:47:43,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-20 03:47:43,943 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:43,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:44,011 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 03:47:44,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:44,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 285 states and 534 transitions. [2019-11-20 03:47:44,379 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 534 transitions. [2019-11-20 03:47:44,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-20 03:47:44,380 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:44,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:44,453 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 03:47:45,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:45,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 291 states and 550 transitions. [2019-11-20 03:47:45,213 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 550 transitions. [2019-11-20 03:47:45,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-20 03:47:45,214 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:45,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:45,274 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 03:47:45,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:45,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 293 states and 552 transitions. [2019-11-20 03:47:45,313 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 552 transitions. [2019-11-20 03:47:45,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-20 03:47:45,314 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:45,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:45,463 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 03:47:45,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:45,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 292 states and 533 transitions. [2019-11-20 03:47:45,591 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 533 transitions. [2019-11-20 03:47:45,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-20 03:47:45,592 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:45,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:45,632 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 03:47:45,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:45,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 294 states and 536 transitions. [2019-11-20 03:47:45,838 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 536 transitions. [2019-11-20 03:47:45,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-20 03:47:45,839 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:45,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:45,903 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 03:47:46,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:46,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 295 states and 536 transitions. [2019-11-20 03:47:46,245 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 536 transitions. [2019-11-20 03:47:46,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-20 03:47:46,246 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:46,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:46,361 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 03:47:46,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:46,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 301 states and 551 transitions. [2019-11-20 03:47:46,978 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 551 transitions. [2019-11-20 03:47:46,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-20 03:47:46,979 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:47,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:47,045 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 03:47:47,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:47,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 303 states and 553 transitions. [2019-11-20 03:47:47,089 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 553 transitions. [2019-11-20 03:47:47,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-20 03:47:47,090 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:47,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:47,156 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 03:47:47,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:47,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 304 states and 553 transitions. [2019-11-20 03:47:47,494 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 553 transitions. [2019-11-20 03:47:47,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-20 03:47:47,495 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:47,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:47,535 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 03:47:48,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:48,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 310 states and 568 transitions. [2019-11-20 03:47:48,229 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 568 transitions. [2019-11-20 03:47:48,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-20 03:47:48,230 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:48,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:48,275 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 03:47:48,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:48,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 312 states and 570 transitions. [2019-11-20 03:47:48,299 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 570 transitions. [2019-11-20 03:47:48,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-20 03:47:48,300 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:48,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:48,341 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 03:47:48,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:48,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 314 states and 573 transitions. [2019-11-20 03:47:48,709 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 573 transitions. [2019-11-20 03:47:48,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-20 03:47:48,710 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:48,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:48,754 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 03:47:48,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:48,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 316 states and 576 transitions. [2019-11-20 03:47:48,788 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 576 transitions. [2019-11-20 03:47:48,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-20 03:47:48,790 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:48,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:48,831 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 03:47:48,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:48,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 318 states and 579 transitions. [2019-11-20 03:47:48,855 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 579 transitions. [2019-11-20 03:47:48,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-20 03:47:48,857 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:48,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:48,902 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 03:47:49,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:49,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 319 states and 579 transitions. [2019-11-20 03:47:49,355 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 579 transitions. [2019-11-20 03:47:49,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-20 03:47:49,356 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:49,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:49,399 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 03:47:50,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:50,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 325 states and 594 transitions. [2019-11-20 03:47:50,390 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 594 transitions. [2019-11-20 03:47:50,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-20 03:47:50,391 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:50,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:50,429 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 03:47:50,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:50,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 327 states and 599 transitions. [2019-11-20 03:47:50,866 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 599 transitions. [2019-11-20 03:47:50,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-20 03:47:50,867 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:50,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:50,906 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 03:47:51,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:51,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 329 states and 601 transitions. [2019-11-20 03:47:51,133 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 601 transitions. [2019-11-20 03:47:51,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-20 03:47:51,134 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:51,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:51,174 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 03:47:51,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:51,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 330 states and 601 transitions. [2019-11-20 03:47:51,403 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 601 transitions. [2019-11-20 03:47:51,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-20 03:47:51,406 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:51,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:51,444 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 03:47:51,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:51,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 334 states and 611 transitions. [2019-11-20 03:47:51,828 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 611 transitions. [2019-11-20 03:47:51,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-20 03:47:51,829 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:51,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:51,874 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 03:47:51,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:51,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 336 states and 613 transitions. [2019-11-20 03:47:51,899 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 613 transitions. [2019-11-20 03:47:51,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-20 03:47:51,900 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:51,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:51,943 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 03:47:51,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:51,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 338 states and 615 transitions. [2019-11-20 03:47:51,967 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 615 transitions. [2019-11-20 03:47:51,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-20 03:47:51,968 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:51,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:52,008 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 03:47:52,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:52,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 340 states and 618 transitions. [2019-11-20 03:47:52,034 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 618 transitions. [2019-11-20 03:47:52,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-20 03:47:52,035 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:52,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:52,419 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 03:47:55,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:55,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 359 states and 667 transitions. [2019-11-20 03:47:55,288 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 667 transitions. [2019-11-20 03:47:55,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-20 03:47:55,289 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:55,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:55,407 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 03:47:55,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:55,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 361 states and 669 transitions. [2019-11-20 03:47:55,426 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 669 transitions. [2019-11-20 03:47:55,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-20 03:47:55,427 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:55,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:55,564 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 03:47:55,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:55,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 368 states and 682 transitions. [2019-11-20 03:47:55,640 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 682 transitions. [2019-11-20 03:47:55,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-20 03:47:55,642 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:55,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:55,758 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 03:47:55,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:55,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 369 states and 683 transitions. [2019-11-20 03:47:55,794 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 683 transitions. [2019-11-20 03:47:55,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-20 03:47:55,795 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:55,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:56,230 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-20 03:47:57,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:57,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 369 states and 682 transitions. [2019-11-20 03:47:57,049 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 682 transitions. [2019-11-20 03:47:57,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-20 03:47:57,051 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:57,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:57,120 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 03:47:57,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:57,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 376 states and 695 transitions. [2019-11-20 03:47:57,187 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 695 transitions. [2019-11-20 03:47:57,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-20 03:47:57,188 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:57,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:57,251 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 03:47:57,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:57,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 377 states and 696 transitions. [2019-11-20 03:47:57,284 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 696 transitions. [2019-11-20 03:47:57,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-20 03:47:57,285 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:57,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:57,332 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 03:47:57,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:57,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 384 states and 709 transitions. [2019-11-20 03:47:57,383 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 709 transitions. [2019-11-20 03:47:57,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-20 03:47:57,385 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:57,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:57,445 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 03:47:57,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:57,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 385 states and 710 transitions. [2019-11-20 03:47:57,457 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 710 transitions. [2019-11-20 03:47:57,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-20 03:47:57,459 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:57,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:57,505 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 03:47:57,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:57,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 392 states and 723 transitions. [2019-11-20 03:47:57,553 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 723 transitions. [2019-11-20 03:47:57,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-20 03:47:57,554 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:57,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:57,618 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 03:47:57,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:57,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 393 states and 729 transitions. [2019-11-20 03:47:57,680 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 729 transitions. [2019-11-20 03:47:57,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-20 03:47:57,681 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:57,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:57,730 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 03:47:57,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:57,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 394 states and 730 transitions. [2019-11-20 03:47:57,743 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 730 transitions. [2019-11-20 03:47:57,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-20 03:47:57,746 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:57,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:57,816 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 03:47:57,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:57,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 394 states and 729 transitions. [2019-11-20 03:47:57,838 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 729 transitions. [2019-11-20 03:47:57,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-20 03:47:57,840 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:57,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:57,890 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 03:47:57,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:57,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 401 states and 742 transitions. [2019-11-20 03:47:57,945 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 742 transitions. [2019-11-20 03:47:57,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-20 03:47:57,947 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:57,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:57,994 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 03:47:58,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:58,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 402 states and 743 transitions. [2019-11-20 03:47:58,008 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 743 transitions. [2019-11-20 03:47:58,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-20 03:47:58,009 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:58,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:58,246 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 03:47:58,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:58,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 403 states and 747 transitions. [2019-11-20 03:47:58,871 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 747 transitions. [2019-11-20 03:47:58,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-20 03:47:58,873 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:58,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:58,918 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 03:47:58,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:47:58,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 403 states and 746 transitions. [2019-11-20 03:47:58,941 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 746 transitions. [2019-11-20 03:47:58,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-20 03:47:58,942 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:47:58,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:58,985 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 16 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-20 03:48:00,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:00,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 418 states and 785 transitions. [2019-11-20 03:48:00,671 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 785 transitions. [2019-11-20 03:48:00,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-20 03:48:00,672 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:00,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:00,721 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-20 03:48:01,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:01,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 424 states and 798 transitions. [2019-11-20 03:48:01,561 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 798 transitions. [2019-11-20 03:48:01,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-20 03:48:01,563 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:01,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:01,771 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-20 03:48:02,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:02,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 430 states and 812 transitions. [2019-11-20 03:48:02,756 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 812 transitions. [2019-11-20 03:48:02,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-20 03:48:02,757 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:02,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:02,796 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 03:48:03,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:03,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 434 states and 817 transitions. [2019-11-20 03:48:03,162 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 817 transitions. [2019-11-20 03:48:03,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-20 03:48:03,164 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:03,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:03,393 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 03:48:04,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:04,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 441 states and 828 transitions. [2019-11-20 03:48:04,265 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 828 transitions. [2019-11-20 03:48:04,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-20 03:48:04,267 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:04,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:04,312 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-20 03:48:04,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:04,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 444 states and 832 transitions. [2019-11-20 03:48:04,497 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 832 transitions. [2019-11-20 03:48:04,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-20 03:48:04,499 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:04,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:04,558 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 03:48:04,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:04,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 445 states and 833 transitions. [2019-11-20 03:48:04,591 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 833 transitions. [2019-11-20 03:48:04,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-20 03:48:04,592 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:04,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:04,666 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-20 03:48:05,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:05,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 452 states and 844 transitions. [2019-11-20 03:48:05,603 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 844 transitions. [2019-11-20 03:48:05,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-20 03:48:05,604 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:05,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:05,660 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-20 03:48:05,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:05,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 453 states and 845 transitions. [2019-11-20 03:48:05,722 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 845 transitions. [2019-11-20 03:48:05,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-20 03:48:05,724 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:05,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:05,841 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 03:48:05,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:05,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 468 states and 871 transitions. [2019-11-20 03:48:05,909 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 871 transitions. [2019-11-20 03:48:05,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-20 03:48:05,910 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:05,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:06,032 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 03:48:06,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:06,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 473 states and 879 transitions. [2019-11-20 03:48:06,081 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 879 transitions. [2019-11-20 03:48:06,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 03:48:06,082 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:06,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:06,182 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 03:48:06,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:06,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 474 states and 880 transitions. [2019-11-20 03:48:06,237 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 880 transitions. [2019-11-20 03:48:06,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-20 03:48:06,238 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:06,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:06,332 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 03:48:06,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:06,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 489 states and 906 transitions. [2019-11-20 03:48:06,431 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 906 transitions. [2019-11-20 03:48:06,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-20 03:48:06,433 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:06,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:06,541 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 03:48:06,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:06,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 494 states and 914 transitions. [2019-11-20 03:48:06,607 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 914 transitions. [2019-11-20 03:48:06,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 03:48:06,608 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:06,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:06,717 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 03:48:06,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:06,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 495 states and 915 transitions. [2019-11-20 03:48:06,774 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 915 transitions. [2019-11-20 03:48:06,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 03:48:06,776 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:06,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:06,871 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 03:48:06,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:06,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 496 states and 916 transitions. [2019-11-20 03:48:06,925 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 916 transitions. [2019-11-20 03:48:06,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-20 03:48:06,927 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:06,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:06,992 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 03:48:07,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:07,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 511 states and 942 transitions. [2019-11-20 03:48:07,068 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 942 transitions. [2019-11-20 03:48:07,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-20 03:48:07,069 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:07,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:07,134 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 03:48:07,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:07,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 516 states and 950 transitions. [2019-11-20 03:48:07,174 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 950 transitions. [2019-11-20 03:48:07,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-20 03:48:07,175 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:07,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:07,242 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 03:48:07,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:07,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 517 states and 951 transitions. [2019-11-20 03:48:07,267 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 951 transitions. [2019-11-20 03:48:07,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 03:48:07,269 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:07,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:07,358 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 03:48:07,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:07,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 518 states and 952 transitions. [2019-11-20 03:48:07,422 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 952 transitions. [2019-11-20 03:48:07,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 03:48:07,423 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:07,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:07,506 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-20 03:48:08,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:08,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 533 states and 980 transitions. [2019-11-20 03:48:08,201 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 980 transitions. [2019-11-20 03:48:08,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 03:48:08,202 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:08,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:08,278 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 03:48:08,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:08,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 548 states and 1008 transitions. [2019-11-20 03:48:08,795 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 1008 transitions. [2019-11-20 03:48:08,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 03:48:08,796 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:08,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:08,877 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-20 03:48:08,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:08,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 553 states and 1016 transitions. [2019-11-20 03:48:08,929 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 1016 transitions. [2019-11-20 03:48:08,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-20 03:48:08,931 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:08,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:08,993 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 03:48:09,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:09,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 559 states and 1028 transitions. [2019-11-20 03:48:09,048 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 1028 transitions. [2019-11-20 03:48:09,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 03:48:09,049 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:09,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:09,110 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 03:48:09,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:09,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 570 states and 1045 transitions. [2019-11-20 03:48:09,193 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1045 transitions. [2019-11-20 03:48:09,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-20 03:48:09,195 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:09,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:09,268 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-20 03:48:09,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:09,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1085 states to 571 states and 1046 transitions. [2019-11-20 03:48:09,294 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 1046 transitions. [2019-11-20 03:48:09,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-20 03:48:09,296 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:09,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:09,358 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 03:48:09,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:09,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 572 states and 1047 transitions. [2019-11-20 03:48:09,400 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 1047 transitions. [2019-11-20 03:48:09,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 03:48:09,402 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:09,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:09,469 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 03:48:09,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:09,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 587 states and 1073 transitions. [2019-11-20 03:48:09,560 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 1073 transitions. [2019-11-20 03:48:09,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-20 03:48:09,562 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:09,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:09,645 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 03:48:09,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:09,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 590 states and 1077 transitions. [2019-11-20 03:48:09,707 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 1077 transitions. [2019-11-20 03:48:09,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 03:48:09,710 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:09,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:09,783 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 03:48:09,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:09,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 595 states and 1085 transitions. [2019-11-20 03:48:09,830 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 1085 transitions. [2019-11-20 03:48:09,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-20 03:48:09,833 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:09,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:09,898 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 03:48:09,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:09,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 596 states and 1086 transitions. [2019-11-20 03:48:09,930 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 1086 transitions. [2019-11-20 03:48:09,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-20 03:48:09,932 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:09,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:09,994 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 03:48:10,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:10,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 597 states and 1087 transitions. [2019-11-20 03:48:10,030 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 1087 transitions. [2019-11-20 03:48:10,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-20 03:48:10,031 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:10,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:10,098 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-20 03:48:10,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:10,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 598 states and 1088 transitions. [2019-11-20 03:48:10,141 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 1088 transitions. [2019-11-20 03:48:10,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-20 03:48:10,142 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:10,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:10,618 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-20 03:48:12,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:12,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 610 states and 1113 transitions. [2019-11-20 03:48:12,004 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 1113 transitions. [2019-11-20 03:48:12,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-20 03:48:12,006 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:12,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:12,109 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 03:48:12,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:12,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 613 states and 1117 transitions. [2019-11-20 03:48:12,183 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 1117 transitions. [2019-11-20 03:48:12,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-20 03:48:12,184 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:12,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:12,262 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-20 03:48:12,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:12,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 615 states and 1120 transitions. [2019-11-20 03:48:12,323 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 1120 transitions. [2019-11-20 03:48:12,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-20 03:48:12,324 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:12,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:12,418 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-20 03:48:12,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:12,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 613 states and 1116 transitions. [2019-11-20 03:48:12,467 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 1116 transitions. [2019-11-20 03:48:12,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-20 03:48:12,468 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:12,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:12,544 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 03:48:12,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:12,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 614 states and 1117 transitions. [2019-11-20 03:48:12,581 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 1117 transitions. [2019-11-20 03:48:12,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-20 03:48:12,583 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:12,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:12,711 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 03:48:12,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:12,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 617 states and 1121 transitions. [2019-11-20 03:48:12,743 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 1121 transitions. [2019-11-20 03:48:12,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-20 03:48:12,744 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:12,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:12,806 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-20 03:48:12,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:12,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 609 states and 1108 transitions. [2019-11-20 03:48:12,840 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 1108 transitions. [2019-11-20 03:48:12,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-20 03:48:12,841 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:12,913 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-20 03:48:12,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:12,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 612 states and 1112 transitions. [2019-11-20 03:48:12,967 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 1112 transitions. [2019-11-20 03:48:12,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-20 03:48:12,968 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:12,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:13,030 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 03:48:13,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:13,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 615 states and 1116 transitions. [2019-11-20 03:48:13,063 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 1116 transitions. [2019-11-20 03:48:13,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-20 03:48:13,065 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:13,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:13,133 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 03:48:13,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:13,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1190 states to 618 states and 1120 transitions. [2019-11-20 03:48:13,167 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 1120 transitions. [2019-11-20 03:48:13,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-20 03:48:13,168 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:13,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:13,233 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-20 03:48:13,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:13,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 618 states and 1119 transitions. [2019-11-20 03:48:13,273 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 1119 transitions. [2019-11-20 03:48:13,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-20 03:48:13,274 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:13,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:13,344 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 03:48:14,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:14,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 634 states and 1146 transitions. [2019-11-20 03:48:14,800 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 1146 transitions. [2019-11-20 03:48:14,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-20 03:48:14,801 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:14,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:14,867 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 03:48:14,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:14,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 639 states and 1154 transitions. [2019-11-20 03:48:14,933 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 1154 transitions. [2019-11-20 03:48:14,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-20 03:48:14,934 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:14,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:15,002 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 03:48:15,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:15,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 640 states and 1155 transitions. [2019-11-20 03:48:15,046 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 1155 transitions. [2019-11-20 03:48:15,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-20 03:48:15,047 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:15,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:15,118 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 03:48:15,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:15,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 641 states and 1156 transitions. [2019-11-20 03:48:15,160 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 1156 transitions. [2019-11-20 03:48:15,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-20 03:48:15,161 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:15,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:15,862 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-20 03:48:17,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:17,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1269 states to 655 states and 1194 transitions. [2019-11-20 03:48:17,233 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1194 transitions. [2019-11-20 03:48:17,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-20 03:48:17,234 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:17,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:17,334 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-11-20 03:48:18,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:18,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 663 states and 1208 transitions. [2019-11-20 03:48:18,392 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 1208 transitions. [2019-11-20 03:48:18,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-20 03:48:18,394 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:18,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:18,486 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-11-20 03:48:19,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:19,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 674 states and 1241 transitions. [2019-11-20 03:48:19,584 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 1241 transitions. [2019-11-20 03:48:19,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-20 03:48:19,585 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:19,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:19,652 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 03:48:19,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:19,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 677 states and 1245 transitions. [2019-11-20 03:48:19,702 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 1245 transitions. [2019-11-20 03:48:19,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-20 03:48:19,703 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:19,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:19,776 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-11-20 03:48:21,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:21,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1367 states to 696 states and 1292 transitions. [2019-11-20 03:48:21,841 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1292 transitions. [2019-11-20 03:48:21,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-20 03:48:21,843 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:21,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:21,933 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 03:48:23,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:23,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 704 states and 1306 transitions. [2019-11-20 03:48:23,387 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 1306 transitions. [2019-11-20 03:48:23,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-20 03:48:23,388 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:23,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:23,480 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 03:48:24,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:24,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 710 states and 1330 transitions. [2019-11-20 03:48:24,409 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 1330 transitions. [2019-11-20 03:48:24,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-20 03:48:24,410 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:24,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:24,506 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-11-20 03:48:27,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:27,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1452 states to 729 states and 1377 transitions. [2019-11-20 03:48:27,884 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 1377 transitions. [2019-11-20 03:48:27,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-20 03:48:27,885 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:27,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:27,984 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 03:48:28,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:28,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1460 states to 731 states and 1385 transitions. [2019-11-20 03:48:28,602 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1385 transitions. [2019-11-20 03:48:28,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-20 03:48:28,603 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:28,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:28,671 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-20 03:48:29,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:29,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1487 states to 746 states and 1412 transitions. [2019-11-20 03:48:29,615 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1412 transitions. [2019-11-20 03:48:29,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-20 03:48:29,616 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:29,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:29,678 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-20 03:48:30,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:30,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1487 states to 747 states and 1412 transitions. [2019-11-20 03:48:30,290 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1412 transitions. [2019-11-20 03:48:30,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-20 03:48:30,291 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:30,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:30,356 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-20 03:48:30,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:30,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1495 states to 752 states and 1420 transitions. [2019-11-20 03:48:30,659 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 1420 transitions. [2019-11-20 03:48:30,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-20 03:48:30,661 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:30,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:30,730 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-11-20 03:48:34,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:34,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 771 states and 1467 transitions. [2019-11-20 03:48:34,991 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1467 transitions. [2019-11-20 03:48:34,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-20 03:48:34,991 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:35,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:35,480 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-20 03:48:39,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:39,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 816 states and 1579 transitions. [2019-11-20 03:48:39,294 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1579 transitions. [2019-11-20 03:48:39,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-20 03:48:39,295 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:39,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:39,403 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-20 03:48:39,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:39,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1663 states to 821 states and 1587 transitions. [2019-11-20 03:48:39,753 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1587 transitions. [2019-11-20 03:48:39,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-20 03:48:39,754 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:39,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:39,842 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-20 03:48:39,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:39,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1664 states to 822 states and 1588 transitions. [2019-11-20 03:48:39,925 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1588 transitions. [2019-11-20 03:48:39,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-20 03:48:39,926 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:39,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:40,000 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-20 03:48:44,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:44,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1698 states to 836 states and 1622 transitions. [2019-11-20 03:48:44,116 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1622 transitions. [2019-11-20 03:48:44,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-20 03:48:44,118 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:44,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:44,191 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-20 03:48:44,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:44,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1711 states to 838 states and 1635 transitions. [2019-11-20 03:48:44,846 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1635 transitions. [2019-11-20 03:48:44,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-20 03:48:44,847 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:44,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:44,936 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-20 03:48:46,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:46,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 845 states and 1657 transitions. [2019-11-20 03:48:46,205 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1657 transitions. [2019-11-20 03:48:46,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-20 03:48:46,206 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:46,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:46,289 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-20 03:48:47,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:47,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1755 states to 852 states and 1679 transitions. [2019-11-20 03:48:47,303 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1679 transitions. [2019-11-20 03:48:47,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-20 03:48:47,304 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:47,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:47,396 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-20 03:48:47,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:47,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1756 states to 853 states and 1680 transitions. [2019-11-20 03:48:47,478 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1680 transitions. [2019-11-20 03:48:47,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-20 03:48:47,479 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:47,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:47,541 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-20 03:48:47,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:47,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1757 states to 854 states and 1681 transitions. [2019-11-20 03:48:47,615 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1681 transitions. [2019-11-20 03:48:47,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-20 03:48:47,617 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:47,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:47,678 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-20 03:48:47,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:47,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1758 states to 855 states and 1682 transitions. [2019-11-20 03:48:47,753 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1682 transitions. [2019-11-20 03:48:47,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-20 03:48:47,755 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:47,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:47,949 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-20 03:48:49,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:49,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1767 states to 859 states and 1691 transitions. [2019-11-20 03:48:49,430 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1691 transitions. [2019-11-20 03:48:49,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-20 03:48:49,430 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:49,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:49,602 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-20 03:48:50,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:50,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 861 states and 1699 transitions. [2019-11-20 03:48:50,557 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1699 transitions. [2019-11-20 03:48:50,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-20 03:48:50,557 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:50,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:50,632 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-11-20 03:48:51,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:51,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1798 states to 871 states and 1722 transitions. [2019-11-20 03:48:51,437 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1722 transitions. [2019-11-20 03:48:51,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-20 03:48:51,437 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:51,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:51,515 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-20 03:48:51,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:51,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1798 states to 872 states and 1722 transitions. [2019-11-20 03:48:51,555 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1722 transitions. [2019-11-20 03:48:51,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-20 03:48:51,557 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:51,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:51,627 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-20 03:48:55,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:55,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1822 states to 884 states and 1746 transitions. [2019-11-20 03:48:55,406 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1746 transitions. [2019-11-20 03:48:55,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-20 03:48:55,407 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:55,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:55,536 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-20 03:48:56,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:56,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1827 states to 886 states and 1751 transitions. [2019-11-20 03:48:56,493 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1751 transitions. [2019-11-20 03:48:56,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-20 03:48:56,495 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:56,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:56,593 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-20 03:48:58,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:58,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1836 states to 890 states and 1760 transitions. [2019-11-20 03:48:58,061 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1760 transitions. [2019-11-20 03:48:58,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-20 03:48:58,061 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:58,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:58,622 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-20 03:48:59,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:48:59,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 891 states and 1762 transitions. [2019-11-20 03:48:59,703 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1762 transitions. [2019-11-20 03:48:59,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-20 03:48:59,703 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:48:59,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:59,765 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-20 03:49:00,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:49:00,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1847 states to 893 states and 1771 transitions. [2019-11-20 03:49:00,374 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1771 transitions. [2019-11-20 03:49:00,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-20 03:49:00,375 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:49:00,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:49:00,453 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-11-20 03:49:01,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:49:01,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1877 states to 904 states and 1801 transitions. [2019-11-20 03:49:01,903 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1801 transitions. [2019-11-20 03:49:01,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-20 03:49:01,904 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:49:01,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:49:01,963 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-20 03:49:02,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:49:02,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1886 states to 906 states and 1810 transitions. [2019-11-20 03:49:02,552 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1810 transitions. [2019-11-20 03:49:02,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-20 03:49:02,552 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:49:02,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:49:02,601 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-20 03:49:03,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:49:03,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1887 states to 907 states and 1811 transitions. [2019-11-20 03:49:03,188 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1811 transitions. [2019-11-20 03:49:03,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-20 03:49:03,189 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:49:03,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:49:03,236 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-20 03:49:03,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:49:03,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1897 states to 909 states and 1821 transitions. [2019-11-20 03:49:03,763 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1821 transitions. [2019-11-20 03:49:03,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-20 03:49:03,764 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:49:03,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:49:03,825 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-20 03:49:04,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:49:04,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1906 states to 911 states and 1830 transitions. [2019-11-20 03:49:04,340 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1830 transitions. [2019-11-20 03:49:04,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-20 03:49:04,341 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:49:04,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:49:04,386 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-20 03:49:04,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:49:04,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1911 states to 914 states and 1835 transitions. [2019-11-20 03:49:04,497 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1835 transitions. [2019-11-20 03:49:04,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-20 03:49:04,499 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:49:04,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:49:04,603 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-11-20 03:49:05,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:49:05,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1917 states to 916 states and 1841 transitions. [2019-11-20 03:49:05,673 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1841 transitions. [2019-11-20 03:49:05,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-20 03:49:05,674 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:49:05,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:49:05,728 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-20 03:49:07,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:49:07,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1926 states to 920 states and 1850 transitions. [2019-11-20 03:49:07,180 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1850 transitions. [2019-11-20 03:49:07,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-20 03:49:07,181 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:49:07,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:49:07,238 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-11-20 03:49:08,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:49:08,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1953 states to 930 states and 1877 transitions. [2019-11-20 03:49:08,029 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1877 transitions. [2019-11-20 03:49:08,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-20 03:49:08,031 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:49:08,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:49:08,101 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-11-20 03:49:08,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:49:08,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1957 states to 931 states and 1881 transitions. [2019-11-20 03:49:08,818 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1881 transitions. [2019-11-20 03:49:08,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-20 03:49:08,818 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:49:08,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:49:08,887 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-11-20 03:49:09,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:49:09,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1960 states to 932 states and 1884 transitions. [2019-11-20 03:49:09,435 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1884 transitions. [2019-11-20 03:49:09,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-20 03:49:09,436 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:49:09,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:49:09,503 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-11-20 03:49:10,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:49:10,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1966 states to 934 states and 1890 transitions. [2019-11-20 03:49:10,574 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1890 transitions. [2019-11-20 03:49:10,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-20 03:49:10,575 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:49:10,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:49:10,794 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-20 03:49:12,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:49:12,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2007 states to 943 states and 1931 transitions. [2019-11-20 03:49:12,841 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1931 transitions. [2019-11-20 03:49:12,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-20 03:49:12,842 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:49:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:49:12,888 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-20 03:49:13,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:49:13,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2010 states to 945 states and 1934 transitions. [2019-11-20 03:49:13,535 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1934 transitions. [2019-11-20 03:49:13,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-20 03:49:13,536 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:49:13,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:49:13,585 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-20 03:49:15,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:49:15,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2019 states to 949 states and 1943 transitions. [2019-11-20 03:49:15,138 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1943 transitions. [2019-11-20 03:49:15,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-20 03:49:15,138 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:49:15,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:49:15,190 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-20 03:49:15,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:49:15,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2022 states to 951 states and 1946 transitions. [2019-11-20 03:49:15,227 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1946 transitions. [2019-11-20 03:49:15,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-20 03:49:15,228 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:49:15,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:49:15,316 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 03:49:15,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:49:15,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2028 states to 955 states and 1952 transitions. [2019-11-20 03:49:15,356 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1952 transitions. [2019-11-20 03:49:15,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-20 03:49:15,357 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:49:15,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:49:16,267 ERROR L603 CodeCheckObserver]: First Tracecheck threw exception Undeclared function symbol (const Int) [2019-11-20 03:49:16,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:49:16,653 INFO L255 TraceCheckSpWp]: Trace formula consists of 1419 conjuncts, 101 conjunts are in the unsatisfiable core [2019-11-20 03:49:16,669 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:49:16,726 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 03:49:16,730 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:49:16,743 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:49:16,744 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:49:16,744 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:10 [2019-11-20 03:49:17,680 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 03:49:17,680 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:49:17,690 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:49:17,691 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 03:49:17,691 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:16 [2019-11-20 03:49:20,673 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 03:49:20,674 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:49:20,678 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:49:20,678 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 03:49:20,678 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2019-11-20 03:49:22,762 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:49:22,762 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 03:49:22,763 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:49:22,805 INFO L567 ElimStorePlain]: treesize reduction 14, result has 69.6 percent of original size [2019-11-20 03:49:22,809 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 03:49:22,810 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:49:22,821 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:49:22,821 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 03:49:22,821 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:31 [2019-11-20 03:49:23,756 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 03:49:23,756 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:49:23,767 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:49:23,768 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 03:49:23,769 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-11-20 03:49:44,224 WARN L191 SmtUtils]: Spent 10.01 s on a formula simplification that was a NOOP. DAG size: 19 [2019-11-20 03:50:20,723 WARN L191 SmtUtils]: Spent 24.35 s on a formula simplification that was a NOOP. DAG size: 37 [2019-11-20 03:50:20,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:50:20,801 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:50:20,801 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 75 treesize of output 122 [2019-11-20 03:50:20,802 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:50:20,980 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-11-20 03:50:20,980 INFO L567 ElimStorePlain]: treesize reduction 32, result has 79.6 percent of original size [2019-11-20 03:50:20,982 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-11-20 03:50:20,982 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:127, output treesize:125 [2019-11-20 03:50:24,349 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 03:50:24,349 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:50:24,358 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:50:24,358 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 03:50:24,358 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-11-20 03:51:24,051 WARN L191 SmtUtils]: Spent 48.72 s on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2019-11-20 03:52:10,047 WARN L191 SmtUtils]: Spent 45.36 s on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-11-20 03:52:30,688 WARN L191 SmtUtils]: Spent 20.03 s on a formula simplification that was a NOOP. DAG size: 46 [2019-11-20 03:52:30,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:52:30,742 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:52:30,743 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 03:52:30,743 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:52:30,889 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-11-20 03:52:30,889 INFO L567 ElimStorePlain]: treesize reduction 28, result has 82.1 percent of original size [2019-11-20 03:52:30,890 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 03:52:30,890 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:126, output treesize:128 [2019-11-20 03:52:32,324 INFO L392 ElimStorePlain]: Different costs {1=[|v_#valid_BEFORE_CALL_9|], 3=[v_prenex_14]} [2019-11-20 03:52:32,330 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 03:52:32,331 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:52:32,377 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:52:32,383 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 03:52:32,383 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:52:32,412 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:52:32,413 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 03:52:32,413 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:91, output treesize:66 [2019-11-20 03:52:45,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:52:45,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:52:45,433 INFO L392 ElimStorePlain]: Different costs {1=[v_prenex_24], 3=[v_prenex_19, v_prenex_20], 6=[|v_#valid_BEFORE_CALL_12|]} [2019-11-20 03:52:45,439 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 57 treesize of output 53 [2019-11-20 03:52:45,439 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:52:45,586 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-11-20 03:52:45,587 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:52:45,604 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:52:45,604 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 65 treesize of output 75 [2019-11-20 03:52:45,605 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:52:45,746 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-11-20 03:52:45,747 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:52:45,754 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 73 treesize of output 67 [2019-11-20 03:52:45,754 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 03:52:45,885 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-11-20 03:52:45,885 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:52:45,908 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:52:45,908 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 81 treesize of output 97 [2019-11-20 03:52:45,909 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 03:52:46,043 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-11-20 03:52:46,044 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:52:46,046 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-1 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2019-11-20 03:52:46,046 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:277, output treesize:237 [2019-11-20 03:54:07,222 WARN L191 SmtUtils]: Spent 1.34 m on a formula simplification. DAG size of input: 114 DAG size of output: 66 [2019-11-20 03:54:48,026 WARN L191 SmtUtils]: Spent 40.10 s on a formula simplification that was a NOOP. DAG size: 66 [2019-11-20 03:54:58,052 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((|ldv_init_zalloc_#t~malloc66.base| Int) (v_ULTIMATE.start_usb_acecad_probe_~input_dev~0.base_BEFORE_CALL_1 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 ((.cse0 ((as const (Array Int Int)) 0))) (and (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) .cse0) (not (= v_ULTIMATE.start_usb_acecad_probe_~acecad~3.base_BEFORE_CALL_2 |ldv_init_zalloc_#t~malloc66.base|)) (not (= 0 (mod v_ULTIMATE.start_usb_acecad_probe_~input_dev~0.base_BEFORE_CALL_1 18446744073709551616))) (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 (= v_ULTIMATE.start_usb_acecad_probe_~id.base_BEFORE_CALL_6 v_ULTIMATE.start_usb_acecad_probe_~input_dev~0.base_BEFORE_CALL_1)) (not (= v_ULTIMATE.start_usb_acecad_probe_~id.base_BEFORE_CALL_6 |ldv_init_zalloc_#t~malloc66.base|)) (= .cse0 (select |c_#memory_int| |ldv_init_zalloc_#t~malloc66.base|)) (not (= v_ULTIMATE.start_usb_acecad_probe_~input_dev~0.base_BEFORE_CALL_1 |ldv_init_zalloc_#t~malloc66.base|)) (not (= 0 (mod v_ULTIMATE.start_usb_acecad_probe_~acecad~3.base_BEFORE_CALL_2 18446744073709551616))) (not (= v_ULTIMATE.start_usb_acecad_probe_~acecad~3.base_BEFORE_CALL_2 v_ULTIMATE.start_usb_acecad_probe_~input_dev~0.base_BEFORE_CALL_1))))) (exists ((v_prenex_29 Int) (v_prenex_23 Int) (v_prenex_30 Int)) (let ((.cse1 ((as const (Array Int Int)) 0))) (and (not (= v_prenex_29 v_prenex_23)) (= .cse1 (select |c_#memory_int| v_prenex_29)) (not (= v_prenex_29 v_prenex_30)) (not (= v_prenex_30 v_prenex_23)) (= .cse1 (select |c_#memory_int| v_prenex_23)) (not (= 0 (mod v_prenex_30 18446744073709551616))) (not (= v_prenex_29 0))))) (exists ((v_prenex_22 Int) (v_prenex_33 Int)) (let ((.cse2 ((as const (Array Int Int)) 0))) (and (= (select |c_#memory_int| v_prenex_22) .cse2) (not (= v_prenex_33 0)) (not (= v_prenex_33 v_prenex_22)) (= .cse2 (select |c_#memory_int| v_prenex_33))))) (exists ((v_prenex_12 Int) (v_prenex_32 Int) (v_prenex_31 Int)) (let ((.cse3 ((as const (Array Int Int)) 0))) (and (not (= v_prenex_32 v_prenex_31)) (not (= v_prenex_32 0)) (not (= v_prenex_32 v_prenex_12)) (not (= 0 (mod v_prenex_31 18446744073709551616))) (not (= v_prenex_12 v_prenex_31)) (= .cse3 (select |c_#memory_int| v_prenex_32)) (= .cse3 (select |c_#memory_int| v_prenex_12)))))) is different from true [2019-11-20 03:55:09,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 03:55:09,344 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 0 case distinctions, treesize of input 57 treesize of output 60 [2019-11-20 03:55:09,353 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2019-11-20 03:55:09,353 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:55:09,368 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:55:09,368 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:55:09,396 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:55:09,397 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 57 treesize of output 93 [2019-11-20 03:55:09,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:55:09,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:55:09,404 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 03:55:09,407 INFO L168 Benchmark]: Toolchain (without parser) took 462480.89 ms. Allocated memory was 1.0 GB in the beginning and 2.6 GB in the end (delta: 1.6 GB). Free memory was 944.7 MB in the beginning and 2.0 GB in the end (delta: -1.1 GB). Peak memory consumption was 559.5 MB. Max. memory is 11.5 GB. [2019-11-20 03:55:09,407 INFO L168 Benchmark]: CDTParser took 0.28 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 03:55:09,407 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1150.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -110.8 MB). Peak memory consumption was 38.0 MB. Max. memory is 11.5 GB. [2019-11-20 03:55:09,407 INFO L168 Benchmark]: Boogie Procedure Inliner took 131.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-20 03:55:09,408 INFO L168 Benchmark]: Boogie Preprocessor took 92.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-20 03:55:09,408 INFO L168 Benchmark]: RCFGBuilder took 2915.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 819.5 MB in the end (delta: 222.2 MB). Peak memory consumption was 222.2 MB. Max. memory is 11.5 GB. [2019-11-20 03:55:09,408 INFO L168 Benchmark]: CodeCheck took 458185.27 ms. Allocated memory was 1.2 GB in the beginning and 2.6 GB in the end (delta: 1.5 GB). Free memory was 819.5 MB in the beginning and 2.0 GB in the end (delta: -1.2 GB). Peak memory consumption was 304.3 MB. Max. memory is 11.5 GB. [2019-11-20 03:55:09,410 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.28 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 1150.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -110.8 MB). Peak memory consumption was 38.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 131.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 92.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2915.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 819.5 MB in the end (delta: 222.2 MB). Peak memory consumption was 222.2 MB. Max. memory is 11.5 GB. * CodeCheck took 458185.27 ms. Allocated memory was 1.2 GB in the beginning and 2.6 GB in the end (delta: 1.5 GB). Free memory was 819.5 MB in the beginning and 2.0 GB in the end (delta: -1.2 GB). Peak memory consumption was 304.3 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 03:55:11,132 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 03:55:11,134 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 03:55:11,144 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 03:55:11,144 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 03:55:11,145 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 03:55:11,147 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 03:55:11,149 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 03:55:11,150 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 03:55:11,151 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 03:55:11,152 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 03:55:11,153 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 03:55:11,154 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 03:55:11,155 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 03:55:11,155 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 03:55:11,157 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 03:55:11,158 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 03:55:11,159 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 03:55:11,161 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 03:55:11,165 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 03:55:11,168 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 03:55:11,172 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 03:55:11,173 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 03:55:11,175 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 03:55:11,177 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 03:55:11,179 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 03:55:11,180 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 03:55:11,181 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 03:55:11,182 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 03:55:11,183 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 03:55:11,184 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 03:55:11,184 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 03:55:11,185 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 03:55:11,186 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 03:55:11,188 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 03:55:11,188 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 03:55:11,189 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 03:55:11,189 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 03:55:11,190 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 03:55:11,191 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 03:55:11,193 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 03:55:11,194 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_344d34c0-40a3-4208-b71a-77bedcab816e/bin/ukojak/config/svcomp-Reach-64bit-Kojak_Bitvector.epf [2019-11-20 03:55:11,215 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 03:55:11,215 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 03:55:11,216 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-20 03:55:11,216 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2019-11-20 03:55:11,217 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 03:55:11,217 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 03:55:11,218 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 03:55:11,218 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 03:55:11,218 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 03:55:11,218 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 03:55:11,219 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 03:55:11,219 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 03:55:11,219 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 03:55:11,219 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 03:55:11,220 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 03:55:11,220 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 03:55:11,220 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2019-11-20 03:55:11,220 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2019-11-20 03:55:11,221 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 03:55:11,221 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 03:55:11,221 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-11-20 03:55:11,221 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 03:55:11,221 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 03:55:11,221 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 03:55:11,222 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-11-20 03:55:11,222 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 03:55:11,222 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 03:55:11,222 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2019-11-20 03:55:11,222 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 03:55:11,223 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2019-11-20 03:55:11,223 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_344d34c0-40a3-4208-b71a-77bedcab816e/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 -> 3198ee11c6ed540a48e3bca51463c154c984d782 [2019-11-20 03:55:11,477 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 03:55:11,487 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 03:55:11,490 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 03:55:11,491 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 03:55:11,492 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 03:55:11,492 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_344d34c0-40a3-4208-b71a-77bedcab816e/bin/ukojak/../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2019-11-20 03:55:11,540 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_344d34c0-40a3-4208-b71a-77bedcab816e/bin/ukojak/data/a1219740b/de68bd7d01c849e68dc6e839f9b82c4d/FLAGa998cb59a [2019-11-20 03:55:12,203 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 03:55:12,203 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_344d34c0-40a3-4208-b71a-77bedcab816e/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2019-11-20 03:55:12,231 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_344d34c0-40a3-4208-b71a-77bedcab816e/bin/ukojak/data/a1219740b/de68bd7d01c849e68dc6e839f9b82c4d/FLAGa998cb59a [2019-11-20 03:55:12,362 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_344d34c0-40a3-4208-b71a-77bedcab816e/bin/ukojak/data/a1219740b/de68bd7d01c849e68dc6e839f9b82c4d [2019-11-20 03:55:12,364 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 03:55:12,365 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 03:55:12,366 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 03:55:12,366 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 03:55:12,369 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 03:55:12,370 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:55:12" (1/1) ... [2019-11-20 03:55:12,372 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d5d702b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:55:12, skipping insertion in model container [2019-11-20 03:55:12,373 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:55:12" (1/1) ... [2019-11-20 03:55:12,379 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 03:55:12,451 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 03:55:13,383 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:55:13,424 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 03:55:13,582 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:55:13,676 INFO L192 MainTranslator]: Completed translation [2019-11-20 03:55:13,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:55:13 WrapperNode [2019-11-20 03:55:13,677 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 03:55:13,677 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 03:55:13,678 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 03:55:13,678 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 03:55:13,688 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:55:13" (1/1) ... [2019-11-20 03:55:13,725 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:55:13" (1/1) ... [2019-11-20 03:55:13,773 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 03:55:13,773 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 03:55:13,773 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 03:55:13,782 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 03:55:13,790 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:55:13" (1/1) ... [2019-11-20 03:55:13,791 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:55:13" (1/1) ... [2019-11-20 03:55:13,798 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:55:13" (1/1) ... [2019-11-20 03:55:13,804 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:55:13" (1/1) ... [2019-11-20 03:55:13,858 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:55:13" (1/1) ... [2019-11-20 03:55:13,867 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:55:13" (1/1) ... [2019-11-20 03:55:13,884 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:55:13" (1/1) ... [2019-11-20 03:55:13,894 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 03:55:13,898 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 03:55:13,898 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 03:55:13,899 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 03:55:13,900 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:55:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_344d34c0-40a3-4208-b71a-77bedcab816e/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 03:55:13,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2019-11-20 03:55:13,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2019-11-20 03:55:13,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-20 03:55:13,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2019-11-20 03:55:13,966 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2019-11-20 03:55:13,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2019-11-20 03:55:13,967 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-11-20 03:55:13,967 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-11-20 03:55:13,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-20 03:55:13,968 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-20 03:55:13,968 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-11-20 03:55:13,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-11-20 03:55:13,969 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-11-20 03:55:13,969 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-11-20 03:55:13,969 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2019-11-20 03:55:13,969 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2019-11-20 03:55:13,970 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2019-11-20 03:55:13,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2019-11-20 03:55:13,970 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2019-11-20 03:55:13,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2019-11-20 03:55:13,971 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_disconnect [2019-11-20 03:55:13,971 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_disconnect [2019-11-20 03:55:13,971 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2019-11-20 03:55:13,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2019-11-20 03:55:13,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 03:55:13,972 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2019-11-20 03:55:13,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2019-11-20 03:55:13,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 03:55:13,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 03:55:13,973 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2019-11-20 03:55:13,973 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2019-11-20 03:55:13,973 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2019-11-20 03:55:13,974 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2019-11-20 03:55:13,974 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_7 [2019-11-20 03:55:13,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_7 [2019-11-20 03:55:13,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 03:55:13,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2019-11-20 03:55:13,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2019-11-20 03:55:13,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 03:55:13,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-20 03:55:13,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-20 03:55:13,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2019-11-20 03:55:13,977 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2019-11-20 03:55:13,977 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2019-11-20 03:55:13,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2019-11-20 03:55:13,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2019-11-20 03:55:13,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2019-11-20 03:55:13,978 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2019-11-20 03:55:13,978 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2019-11-20 03:55:13,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 03:55:13,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 03:55:14,587 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2019-11-20 03:55:39,795 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 03:55:39,796 INFO L285 CfgBuilder]: Removed 82 assume(true) statements. [2019-11-20 03:55:39,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:55:39 BoogieIcfgContainer [2019-11-20 03:55:39,797 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 03:55:39,797 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2019-11-20 03:55:39,797 INFO L271 PluginConnector]: Initializing CodeCheck... [2019-11-20 03:55:39,807 INFO L275 PluginConnector]: CodeCheck initialized [2019-11-20 03:55:39,808 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:55:39" (1/1) ... [2019-11-20 03:55:39,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:55:39,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 03:55:39,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 149 states and 205 transitions. [2019-11-20 03:55:39,857 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 205 transitions. [2019-11-20 03:55:39,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 03:55:39,862 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 03:55:39,899 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 03:55:39,903 INFO L168 Benchmark]: Toolchain (without parser) took 27537.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 180.4 MB). Free memory was 951.1 MB in the beginning and 859.5 MB in the end (delta: 91.6 MB). Peak memory consumption was 271.9 MB. Max. memory is 11.5 GB. [2019-11-20 03:55:39,904 INFO L168 Benchmark]: CDTParser took 0.23 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 03:55:39,905 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1310.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 180.4 MB). Free memory was 951.1 MB in the beginning and 1.1 GB in the end (delta: -154.2 MB). Peak memory consumption was 57.8 MB. Max. memory is 11.5 GB. [2019-11-20 03:55:39,905 INFO L168 Benchmark]: Boogie Procedure Inliner took 95.52 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-20 03:55:39,906 INFO L168 Benchmark]: Boogie Preprocessor took 124.81 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-20 03:55:39,906 INFO L168 Benchmark]: RCFGBuilder took 25898.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 859.5 MB in the end (delta: 232.6 MB). Peak memory consumption was 232.6 MB. Max. memory is 11.5 GB. [2019-11-20 03:55:39,907 INFO L168 Benchmark]: CodeCheck took 104.15 ms. Allocated memory is still 1.2 GB. Free memory is still 859.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 03:55:39,909 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.23 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 1310.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 180.4 MB). Free memory was 951.1 MB in the beginning and 1.1 GB in the end (delta: -154.2 MB). Peak memory consumption was 57.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 95.52 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 124.81 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 25898.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 859.5 MB in the end (delta: 232.6 MB). Peak memory consumption was 232.6 MB. Max. memory is 11.5 GB. * CodeCheck took 104.15 ms. Allocated memory is still 1.2 GB. Free memory is still 859.5 MB. There was no memory consumed. Max. memory is 11.5 GB. RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...