./Ultimate.py --spec ../../sv-benchmarks/c/Systems_DeviceDriversLinux64_ReachSafety.prp --file ../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-4ee267b-1-130_7a-drivers--hwmon--ibmaem.ko-entry_point_ldv-val-v0.8_false-unreach-call.cil.out.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d35aa36c-eba9-4488-b57f-36fa6d2b24b8/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d35aa36c-eba9-4488-b57f-36fa6d2b24b8/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d35aa36c-eba9-4488-b57f-36fa6d2b24b8/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d35aa36c-eba9-4488-b57f-36fa6d2b24b8/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-4ee267b-1-130_7a-drivers--hwmon--ibmaem.ko-entry_point_ldv-val-v0.8_false-unreach-call.cil.out.c -s /tmp/vcloud-vcloud-master/worker/working_dir_d35aa36c-eba9-4488-b57f-36fa6d2b24b8/bin-2019/utaipan/config/svcomp-Reach-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d35aa36c-eba9-4488-b57f-36fa6d2b24b8/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 9510b7848b290b8f46d4ef3490482ae53aafbe1f .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d35aa36c-eba9-4488-b57f-36fa6d2b24b8/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d35aa36c-eba9-4488-b57f-36fa6d2b24b8/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d35aa36c-eba9-4488-b57f-36fa6d2b24b8/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d35aa36c-eba9-4488-b57f-36fa6d2b24b8/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-4ee267b-1-130_7a-drivers--hwmon--ibmaem.ko-entry_point_ldv-val-v0.8_false-unreach-call.cil.out.c -s /tmp/vcloud-vcloud-master/worker/working_dir_d35aa36c-eba9-4488-b57f-36fa6d2b24b8/bin-2019/utaipan/config/svcomp-Reach-64bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d35aa36c-eba9-4488-b57f-36fa6d2b24b8/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 9510b7848b290b8f46d4ef3490482ae53aafbe1f .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: translation of (const (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32))) not yet implemented, please contact Matthias --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 12:02:34,360 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 12:02:34,361 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 12:02:34,367 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 12:02:34,368 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 12:02:34,368 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 12:02:34,369 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 12:02:34,370 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 12:02:34,372 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 12:02:34,372 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 12:02:34,373 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 12:02:34,373 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 12:02:34,374 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 12:02:34,374 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 12:02:34,375 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 12:02:34,376 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 12:02:34,376 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 12:02:34,377 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 12:02:34,379 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 12:02:34,380 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 12:02:34,381 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 12:02:34,381 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 12:02:34,383 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 12:02:34,383 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 12:02:34,384 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 12:02:34,384 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 12:02:34,385 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 12:02:34,385 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 12:02:34,386 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 12:02:34,387 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 12:02:34,387 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 12:02:34,388 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 12:02:34,388 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 12:02:34,388 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 12:02:34,389 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 12:02:34,389 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 12:02:34,389 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d35aa36c-eba9-4488-b57f-36fa6d2b24b8/bin-2019/utaipan/config/svcomp-Reach-64bit-Taipan_Default.epf [2018-11-18 12:02:34,400 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 12:02:34,400 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 12:02:34,401 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 12:02:34,401 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 12:02:34,401 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 12:02:34,401 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 12:02:34,401 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 12:02:34,401 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 12:02:34,401 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 12:02:34,402 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 12:02:34,402 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-18 12:02:34,402 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 12:02:34,402 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 12:02:34,402 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 12:02:34,403 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 12:02:34,403 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 12:02:34,403 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 12:02:34,403 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 12:02:34,403 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 12:02:34,403 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 12:02:34,403 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 12:02:34,404 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 12:02:34,404 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 12:02:34,404 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 12:02:34,404 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 12:02:34,404 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 12:02:34,404 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 12:02:34,404 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 12:02:34,405 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 12:02:34,405 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 12:02:34,405 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 12:02:34,405 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 12:02:34,405 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 12:02:34,405 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 12:02:34,405 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 12:02:34,405 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-18 12:02:34,406 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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/working_dir_d35aa36c-eba9-4488-b57f-36fa6d2b24b8/bin-2019/utaipan 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 -> Taipan 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 -> 9510b7848b290b8f46d4ef3490482ae53aafbe1f [2018-11-18 12:02:34,429 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 12:02:34,438 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 12:02:34,441 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 12:02:34,442 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 12:02:34,442 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 12:02:34,443 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d35aa36c-eba9-4488-b57f-36fa6d2b24b8/bin-2019/utaipan/../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-4ee267b-1-130_7a-drivers--hwmon--ibmaem.ko-entry_point_ldv-val-v0.8_false-unreach-call.cil.out.c [2018-11-18 12:02:34,486 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d35aa36c-eba9-4488-b57f-36fa6d2b24b8/bin-2019/utaipan/data/e2961c37b/2585bc040770432c91ba2329e41f205a/FLAG27d2f89fe [2018-11-18 12:02:34,927 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 12:02:34,928 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d35aa36c-eba9-4488-b57f-36fa6d2b24b8/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-4ee267b-1-130_7a-drivers--hwmon--ibmaem.ko-entry_point_ldv-val-v0.8_false-unreach-call.cil.out.c [2018-11-18 12:02:34,943 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d35aa36c-eba9-4488-b57f-36fa6d2b24b8/bin-2019/utaipan/data/e2961c37b/2585bc040770432c91ba2329e41f205a/FLAG27d2f89fe [2018-11-18 12:02:34,953 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d35aa36c-eba9-4488-b57f-36fa6d2b24b8/bin-2019/utaipan/data/e2961c37b/2585bc040770432c91ba2329e41f205a [2018-11-18 12:02:34,956 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 12:02:34,957 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 12:02:34,957 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 12:02:34,957 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 12:02:34,960 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 12:02:34,960 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:02:34" (1/1) ... [2018-11-18 12:02:34,962 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7987d47d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:02:34, skipping insertion in model container [2018-11-18 12:02:34,962 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:02:34" (1/1) ... [2018-11-18 12:02:34,968 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 12:02:35,017 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 12:02:36,044 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:02:36,094 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 12:02:36,342 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:02:36,433 INFO L195 MainTranslator]: Completed translation [2018-11-18 12:02:36,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:02:36 WrapperNode [2018-11-18 12:02:36,433 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 12:02:36,434 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 12:02:36,434 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 12:02:36,434 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 12:02:36,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:02:36" (1/1) ... [2018-11-18 12:02:36,476 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:02:36" (1/1) ... [2018-11-18 12:02:36,487 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 12:02:36,487 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 12:02:36,487 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 12:02:36,488 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 12:02:36,496 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:02:36" (1/1) ... [2018-11-18 12:02:36,496 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:02:36" (1/1) ... [2018-11-18 12:02:36,508 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:02:36" (1/1) ... [2018-11-18 12:02:36,509 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:02:36" (1/1) ... [2018-11-18 12:02:36,557 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:02:36" (1/1) ... [2018-11-18 12:02:36,565 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:02:36" (1/1) ... [2018-11-18 12:02:36,573 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:02:36" (1/1) ... [2018-11-18 12:02:36,582 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 12:02:36,582 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 12:02:36,582 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 12:02:36,582 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 12:02:36,583 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:02:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d35aa36c-eba9-4488-b57f-36fa6d2b24b8/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 12:02:36,637 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2018-11-18 12:02:36,637 INFO L130 BoogieDeclarations]: Found specification of procedure show_name [2018-11-18 12:02:36,637 INFO L138 BoogieDeclarations]: Found implementation of procedure show_name [2018-11-18 12:02:36,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-18 12:02:36,637 INFO L130 BoogieDeclarations]: Found specification of procedure aem_msg_handler [2018-11-18 12:02:36,637 INFO L138 BoogieDeclarations]: Found implementation of procedure aem_msg_handler [2018-11-18 12:02:36,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 12:02:36,638 INFO L130 BoogieDeclarations]: Found specification of procedure platform_device_add [2018-11-18 12:02:36,638 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2018-11-18 12:02:36,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2018-11-18 12:02:36,638 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2018-11-18 12:02:36,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2018-11-18 12:02:36,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 12:02:36,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2018-11-18 12:02:36,638 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2018-11-18 12:02:36,639 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int_negative [2018-11-18 12:02:36,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int_negative [2018-11-18 12:02:36,639 INFO L130 BoogieDeclarations]: Found specification of procedure aem_init_ipmi_data [2018-11-18 12:02:36,639 INFO L138 BoogieDeclarations]: Found implementation of procedure aem_init_ipmi_data [2018-11-18 12:02:36,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-11-18 12:02:36,639 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-11-18 12:02:36,639 INFO L130 BoogieDeclarations]: Found specification of procedure aem1_find_sensors [2018-11-18 12:02:36,639 INFO L138 BoogieDeclarations]: Found implementation of procedure aem1_find_sensors [2018-11-18 12:02:36,639 INFO L130 BoogieDeclarations]: Found specification of procedure wait_for_completion_timeout [2018-11-18 12:02:36,640 INFO L130 BoogieDeclarations]: Found specification of procedure ipmi_smi_watcher_unregister [2018-11-18 12:02:36,640 INFO L130 BoogieDeclarations]: Found specification of procedure ipmi_validate_addr [2018-11-18 12:02:36,640 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2018-11-18 12:02:36,640 INFO L130 BoogieDeclarations]: Found specification of procedure aem_exit [2018-11-18 12:02:36,640 INFO L138 BoogieDeclarations]: Found implementation of procedure aem_exit [2018-11-18 12:02:36,640 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2018-11-18 12:02:36,640 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2018-11-18 12:02:36,640 INFO L130 BoogieDeclarations]: Found specification of procedure init_completion [2018-11-18 12:02:36,641 INFO L138 BoogieDeclarations]: Found implementation of procedure init_completion [2018-11-18 12:02:36,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 12:02:36,641 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2018-11-18 12:02:36,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2018-11-18 12:02:36,641 INFO L130 BoogieDeclarations]: Found specification of procedure aem_init [2018-11-18 12:02:36,641 INFO L138 BoogieDeclarations]: Found implementation of procedure aem_init [2018-11-18 12:02:36,641 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2018-11-18 12:02:36,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2018-11-18 12:02:36,642 INFO L130 BoogieDeclarations]: Found specification of procedure aem_init_aem2_inst [2018-11-18 12:02:36,642 INFO L138 BoogieDeclarations]: Found implementation of procedure aem_init_aem2_inst [2018-11-18 12:02:36,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-11-18 12:02:36,642 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-11-18 12:02:36,642 INFO L130 BoogieDeclarations]: Found specification of procedure aem_find_aem1_count [2018-11-18 12:02:36,642 INFO L138 BoogieDeclarations]: Found implementation of procedure aem_find_aem1_count [2018-11-18 12:02:36,642 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_device_create_file_9 [2018-11-18 12:02:36,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_device_create_file_9 [2018-11-18 12:02:36,643 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2018-11-18 12:02:36,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2018-11-18 12:02:36,643 INFO L130 BoogieDeclarations]: Found specification of procedure aem_delete [2018-11-18 12:02:36,643 INFO L138 BoogieDeclarations]: Found implementation of procedure aem_delete [2018-11-18 12:02:36,643 INFO L130 BoogieDeclarations]: Found specification of procedure ipmi_create_user [2018-11-18 12:02:36,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 12:02:36,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 12:02:36,643 INFO L130 BoogieDeclarations]: Found specification of procedure show_version [2018-11-18 12:02:36,644 INFO L138 BoogieDeclarations]: Found implementation of procedure show_version [2018-11-18 12:02:36,644 INFO L130 BoogieDeclarations]: Found specification of procedure aem_bmc_gone [2018-11-18 12:02:36,644 INFO L138 BoogieDeclarations]: Found implementation of procedure aem_bmc_gone [2018-11-18 12:02:36,644 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2018-11-18 12:02:36,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2018-11-18 12:02:36,644 INFO L130 BoogieDeclarations]: Found specification of procedure complete [2018-11-18 12:02:36,644 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_device_create_file [2018-11-18 12:02:36,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_device_create_file [2018-11-18 12:02:36,645 INFO L130 BoogieDeclarations]: Found specification of procedure ipmi_request_settime [2018-11-18 12:02:36,645 INFO L130 BoogieDeclarations]: Found specification of procedure __list_add [2018-11-18 12:02:36,645 INFO L130 BoogieDeclarations]: Found specification of procedure aem_idr_get [2018-11-18 12:02:36,645 INFO L138 BoogieDeclarations]: Found implementation of procedure aem_idr_get [2018-11-18 12:02:36,645 INFO L130 BoogieDeclarations]: Found specification of procedure ipmi_destroy_user [2018-11-18 12:02:36,645 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2018-11-18 12:02:36,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2018-11-18 12:02:36,645 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 12:02:36,645 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 12:02:36,646 INFO L130 BoogieDeclarations]: Found specification of procedure aem_register_bmc [2018-11-18 12:02:36,646 INFO L138 BoogieDeclarations]: Found implementation of procedure aem_register_bmc [2018-11-18 12:02:36,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 12:02:36,646 INFO L130 BoogieDeclarations]: Found specification of procedure driver_register [2018-11-18 12:02:36,646 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2018-11-18 12:02:36,646 INFO L130 BoogieDeclarations]: Found specification of procedure aem_init_aem1 [2018-11-18 12:02:36,646 INFO L138 BoogieDeclarations]: Found implementation of procedure aem_init_aem1 [2018-11-18 12:02:36,646 INFO L130 BoogieDeclarations]: Found specification of procedure aem_init_aem2 [2018-11-18 12:02:36,646 INFO L138 BoogieDeclarations]: Found implementation of procedure aem_init_aem2 [2018-11-18 12:02:36,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 12:02:36,647 INFO L130 BoogieDeclarations]: Found specification of procedure hwmon_device_register [2018-11-18 12:02:36,647 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2018-11-18 12:02:36,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2018-11-18 12:02:36,647 INFO L130 BoogieDeclarations]: Found specification of procedure aem_find_aem2 [2018-11-18 12:02:36,647 INFO L138 BoogieDeclarations]: Found implementation of procedure aem_find_aem2 [2018-11-18 12:02:36,647 INFO L130 BoogieDeclarations]: Found specification of procedure platform_device_unregister [2018-11-18 12:02:36,647 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kzalloc_6 [2018-11-18 12:02:36,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kzalloc_6 [2018-11-18 12:02:36,647 INFO L130 BoogieDeclarations]: Found specification of procedure idr_pre_get [2018-11-18 12:02:36,648 INFO L130 BoogieDeclarations]: Found specification of procedure aem_send_message [2018-11-18 12:02:36,648 INFO L138 BoogieDeclarations]: Found implementation of procedure aem_send_message [2018-11-18 12:02:36,648 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_unlock [2018-11-18 12:02:36,648 INFO L130 BoogieDeclarations]: Found specification of procedure driver_unregister [2018-11-18 12:02:36,648 INFO L130 BoogieDeclarations]: Found specification of procedure ipmi_smi_watcher_register [2018-11-18 12:02:36,648 INFO L130 BoogieDeclarations]: Found specification of procedure idr_get_new [2018-11-18 12:02:36,648 INFO L130 BoogieDeclarations]: Found specification of procedure aem_register_sensors [2018-11-18 12:02:36,648 INFO L138 BoogieDeclarations]: Found implementation of procedure aem_register_sensors [2018-11-18 12:02:36,648 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2018-11-18 12:02:36,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 12:02:36,649 INFO L130 BoogieDeclarations]: Found specification of procedure aem_init_aem1_inst [2018-11-18 12:02:36,649 INFO L138 BoogieDeclarations]: Found implementation of procedure aem_init_aem1_inst [2018-11-18 12:02:36,649 INFO L130 BoogieDeclarations]: Found specification of procedure aem_idr_put [2018-11-18 12:02:36,649 INFO L138 BoogieDeclarations]: Found implementation of procedure aem_idr_put [2018-11-18 12:02:36,649 INFO L130 BoogieDeclarations]: Found specification of procedure hwmon_device_unregister [2018-11-18 12:02:36,649 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_device_create_file_10 [2018-11-18 12:02:36,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_device_create_file_10 [2018-11-18 12:02:36,649 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2018-11-18 12:02:36,650 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2018-11-18 12:02:36,650 INFO L130 BoogieDeclarations]: Found specification of procedure aem2_find_sensors [2018-11-18 12:02:36,650 INFO L138 BoogieDeclarations]: Found implementation of procedure aem2_find_sensors [2018-11-18 12:02:36,650 INFO L130 BoogieDeclarations]: Found specification of procedure idr_remove [2018-11-18 12:02:36,650 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2018-11-18 12:02:36,650 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2018-11-18 12:02:36,650 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_device_create_file_12 [2018-11-18 12:02:36,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_device_create_file_12 [2018-11-18 12:02:36,650 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_device_create_file_11 [2018-11-18 12:02:36,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_device_create_file_11 [2018-11-18 12:02:36,651 INFO L130 BoogieDeclarations]: Found specification of procedure __init_waitqueue_head [2018-11-18 12:02:36,651 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2018-11-18 12:02:36,651 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2018-11-18 12:02:36,651 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock [2018-11-18 12:02:36,651 INFO L130 BoogieDeclarations]: Found specification of procedure ipmi_free_recv_msg [2018-11-18 12:02:36,651 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2018-11-18 12:02:36,651 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2018-11-18 12:02:36,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2018-11-18 12:02:36,652 INFO L130 BoogieDeclarations]: Found specification of procedure device_remove_file [2018-11-18 12:02:36,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 12:02:36,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 12:02:36,652 INFO L130 BoogieDeclarations]: Found specification of procedure aem_remove_sensors [2018-11-18 12:02:36,652 INFO L138 BoogieDeclarations]: Found implementation of procedure aem_remove_sensors [2018-11-18 12:02:36,652 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2018-11-18 12:02:36,652 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2018-11-18 12:02:36,652 INFO L130 BoogieDeclarations]: Found specification of procedure platform_device_alloc [2018-11-18 12:02:40,548 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 12:02:40,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:02:40 BoogieIcfgContainer [2018-11-18 12:02:40,549 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 12:02:40,549 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 12:02:40,549 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 12:02:40,552 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 12:02:40,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 12:02:34" (1/3) ... [2018-11-18 12:02:40,553 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2736f295 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 12:02:40, skipping insertion in model container [2018-11-18 12:02:40,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:02:36" (2/3) ... [2018-11-18 12:02:40,553 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2736f295 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 12:02:40, skipping insertion in model container [2018-11-18 12:02:40,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:02:40" (3/3) ... [2018-11-18 12:02:40,555 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-stable-4ee267b-1-130_7a-drivers--hwmon--ibmaem.ko-entry_point_ldv-val-v0.8_false-unreach-call.cil.out.c [2018-11-18 12:02:40,561 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 12:02:40,567 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 12:02:40,576 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 12:02:40,601 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 12:02:40,601 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 12:02:40,601 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 12:02:40,601 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 12:02:40,601 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 12:02:40,601 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 12:02:40,601 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 12:02:40,602 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 12:02:40,620 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states. [2018-11-18 12:02:40,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-11-18 12:02:40,635 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:02:40,635 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:02:40,637 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:02:40,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:02:40,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1283572264, now seen corresponding path program 1 times [2018-11-18 12:02:40,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:02:40,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:02:40,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:02:40,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:02:40,681 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:02:40,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:02:41,309 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2018-11-18 12:02:41,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:02:41,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 12:02:41,311 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:02:41,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:02:41,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:02:41,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:02:41,330 INFO L87 Difference]: Start difference. First operand 423 states. Second operand 3 states. [2018-11-18 12:02:41,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:02:41,464 INFO L93 Difference]: Finished difference Result 890 states and 1153 transitions. [2018-11-18 12:02:41,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:02:41,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2018-11-18 12:02:41,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:02:41,474 INFO L225 Difference]: With dead ends: 890 [2018-11-18 12:02:41,474 INFO L226 Difference]: Without dead ends: 449 [2018-11-18 12:02:41,478 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:02:41,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-11-18 12:02:41,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 449. [2018-11-18 12:02:41,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2018-11-18 12:02:41,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 572 transitions. [2018-11-18 12:02:41,531 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 572 transitions. Word has length 233 [2018-11-18 12:02:41,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:02:41,533 INFO L480 AbstractCegarLoop]: Abstraction has 449 states and 572 transitions. [2018-11-18 12:02:41,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:02:41,533 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 572 transitions. [2018-11-18 12:02:41,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-11-18 12:02:41,538 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:02:41,539 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:02:41,539 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:02:41,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:02:41,539 INFO L82 PathProgramCache]: Analyzing trace with hash 2103365207, now seen corresponding path program 1 times [2018-11-18 12:02:41,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:02:41,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:02:41,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:02:41,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:02:41,543 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:02:41,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:02:42,065 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2018-11-18 12:02:42,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:02:42,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 12:02:42,065 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:02:42,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:02:42,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:02:42,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:02:42,068 INFO L87 Difference]: Start difference. First operand 449 states and 572 transitions. Second operand 3 states. [2018-11-18 12:02:42,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:02:42,133 INFO L93 Difference]: Finished difference Result 851 states and 1091 transitions. [2018-11-18 12:02:42,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:02:42,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 249 [2018-11-18 12:02:42,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:02:42,138 INFO L225 Difference]: With dead ends: 851 [2018-11-18 12:02:42,138 INFO L226 Difference]: Without dead ends: 451 [2018-11-18 12:02:42,140 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:02:42,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-11-18 12:02:42,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 450. [2018-11-18 12:02:42,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2018-11-18 12:02:42,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 573 transitions. [2018-11-18 12:02:42,161 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 573 transitions. Word has length 249 [2018-11-18 12:02:42,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:02:42,162 INFO L480 AbstractCegarLoop]: Abstraction has 450 states and 573 transitions. [2018-11-18 12:02:42,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:02:42,162 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 573 transitions. [2018-11-18 12:02:42,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-11-18 12:02:42,166 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:02:42,166 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:02:42,167 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:02:42,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:02:42,167 INFO L82 PathProgramCache]: Analyzing trace with hash -388894833, now seen corresponding path program 1 times [2018-11-18 12:02:42,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:02:42,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:02:42,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:02:42,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:02:42,171 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:02:42,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:02:42,604 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2018-11-18 12:02:42,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:02:42,604 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 12:02:42,605 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 251 with the following transitions: [2018-11-18 12:02:42,606 INFO L202 CegarAbsIntRunner]: [0], [2], [4], [7], [25], [28], [29], [30], [32], [34], [36], [38], [40], [42], [44], [46], [48], [51], [53], [55], [88], [91], [94], [106], [109], [112], [114], [117], [125], [144], [147], [150], [163], [166], [169], [278], [280], [284], [292], [294], [305], [309], [310], [334], [335], [348], [350], [353], [355], [364], [368], [369], [396], [398], [399], [400], [403], [412], [413], [414], [416], [425], [428], [470], [472], [476], [478], [482], [484], [486], [491], [496], [501], [503], [508], [510], [515], [544], [545], [550], [553], [556], [564], [575], [576], [648], [654], [655], [656], [658], [661], [677], [678], [684], [686], [687], [694], [695], [716], [719], [723], [727], [729], [730], [731], [733], [736], [739], [766], [768], [769], [770], [771], [780], [781], [782], [783], [784], [785], [786], [787], [788], [789], [790], [791], [792], [793], [794], [795], [796], [797], [798], [799], [800], [801], [802], [803], [810], [811], [816], [830], [831], [832], [836], [837], [838], [848], [849], [850], [854], [855], [856], [868], [869], [870], [871], [872], [873], [874], [875], [876], [908], [909], [910], [912], [913], [922], [923], [924], [926], [927], [928], [929], [930], [934], [935] [2018-11-18 12:02:42,641 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 12:02:42,642 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 12:02:42,761 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:391) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.handleInfeasibleCase(BaseRefinementStrategy.java:296) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:206) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) 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) Caused by: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:209) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:291) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.AssumptionBuilder.constructBoogieAssumeStatement(AssumptionBuilder.java:75) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.getCachedCodeBlock(TermConjunctEvaluator.java:273) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.applyPost(TermConjunctEvaluator.java:296) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$4(TermConjunctEvaluator.java:178) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computeFixpoint(TermConjunctEvaluator.java:198) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$1(TermConjunctEvaluator.java:150) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computePost(TermConjunctEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormanCachedPostOperation.applyPost(PoormanCachedPostOperation.java:308) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.applyPost(PoormansAbstractPostOperator.java:217) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:119) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:340) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:536) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:340) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateAbstractPost(FixpointEngine.java:249) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateFixpoint(FixpointEngine.java:134) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.run(FixpointEngine.java:105) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.tool.AbstractInterpreter.runWithoutTimeoutAndResults(AbstractInterpreter.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner.generateFixpoints(CegarAbsIntRunner.java:217) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.constructInterpolantGenerator(BaseTaipanRefinementStrategy.java:379) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getInterpolantGenerator(BaseTaipanRefinementStrategy.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:380) ... 20 more [2018-11-18 12:02:42,771 INFO L168 Benchmark]: Toolchain (without parser) took 7814.76 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 433.6 MB). Free memory was 954.8 MB in the beginning and 1.2 GB in the end (delta: -275.4 MB). Peak memory consumption was 158.2 MB. Max. memory is 11.5 GB. [2018-11-18 12:02:42,772 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:02:42,773 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1476.15 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 229.6 MB). Free memory was 954.8 MB in the beginning and 834.5 MB in the end (delta: 120.3 MB). Peak memory consumption was 360.0 MB. Max. memory is 11.5 GB. [2018-11-18 12:02:42,773 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.59 ms. Allocated memory is still 1.3 GB. Free memory was 834.5 MB in the beginning and 829.1 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-18 12:02:42,774 INFO L168 Benchmark]: Boogie Preprocessor took 94.39 ms. Allocated memory is still 1.3 GB. Free memory was 829.1 MB in the beginning and 818.2 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. [2018-11-18 12:02:42,777 INFO L168 Benchmark]: RCFGBuilder took 3966.85 ms. Allocated memory was 1.3 GB in the beginning and 1.4 GB in the end (delta: 109.6 MB). Free memory was 818.2 MB in the beginning and 1.1 GB in the end (delta: -286.9 MB). Peak memory consumption was 97.7 MB. Max. memory is 11.5 GB. [2018-11-18 12:02:42,778 INFO L168 Benchmark]: TraceAbstraction took 2220.92 ms. Allocated memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: 94.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -125.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:02:42,783 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1476.15 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 229.6 MB). Free memory was 954.8 MB in the beginning and 834.5 MB in the end (delta: 120.3 MB). Peak memory consumption was 360.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.59 ms. Allocated memory is still 1.3 GB. Free memory was 834.5 MB in the beginning and 829.1 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 94.39 ms. Allocated memory is still 1.3 GB. Free memory was 829.1 MB in the beginning and 818.2 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3966.85 ms. Allocated memory was 1.3 GB in the beginning and 1.4 GB in the end (delta: 109.6 MB). Free memory was 818.2 MB in the beginning and 1.1 GB in the end (delta: -286.9 MB). Peak memory consumption was 97.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2220.92 ms. Allocated memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: 94.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -125.1 MB). There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)): de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:391) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-5842f4b [2018-11-18 12:02:44,260 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 12:02:44,261 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 12:02:44,270 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 12:02:44,270 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 12:02:44,271 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 12:02:44,272 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 12:02:44,273 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 12:02:44,274 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 12:02:44,275 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 12:02:44,276 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 12:02:44,276 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 12:02:44,277 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 12:02:44,278 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 12:02:44,279 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 12:02:44,279 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 12:02:44,280 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 12:02:44,281 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 12:02:44,283 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 12:02:44,284 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 12:02:44,285 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 12:02:44,286 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 12:02:44,288 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 12:02:44,288 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 12:02:44,288 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 12:02:44,289 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 12:02:44,289 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 12:02:44,291 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 12:02:44,291 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 12:02:44,292 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 12:02:44,292 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 12:02:44,293 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 12:02:44,293 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 12:02:44,293 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 12:02:44,294 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 12:02:44,295 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 12:02:44,295 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d35aa36c-eba9-4488-b57f-36fa6d2b24b8/bin-2019/utaipan/config/svcomp-Reach-64bit-Taipan_Bitvector.epf [2018-11-18 12:02:44,306 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 12:02:44,306 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 12:02:44,306 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 12:02:44,307 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 12:02:44,307 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 12:02:44,307 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 12:02:44,307 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 12:02:44,308 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 12:02:44,308 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 12:02:44,308 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 12:02:44,308 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 12:02:44,309 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 12:02:44,309 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 12:02:44,309 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 12:02:44,309 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 12:02:44,309 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 12:02:44,309 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 12:02:44,309 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 12:02:44,310 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 12:02:44,310 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 12:02:44,310 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 12:02:44,310 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 12:02:44,310 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 12:02:44,310 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 12:02:44,310 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 12:02:44,311 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 12:02:44,311 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 12:02:44,311 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 12:02:44,311 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-18 12:02:44,311 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 12:02:44,311 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 12:02:44,311 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 12:02:44,312 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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/working_dir_d35aa36c-eba9-4488-b57f-36fa6d2b24b8/bin-2019/utaipan 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 -> Taipan 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 -> 9510b7848b290b8f46d4ef3490482ae53aafbe1f [2018-11-18 12:02:44,345 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 12:02:44,355 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 12:02:44,357 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 12:02:44,358 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 12:02:44,359 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 12:02:44,359 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d35aa36c-eba9-4488-b57f-36fa6d2b24b8/bin-2019/utaipan/../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-4ee267b-1-130_7a-drivers--hwmon--ibmaem.ko-entry_point_ldv-val-v0.8_false-unreach-call.cil.out.c [2018-11-18 12:02:44,402 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d35aa36c-eba9-4488-b57f-36fa6d2b24b8/bin-2019/utaipan/data/7e2c575ec/9a72f15819b64cfe8a1d992427c8cab7/FLAG3f71db051 [2018-11-18 12:02:44,867 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 12:02:44,868 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d35aa36c-eba9-4488-b57f-36fa6d2b24b8/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-4ee267b-1-130_7a-drivers--hwmon--ibmaem.ko-entry_point_ldv-val-v0.8_false-unreach-call.cil.out.c [2018-11-18 12:02:44,887 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d35aa36c-eba9-4488-b57f-36fa6d2b24b8/bin-2019/utaipan/data/7e2c575ec/9a72f15819b64cfe8a1d992427c8cab7/FLAG3f71db051 [2018-11-18 12:02:45,162 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d35aa36c-eba9-4488-b57f-36fa6d2b24b8/bin-2019/utaipan/data/7e2c575ec/9a72f15819b64cfe8a1d992427c8cab7 [2018-11-18 12:02:45,164 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 12:02:45,165 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 12:02:45,165 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 12:02:45,166 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 12:02:45,167 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 12:02:45,168 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:02:45" (1/1) ... [2018-11-18 12:02:45,169 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54c3999 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:02:45, skipping insertion in model container [2018-11-18 12:02:45,170 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:02:45" (1/1) ... [2018-11-18 12:02:45,176 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 12:02:45,242 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 12:02:46,383 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:02:46,521 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 12:02:46,847 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:02:47,000 INFO L195 MainTranslator]: Completed translation [2018-11-18 12:02:47,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:02:47 WrapperNode [2018-11-18 12:02:47,000 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 12:02:47,001 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 12:02:47,001 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 12:02:47,001 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 12:02:47,008 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:02:47" (1/1) ... [2018-11-18 12:02:47,036 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:02:47" (1/1) ... [2018-11-18 12:02:47,047 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 12:02:47,047 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 12:02:47,047 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 12:02:47,047 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 12:02:47,055 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:02:47" (1/1) ... [2018-11-18 12:02:47,056 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:02:47" (1/1) ... [2018-11-18 12:02:47,064 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:02:47" (1/1) ... [2018-11-18 12:02:47,064 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:02:47" (1/1) ... [2018-11-18 12:02:47,116 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:02:47" (1/1) ... [2018-11-18 12:02:47,124 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:02:47" (1/1) ... [2018-11-18 12:02:47,136 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:02:47" (1/1) ... [2018-11-18 12:02:47,147 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 12:02:47,147 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 12:02:47,147 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 12:02:47,147 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 12:02:47,149 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:02:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d35aa36c-eba9-4488-b57f-36fa6d2b24b8/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 12:02:47,201 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2018-11-18 12:02:47,201 INFO L130 BoogieDeclarations]: Found specification of procedure show_name [2018-11-18 12:02:47,202 INFO L138 BoogieDeclarations]: Found implementation of procedure show_name [2018-11-18 12:02:47,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2018-11-18 12:02:47,202 INFO L130 BoogieDeclarations]: Found specification of procedure aem_msg_handler [2018-11-18 12:02:47,202 INFO L138 BoogieDeclarations]: Found implementation of procedure aem_msg_handler [2018-11-18 12:02:47,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2018-11-18 12:02:47,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 12:02:47,202 INFO L130 BoogieDeclarations]: Found specification of procedure platform_device_add [2018-11-18 12:02:47,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-18 12:02:47,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2018-11-18 12:02:47,203 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2018-11-18 12:02:47,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2018-11-18 12:02:47,203 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2018-11-18 12:02:47,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2018-11-18 12:02:47,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2018-11-18 12:02:47,204 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2018-11-18 12:02:47,204 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int_negative [2018-11-18 12:02:47,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int_negative [2018-11-18 12:02:47,204 INFO L130 BoogieDeclarations]: Found specification of procedure aem_init_ipmi_data [2018-11-18 12:02:47,205 INFO L138 BoogieDeclarations]: Found implementation of procedure aem_init_ipmi_data [2018-11-18 12:02:47,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-11-18 12:02:47,205 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-11-18 12:02:47,205 INFO L130 BoogieDeclarations]: Found specification of procedure aem1_find_sensors [2018-11-18 12:02:47,205 INFO L138 BoogieDeclarations]: Found implementation of procedure aem1_find_sensors [2018-11-18 12:02:47,206 INFO L130 BoogieDeclarations]: Found specification of procedure wait_for_completion_timeout [2018-11-18 12:02:47,206 INFO L130 BoogieDeclarations]: Found specification of procedure ipmi_smi_watcher_unregister [2018-11-18 12:02:47,206 INFO L130 BoogieDeclarations]: Found specification of procedure ipmi_validate_addr [2018-11-18 12:02:47,206 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2018-11-18 12:02:47,206 INFO L130 BoogieDeclarations]: Found specification of procedure aem_exit [2018-11-18 12:02:47,206 INFO L138 BoogieDeclarations]: Found implementation of procedure aem_exit [2018-11-18 12:02:47,206 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2018-11-18 12:02:47,206 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2018-11-18 12:02:47,207 INFO L130 BoogieDeclarations]: Found specification of procedure init_completion [2018-11-18 12:02:47,207 INFO L138 BoogieDeclarations]: Found implementation of procedure init_completion [2018-11-18 12:02:47,207 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2018-11-18 12:02:47,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2018-11-18 12:02:47,207 INFO L130 BoogieDeclarations]: Found specification of procedure aem_init [2018-11-18 12:02:47,207 INFO L138 BoogieDeclarations]: Found implementation of procedure aem_init [2018-11-18 12:02:47,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-18 12:02:47,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2018-11-18 12:02:47,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2018-11-18 12:02:47,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2018-11-18 12:02:47,208 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2018-11-18 12:02:47,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2018-11-18 12:02:47,208 INFO L130 BoogieDeclarations]: Found specification of procedure aem_init_aem2_inst [2018-11-18 12:02:47,208 INFO L138 BoogieDeclarations]: Found implementation of procedure aem_init_aem2_inst [2018-11-18 12:02:47,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-11-18 12:02:47,208 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-11-18 12:02:47,208 INFO L130 BoogieDeclarations]: Found specification of procedure aem_find_aem1_count [2018-11-18 12:02:47,209 INFO L138 BoogieDeclarations]: Found implementation of procedure aem_find_aem1_count [2018-11-18 12:02:47,209 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_device_create_file_9 [2018-11-18 12:02:47,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_device_create_file_9 [2018-11-18 12:02:47,209 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2018-11-18 12:02:47,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2018-11-18 12:02:47,209 INFO L130 BoogieDeclarations]: Found specification of procedure aem_delete [2018-11-18 12:02:47,209 INFO L138 BoogieDeclarations]: Found implementation of procedure aem_delete [2018-11-18 12:02:47,210 INFO L130 BoogieDeclarations]: Found specification of procedure ipmi_create_user [2018-11-18 12:02:47,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 12:02:47,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 12:02:47,210 INFO L130 BoogieDeclarations]: Found specification of procedure show_version [2018-11-18 12:02:47,210 INFO L138 BoogieDeclarations]: Found implementation of procedure show_version [2018-11-18 12:02:47,210 INFO L130 BoogieDeclarations]: Found specification of procedure aem_bmc_gone [2018-11-18 12:02:47,210 INFO L138 BoogieDeclarations]: Found implementation of procedure aem_bmc_gone [2018-11-18 12:02:47,210 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2018-11-18 12:02:47,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2018-11-18 12:02:47,211 INFO L130 BoogieDeclarations]: Found specification of procedure complete [2018-11-18 12:02:47,211 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_device_create_file [2018-11-18 12:02:47,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_device_create_file [2018-11-18 12:02:47,211 INFO L130 BoogieDeclarations]: Found specification of procedure ipmi_request_settime [2018-11-18 12:02:47,211 INFO L130 BoogieDeclarations]: Found specification of procedure __list_add [2018-11-18 12:02:47,211 INFO L130 BoogieDeclarations]: Found specification of procedure aem_idr_get [2018-11-18 12:02:47,211 INFO L138 BoogieDeclarations]: Found implementation of procedure aem_idr_get [2018-11-18 12:02:47,211 INFO L130 BoogieDeclarations]: Found specification of procedure ipmi_destroy_user [2018-11-18 12:02:47,211 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2018-11-18 12:02:47,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2018-11-18 12:02:47,211 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 12:02:47,211 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 12:02:47,211 INFO L130 BoogieDeclarations]: Found specification of procedure aem_register_bmc [2018-11-18 12:02:47,212 INFO L138 BoogieDeclarations]: Found implementation of procedure aem_register_bmc [2018-11-18 12:02:47,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 12:02:47,212 INFO L130 BoogieDeclarations]: Found specification of procedure driver_register [2018-11-18 12:02:47,214 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2018-11-18 12:02:47,214 INFO L130 BoogieDeclarations]: Found specification of procedure aem_init_aem1 [2018-11-18 12:02:47,214 INFO L138 BoogieDeclarations]: Found implementation of procedure aem_init_aem1 [2018-11-18 12:02:47,214 INFO L130 BoogieDeclarations]: Found specification of procedure aem_init_aem2 [2018-11-18 12:02:47,214 INFO L138 BoogieDeclarations]: Found implementation of procedure aem_init_aem2 [2018-11-18 12:02:47,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 12:02:47,215 INFO L130 BoogieDeclarations]: Found specification of procedure hwmon_device_register [2018-11-18 12:02:47,215 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2018-11-18 12:02:47,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2018-11-18 12:02:47,215 INFO L130 BoogieDeclarations]: Found specification of procedure aem_find_aem2 [2018-11-18 12:02:47,215 INFO L138 BoogieDeclarations]: Found implementation of procedure aem_find_aem2 [2018-11-18 12:02:47,215 INFO L130 BoogieDeclarations]: Found specification of procedure platform_device_unregister [2018-11-18 12:02:47,215 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kzalloc_6 [2018-11-18 12:02:47,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kzalloc_6 [2018-11-18 12:02:47,215 INFO L130 BoogieDeclarations]: Found specification of procedure idr_pre_get [2018-11-18 12:02:47,216 INFO L130 BoogieDeclarations]: Found specification of procedure aem_send_message [2018-11-18 12:02:47,216 INFO L138 BoogieDeclarations]: Found implementation of procedure aem_send_message [2018-11-18 12:02:47,216 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_unlock [2018-11-18 12:02:47,216 INFO L130 BoogieDeclarations]: Found specification of procedure driver_unregister [2018-11-18 12:02:47,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2018-11-18 12:02:47,216 INFO L130 BoogieDeclarations]: Found specification of procedure ipmi_smi_watcher_register [2018-11-18 12:02:47,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2018-11-18 12:02:47,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2018-11-18 12:02:47,217 INFO L130 BoogieDeclarations]: Found specification of procedure idr_get_new [2018-11-18 12:02:47,217 INFO L130 BoogieDeclarations]: Found specification of procedure aem_register_sensors [2018-11-18 12:02:47,217 INFO L138 BoogieDeclarations]: Found implementation of procedure aem_register_sensors [2018-11-18 12:02:47,217 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2018-11-18 12:02:47,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 12:02:47,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-18 12:02:47,217 INFO L130 BoogieDeclarations]: Found specification of procedure aem_init_aem1_inst [2018-11-18 12:02:47,217 INFO L138 BoogieDeclarations]: Found implementation of procedure aem_init_aem1_inst [2018-11-18 12:02:47,218 INFO L130 BoogieDeclarations]: Found specification of procedure aem_idr_put [2018-11-18 12:02:47,218 INFO L138 BoogieDeclarations]: Found implementation of procedure aem_idr_put [2018-11-18 12:02:47,218 INFO L130 BoogieDeclarations]: Found specification of procedure hwmon_device_unregister [2018-11-18 12:02:47,218 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_device_create_file_10 [2018-11-18 12:02:47,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_device_create_file_10 [2018-11-18 12:02:47,218 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2018-11-18 12:02:47,218 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2018-11-18 12:02:47,218 INFO L130 BoogieDeclarations]: Found specification of procedure aem2_find_sensors [2018-11-18 12:02:47,218 INFO L138 BoogieDeclarations]: Found implementation of procedure aem2_find_sensors [2018-11-18 12:02:47,219 INFO L130 BoogieDeclarations]: Found specification of procedure idr_remove [2018-11-18 12:02:47,219 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2018-11-18 12:02:47,219 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2018-11-18 12:02:47,219 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_device_create_file_12 [2018-11-18 12:02:47,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_device_create_file_12 [2018-11-18 12:02:47,219 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_device_create_file_11 [2018-11-18 12:02:47,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_device_create_file_11 [2018-11-18 12:02:47,219 INFO L130 BoogieDeclarations]: Found specification of procedure __init_waitqueue_head [2018-11-18 12:02:47,219 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2018-11-18 12:02:47,219 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2018-11-18 12:02:47,220 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock [2018-11-18 12:02:47,220 INFO L130 BoogieDeclarations]: Found specification of procedure ipmi_free_recv_msg [2018-11-18 12:02:47,220 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2018-11-18 12:02:47,220 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2018-11-18 12:02:47,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2018-11-18 12:02:47,220 INFO L130 BoogieDeclarations]: Found specification of procedure device_remove_file [2018-11-18 12:02:47,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 12:02:47,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 12:02:47,221 INFO L130 BoogieDeclarations]: Found specification of procedure aem_remove_sensors [2018-11-18 12:02:47,221 INFO L138 BoogieDeclarations]: Found implementation of procedure aem_remove_sensors [2018-11-18 12:02:47,221 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2018-11-18 12:02:47,221 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2018-11-18 12:02:47,221 INFO L130 BoogieDeclarations]: Found specification of procedure platform_device_alloc [2018-11-18 12:02:52,027 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 12:02:52,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:02:52 BoogieIcfgContainer [2018-11-18 12:02:52,028 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 12:02:52,029 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 12:02:52,029 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 12:02:52,032 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 12:02:52,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 12:02:45" (1/3) ... [2018-11-18 12:02:52,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d2975f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 12:02:52, skipping insertion in model container [2018-11-18 12:02:52,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:02:47" (2/3) ... [2018-11-18 12:02:52,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d2975f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 12:02:52, skipping insertion in model container [2018-11-18 12:02:52,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:02:52" (3/3) ... [2018-11-18 12:02:52,035 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-stable-4ee267b-1-130_7a-drivers--hwmon--ibmaem.ko-entry_point_ldv-val-v0.8_false-unreach-call.cil.out.c [2018-11-18 12:02:52,043 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 12:02:52,050 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 12:02:52,063 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 12:02:52,091 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 12:02:52,092 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 12:02:52,092 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 12:02:52,092 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 12:02:52,092 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 12:02:52,092 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 12:02:52,092 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 12:02:52,092 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 12:02:52,092 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 12:02:52,112 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states. [2018-11-18 12:02:52,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-11-18 12:02:52,127 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:02:52,128 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:02:52,131 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:02:52,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:02:52,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1283572264, now seen corresponding path program 1 times [2018-11-18 12:02:52,141 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 12:02:52,142 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d35aa36c-eba9-4488-b57f-36fa6d2b24b8/bin-2019/utaipan/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 12:02:52,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:02:52,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:02:52,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:02:52,709 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2018-11-18 12:02:52,709 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 12:02:52,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:02:52,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 12:02:52,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:02:52,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:02:52,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:02:52,739 INFO L87 Difference]: Start difference. First operand 423 states. Second operand 3 states. [2018-11-18 12:02:53,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:02:53,034 INFO L93 Difference]: Finished difference Result 888 states and 1154 transitions. [2018-11-18 12:02:53,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:02:53,039 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2018-11-18 12:02:53,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:02:53,052 INFO L225 Difference]: With dead ends: 888 [2018-11-18 12:02:53,052 INFO L226 Difference]: Without dead ends: 447 [2018-11-18 12:02:53,058 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:02:53,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-11-18 12:02:53,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 447. [2018-11-18 12:02:53,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2018-11-18 12:02:53,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 568 transitions. [2018-11-18 12:02:53,120 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 568 transitions. Word has length 233 [2018-11-18 12:02:53,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:02:53,122 INFO L480 AbstractCegarLoop]: Abstraction has 447 states and 568 transitions. [2018-11-18 12:02:53,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:02:53,122 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 568 transitions. [2018-11-18 12:02:53,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-11-18 12:02:53,128 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:02:53,128 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:02:53,129 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:02:53,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:02:53,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1690813234, now seen corresponding path program 1 times [2018-11-18 12:02:53,132 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 12:02:53,132 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d35aa36c-eba9-4488-b57f-36fa6d2b24b8/bin-2019/utaipan/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 12:02:53,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:02:53,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:02:53,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:02:53,608 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2018-11-18 12:02:53,608 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 12:02:53,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:02:53,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 12:02:53,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 12:02:53,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:02:53,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:02:53,613 INFO L87 Difference]: Start difference. First operand 447 states and 568 transitions. Second operand 5 states. [2018-11-18 12:02:55,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:02:55,829 INFO L93 Difference]: Finished difference Result 854 states and 1088 transitions. [2018-11-18 12:02:55,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:02:55,830 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 250 [2018-11-18 12:02:55,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:02:55,834 INFO L225 Difference]: With dead ends: 854 [2018-11-18 12:02:55,834 INFO L226 Difference]: Without dead ends: 446 [2018-11-18 12:02:55,835 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:02:55,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2018-11-18 12:02:55,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 437. [2018-11-18 12:02:55,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2018-11-18 12:02:55,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 553 transitions. [2018-11-18 12:02:55,860 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 553 transitions. Word has length 250 [2018-11-18 12:02:55,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:02:55,861 INFO L480 AbstractCegarLoop]: Abstraction has 437 states and 553 transitions. [2018-11-18 12:02:55,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 12:02:55,861 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 553 transitions. [2018-11-18 12:02:55,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-11-18 12:02:55,865 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:02:55,865 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:02:55,865 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:02:55,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:02:55,866 INFO L82 PathProgramCache]: Analyzing trace with hash -344122192, now seen corresponding path program 1 times [2018-11-18 12:02:55,867 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 12:02:55,868 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d35aa36c-eba9-4488-b57f-36fa6d2b24b8/bin-2019/utaipan/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 12:02:55,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:02:56,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:02:56,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:02:56,295 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-11-18 12:02:56,295 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 12:02:56,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:02:56,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 12:02:56,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 12:02:56,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:02:56,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:02:56,298 INFO L87 Difference]: Start difference. First operand 437 states and 553 transitions. Second operand 5 states. [2018-11-18 12:02:56,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:02:56,344 INFO L93 Difference]: Finished difference Result 831 states and 1057 transitions. [2018-11-18 12:02:56,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:02:56,344 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 250 [2018-11-18 12:02:56,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:02:56,348 INFO L225 Difference]: With dead ends: 831 [2018-11-18 12:02:56,348 INFO L226 Difference]: Without dead ends: 443 [2018-11-18 12:02:56,349 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:02:56,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-11-18 12:02:56,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 441. [2018-11-18 12:02:56,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2018-11-18 12:02:56,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 559 transitions. [2018-11-18 12:02:56,370 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 559 transitions. Word has length 250 [2018-11-18 12:02:56,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:02:56,370 INFO L480 AbstractCegarLoop]: Abstraction has 441 states and 559 transitions. [2018-11-18 12:02:56,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 12:02:56,370 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 559 transitions. [2018-11-18 12:02:56,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-11-18 12:02:56,374 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:02:56,375 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:02:56,375 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:02:56,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:02:56,375 INFO L82 PathProgramCache]: Analyzing trace with hash 331570417, now seen corresponding path program 1 times [2018-11-18 12:02:56,376 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 12:02:56,376 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d35aa36c-eba9-4488-b57f-36fa6d2b24b8/bin-2019/utaipan/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 12:02:56,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:02:56,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:02:56,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:02:56,828 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-11-18 12:02:56,829 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 12:02:56,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:02:56,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 12:02:56,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 12:02:56,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:02:56,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:02:56,832 INFO L87 Difference]: Start difference. First operand 441 states and 559 transitions. Second operand 5 states. [2018-11-18 12:02:56,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:02:56,862 INFO L93 Difference]: Finished difference Result 840 states and 1071 transitions. [2018-11-18 12:02:56,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:02:56,863 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 250 [2018-11-18 12:02:56,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:02:56,866 INFO L225 Difference]: With dead ends: 840 [2018-11-18 12:02:56,866 INFO L226 Difference]: Without dead ends: 448 [2018-11-18 12:02:56,867 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:02:56,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2018-11-18 12:02:56,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 445. [2018-11-18 12:02:56,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-11-18 12:02:56,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 564 transitions. [2018-11-18 12:02:56,879 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 564 transitions. Word has length 250 [2018-11-18 12:02:56,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:02:56,879 INFO L480 AbstractCegarLoop]: Abstraction has 445 states and 564 transitions. [2018-11-18 12:02:56,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 12:02:56,879 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 564 transitions. [2018-11-18 12:02:56,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-11-18 12:02:56,883 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:02:56,883 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:02:56,883 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:02:56,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:02:56,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1488578114, now seen corresponding path program 1 times [2018-11-18 12:02:56,884 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 12:02:56,884 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d35aa36c-eba9-4488-b57f-36fa6d2b24b8/bin-2019/utaipan/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 12:02:56,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:02:57,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:02:57,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:02:57,316 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2018-11-18 12:02:57,316 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 12:02:57,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:02:57,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 12:02:57,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 12:02:57,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:02:57,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:02:57,321 INFO L87 Difference]: Start difference. First operand 445 states and 564 transitions. Second operand 5 states. [2018-11-18 12:02:57,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:02:57,381 INFO L93 Difference]: Finished difference Result 847 states and 1078 transitions. [2018-11-18 12:02:57,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:02:57,382 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 271 [2018-11-18 12:02:57,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:02:57,384 INFO L225 Difference]: With dead ends: 847 [2018-11-18 12:02:57,384 INFO L226 Difference]: Without dead ends: 451 [2018-11-18 12:02:57,385 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:02:57,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-11-18 12:02:57,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 449. [2018-11-18 12:02:57,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2018-11-18 12:02:57,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 568 transitions. [2018-11-18 12:02:57,402 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 568 transitions. Word has length 271 [2018-11-18 12:02:57,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:02:57,403 INFO L480 AbstractCegarLoop]: Abstraction has 449 states and 568 transitions. [2018-11-18 12:02:57,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 12:02:57,403 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 568 transitions. [2018-11-18 12:02:57,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-11-18 12:02:57,405 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:02:57,406 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:02:57,406 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:02:57,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:02:57,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1131922587, now seen corresponding path program 1 times [2018-11-18 12:02:57,407 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 12:02:57,407 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d35aa36c-eba9-4488-b57f-36fa6d2b24b8/bin-2019/utaipan/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 12:02:57,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:02:57,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:02:57,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:02:57,869 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2018-11-18 12:02:57,869 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 12:02:57,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:02:57,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 12:02:57,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 12:02:57,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:02:57,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:02:57,874 INFO L87 Difference]: Start difference. First operand 449 states and 568 transitions. Second operand 5 states. [2018-11-18 12:02:57,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:02:57,924 INFO L93 Difference]: Finished difference Result 855 states and 1086 transitions. [2018-11-18 12:02:57,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:02:57,925 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 273 [2018-11-18 12:02:57,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:02:57,928 INFO L225 Difference]: With dead ends: 855 [2018-11-18 12:02:57,928 INFO L226 Difference]: Without dead ends: 455 [2018-11-18 12:02:57,929 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:02:57,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2018-11-18 12:02:57,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 449. [2018-11-18 12:02:57,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2018-11-18 12:02:57,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 568 transitions. [2018-11-18 12:02:57,948 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 568 transitions. Word has length 273 [2018-11-18 12:02:57,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:02:57,949 INFO L480 AbstractCegarLoop]: Abstraction has 449 states and 568 transitions. [2018-11-18 12:02:57,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 12:02:57,949 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 568 transitions. [2018-11-18 12:02:57,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-11-18 12:02:57,952 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:02:57,952 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:02:57,952 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:02:57,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:02:57,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1873552554, now seen corresponding path program 1 times [2018-11-18 12:02:57,954 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 12:02:57,954 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d35aa36c-eba9-4488-b57f-36fa6d2b24b8/bin-2019/utaipan/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 12:02:57,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:02:58,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:02:58,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:02:58,420 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2018-11-18 12:02:58,421 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 12:02:58,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:02:58,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 12:02:58,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:02:58,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:02:58,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:02:58,424 INFO L87 Difference]: Start difference. First operand 449 states and 568 transitions. Second operand 3 states. [2018-11-18 12:02:58,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:02:58,451 INFO L93 Difference]: Finished difference Result 850 states and 1083 transitions. [2018-11-18 12:02:58,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:02:58,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 275 [2018-11-18 12:02:58,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:02:58,456 INFO L225 Difference]: With dead ends: 850 [2018-11-18 12:02:58,457 INFO L226 Difference]: Without dead ends: 450 [2018-11-18 12:02:58,458 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:02:58,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2018-11-18 12:02:58,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2018-11-18 12:02:58,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2018-11-18 12:02:58,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 569 transitions. [2018-11-18 12:02:58,472 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 569 transitions. Word has length 275 [2018-11-18 12:02:58,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:02:58,473 INFO L480 AbstractCegarLoop]: Abstraction has 450 states and 569 transitions. [2018-11-18 12:02:58,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:02:58,473 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 569 transitions. [2018-11-18 12:02:58,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-11-18 12:02:58,475 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:02:58,475 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:02:58,476 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:02:58,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:02:58,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1651411933, now seen corresponding path program 1 times [2018-11-18 12:02:58,477 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 12:02:58,477 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d35aa36c-eba9-4488-b57f-36fa6d2b24b8/bin-2019/utaipan/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 12:02:58,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:02:58,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:02:59,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:02:59,064 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2018-11-18 12:02:59,065 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 12:02:59,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:02:59,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 12:02:59,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 12:02:59,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:02:59,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:02:59,070 INFO L87 Difference]: Start difference. First operand 450 states and 569 transitions. Second operand 5 states. [2018-11-18 12:02:59,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:02:59,132 INFO L93 Difference]: Finished difference Result 856 states and 1088 transitions. [2018-11-18 12:02:59,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:02:59,134 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 276 [2018-11-18 12:02:59,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:02:59,136 INFO L225 Difference]: With dead ends: 856 [2018-11-18 12:02:59,136 INFO L226 Difference]: Without dead ends: 455 [2018-11-18 12:02:59,137 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:02:59,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2018-11-18 12:02:59,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 452. [2018-11-18 12:02:59,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2018-11-18 12:02:59,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 571 transitions. [2018-11-18 12:02:59,152 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 571 transitions. Word has length 276 [2018-11-18 12:02:59,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:02:59,153 INFO L480 AbstractCegarLoop]: Abstraction has 452 states and 571 transitions. [2018-11-18 12:02:59,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 12:02:59,153 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 571 transitions. [2018-11-18 12:02:59,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-11-18 12:02:59,156 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:02:59,156 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:02:59,156 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:02:59,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:02:59,156 INFO L82 PathProgramCache]: Analyzing trace with hash -636677581, now seen corresponding path program 1 times [2018-11-18 12:02:59,157 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 12:02:59,157 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d35aa36c-eba9-4488-b57f-36fa6d2b24b8/bin-2019/utaipan/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 12:02:59,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:02:59,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:02:59,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:02:59,610 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2018-11-18 12:02:59,610 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 12:02:59,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:02:59,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 12:02:59,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 12:02:59,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:02:59,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:02:59,614 INFO L87 Difference]: Start difference. First operand 452 states and 571 transitions. Second operand 5 states. [2018-11-18 12:02:59,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:02:59,637 INFO L93 Difference]: Finished difference Result 864 states and 1097 transitions. [2018-11-18 12:02:59,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:02:59,638 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 272 [2018-11-18 12:02:59,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:02:59,640 INFO L225 Difference]: With dead ends: 864 [2018-11-18 12:02:59,640 INFO L226 Difference]: Without dead ends: 461 [2018-11-18 12:02:59,641 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:02:59,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2018-11-18 12:02:59,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 454. [2018-11-18 12:02:59,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2018-11-18 12:02:59,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 573 transitions. [2018-11-18 12:02:59,652 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 573 transitions. Word has length 272 [2018-11-18 12:02:59,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:02:59,653 INFO L480 AbstractCegarLoop]: Abstraction has 454 states and 573 transitions. [2018-11-18 12:02:59,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 12:02:59,653 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 573 transitions. [2018-11-18 12:02:59,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-11-18 12:02:59,654 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:02:59,654 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:02:59,655 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:02:59,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:02:59,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1497304019, now seen corresponding path program 1 times [2018-11-18 12:02:59,656 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 12:02:59,656 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d35aa36c-eba9-4488-b57f-36fa6d2b24b8/bin-2019/utaipan/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 12:02:59,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:03:00,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:03:00,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:03:00,654 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2018-11-18 12:03:00,655 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 12:03:00,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:03:00,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 12:03:00,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 12:03:00,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 12:03:00,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 12:03:00,660 INFO L87 Difference]: Start difference. First operand 454 states and 573 transitions. Second operand 6 states. [2018-11-18 12:03:00,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:03:00,784 INFO L93 Difference]: Finished difference Result 877 states and 1108 transitions. [2018-11-18 12:03:00,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 12:03:00,785 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 271 [2018-11-18 12:03:00,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:03:00,787 INFO L225 Difference]: With dead ends: 877 [2018-11-18 12:03:00,787 INFO L226 Difference]: Without dead ends: 455 [2018-11-18 12:03:00,788 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-18 12:03:00,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2018-11-18 12:03:00,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 455. [2018-11-18 12:03:00,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2018-11-18 12:03:00,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 574 transitions. [2018-11-18 12:03:00,801 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 574 transitions. Word has length 271 [2018-11-18 12:03:00,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:03:00,802 INFO L480 AbstractCegarLoop]: Abstraction has 455 states and 574 transitions. [2018-11-18 12:03:00,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 12:03:00,802 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 574 transitions. [2018-11-18 12:03:00,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-11-18 12:03:00,804 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:03:00,804 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:03:00,804 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:03:00,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:03:00,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1876859750, now seen corresponding path program 1 times [2018-11-18 12:03:00,805 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 12:03:00,805 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d35aa36c-eba9-4488-b57f-36fa6d2b24b8/bin-2019/utaipan/cvc4nyu Starting monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 12:03:00,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:03:01,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:03:01,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:03:01,810 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2018-11-18 12:03:01,810 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 12:03:02,130 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-11-18 12:03:02,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:03:02,135 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d35aa36c-eba9-4488-b57f-36fa6d2b24b8/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:03:02,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:03:02,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:03:02,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:03:02,547 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2018-11-18 12:03:02,548 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 12:03:02,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:03:02,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 7] total 14 [2018-11-18 12:03:02,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 12:03:02,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 12:03:02,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-11-18 12:03:02,570 INFO L87 Difference]: Start difference. First operand 455 states and 574 transitions. Second operand 14 states. [2018-11-18 12:03:02,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:03:02,756 INFO L93 Difference]: Finished difference Result 885 states and 1119 transitions. [2018-11-18 12:03:02,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 12:03:02,756 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 274 [2018-11-18 12:03:02,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:03:02,758 INFO L225 Difference]: With dead ends: 885 [2018-11-18 12:03:02,758 INFO L226 Difference]: Without dead ends: 462 [2018-11-18 12:03:02,759 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 822 GetRequests, 807 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-11-18 12:03:02,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2018-11-18 12:03:02,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 460. [2018-11-18 12:03:02,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-11-18 12:03:02,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 579 transitions. [2018-11-18 12:03:02,768 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 579 transitions. Word has length 274 [2018-11-18 12:03:02,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:03:02,768 INFO L480 AbstractCegarLoop]: Abstraction has 460 states and 579 transitions. [2018-11-18 12:03:02,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 12:03:02,768 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 579 transitions. [2018-11-18 12:03:02,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-11-18 12:03:02,770 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:03:02,770 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:03:02,770 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:03:02,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:03:02,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1489942905, now seen corresponding path program 1 times [2018-11-18 12:03:02,771 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 12:03:02,772 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d35aa36c-eba9-4488-b57f-36fa6d2b24b8/bin-2019/utaipan/cvc4nyu Starting monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 12:03:02,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:03:03,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:03:03,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:03:03,760 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-11-18 12:03:03,760 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 12:03:04,042 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2018-11-18 12:03:04,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:03:04,047 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d35aa36c-eba9-4488-b57f-36fa6d2b24b8/bin-2019/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:03:04,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:03:04,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:03:04,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:03:04,478 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 323 trivial. 0 not checked. [2018-11-18 12:03:04,478 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 12:03:04,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:03:04,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [8, 8] total 16 [2018-11-18 12:03:04,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-18 12:03:04,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-18 12:03:04,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-11-18 12:03:04,501 INFO L87 Difference]: Start difference. First operand 460 states and 579 transitions. Second operand 16 states. [2018-11-18 12:03:04,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:03:04,747 INFO L93 Difference]: Finished difference Result 895 states and 1129 transitions. [2018-11-18 12:03:04,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 12:03:04,747 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 278 [2018-11-18 12:03:04,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:03:04,748 INFO L225 Difference]: With dead ends: 895 [2018-11-18 12:03:04,748 INFO L226 Difference]: Without dead ends: 467 [2018-11-18 12:03:04,749 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 834 GetRequests, 817 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2018-11-18 12:03:04,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2018-11-18 12:03:04,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 461. [2018-11-18 12:03:04,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2018-11-18 12:03:04,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 580 transitions. [2018-11-18 12:03:04,759 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 580 transitions. Word has length 278 [2018-11-18 12:03:04,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:03:04,759 INFO L480 AbstractCegarLoop]: Abstraction has 461 states and 580 transitions. [2018-11-18 12:03:04,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-18 12:03:04,759 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 580 transitions. [2018-11-18 12:03:04,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-11-18 12:03:04,760 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:03:04,761 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:03:04,761 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:03:04,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:03:04,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1963899075, now seen corresponding path program 1 times [2018-11-18 12:03:04,762 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 12:03:04,762 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d35aa36c-eba9-4488-b57f-36fa6d2b24b8/bin-2019/utaipan/cvc4nyu Starting monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 12:03:04,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:03:05,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:03:05,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:03:05,186 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2018-11-18 12:03:05,186 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 12:03:05,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:03:05,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 12:03:05,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:03:05,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:03:05,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:03:05,189 INFO L87 Difference]: Start difference. First operand 461 states and 580 transitions. Second operand 3 states. [2018-11-18 12:03:05,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:03:05,218 INFO L93 Difference]: Finished difference Result 871 states and 1104 transitions. [2018-11-18 12:03:05,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:03:05,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 279 [2018-11-18 12:03:05,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:03:05,221 INFO L225 Difference]: With dead ends: 871 [2018-11-18 12:03:05,221 INFO L226 Difference]: Without dead ends: 462 [2018-11-18 12:03:05,222 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:03:05,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2018-11-18 12:03:05,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 462. [2018-11-18 12:03:05,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2018-11-18 12:03:05,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 581 transitions. [2018-11-18 12:03:05,235 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 581 transitions. Word has length 279 [2018-11-18 12:03:05,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:03:05,235 INFO L480 AbstractCegarLoop]: Abstraction has 462 states and 581 transitions. [2018-11-18 12:03:05,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:03:05,235 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 581 transitions. [2018-11-18 12:03:05,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2018-11-18 12:03:05,237 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:03:05,237 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:03:05,237 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:03:05,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:03:05,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1633757826, now seen corresponding path program 1 times [2018-11-18 12:03:05,239 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 12:03:05,239 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d35aa36c-eba9-4488-b57f-36fa6d2b24b8/bin-2019/utaipan/cvc4nyu Starting monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 12:03:05,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:03:05,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:03:06,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:03:06,250 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2018-11-18 12:03:06,250 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 12:03:06,519 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2018-11-18 12:03:06,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:03:06,523 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d35aa36c-eba9-4488-b57f-36fa6d2b24b8/bin-2019/utaipan/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:03:06,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:03:06,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:03:06,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:03:06,995 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2018-11-18 12:03:06,995 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 12:03:07,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:03:07,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9, 9] total 16 [2018-11-18 12:03:07,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-18 12:03:07,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-18 12:03:07,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2018-11-18 12:03:07,023 INFO L87 Difference]: Start difference. First operand 462 states and 581 transitions. Second operand 16 states. [2018-11-18 12:03:07,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:03:07,372 INFO L93 Difference]: Finished difference Result 895 states and 1130 transitions. [2018-11-18 12:03:07,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 12:03:07,372 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 281 [2018-11-18 12:03:07,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:03:07,374 INFO L225 Difference]: With dead ends: 895 [2018-11-18 12:03:07,374 INFO L226 Difference]: Without dead ends: 465 [2018-11-18 12:03:07,375 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 843 GetRequests, 826 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-11-18 12:03:07,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2018-11-18 12:03:07,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 464. [2018-11-18 12:03:07,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2018-11-18 12:03:07,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 583 transitions. [2018-11-18 12:03:07,383 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 583 transitions. Word has length 281 [2018-11-18 12:03:07,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:03:07,384 INFO L480 AbstractCegarLoop]: Abstraction has 464 states and 583 transitions. [2018-11-18 12:03:07,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-18 12:03:07,384 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 583 transitions. [2018-11-18 12:03:07,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-11-18 12:03:07,385 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:03:07,385 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:03:07,385 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:03:07,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:03:07,386 INFO L82 PathProgramCache]: Analyzing trace with hash -774989345, now seen corresponding path program 1 times [2018-11-18 12:03:07,387 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 12:03:07,387 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d35aa36c-eba9-4488-b57f-36fa6d2b24b8/bin-2019/utaipan/cvc4nyu Starting monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 12:03:07,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:03:08,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:03:08,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:03:08,390 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2018-11-18 12:03:08,390 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 12:03:08,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:03:08,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 12:03:08,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 12:03:08,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 12:03:08,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 12:03:08,396 INFO L87 Difference]: Start difference. First operand 464 states and 583 transitions. Second operand 7 states. [2018-11-18 12:03:08,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:03:08,467 INFO L93 Difference]: Finished difference Result 884 states and 1117 transitions. [2018-11-18 12:03:08,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 12:03:08,468 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 284 [2018-11-18 12:03:08,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:03:08,470 INFO L225 Difference]: With dead ends: 884 [2018-11-18 12:03:08,470 INFO L226 Difference]: Without dead ends: 473 [2018-11-18 12:03:08,471 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 12:03:08,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2018-11-18 12:03:08,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 471. [2018-11-18 12:03:08,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-11-18 12:03:08,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 591 transitions. [2018-11-18 12:03:08,484 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 591 transitions. Word has length 284 [2018-11-18 12:03:08,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:03:08,484 INFO L480 AbstractCegarLoop]: Abstraction has 471 states and 591 transitions. [2018-11-18 12:03:08,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 12:03:08,484 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 591 transitions. [2018-11-18 12:03:08,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-11-18 12:03:08,486 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:03:08,486 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 8, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:03:08,487 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:03:08,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:03:08,487 INFO L82 PathProgramCache]: Analyzing trace with hash 118294216, now seen corresponding path program 1 times [2018-11-18 12:03:08,488 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 12:03:08,488 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d35aa36c-eba9-4488-b57f-36fa6d2b24b8/bin-2019/utaipan/cvc4nyu Starting monitored process 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 12:03:08,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:03:09,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:03:09,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:03:09,591 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2018-11-18 12:03:09,591 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 12:03:09,879 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2018-11-18 12:03:09,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 12:03:09,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2018-11-18 12:03:09,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 12:03:09,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 12:03:09,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-11-18 12:03:09,885 INFO L87 Difference]: Start difference. First operand 471 states and 591 transitions. Second operand 12 states. [2018-11-18 12:03:30,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:03:30,931 INFO L93 Difference]: Finished difference Result 1793 states and 2358 transitions. [2018-11-18 12:03:30,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 12:03:30,933 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 288 [2018-11-18 12:03:30,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:03:30,938 INFO L225 Difference]: With dead ends: 1793 [2018-11-18 12:03:30,938 INFO L226 Difference]: Without dead ends: 1790 [2018-11-18 12:03:30,939 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 585 GetRequests, 569 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2018-11-18 12:03:30,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2018-11-18 12:03:31,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1714. [2018-11-18 12:03:31,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1714 states. [2018-11-18 12:03:31,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1714 states to 1714 states and 2234 transitions. [2018-11-18 12:03:31,032 INFO L78 Accepts]: Start accepts. Automaton has 1714 states and 2234 transitions. Word has length 288 [2018-11-18 12:03:31,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:03:31,032 INFO L480 AbstractCegarLoop]: Abstraction has 1714 states and 2234 transitions. [2018-11-18 12:03:31,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 12:03:31,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1714 states and 2234 transitions. [2018-11-18 12:03:31,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-11-18 12:03:31,036 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:03:31,036 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:03:31,036 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:03:31,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:03:31,037 INFO L82 PathProgramCache]: Analyzing trace with hash -725439558, now seen corresponding path program 1 times [2018-11-18 12:03:31,038 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 12:03:31,038 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d35aa36c-eba9-4488-b57f-36fa6d2b24b8/bin-2019/utaipan/cvc4nyu Starting monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 12:03:31,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:03:32,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:03:32,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:03:32,808 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2018-11-18 12:03:32,808 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 12:03:32,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:03:32,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 12:03:32,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 12:03:32,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 12:03:32,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 12:03:32,816 INFO L87 Difference]: Start difference. First operand 1714 states and 2234 transitions. Second operand 8 states. [2018-11-18 12:03:32,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:03:32,993 INFO L93 Difference]: Finished difference Result 3403 states and 4469 transitions. [2018-11-18 12:03:32,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 12:03:32,994 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 330 [2018-11-18 12:03:32,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:03:32,999 INFO L225 Difference]: With dead ends: 3403 [2018-11-18 12:03:32,999 INFO L226 Difference]: Without dead ends: 1742 [2018-11-18 12:03:33,002 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 12:03:33,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1742 states. [2018-11-18 12:03:33,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1742 to 1731. [2018-11-18 12:03:33,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1731 states. [2018-11-18 12:03:33,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1731 states to 1731 states and 2255 transitions. [2018-11-18 12:03:33,097 INFO L78 Accepts]: Start accepts. Automaton has 1731 states and 2255 transitions. Word has length 330 [2018-11-18 12:03:33,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:03:33,098 INFO L480 AbstractCegarLoop]: Abstraction has 1731 states and 2255 transitions. [2018-11-18 12:03:33,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 12:03:33,098 INFO L276 IsEmpty]: Start isEmpty. Operand 1731 states and 2255 transitions. [2018-11-18 12:03:33,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-11-18 12:03:33,100 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:03:33,101 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:03:33,101 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:03:33,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:03:33,101 INFO L82 PathProgramCache]: Analyzing trace with hash -739689703, now seen corresponding path program 1 times [2018-11-18 12:03:33,102 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 12:03:33,102 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d35aa36c-eba9-4488-b57f-36fa6d2b24b8/bin-2019/utaipan/cvc4nyu Starting monitored process 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 12:03:33,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:03:34,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:03:35,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:03:35,261 INFO L477 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 [2018-11-18 12:03:35,262 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 12:03:35,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:03:35,265 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:7, output treesize:6 [2018-11-18 12:03:35,385 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:03:35,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 50 [2018-11-18 12:03:35,386 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 12:03:35,421 INFO L267 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. [2018-11-18 12:03:35,422 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:31 [2018-11-18 12:03:37,486 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 28 [2018-11-18 12:03:37,543 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2018-11-18 12:03:37,543 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 12:03:37,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:03:37,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 12:03:37,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 12:03:37,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 12:03:37,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-11-18 12:03:37,549 INFO L87 Difference]: Start difference. First operand 1731 states and 2255 transitions. Second operand 11 states. [2018-11-18 12:03:58,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:03:58,882 INFO L93 Difference]: Finished difference Result 3276 states and 4259 transitions. [2018-11-18 12:03:58,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 12:03:58,888 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 330 [2018-11-18 12:03:58,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:03:58,893 INFO L225 Difference]: With dead ends: 3276 [2018-11-18 12:03:58,893 INFO L226 Difference]: Without dead ends: 1590 [2018-11-18 12:03:58,897 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-11-18 12:03:58,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2018-11-18 12:03:58,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 1546. [2018-11-18 12:03:58,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1546 states. [2018-11-18 12:03:58,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 1976 transitions. [2018-11-18 12:03:58,977 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 1976 transitions. Word has length 330 [2018-11-18 12:03:58,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:03:58,977 INFO L480 AbstractCegarLoop]: Abstraction has 1546 states and 1976 transitions. [2018-11-18 12:03:58,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 12:03:58,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 1976 transitions. [2018-11-18 12:03:58,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2018-11-18 12:03:58,982 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:03:58,982 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:03:58,982 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:03:58,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:03:58,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1845105210, now seen corresponding path program 1 times [2018-11-18 12:03:58,984 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 12:03:58,984 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d35aa36c-eba9-4488-b57f-36fa6d2b24b8/bin-2019/utaipan/cvc4nyu Starting monitored process 23 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 12:03:59,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:03:59,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:03:59,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:03:59,455 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 415 trivial. 0 not checked. [2018-11-18 12:03:59,455 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 12:03:59,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:03:59,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 12:03:59,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 12:03:59,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:03:59,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:03:59,459 INFO L87 Difference]: Start difference. First operand 1546 states and 1976 transitions. Second operand 5 states. [2018-11-18 12:03:59,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:03:59,531 INFO L93 Difference]: Finished difference Result 3075 states and 3959 transitions. [2018-11-18 12:03:59,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:03:59,532 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 349 [2018-11-18 12:03:59,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:03:59,536 INFO L225 Difference]: With dead ends: 3075 [2018-11-18 12:03:59,536 INFO L226 Difference]: Without dead ends: 1582 [2018-11-18 12:03:59,538 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:03:59,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2018-11-18 12:03:59,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1575. [2018-11-18 12:03:59,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2018-11-18 12:03:59,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 2008 transitions. [2018-11-18 12:03:59,611 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 2008 transitions. Word has length 349 [2018-11-18 12:03:59,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:03:59,611 INFO L480 AbstractCegarLoop]: Abstraction has 1575 states and 2008 transitions. [2018-11-18 12:03:59,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 12:03:59,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 2008 transitions. [2018-11-18 12:03:59,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2018-11-18 12:03:59,614 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:03:59,614 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:03:59,614 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:03:59,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:03:59,615 INFO L82 PathProgramCache]: Analyzing trace with hash 160741598, now seen corresponding path program 1 times [2018-11-18 12:03:59,616 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 12:03:59,616 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d35aa36c-eba9-4488-b57f-36fa6d2b24b8/bin-2019/utaipan/cvc4nyu Starting monitored process 24 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 12:03:59,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:04:00,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:04:00,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:04:00,751 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2018-11-18 12:04:00,751 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 12:04:00,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:04:00,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 12:04:00,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 12:04:00,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 12:04:00,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 12:04:00,756 INFO L87 Difference]: Start difference. First operand 1575 states and 2008 transitions. Second operand 7 states. [2018-11-18 12:04:00,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:04:00,892 INFO L93 Difference]: Finished difference Result 3133 states and 4026 transitions. [2018-11-18 12:04:00,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 12:04:00,893 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 345 [2018-11-18 12:04:00,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:04:00,898 INFO L225 Difference]: With dead ends: 3133 [2018-11-18 12:04:00,898 INFO L226 Difference]: Without dead ends: 1611 [2018-11-18 12:04:00,901 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 12:04:00,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1611 states. [2018-11-18 12:04:00,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1611 to 1603. [2018-11-18 12:04:00,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1603 states. [2018-11-18 12:04:00,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2040 transitions. [2018-11-18 12:04:00,969 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 2040 transitions. Word has length 345 [2018-11-18 12:04:00,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:04:00,970 INFO L480 AbstractCegarLoop]: Abstraction has 1603 states and 2040 transitions. [2018-11-18 12:04:00,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 12:04:00,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 2040 transitions. [2018-11-18 12:04:00,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-11-18 12:04:00,972 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:04:00,973 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:04:00,973 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:04:00,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:04:00,973 INFO L82 PathProgramCache]: Analyzing trace with hash 657483081, now seen corresponding path program 1 times [2018-11-18 12:04:00,974 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 12:04:00,974 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d35aa36c-eba9-4488-b57f-36fa6d2b24b8/bin-2019/utaipan/cvc4nyu Starting monitored process 25 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 12:04:00,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:04:01,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:04:02,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:04:02,135 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2018-11-18 12:04:02,135 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 12:04:02,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:04:02,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 12:04:02,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:04:02,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:04:02,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:04:02,143 INFO L87 Difference]: Start difference. First operand 1603 states and 2040 transitions. Second operand 3 states. [2018-11-18 12:04:02,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:04:02,235 INFO L93 Difference]: Finished difference Result 3161 states and 4058 transitions. [2018-11-18 12:04:02,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:04:02,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 350 [2018-11-18 12:04:02,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:04:02,242 INFO L225 Difference]: With dead ends: 3161 [2018-11-18 12:04:02,242 INFO L226 Difference]: Without dead ends: 1611 [2018-11-18 12:04:02,245 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:04:02,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1611 states. [2018-11-18 12:04:02,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1611 to 1607. [2018-11-18 12:04:02,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1607 states. [2018-11-18 12:04:02,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1607 states to 1607 states and 2044 transitions. [2018-11-18 12:04:02,314 INFO L78 Accepts]: Start accepts. Automaton has 1607 states and 2044 transitions. Word has length 350 [2018-11-18 12:04:02,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:04:02,314 INFO L480 AbstractCegarLoop]: Abstraction has 1607 states and 2044 transitions. [2018-11-18 12:04:02,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:04:02,315 INFO L276 IsEmpty]: Start isEmpty. Operand 1607 states and 2044 transitions. [2018-11-18 12:04:02,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-11-18 12:04:02,317 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:04:02,317 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:04:02,318 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:04:02,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:04:02,318 INFO L82 PathProgramCache]: Analyzing trace with hash 769429925, now seen corresponding path program 1 times [2018-11-18 12:04:02,319 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 12:04:02,319 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d35aa36c-eba9-4488-b57f-36fa6d2b24b8/bin-2019/utaipan/cvc4nyu Starting monitored process 26 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 12:04:02,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:04:03,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:04:03,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:04:03,588 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2018-11-18 12:04:03,588 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 12:04:03,745 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 413 trivial. 0 not checked. [2018-11-18 12:04:03,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:04:03,750 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d35aa36c-eba9-4488-b57f-36fa6d2b24b8/bin-2019/utaipan/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:04:03,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:04:04,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:04:04,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:04:04,296 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 411 trivial. 0 not checked. [2018-11-18 12:04:04,296 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 12:04:04,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:04:04,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [4, 4] total 12 [2018-11-18 12:04:04,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 12:04:04,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 12:04:04,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-11-18 12:04:04,321 INFO L87 Difference]: Start difference. First operand 1607 states and 2044 transitions. Second operand 12 states. [2018-11-18 12:04:04,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:04:04,546 INFO L93 Difference]: Finished difference Result 3201 states and 4102 transitions. [2018-11-18 12:04:04,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 12:04:04,548 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 352 [2018-11-18 12:04:04,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:04:04,552 INFO L225 Difference]: With dead ends: 3201 [2018-11-18 12:04:04,552 INFO L226 Difference]: Without dead ends: 1647 [2018-11-18 12:04:04,555 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1055 GetRequests, 1044 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-11-18 12:04:04,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1647 states. [2018-11-18 12:04:04,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1647 to 1615. [2018-11-18 12:04:04,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1615 states. [2018-11-18 12:04:04,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 2052 transitions. [2018-11-18 12:04:04,613 INFO L78 Accepts]: Start accepts. Automaton has 1615 states and 2052 transitions. Word has length 352 [2018-11-18 12:04:04,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:04:04,613 INFO L480 AbstractCegarLoop]: Abstraction has 1615 states and 2052 transitions. [2018-11-18 12:04:04,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 12:04:04,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 2052 transitions. [2018-11-18 12:04:04,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2018-11-18 12:04:04,615 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:04:04,615 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:04:04,615 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:04:04,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:04:04,616 INFO L82 PathProgramCache]: Analyzing trace with hash 910621866, now seen corresponding path program 1 times [2018-11-18 12:04:04,617 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 12:04:04,617 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d35aa36c-eba9-4488-b57f-36fa6d2b24b8/bin-2019/utaipan/cvc4nyu Starting monitored process 28 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 12:04:04,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:04:06,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:04:06,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:04:07,013 INFO L477 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 [2018-11-18 12:04:07,013 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 12:04:07,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:04:07,015 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:7, output treesize:6 [2018-11-18 12:04:07,796 WARN L180 SmtUtils]: Spent 695.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 42 [2018-11-18 12:04:07,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 56 [2018-11-18 12:04:07,938 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-11-18 12:04:08,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-11-18 12:04:08,106 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:127, output treesize:115 [2018-11-18 12:04:28,295 WARN L180 SmtUtils]: Spent 20.09 s on a formula simplification that was a NOOP. DAG size: 67 [2018-11-18 12:04:28,304 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:04:28,306 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:04:28,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 77 treesize of output 89 [2018-11-18 12:04:28,388 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-11-18 12:04:29,509 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:04:29,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 82 [2018-11-18 12:04:29,547 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:04:30,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-11-18 12:04:30,625 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:153, output treesize:197 [2018-11-18 12:05:03,409 WARN L180 SmtUtils]: Spent 32.22 s on a formula simplification. DAG size of input: 96 DAG size of output: 72 [2018-11-18 12:05:03,472 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 29 proven. 2 refuted. 0 times theorem prover too weak. 409 trivial. 0 not checked. [2018-11-18 12:05:03,472 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 12:05:05,817 WARN L832 $PredicateComparison]: unable to prove that (forall ((aem_init_aem2_inst_~fi_resp.base (_ BitVec 32)) (aem_init_aem2_inst_~fi_resp.offset (_ BitVec 32))) (not (let ((.cse1 ((_ extract 31 0) (_ bv1000 64)))) (let ((.cse0 (store (let ((.cse2 (let ((.cse3 (store (select |c_#memory_int| c_aem_init_aem2_inst_~data~2.base) (bvadd c_aem_init_aem2_inst_~data~2.offset (_ bv193 32)) ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| aem_init_aem2_inst_~fi_resp.base) (bvadd aem_init_aem2_inst_~fi_resp.offset (_ bv4 32)))))))) (store .cse3 (bvadd c_aem_init_aem2_inst_~data~2.offset (_ bv194 32)) ((_ sign_extend 24) ((_ extract 7 0) (select (select (store |c_#memory_int| c_aem_init_aem2_inst_~data~2.base .cse3) aem_init_aem2_inst_~fi_resp.base) (bvadd aem_init_aem2_inst_~fi_resp.offset (_ bv5 32))))))))) (store .cse2 (bvadd c_aem_init_aem2_inst_~data~2.offset (_ bv195 32)) ((_ sign_extend 24) ((_ extract 7 0) (select (select (store |c_#memory_int| c_aem_init_aem2_inst_~data~2.base .cse2) aem_init_aem2_inst_~fi_resp.base) (bvadd aem_init_aem2_inst_~fi_resp.offset (_ bv6 32))))))) (bvadd c_aem_init_aem2_inst_~data~2.offset (_ bv1073 32)) .cse1))) (= (store |c_#memory_int| c_aem_init_aem2_inst_~data~2.base (store .cse0 (bvadd c_aem_init_aem2_inst_~data~2.offset (_ bv1081 32)) .cse1)) (store |c_#memory_int| c_aem_init_aem2_inst_~data~2.base (store .cse0 (bvadd c_aem_init_aem2_inst_~data~2.offset (_ bv1085 32)) ((_ extract 63 32) (_ bv1000 64))))))))) is different from false [2018-11-18 12:05:07,876 WARN L832 $PredicateComparison]: unable to prove that (forall ((aem_init_aem2_inst_~fi_resp.base (_ BitVec 32)) (aem_init_aem2_inst_~fi_resp.offset (_ BitVec 32))) (not (let ((.cse1 ((_ extract 31 0) (_ bv1000 64)))) (let ((.cse0 (store (let ((.cse2 (let ((.cse3 (store (select |c_#memory_int| |c_aem_init_aem2_inst_#t~ret244.base|) (bvadd |c_aem_init_aem2_inst_#t~ret244.offset| (_ bv193 32)) ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| aem_init_aem2_inst_~fi_resp.base) (bvadd aem_init_aem2_inst_~fi_resp.offset (_ bv4 32)))))))) (store .cse3 (bvadd |c_aem_init_aem2_inst_#t~ret244.offset| (_ bv194 32)) ((_ sign_extend 24) ((_ extract 7 0) (select (select (store |c_#memory_int| |c_aem_init_aem2_inst_#t~ret244.base| .cse3) aem_init_aem2_inst_~fi_resp.base) (bvadd aem_init_aem2_inst_~fi_resp.offset (_ bv5 32))))))))) (store .cse2 (bvadd |c_aem_init_aem2_inst_#t~ret244.offset| (_ bv195 32)) ((_ sign_extend 24) ((_ extract 7 0) (select (select (store |c_#memory_int| |c_aem_init_aem2_inst_#t~ret244.base| .cse2) aem_init_aem2_inst_~fi_resp.base) (bvadd aem_init_aem2_inst_~fi_resp.offset (_ bv6 32))))))) (bvadd |c_aem_init_aem2_inst_#t~ret244.offset| (_ bv1073 32)) .cse1))) (= (store |c_#memory_int| |c_aem_init_aem2_inst_#t~ret244.base| (store .cse0 (bvadd |c_aem_init_aem2_inst_#t~ret244.offset| (_ bv1085 32)) ((_ extract 63 32) (_ bv1000 64)))) (store |c_#memory_int| |c_aem_init_aem2_inst_#t~ret244.base| (store .cse0 (bvadd |c_aem_init_aem2_inst_#t~ret244.offset| (_ bv1081 32)) .cse1))))))) is different from false [2018-11-18 12:05:10,138 WARN L832 $PredicateComparison]: unable to prove that (forall ((aem_init_aem2_inst_~fi_resp.base (_ BitVec 32)) (aem_init_aem2_inst_~fi_resp.offset (_ BitVec 32))) (not (let ((.cse1 ((_ extract 31 0) (_ bv1000 64)))) (let ((.cse0 (store (let ((.cse2 (let ((.cse3 (store (select |c_#memory_int| |c_ldv_kzalloc_6_#res.base|) (bvadd |c_ldv_kzalloc_6_#res.offset| (_ bv193 32)) ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| aem_init_aem2_inst_~fi_resp.base) (bvadd aem_init_aem2_inst_~fi_resp.offset (_ bv4 32)))))))) (store .cse3 (bvadd |c_ldv_kzalloc_6_#res.offset| (_ bv194 32)) ((_ sign_extend 24) ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ldv_kzalloc_6_#res.base| .cse3) aem_init_aem2_inst_~fi_resp.base) (bvadd aem_init_aem2_inst_~fi_resp.offset (_ bv5 32))))))))) (store .cse2 (bvadd |c_ldv_kzalloc_6_#res.offset| (_ bv195 32)) ((_ sign_extend 24) ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ldv_kzalloc_6_#res.base| .cse2) aem_init_aem2_inst_~fi_resp.base) (bvadd aem_init_aem2_inst_~fi_resp.offset (_ bv6 32))))))) (bvadd |c_ldv_kzalloc_6_#res.offset| (_ bv1073 32)) .cse1))) (= (store |c_#memory_int| |c_ldv_kzalloc_6_#res.base| (store .cse0 (bvadd |c_ldv_kzalloc_6_#res.offset| (_ bv1081 32)) .cse1)) (store |c_#memory_int| |c_ldv_kzalloc_6_#res.base| (store .cse0 (bvadd |c_ldv_kzalloc_6_#res.offset| (_ bv1085 32)) ((_ extract 63 32) (_ bv1000 64))))))))) is different from false [2018-11-18 12:05:12,197 WARN L832 $PredicateComparison]: unable to prove that (forall ((aem_init_aem2_inst_~fi_resp.base (_ BitVec 32)) (aem_init_aem2_inst_~fi_resp.offset (_ BitVec 32))) (not (let ((.cse1 ((_ extract 31 0) (_ bv1000 64)))) (let ((.cse0 (store (let ((.cse2 (let ((.cse3 (store (select |c_#memory_int| |c_ldv_kzalloc_6_#t~ret437.base|) (bvadd |c_ldv_kzalloc_6_#t~ret437.offset| (_ bv193 32)) ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| aem_init_aem2_inst_~fi_resp.base) (bvadd aem_init_aem2_inst_~fi_resp.offset (_ bv4 32)))))))) (store .cse3 (bvadd |c_ldv_kzalloc_6_#t~ret437.offset| (_ bv194 32)) ((_ sign_extend 24) ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ldv_kzalloc_6_#t~ret437.base| .cse3) aem_init_aem2_inst_~fi_resp.base) (bvadd aem_init_aem2_inst_~fi_resp.offset (_ bv5 32))))))))) (store .cse2 (bvadd |c_ldv_kzalloc_6_#t~ret437.offset| (_ bv195 32)) ((_ sign_extend 24) ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ldv_kzalloc_6_#t~ret437.base| .cse2) aem_init_aem2_inst_~fi_resp.base) (bvadd aem_init_aem2_inst_~fi_resp.offset (_ bv6 32))))))) (bvadd |c_ldv_kzalloc_6_#t~ret437.offset| (_ bv1073 32)) .cse1))) (= (store |c_#memory_int| |c_ldv_kzalloc_6_#t~ret437.base| (store .cse0 (bvadd |c_ldv_kzalloc_6_#t~ret437.offset| (_ bv1081 32)) .cse1)) (store |c_#memory_int| |c_ldv_kzalloc_6_#t~ret437.base| (store .cse0 (bvadd |c_ldv_kzalloc_6_#t~ret437.offset| (_ bv1085 32)) ((_ extract 63 32) (_ bv1000 64))))))))) is different from false [2018-11-18 12:05:14,363 WARN L832 $PredicateComparison]: unable to prove that (forall ((aem_init_aem2_inst_~fi_resp.base (_ BitVec 32)) (aem_init_aem2_inst_~fi_resp.offset (_ BitVec 32))) (not (let ((.cse1 ((_ extract 31 0) (_ bv1000 64)))) (let ((.cse0 (store (let ((.cse2 (let ((.cse3 (store (select |c_#memory_int| |c_ldv_zalloc_#res.base|) (bvadd |c_ldv_zalloc_#res.offset| (_ bv193 32)) ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| aem_init_aem2_inst_~fi_resp.base) (bvadd aem_init_aem2_inst_~fi_resp.offset (_ bv4 32)))))))) (store .cse3 (bvadd |c_ldv_zalloc_#res.offset| (_ bv194 32)) ((_ sign_extend 24) ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ldv_zalloc_#res.base| .cse3) aem_init_aem2_inst_~fi_resp.base) (bvadd aem_init_aem2_inst_~fi_resp.offset (_ bv5 32))))))))) (store .cse2 (bvadd |c_ldv_zalloc_#res.offset| (_ bv195 32)) ((_ sign_extend 24) ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ldv_zalloc_#res.base| .cse2) aem_init_aem2_inst_~fi_resp.base) (bvadd aem_init_aem2_inst_~fi_resp.offset (_ bv6 32))))))) (bvadd |c_ldv_zalloc_#res.offset| (_ bv1073 32)) .cse1))) (= (store |c_#memory_int| |c_ldv_zalloc_#res.base| (store .cse0 (bvadd |c_ldv_zalloc_#res.offset| (_ bv1085 32)) ((_ extract 63 32) (_ bv1000 64)))) (store |c_#memory_int| |c_ldv_zalloc_#res.base| (store .cse0 (bvadd |c_ldv_zalloc_#res.offset| (_ bv1081 32)) .cse1))))))) is different from false [2018-11-18 12:05:16,417 WARN L832 $PredicateComparison]: unable to prove that (forall ((aem_init_aem2_inst_~fi_resp.base (_ BitVec 32)) (aem_init_aem2_inst_~fi_resp.offset (_ BitVec 32))) (not (let ((.cse1 ((_ extract 31 0) (_ bv1000 64)))) (let ((.cse0 (store (let ((.cse2 (let ((.cse3 (store (select |c_#memory_int| |c_ldv_zalloc_#t~malloc65.base|) (bvadd |c_ldv_zalloc_#t~malloc65.offset| (_ bv193 32)) ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| aem_init_aem2_inst_~fi_resp.base) (bvadd aem_init_aem2_inst_~fi_resp.offset (_ bv4 32)))))))) (store .cse3 (bvadd |c_ldv_zalloc_#t~malloc65.offset| (_ bv194 32)) ((_ sign_extend 24) ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ldv_zalloc_#t~malloc65.base| .cse3) aem_init_aem2_inst_~fi_resp.base) (bvadd aem_init_aem2_inst_~fi_resp.offset (_ bv5 32))))))))) (store .cse2 (bvadd |c_ldv_zalloc_#t~malloc65.offset| (_ bv195 32)) ((_ sign_extend 24) ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ldv_zalloc_#t~malloc65.base| .cse2) aem_init_aem2_inst_~fi_resp.base) (bvadd aem_init_aem2_inst_~fi_resp.offset (_ bv6 32))))))) (bvadd |c_ldv_zalloc_#t~malloc65.offset| (_ bv1073 32)) .cse1))) (= (store |c_#memory_int| |c_ldv_zalloc_#t~malloc65.base| (store .cse0 (bvadd |c_ldv_zalloc_#t~malloc65.offset| (_ bv1081 32)) .cse1)) (store |c_#memory_int| |c_ldv_zalloc_#t~malloc65.base| (store .cse0 (bvadd |c_ldv_zalloc_#t~malloc65.offset| (_ bv1085 32)) ((_ extract 63 32) (_ bv1000 64))))))))) is different from false [2018-11-18 12:05:18,536 WARN L180 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 145 DAG size of output: 1 [2018-11-18 12:05:18,536 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-11-18 12:05:18,536 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 4 variables, input treesize:274, output treesize:1 [2018-11-18 12:05:20,544 WARN L832 $PredicateComparison]: unable to prove that (forall ((aem_init_aem2_inst_~fi_resp.base (_ BitVec 32)) (|v_ldv_zalloc_#t~malloc65.offset_BEFORE_CALL_3| (_ BitVec 32)) (aem_init_aem2_inst_~fi_resp.offset (_ BitVec 32))) (not (let ((.cse1 ((_ extract 31 0) (_ bv1000 64)))) (let ((.cse0 (store (let ((.cse2 (let ((.cse3 (store (select |c_#memory_int| |c_#Ultimate.meminit_#ptr.base|) (bvadd |v_ldv_zalloc_#t~malloc65.offset_BEFORE_CALL_3| (_ bv193 32)) ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| aem_init_aem2_inst_~fi_resp.base) (bvadd aem_init_aem2_inst_~fi_resp.offset (_ bv4 32)))))))) (store .cse3 (bvadd |v_ldv_zalloc_#t~malloc65.offset_BEFORE_CALL_3| (_ bv194 32)) ((_ sign_extend 24) ((_ extract 7 0) (select (select (store |c_#memory_int| |c_#Ultimate.meminit_#ptr.base| .cse3) aem_init_aem2_inst_~fi_resp.base) (bvadd aem_init_aem2_inst_~fi_resp.offset (_ bv5 32))))))))) (store .cse2 (bvadd |v_ldv_zalloc_#t~malloc65.offset_BEFORE_CALL_3| (_ bv195 32)) ((_ sign_extend 24) ((_ extract 7 0) (select (select (store |c_#memory_int| |c_#Ultimate.meminit_#ptr.base| .cse2) aem_init_aem2_inst_~fi_resp.base) (bvadd aem_init_aem2_inst_~fi_resp.offset (_ bv6 32))))))) (bvadd |v_ldv_zalloc_#t~malloc65.offset_BEFORE_CALL_3| (_ bv1073 32)) .cse1))) (= (store |c_#memory_int| |c_#Ultimate.meminit_#ptr.base| (store .cse0 (bvadd |v_ldv_zalloc_#t~malloc65.offset_BEFORE_CALL_3| (_ bv1085 32)) ((_ extract 63 32) (_ bv1000 64)))) (store |c_#memory_int| |c_#Ultimate.meminit_#ptr.base| (store .cse0 (bvadd |v_ldv_zalloc_#t~malloc65.offset_BEFORE_CALL_3| (_ bv1081 32)) .cse1))))))) is different from false [2018-11-18 12:05:20,871 WARN L180 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 1 [2018-11-18 12:05:20,872 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-11-18 12:05:20,872 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 4 variables, input treesize:274, output treesize:1 [2018-11-18 12:05:21,035 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2018-11-18 12:05:21,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:05:21,040 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d35aa36c-eba9-4488-b57f-36fa6d2b24b8/bin-2019/utaipan/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:05:21,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:05:26,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:05:26,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:05:26,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 12:05:26,675 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 12:05:26,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:05:26,679 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-18 12:05:26,826 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:05:26,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-11-18 12:05:26,827 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 12:05:26,829 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 12:05:26,829 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-11-18 12:05:28,782 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_aem_find_aem2_~#fi_req~0.base_20| (_ BitVec 32))) (and (= (store |c_old(#valid)| |v_aem_find_aem2_~#fi_req~0.base_20| (_ bv0 1)) |c_#valid|) (= (_ bv0 1) (select |c_old(#valid)| |v_aem_find_aem2_~#fi_req~0.base_20|)))) is different from true [2018-11-18 12:05:28,787 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:05:28,789 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:05:28,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-18 12:05:28,790 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 12:05:28,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 12:05:28,797 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:15 [2018-11-18 12:05:29,165 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:05:29,172 INFO L477 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 34 [2018-11-18 12:05:29,173 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-11-18 12:05:29,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-18 12:05:29,219 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:66 [2018-11-18 12:05:29,927 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:05:29,928 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:05:29,929 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:05:29,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 13 [2018-11-18 12:05:29,930 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 12:05:29,952 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:05:29,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 29 [2018-11-18 12:05:29,953 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:05:29,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:05:29,982 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:24 [2018-11-18 12:05:30,353 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 39 [2018-11-18 12:05:30,362 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:05:30,368 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:05:30,383 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:05:30,391 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:05:30,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 138 [2018-11-18 12:05:30,392 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 12:05:30,474 INFO L267 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. [2018-11-18 12:05:30,474 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:121, output treesize:52 [2018-11-18 12:05:30,893 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-18 12:05:30,893 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 12:05:30,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:05:30,895 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:88, output treesize:1 [2018-11-18 12:05:30,947 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2018-11-18 12:05:30,947 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 12:05:30,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:05:30,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [12, 11] total 42 [2018-11-18 12:05:30,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-18 12:05:30,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-18 12:05:30,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1030, Unknown=8, NotChecked=568, Total=1722 [2018-11-18 12:05:30,984 INFO L87 Difference]: Start difference. First operand 1615 states and 2052 transitions. Second operand 42 states. [2018-11-18 12:05:35,475 WARN L832 $PredicateComparison]: unable to prove that (and (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| ((as const (Array (_ BitVec 32) (_ BitVec 32))) #b00000000000000000000000000000000))) (= |c_#valid| |c_old(#valid)|) (forall ((aem_init_aem2_inst_~fi_resp.base (_ BitVec 32)) (|v_ldv_zalloc_#t~malloc65.offset_BEFORE_CALL_3| (_ BitVec 32)) (aem_init_aem2_inst_~fi_resp.offset (_ BitVec 32))) (not (let ((.cse1 ((_ extract 31 0) (_ bv1000 64)))) (let ((.cse0 (store (let ((.cse2 (let ((.cse3 (store (select |c_#memory_int| |c_#Ultimate.meminit_#ptr.base|) (bvadd |v_ldv_zalloc_#t~malloc65.offset_BEFORE_CALL_3| (_ bv193 32)) ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| aem_init_aem2_inst_~fi_resp.base) (bvadd aem_init_aem2_inst_~fi_resp.offset (_ bv4 32)))))))) (store .cse3 (bvadd |v_ldv_zalloc_#t~malloc65.offset_BEFORE_CALL_3| (_ bv194 32)) ((_ sign_extend 24) ((_ extract 7 0) (select (select (store |c_#memory_int| |c_#Ultimate.meminit_#ptr.base| .cse3) aem_init_aem2_inst_~fi_resp.base) (bvadd aem_init_aem2_inst_~fi_resp.offset (_ bv5 32))))))))) (store .cse2 (bvadd |v_ldv_zalloc_#t~malloc65.offset_BEFORE_CALL_3| (_ bv195 32)) ((_ sign_extend 24) ((_ extract 7 0) (select (select (store |c_#memory_int| |c_#Ultimate.meminit_#ptr.base| .cse2) aem_init_aem2_inst_~fi_resp.base) (bvadd aem_init_aem2_inst_~fi_resp.offset (_ bv6 32))))))) (bvadd |v_ldv_zalloc_#t~malloc65.offset_BEFORE_CALL_3| (_ bv1073 32)) .cse1))) (= (store |c_#memory_int| |c_#Ultimate.meminit_#ptr.base| (store .cse0 (bvadd |v_ldv_zalloc_#t~malloc65.offset_BEFORE_CALL_3| (_ bv1085 32)) ((_ extract 63 32) (_ bv1000 64)))) (store |c_#memory_int| |c_#Ultimate.meminit_#ptr.base| (store .cse0 (bvadd |v_ldv_zalloc_#t~malloc65.offset_BEFORE_CALL_3| (_ bv1081 32)) .cse1))))))) (exists ((|v_aem_find_aem2_~#fi_req~0.base_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv1 1) (select |c_#valid| |v_aem_find_aem2_~#fi_req~0.base_BEFORE_CALL_1|)))) is different from false [2018-11-18 12:05:37,831 WARN L832 $PredicateComparison]: unable to prove that (and (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| ((as const (Array (_ BitVec 32) (_ BitVec 32))) #b00000000000000000000000000000000))) (forall ((aem_init_aem2_inst_~fi_resp.base (_ BitVec 32)) (|v_ldv_zalloc_#t~malloc65.offset_BEFORE_CALL_3| (_ BitVec 32)) (aem_init_aem2_inst_~fi_resp.offset (_ BitVec 32))) (not (let ((.cse1 ((_ extract 31 0) (_ bv1000 64)))) (let ((.cse0 (store (let ((.cse2 (let ((.cse3 (store (select |c_#memory_int| |c_#Ultimate.meminit_#ptr.base|) (bvadd |v_ldv_zalloc_#t~malloc65.offset_BEFORE_CALL_3| (_ bv193 32)) ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| aem_init_aem2_inst_~fi_resp.base) (bvadd aem_init_aem2_inst_~fi_resp.offset (_ bv4 32)))))))) (store .cse3 (bvadd |v_ldv_zalloc_#t~malloc65.offset_BEFORE_CALL_3| (_ bv194 32)) ((_ sign_extend 24) ((_ extract 7 0) (select (select (store |c_#memory_int| |c_#Ultimate.meminit_#ptr.base| .cse3) aem_init_aem2_inst_~fi_resp.base) (bvadd aem_init_aem2_inst_~fi_resp.offset (_ bv5 32))))))))) (store .cse2 (bvadd |v_ldv_zalloc_#t~malloc65.offset_BEFORE_CALL_3| (_ bv195 32)) ((_ sign_extend 24) ((_ extract 7 0) (select (select (store |c_#memory_int| |c_#Ultimate.meminit_#ptr.base| .cse2) aem_init_aem2_inst_~fi_resp.base) (bvadd aem_init_aem2_inst_~fi_resp.offset (_ bv6 32))))))) (bvadd |v_ldv_zalloc_#t~malloc65.offset_BEFORE_CALL_3| (_ bv1073 32)) .cse1))) (= (store |c_#memory_int| |c_#Ultimate.meminit_#ptr.base| (store .cse0 (bvadd |v_ldv_zalloc_#t~malloc65.offset_BEFORE_CALL_3| (_ bv1085 32)) ((_ extract 63 32) (_ bv1000 64)))) (store |c_#memory_int| |c_#Ultimate.meminit_#ptr.base| (store .cse0 (bvadd |v_ldv_zalloc_#t~malloc65.offset_BEFORE_CALL_3| (_ bv1081 32)) .cse1)))))))) is different from false [2018-11-18 12:05:59,941 WARN L832 $PredicateComparison]: unable to prove that (and (= |c_ldv_zalloc_#t~malloc65.offset| (_ bv0 32)) (forall ((aem_init_aem2_inst_~fi_resp.base (_ BitVec 32)) (aem_init_aem2_inst_~fi_resp.offset (_ BitVec 32))) (not (let ((.cse1 ((_ extract 31 0) (_ bv1000 64)))) (let ((.cse0 (store (let ((.cse2 (let ((.cse3 (store (select |c_#memory_int| |c_ldv_zalloc_#t~malloc65.base|) (bvadd |c_ldv_zalloc_#t~malloc65.offset| (_ bv193 32)) ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| aem_init_aem2_inst_~fi_resp.base) (bvadd aem_init_aem2_inst_~fi_resp.offset (_ bv4 32)))))))) (store .cse3 (bvadd |c_ldv_zalloc_#t~malloc65.offset| (_ bv194 32)) ((_ sign_extend 24) ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ldv_zalloc_#t~malloc65.base| .cse3) aem_init_aem2_inst_~fi_resp.base) (bvadd aem_init_aem2_inst_~fi_resp.offset (_ bv5 32))))))))) (store .cse2 (bvadd |c_ldv_zalloc_#t~malloc65.offset| (_ bv195 32)) ((_ sign_extend 24) ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ldv_zalloc_#t~malloc65.base| .cse2) aem_init_aem2_inst_~fi_resp.base) (bvadd aem_init_aem2_inst_~fi_resp.offset (_ bv6 32))))))) (bvadd |c_ldv_zalloc_#t~malloc65.offset| (_ bv1073 32)) .cse1))) (= (store |c_#memory_int| |c_ldv_zalloc_#t~malloc65.base| (store .cse0 (bvadd |c_ldv_zalloc_#t~malloc65.offset| (_ bv1081 32)) .cse1)) (store |c_#memory_int| |c_ldv_zalloc_#t~malloc65.base| (store .cse0 (bvadd |c_ldv_zalloc_#t~malloc65.offset| (_ bv1085 32)) ((_ extract 63 32) (_ bv1000 64))))))))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_ldv_zalloc_#t~malloc65.base| ((as const (Array (_ BitVec 32) (_ BitVec 32))) #b00000000000000000000000000000000))) (= (_ bv0 1) (select |c_old(#valid)| |c_ldv_zalloc_#t~malloc65.base|))) is different from false [2018-11-18 12:06:02,055 WARN L832 $PredicateComparison]: unable to prove that (and (= (select |c_old(#valid)| |c_ldv_zalloc_#res.base|) (_ bv0 1)) (forall ((aem_init_aem2_inst_~fi_resp.base (_ BitVec 32)) (aem_init_aem2_inst_~fi_resp.offset (_ BitVec 32))) (not (let ((.cse1 ((_ extract 31 0) (_ bv1000 64)))) (let ((.cse0 (store (let ((.cse2 (let ((.cse3 (store (select |c_#memory_int| |c_ldv_zalloc_#res.base|) (bvadd |c_ldv_zalloc_#res.offset| (_ bv193 32)) ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| aem_init_aem2_inst_~fi_resp.base) (bvadd aem_init_aem2_inst_~fi_resp.offset (_ bv4 32)))))))) (store .cse3 (bvadd |c_ldv_zalloc_#res.offset| (_ bv194 32)) ((_ sign_extend 24) ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ldv_zalloc_#res.base| .cse3) aem_init_aem2_inst_~fi_resp.base) (bvadd aem_init_aem2_inst_~fi_resp.offset (_ bv5 32))))))))) (store .cse2 (bvadd |c_ldv_zalloc_#res.offset| (_ bv195 32)) ((_ sign_extend 24) ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ldv_zalloc_#res.base| .cse2) aem_init_aem2_inst_~fi_resp.base) (bvadd aem_init_aem2_inst_~fi_resp.offset (_ bv6 32))))))) (bvadd |c_ldv_zalloc_#res.offset| (_ bv1073 32)) .cse1))) (= (store |c_#memory_int| |c_ldv_zalloc_#res.base| (store .cse0 (bvadd |c_ldv_zalloc_#res.offset| (_ bv1085 32)) ((_ extract 63 32) (_ bv1000 64)))) (store |c_#memory_int| |c_ldv_zalloc_#res.base| (store .cse0 (bvadd |c_ldv_zalloc_#res.offset| (_ bv1081 32)) .cse1))))))) (= |c_ldv_zalloc_#res.offset| (_ bv0 32)) (= (store |c_old(#memory_int)| |c_ldv_zalloc_#res.base| ((as const (Array (_ BitVec 32) (_ BitVec 32))) #b00000000000000000000000000000000)) |c_#memory_int|)) is different from false [2018-11-18 12:06:04,151 WARN L832 $PredicateComparison]: unable to prove that (and (= (select |c_old(#valid)| |c_ldv_kzalloc_6_#t~ret437.base|) (_ bv0 1)) (= |c_ldv_kzalloc_6_#t~ret437.offset| (_ bv0 32)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_ldv_kzalloc_6_#t~ret437.base| ((as const (Array (_ BitVec 32) (_ BitVec 32))) #b00000000000000000000000000000000))) (forall ((aem_init_aem2_inst_~fi_resp.base (_ BitVec 32)) (aem_init_aem2_inst_~fi_resp.offset (_ BitVec 32))) (not (let ((.cse1 ((_ extract 31 0) (_ bv1000 64)))) (let ((.cse0 (store (let ((.cse2 (let ((.cse3 (store (select |c_#memory_int| |c_ldv_kzalloc_6_#t~ret437.base|) (bvadd |c_ldv_kzalloc_6_#t~ret437.offset| (_ bv193 32)) ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| aem_init_aem2_inst_~fi_resp.base) (bvadd aem_init_aem2_inst_~fi_resp.offset (_ bv4 32)))))))) (store .cse3 (bvadd |c_ldv_kzalloc_6_#t~ret437.offset| (_ bv194 32)) ((_ sign_extend 24) ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ldv_kzalloc_6_#t~ret437.base| .cse3) aem_init_aem2_inst_~fi_resp.base) (bvadd aem_init_aem2_inst_~fi_resp.offset (_ bv5 32))))))))) (store .cse2 (bvadd |c_ldv_kzalloc_6_#t~ret437.offset| (_ bv195 32)) ((_ sign_extend 24) ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ldv_kzalloc_6_#t~ret437.base| .cse2) aem_init_aem2_inst_~fi_resp.base) (bvadd aem_init_aem2_inst_~fi_resp.offset (_ bv6 32))))))) (bvadd |c_ldv_kzalloc_6_#t~ret437.offset| (_ bv1073 32)) .cse1))) (= (store |c_#memory_int| |c_ldv_kzalloc_6_#t~ret437.base| (store .cse0 (bvadd |c_ldv_kzalloc_6_#t~ret437.offset| (_ bv1081 32)) .cse1)) (store |c_#memory_int| |c_ldv_kzalloc_6_#t~ret437.base| (store .cse0 (bvadd |c_ldv_kzalloc_6_#t~ret437.offset| (_ bv1085 32)) ((_ extract 63 32) (_ bv1000 64)))))))))) is different from false [2018-11-18 12:06:06,419 WARN L832 $PredicateComparison]: unable to prove that (and (= (_ bv0 1) (select |c_old(#valid)| |c_ldv_kzalloc_6_#res.base|)) (forall ((aem_init_aem2_inst_~fi_resp.base (_ BitVec 32)) (aem_init_aem2_inst_~fi_resp.offset (_ BitVec 32))) (not (let ((.cse1 ((_ extract 31 0) (_ bv1000 64)))) (let ((.cse0 (store (let ((.cse2 (let ((.cse3 (store (select |c_#memory_int| |c_ldv_kzalloc_6_#res.base|) (bvadd |c_ldv_kzalloc_6_#res.offset| (_ bv193 32)) ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| aem_init_aem2_inst_~fi_resp.base) (bvadd aem_init_aem2_inst_~fi_resp.offset (_ bv4 32)))))))) (store .cse3 (bvadd |c_ldv_kzalloc_6_#res.offset| (_ bv194 32)) ((_ sign_extend 24) ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ldv_kzalloc_6_#res.base| .cse3) aem_init_aem2_inst_~fi_resp.base) (bvadd aem_init_aem2_inst_~fi_resp.offset (_ bv5 32))))))))) (store .cse2 (bvadd |c_ldv_kzalloc_6_#res.offset| (_ bv195 32)) ((_ sign_extend 24) ((_ extract 7 0) (select (select (store |c_#memory_int| |c_ldv_kzalloc_6_#res.base| .cse2) aem_init_aem2_inst_~fi_resp.base) (bvadd aem_init_aem2_inst_~fi_resp.offset (_ bv6 32))))))) (bvadd |c_ldv_kzalloc_6_#res.offset| (_ bv1073 32)) .cse1))) (= (store |c_#memory_int| |c_ldv_kzalloc_6_#res.base| (store .cse0 (bvadd |c_ldv_kzalloc_6_#res.offset| (_ bv1081 32)) .cse1)) (store |c_#memory_int| |c_ldv_kzalloc_6_#res.base| (store .cse0 (bvadd |c_ldv_kzalloc_6_#res.offset| (_ bv1085 32)) ((_ extract 63 32) (_ bv1000 64))))))))) (= |c_ldv_kzalloc_6_#res.offset| (_ bv0 32)) (= (store |c_old(#memory_int)| |c_ldv_kzalloc_6_#res.base| ((as const (Array (_ BitVec 32) (_ BitVec 32))) #b00000000000000000000000000000000)) |c_#memory_int|)) is different from false [2018-11-18 12:06:13,426 WARN L180 SmtUtils]: Spent 2.35 s on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-11-18 12:06:22,141 WARN L180 SmtUtils]: Spent 4.46 s on a formula simplification. DAG size of input: 87 DAG size of output: 65 [2018-11-18 12:06:23,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:06:23,820 INFO L93 Difference]: Finished difference Result 1918 states and 2454 transitions. [2018-11-18 12:06:23,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-18 12:06:23,821 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 357 [2018-11-18 12:06:23,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:06:23,821 INFO L225 Difference]: With dead ends: 1918 [2018-11-18 12:06:23,821 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 12:06:23,824 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1092 GetRequests, 1032 SyntacticMatches, 5 SemanticMatches, 55 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 97.4s TimeCoverageRelationStatistics Valid=183, Invalid=1665, Unknown=14, NotChecked=1330, Total=3192 [2018-11-18 12:06:23,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 12:06:23,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 12:06:23,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 12:06:23,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 12:06:23,825 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 357 [2018-11-18 12:06:23,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:06:23,825 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 12:06:23,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-18 12:06:23,825 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 12:06:23,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 12:06:23,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 12:06:24,793 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 22 [2018-11-18 12:06:25,302 WARN L180 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2018-11-18 12:07:16,492 WARN L180 SmtUtils]: Spent 51.06 s on a formula simplification. DAG size of input: 129 DAG size of output: 120 [2018-11-18 12:07:20,852 WARN L180 SmtUtils]: Spent 4.10 s on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2018-11-18 12:07:20,970 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 26 [2018-11-18 12:08:09,568 WARN L180 SmtUtils]: Spent 48.33 s on a formula simplification. DAG size of input: 129 DAG size of output: 120 [2018-11-18 12:08:14,219 WARN L180 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2018-11-18 12:08:14,441 INFO L428 ceAbstractionStarter]: At program point L3224(line 3224) the Hoare annotation is: true [2018-11-18 12:08:14,441 INFO L425 ceAbstractionStarter]: For program point L3225(lines 3225 3229) no Hoare annotation was computed. [2018-11-18 12:08:14,441 INFO L428 ceAbstractionStarter]: At program point L3222(lines 3208 3233) the Hoare annotation is: true [2018-11-18 12:08:14,441 INFO L425 ceAbstractionStarter]: For program point L3224-1(line 3224) no Hoare annotation was computed. [2018-11-18 12:08:14,441 INFO L425 ceAbstractionStarter]: For program point L3220(line 3220) no Hoare annotation was computed. [2018-11-18 12:08:14,441 INFO L425 ceAbstractionStarter]: For program point L3221(lines 3221 3230) no Hoare annotation was computed. [2018-11-18 12:08:14,441 INFO L428 ceAbstractionStarter]: At program point L3219-1(line 3219) the Hoare annotation is: true [2018-11-18 12:08:14,441 INFO L428 ceAbstractionStarter]: At program point L3219(line 3219) the Hoare annotation is: true [2018-11-18 12:08:14,441 INFO L425 ceAbstractionStarter]: For program point L3217-1(line 3217) no Hoare annotation was computed. [2018-11-18 12:08:14,441 INFO L425 ceAbstractionStarter]: For program point aem_idr_getFINAL(lines 3199 3234) no Hoare annotation was computed. [2018-11-18 12:08:14,441 INFO L428 ceAbstractionStarter]: At program point L3217(line 3217) the Hoare annotation is: true [2018-11-18 12:08:14,442 INFO L425 ceAbstractionStarter]: For program point L3212(lines 3212 3216) no Hoare annotation was computed. [2018-11-18 12:08:14,442 INFO L425 ceAbstractionStarter]: For program point aem_idr_getEXIT(lines 3199 3234) no Hoare annotation was computed. [2018-11-18 12:08:14,442 INFO L425 ceAbstractionStarter]: For program point L3211-1(line 3211) no Hoare annotation was computed. [2018-11-18 12:08:14,442 INFO L428 ceAbstractionStarter]: At program point L3211(line 3211) the Hoare annotation is: true [2018-11-18 12:08:14,442 INFO L428 ceAbstractionStarter]: At program point aem_idr_getENTRY(lines 3199 3234) the Hoare annotation is: true [2018-11-18 12:08:14,442 INFO L425 ceAbstractionStarter]: For program point show_nameEXIT(lines 3818 3830) no Hoare annotation was computed. [2018-11-18 12:08:14,442 INFO L428 ceAbstractionStarter]: At program point show_nameENTRY(lines 3818 3830) the Hoare annotation is: true [2018-11-18 12:08:14,442 INFO L425 ceAbstractionStarter]: For program point show_nameFINAL(lines 3818 3830) no Hoare annotation was computed. [2018-11-18 12:08:14,442 INFO L428 ceAbstractionStarter]: At program point ldv_undef_intENTRY(lines 3015 3023) the Hoare annotation is: true [2018-11-18 12:08:14,442 INFO L425 ceAbstractionStarter]: For program point ldv_undef_intFINAL(lines 3015 3023) no Hoare annotation was computed. [2018-11-18 12:08:14,442 INFO L425 ceAbstractionStarter]: For program point ldv_undef_intEXIT(lines 3015 3023) no Hoare annotation was computed. [2018-11-18 12:08:14,442 INFO L421 ceAbstractionStarter]: At program point L4255(line 4255) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_count_1~0)|)) (and (= (_ bv0 32) ~ldv_count_2~0) (= ~ldv_state_variable_3~0 (_ bv0 32)) (= |old(~ldv_count_1~0)| ~ldv_count_1~0)) (not (= (_ bv0 32) |old(~ldv_count_2~0)|)) (not (= (_ bv0 32) |old(~ldv_state_variable_3~0)|))) [2018-11-18 12:08:14,442 INFO L425 ceAbstractionStarter]: For program point L4255-1(line 4255) no Hoare annotation was computed. [2018-11-18 12:08:14,442 INFO L425 ceAbstractionStarter]: For program point L4354-1(line 4354) no Hoare annotation was computed. [2018-11-18 12:08:14,442 INFO L425 ceAbstractionStarter]: For program point L4379(lines 4379 4390) no Hoare annotation was computed. [2018-11-18 12:08:14,442 INFO L421 ceAbstractionStarter]: At program point L4346(line 4346) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_count_1~0)|)) (and (= (_ bv0 32) ~ldv_count_2~0) (= (_ bv2 32) ~ldv_count_1~0)) (not (= (_ bv0 32) |old(~ldv_count_2~0)|)) (not (= (_ bv0 32) |old(~ldv_state_variable_3~0)|))) [2018-11-18 12:08:14,443 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 4220 4405) no Hoare annotation was computed. [2018-11-18 12:08:14,443 INFO L421 ceAbstractionStarter]: At program point L4313(line 4313) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_count_1~0)|)) (and (= (_ bv0 32) ~ldv_count_2~0) (= (_ bv2 32) ~ldv_count_1~0)) (not (= (_ bv0 32) |old(~ldv_count_2~0)|)) (not (= (_ bv0 32) |old(~ldv_state_variable_3~0)|))) [2018-11-18 12:08:14,443 INFO L425 ceAbstractionStarter]: For program point L4346-1(line 4346) no Hoare annotation was computed. [2018-11-18 12:08:14,443 INFO L425 ceAbstractionStarter]: For program point L4313-1(line 4313) no Hoare annotation was computed. [2018-11-18 12:08:14,443 INFO L425 ceAbstractionStarter]: For program point L4396(line 4396) no Hoare annotation was computed. [2018-11-18 12:08:14,443 INFO L425 ceAbstractionStarter]: For program point L4388(line 4388) no Hoare annotation was computed. [2018-11-18 12:08:14,443 INFO L425 ceAbstractionStarter]: For program point L4314(lines 4314 4321) no Hoare annotation was computed. [2018-11-18 12:08:14,443 INFO L425 ceAbstractionStarter]: For program point L4380(line 4380) no Hoare annotation was computed. [2018-11-18 12:08:14,443 INFO L425 ceAbstractionStarter]: For program point L4281(lines 4281 4292) no Hoare annotation was computed. [2018-11-18 12:08:14,443 INFO L425 ceAbstractionStarter]: For program point L4314-2(lines 4312 4328) no Hoare annotation was computed. [2018-11-18 12:08:14,443 INFO L425 ceAbstractionStarter]: For program point L4298(line 4298) no Hoare annotation was computed. [2018-11-18 12:08:14,443 INFO L428 ceAbstractionStarter]: At program point L4397(line 4397) the Hoare annotation is: true [2018-11-18 12:08:14,443 INFO L421 ceAbstractionStarter]: At program point L4265(line 4265) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_count_1~0)|)) (and (= (_ bv0 32) ~ldv_count_2~0) (= ~ldv_state_variable_3~0 (_ bv0 32)) (= |old(~ldv_count_1~0)| ~ldv_count_1~0)) (not (= (_ bv0 32) |old(~ldv_count_2~0)|)) (not (= (_ bv0 32) |old(~ldv_state_variable_3~0)|))) [2018-11-18 12:08:14,443 INFO L425 ceAbstractionStarter]: For program point L4265-1(line 4265) no Hoare annotation was computed. [2018-11-18 12:08:14,443 INFO L425 ceAbstractionStarter]: For program point L4290(line 4290) no Hoare annotation was computed. [2018-11-18 12:08:14,444 INFO L428 ceAbstractionStarter]: At program point L4389(line 4389) the Hoare annotation is: true [2018-11-18 12:08:14,444 INFO L421 ceAbstractionStarter]: At program point L4257(line 4257) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_count_1~0)|)) (and (= (_ bv0 32) ~ldv_count_2~0) (= ~ldv_state_variable_3~0 (_ bv0 32)) (= |old(~ldv_count_1~0)| ~ldv_count_1~0)) (not (= (_ bv0 32) |old(~ldv_count_2~0)|)) (not (= (_ bv0 32) |old(~ldv_state_variable_3~0)|))) [2018-11-18 12:08:14,444 INFO L425 ceAbstractionStarter]: For program point L4257-1(line 4257) no Hoare annotation was computed. [2018-11-18 12:08:14,444 INFO L425 ceAbstractionStarter]: For program point L4282(line 4282) no Hoare annotation was computed. [2018-11-18 12:08:14,444 INFO L425 ceAbstractionStarter]: For program point L4381(lines 4381 4386) no Hoare annotation was computed. [2018-11-18 12:08:14,444 INFO L421 ceAbstractionStarter]: At program point L4249(line 4249) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_count_1~0)|)) (not (= (_ bv0 32) |old(~ldv_count_2~0)|)) (not (= (_ bv0 32) |old(~ldv_state_variable_3~0)|)) (and (= (_ bv0 32) ~ldv_count_2~0) (= |old(#memory_int)| |#memory_int|) (= ~ldv_state_variable_3~0 (_ bv0 32)) (= |old(~ldv_count_1~0)| ~ldv_count_1~0) (exists ((|v_aem_find_aem2_~#fi_req~0.base_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv1 1) (select |#valid| |v_aem_find_aem2_~#fi_req~0.base_BEFORE_CALL_1|))))) [2018-11-18 12:08:14,444 INFO L425 ceAbstractionStarter]: For program point L4249-1(line 4249) no Hoare annotation was computed. [2018-11-18 12:08:14,444 INFO L425 ceAbstractionStarter]: For program point L4340(line 4340) no Hoare annotation was computed. [2018-11-18 12:08:14,444 INFO L425 ceAbstractionStarter]: For program point L4299(lines 4299 4338) no Hoare annotation was computed. [2018-11-18 12:08:14,444 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 4220 4405) no Hoare annotation was computed. [2018-11-18 12:08:14,444 INFO L425 ceAbstractionStarter]: For program point L4332(line 4332) no Hoare annotation was computed. [2018-11-18 12:08:14,444 INFO L428 ceAbstractionStarter]: At program point L4291(line 4291) the Hoare annotation is: true [2018-11-18 12:08:14,444 INFO L428 ceAbstractionStarter]: At program point L4324(lines 4248 4404) the Hoare annotation is: true [2018-11-18 12:08:14,444 INFO L421 ceAbstractionStarter]: At program point L4382(line 4382) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_count_1~0)|)) (and (= (_ bv0 32) ~ldv_count_2~0) (= (_ bv2 32) ~ldv_count_1~0)) (not (= (_ bv0 32) |old(~ldv_count_2~0)|)) (not (= (_ bv0 32) |old(~ldv_state_variable_3~0)|))) [2018-11-18 12:08:14,444 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 4220 4405) the Hoare annotation is: (or (and (= (_ bv0 32) ~ldv_count_2~0) (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|) (= ~ldv_state_variable_3~0 (_ bv0 32)) (= |old(~ldv_count_1~0)| ~ldv_count_1~0)) (not (= (_ bv0 32) |old(~ldv_count_1~0)|)) (not (= (_ bv0 32) |old(~ldv_count_2~0)|)) (not (= (_ bv0 32) |old(~ldv_state_variable_3~0)|))) [2018-11-18 12:08:14,444 INFO L425 ceAbstractionStarter]: For program point L4283(lines 4283 4288) no Hoare annotation was computed. [2018-11-18 12:08:14,444 INFO L425 ceAbstractionStarter]: For program point L4382-1(line 4382) no Hoare annotation was computed. [2018-11-18 12:08:14,444 INFO L425 ceAbstractionStarter]: For program point L4341(lines 4341 4374) no Hoare annotation was computed. [2018-11-18 12:08:14,444 INFO L421 ceAbstractionStarter]: At program point L4399(lines 4248 4404) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_count_1~0)|)) (and (= (_ bv0 32) ~ldv_count_2~0) (= (_ bv2 32) ~ldv_count_1~0)) (not (= (_ bv0 32) |old(~ldv_count_2~0)|)) (not (= (_ bv0 32) |old(~ldv_state_variable_3~0)|))) [2018-11-18 12:08:14,444 INFO L421 ceAbstractionStarter]: At program point L4267(line 4267) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_count_1~0)|)) (and (= (_ bv0 32) ~ldv_count_2~0) (= ~ldv_state_variable_3~0 (_ bv0 32)) (= |old(~ldv_count_1~0)| ~ldv_count_1~0)) (not (= (_ bv0 32) |old(~ldv_count_2~0)|)) (not (= (_ bv0 32) |old(~ldv_state_variable_3~0)|))) [2018-11-18 12:08:14,444 INFO L421 ceAbstractionStarter]: At program point L4267-1(line 4267) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_count_1~0)|)) (and (= (_ bv0 32) ~ldv_count_2~0) (= ~ldv_state_variable_3~0 (_ bv0 32)) (= (_ bv2 32) ~ldv_count_1~0)) (not (= (_ bv0 32) |old(~ldv_count_2~0)|)) (not (= (_ bv0 32) |old(~ldv_state_variable_3~0)|))) [2018-11-18 12:08:14,444 INFO L428 ceAbstractionStarter]: At program point L4333(line 4333) the Hoare annotation is: true [2018-11-18 12:08:14,445 INFO L421 ceAbstractionStarter]: At program point L4259(line 4259) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_count_1~0)|)) (and (= (_ bv0 32) ~ldv_count_2~0) (= ~ldv_state_variable_3~0 (_ bv0 32)) (= |old(~ldv_count_1~0)| ~ldv_count_1~0)) (not (= (_ bv0 32) |old(~ldv_count_2~0)|)) (not (= (_ bv0 32) |old(~ldv_state_variable_3~0)|))) [2018-11-18 12:08:14,445 INFO L425 ceAbstractionStarter]: For program point L4259-1(line 4259) no Hoare annotation was computed. [2018-11-18 12:08:14,445 INFO L421 ceAbstractionStarter]: At program point L4251(line 4251) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_count_1~0)|)) (and (= (_ bv0 32) ~ldv_count_2~0) (= ~ldv_state_variable_3~0 (_ bv0 32)) (= |old(~ldv_count_1~0)| ~ldv_count_1~0)) (not (= (_ bv0 32) |old(~ldv_count_2~0)|)) (not (= (_ bv0 32) |old(~ldv_state_variable_3~0)|))) [2018-11-18 12:08:14,445 INFO L425 ceAbstractionStarter]: For program point L4284-1(line 4284) no Hoare annotation was computed. [2018-11-18 12:08:14,445 INFO L425 ceAbstractionStarter]: For program point L4251-1(line 4251) no Hoare annotation was computed. [2018-11-18 12:08:14,445 INFO L421 ceAbstractionStarter]: At program point L4284(line 4284) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_count_1~0)|)) (and (= (_ bv0 32) ~ldv_count_2~0) (= (_ bv2 32) ~ldv_count_1~0)) (not (= (_ bv0 32) |old(~ldv_count_2~0)|)) (not (= (_ bv0 32) |old(~ldv_state_variable_3~0)|))) [2018-11-18 12:08:14,445 INFO L425 ceAbstractionStarter]: For program point L4301(lines 4301 4334) no Hoare annotation was computed. [2018-11-18 12:08:14,445 INFO L425 ceAbstractionStarter]: For program point L4268(line 4268) no Hoare annotation was computed. [2018-11-18 12:08:14,445 INFO L425 ceAbstractionStarter]: For program point L4343(lines 4343 4370) no Hoare annotation was computed. [2018-11-18 12:08:14,445 INFO L425 ceAbstractionStarter]: For program point L4376(line 4376) no Hoare annotation was computed. [2018-11-18 12:08:14,445 INFO L425 ceAbstractionStarter]: For program point L4277(lines 4277 4398) no Hoare annotation was computed. [2018-11-18 12:08:14,445 INFO L425 ceAbstractionStarter]: For program point L4302(line 4302) no Hoare annotation was computed. [2018-11-18 12:08:14,445 INFO L425 ceAbstractionStarter]: For program point L4368(line 4368) no Hoare annotation was computed. [2018-11-18 12:08:14,445 INFO L421 ceAbstractionStarter]: At program point L4269(line 4269) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_count_1~0)|)) (and (= (_ bv0 32) ~ldv_count_2~0) (= ~ldv_state_variable_3~0 (_ bv0 32)) (= (_ bv2 32) ~ldv_count_1~0)) (not (= (_ bv0 32) |old(~ldv_count_2~0)|)) (not (= (_ bv0 32) |old(~ldv_state_variable_3~0)|))) [2018-11-18 12:08:14,445 INFO L425 ceAbstractionStarter]: For program point L4269-1(line 4269) no Hoare annotation was computed. [2018-11-18 12:08:14,445 INFO L425 ceAbstractionStarter]: For program point L4360(line 4360) no Hoare annotation was computed. [2018-11-18 12:08:14,445 INFO L421 ceAbstractionStarter]: At program point L4261(line 4261) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_count_1~0)|)) (and (= (_ bv0 32) ~ldv_count_2~0) (= ~ldv_state_variable_3~0 (_ bv0 32)) (= |old(~ldv_count_1~0)| ~ldv_count_1~0)) (not (= (_ bv0 32) |old(~ldv_count_2~0)|)) (not (= (_ bv0 32) |old(~ldv_state_variable_3~0)|))) [2018-11-18 12:08:14,445 INFO L425 ceAbstractionStarter]: For program point L4261-1(line 4261) no Hoare annotation was computed. [2018-11-18 12:08:14,445 INFO L425 ceAbstractionStarter]: For program point L4352(line 4352) no Hoare annotation was computed. [2018-11-18 12:08:14,445 INFO L421 ceAbstractionStarter]: At program point L4253(line 4253) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_count_1~0)|)) (and (= (_ bv0 32) ~ldv_count_2~0) (= ~ldv_state_variable_3~0 (_ bv0 32)) (= |old(~ldv_count_1~0)| ~ldv_count_1~0)) (not (= (_ bv0 32) |old(~ldv_count_2~0)|)) (not (= (_ bv0 32) |old(~ldv_state_variable_3~0)|))) [2018-11-18 12:08:14,445 INFO L425 ceAbstractionStarter]: For program point L4253-1(line 4253) no Hoare annotation was computed. [2018-11-18 12:08:14,445 INFO L425 ceAbstractionStarter]: For program point L4311(line 4311) no Hoare annotation was computed. [2018-11-18 12:08:14,445 INFO L425 ceAbstractionStarter]: For program point L4278(line 4278) no Hoare annotation was computed. [2018-11-18 12:08:14,445 INFO L425 ceAbstractionStarter]: For program point L4377(lines 4377 4394) no Hoare annotation was computed. [2018-11-18 12:08:14,446 INFO L425 ceAbstractionStarter]: For program point L4344(line 4344) no Hoare annotation was computed. [2018-11-18 12:08:14,446 INFO L425 ceAbstractionStarter]: For program point L4303(lines 4303 4309) no Hoare annotation was computed. [2018-11-18 12:08:14,446 INFO L428 ceAbstractionStarter]: At program point L4369(line 4369) the Hoare annotation is: true [2018-11-18 12:08:14,446 INFO L425 ceAbstractionStarter]: For program point L4361(lines 4361 4366) no Hoare annotation was computed. [2018-11-18 12:08:14,446 INFO L425 ceAbstractionStarter]: For program point L4353(lines 4353 4358) no Hoare annotation was computed. [2018-11-18 12:08:14,446 INFO L425 ceAbstractionStarter]: For program point L4279(lines 4279 4296) no Hoare annotation was computed. [2018-11-18 12:08:14,446 INFO L425 ceAbstractionStarter]: For program point L4345(lines 4345 4350) no Hoare annotation was computed. [2018-11-18 12:08:14,446 INFO L425 ceAbstractionStarter]: For program point L4312(lines 4312 4330) no Hoare annotation was computed. [2018-11-18 12:08:14,446 INFO L425 ceAbstractionStarter]: For program point L4304-1(line 4304) no Hoare annotation was computed. [2018-11-18 12:08:14,446 INFO L428 ceAbstractionStarter]: At program point L4304(line 4304) the Hoare annotation is: true [2018-11-18 12:08:14,446 INFO L421 ceAbstractionStarter]: At program point L4362(line 4362) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_count_1~0)|)) (and (= (_ bv0 32) ~ldv_count_2~0) (= (_ bv2 32) ~ldv_count_1~0)) (not (= (_ bv0 32) |old(~ldv_count_2~0)|)) (not (= (_ bv0 32) |old(~ldv_state_variable_3~0)|))) [2018-11-18 12:08:14,446 INFO L421 ceAbstractionStarter]: At program point L4263(line 4263) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_count_1~0)|)) (and (= (_ bv0 32) ~ldv_count_2~0) (= ~ldv_state_variable_3~0 (_ bv0 32)) (= |old(~ldv_count_1~0)| ~ldv_count_1~0)) (not (= (_ bv0 32) |old(~ldv_count_2~0)|)) (not (= (_ bv0 32) |old(~ldv_state_variable_3~0)|))) [2018-11-18 12:08:14,446 INFO L425 ceAbstractionStarter]: For program point L4263-1(line 4263) no Hoare annotation was computed. [2018-11-18 12:08:14,446 INFO L425 ceAbstractionStarter]: For program point L4362-1(line 4362) no Hoare annotation was computed. [2018-11-18 12:08:14,447 INFO L421 ceAbstractionStarter]: At program point L4354(line 4354) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_count_1~0)|)) (and (= (_ bv0 32) ~ldv_count_2~0) (= (_ bv2 32) ~ldv_count_1~0)) (not (= (_ bv0 32) |old(~ldv_count_2~0)|)) (not (= (_ bv0 32) |old(~ldv_state_variable_3~0)|))) [2018-11-18 12:08:14,447 INFO L425 ceAbstractionStarter]: For program point L3182(lines 3182 3186) no Hoare annotation was computed. [2018-11-18 12:08:14,447 INFO L425 ceAbstractionStarter]: For program point aem_msg_handlerFINAL(lines 3157 3198) no Hoare annotation was computed. [2018-11-18 12:08:14,447 INFO L425 ceAbstractionStarter]: For program point L3180(lines 3180 3193) no Hoare annotation was computed. [2018-11-18 12:08:14,447 INFO L425 ceAbstractionStarter]: For program point L3182-2(lines 3182 3186) no Hoare annotation was computed. [2018-11-18 12:08:14,447 INFO L425 ceAbstractionStarter]: For program point L3180-2(lines 3180 3193) no Hoare annotation was computed. [2018-11-18 12:08:14,447 INFO L425 ceAbstractionStarter]: For program point L3166(lines 3166 3173) no Hoare annotation was computed. [2018-11-18 12:08:14,447 INFO L425 ceAbstractionStarter]: For program point L3189-1(lines 3189 3190) no Hoare annotation was computed. [2018-11-18 12:08:14,447 INFO L428 ceAbstractionStarter]: At program point L3189(lines 3189 3190) the Hoare annotation is: true [2018-11-18 12:08:14,447 INFO L421 ceAbstractionStarter]: At program point aem_msg_handlerENTRY(lines 3157 3198) the Hoare annotation is: (or (= |old(#memory_int)| |#memory_int|) (not (= (_ bv2 32) ~ldv_count_1~0)) (not (= (_ bv0 32) ~ldv_count_2~0))) [2018-11-18 12:08:14,447 INFO L425 ceAbstractionStarter]: For program point L3175(lines 3175 3179) no Hoare annotation was computed. [2018-11-18 12:08:14,447 INFO L425 ceAbstractionStarter]: For program point aem_msg_handlerEXIT(lines 3157 3198) no Hoare annotation was computed. [2018-11-18 12:08:14,447 INFO L425 ceAbstractionStarter]: For program point L3175-2(lines 3175 3179) no Hoare annotation was computed. [2018-11-18 12:08:14,447 INFO L425 ceAbstractionStarter]: For program point L3774(lines 3774 3778) no Hoare annotation was computed. [2018-11-18 12:08:14,447 INFO L425 ceAbstractionStarter]: For program point L3773-1(line 3773) no Hoare annotation was computed. [2018-11-18 12:08:14,447 INFO L421 ceAbstractionStarter]: At program point aem_register_bmcENTRY(lines 3767 3784) the Hoare annotation is: (or (and (= (_ bv0 32) ~ldv_count_2~0) (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|)) (not (= (_ bv2 32) ~ldv_count_1~0)) (not (= (_ bv0 32) |old(~ldv_count_2~0)|))) [2018-11-18 12:08:14,447 INFO L421 ceAbstractionStarter]: At program point L3773(line 3773) the Hoare annotation is: (or (not (= (_ bv2 32) ~ldv_count_1~0)) (not (= (_ bv0 32) |old(~ldv_count_2~0)|)) (and (= (_ bv0 32) ~ldv_count_2~0) (= |old(#memory_int)| |#memory_int|) (exists ((|v_aem_find_aem2_~#fi_req~0.base_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv1 1) (select |#valid| |v_aem_find_aem2_~#fi_req~0.base_BEFORE_CALL_1|))))) [2018-11-18 12:08:14,447 INFO L425 ceAbstractionStarter]: For program point aem_register_bmcFINAL(lines 3767 3784) no Hoare annotation was computed. [2018-11-18 12:08:14,447 INFO L421 ceAbstractionStarter]: At program point L3780(line 3780) the Hoare annotation is: (or (= (_ bv0 32) ~ldv_count_2~0) (not (= (_ bv2 32) ~ldv_count_1~0)) (not (= (_ bv0 32) |old(~ldv_count_2~0)|))) [2018-11-18 12:08:14,447 INFO L425 ceAbstractionStarter]: For program point L3779-1(line 3779) no Hoare annotation was computed. [2018-11-18 12:08:14,448 INFO L425 ceAbstractionStarter]: For program point aem_register_bmcEXIT(lines 3767 3784) no Hoare annotation was computed. [2018-11-18 12:08:14,448 INFO L421 ceAbstractionStarter]: At program point L3779(line 3779) the Hoare annotation is: (or (and (= (_ bv0 32) ~ldv_count_2~0) (exists ((|v_aem_find_aem2_~#fi_req~0.base_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv1 1) (select |#valid| |v_aem_find_aem2_~#fi_req~0.base_BEFORE_CALL_1|)))) (not (= (_ bv2 32) ~ldv_count_1~0)) (not (= (_ bv0 32) |old(~ldv_count_2~0)|))) [2018-11-18 12:08:14,448 INFO L425 ceAbstractionStarter]: For program point L3780-1(line 3780) no Hoare annotation was computed. [2018-11-18 12:08:14,448 INFO L425 ceAbstractionStarter]: For program point ldv_stopFINAL(lines 3042 3050) no Hoare annotation was computed. [2018-11-18 12:08:14,448 INFO L425 ceAbstractionStarter]: For program point ldv_stopEXIT(lines 3042 3050) no Hoare annotation was computed. [2018-11-18 12:08:14,448 INFO L428 ceAbstractionStarter]: At program point ldv_stopENTRY(lines 3042 3050) the Hoare annotation is: true [2018-11-18 12:08:14,448 INFO L421 ceAbstractionStarter]: At program point L3582(lines 3566 3588) the Hoare annotation is: (or (= (_ bv0 32) ~ldv_count_2~0) (not (= (_ bv2 32) ~ldv_count_1~0)) (not (= (_ bv0 32) |old(~ldv_count_2~0)|)) (forall ((|v_aem_find_aem2_~#fi_req~0.base_BEFORE_CALL_1| (_ BitVec 32))) (not (= (_ bv1 1) (select |old(#valid)| |v_aem_find_aem2_~#fi_req~0.base_BEFORE_CALL_1|))))) [2018-11-18 12:08:14,448 INFO L421 ceAbstractionStarter]: At program point L3580(lines 3566 3588) the Hoare annotation is: (or (= (_ bv0 32) ~ldv_count_2~0) (not (= (_ bv2 32) ~ldv_count_1~0)) (not (= (_ bv0 32) |old(~ldv_count_2~0)|)) (forall ((|v_aem_find_aem2_~#fi_req~0.base_BEFORE_CALL_1| (_ BitVec 32))) (not (= (_ bv1 1) (select |old(#valid)| |v_aem_find_aem2_~#fi_req~0.base_BEFORE_CALL_1|))))) [2018-11-18 12:08:14,448 INFO L425 ceAbstractionStarter]: For program point aem_init_aem1FINAL(lines 3560 3589) no Hoare annotation was computed. [2018-11-18 12:08:14,448 INFO L425 ceAbstractionStarter]: For program point aem_init_aem1EXIT(lines 3560 3589) no Hoare annotation was computed. [2018-11-18 12:08:14,448 INFO L425 ceAbstractionStarter]: For program point L3572(lines 3572 3578) no Hoare annotation was computed. [2018-11-18 12:08:14,448 INFO L425 ceAbstractionStarter]: For program point L3571(line 3571) no Hoare annotation was computed. [2018-11-18 12:08:14,448 INFO L425 ceAbstractionStarter]: For program point L3567-1(line 3567) no Hoare annotation was computed. [2018-11-18 12:08:14,449 INFO L421 ceAbstractionStarter]: At program point L3567(line 3567) the Hoare annotation is: (or (and (= (_ bv0 32) ~ldv_count_2~0) (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|)) (not (= (_ bv2 32) ~ldv_count_1~0)) (not (= (_ bv0 32) |old(~ldv_count_2~0)|)) (forall ((|v_aem_find_aem2_~#fi_req~0.base_BEFORE_CALL_1| (_ BitVec 32))) (not (= (_ bv1 1) (select |old(#valid)| |v_aem_find_aem2_~#fi_req~0.base_BEFORE_CALL_1|))))) [2018-11-18 12:08:14,449 INFO L421 ceAbstractionStarter]: At program point aem_init_aem1ENTRY(lines 3560 3589) the Hoare annotation is: (or (and (= (_ bv0 32) ~ldv_count_2~0) (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|)) (not (= (_ bv2 32) ~ldv_count_1~0)) (not (= (_ bv0 32) |old(~ldv_count_2~0)|)) (forall ((|v_aem_find_aem2_~#fi_req~0.base_BEFORE_CALL_1| (_ BitVec 32))) (not (= (_ bv1 1) (select |old(#valid)| |v_aem_find_aem2_~#fi_req~0.base_BEFORE_CALL_1|))))) [2018-11-18 12:08:14,449 INFO L421 ceAbstractionStarter]: At program point ldv_initializeENTRY(lines 4560 4569) the Hoare annotation is: (or (= |old(~ldv_count_1~0)| ~ldv_count_1~0) (not (= (_ bv0 32) |old(~ldv_count_1~0)|)) (not (= (_ bv0 32) ~ldv_count_2~0)) (not (= (_ bv0 32) ~ldv_state_variable_3~0))) [2018-11-18 12:08:14,449 INFO L425 ceAbstractionStarter]: For program point ldv_initializeFINAL(lines 4560 4569) no Hoare annotation was computed. [2018-11-18 12:08:14,449 INFO L425 ceAbstractionStarter]: For program point ldv_initializeEXIT(lines 4560 4569) no Hoare annotation was computed. [2018-11-18 12:08:14,449 INFO L425 ceAbstractionStarter]: For program point aem_init_aem2FINAL(lines 3728 3766) no Hoare annotation was computed. [2018-11-18 12:08:14,449 INFO L425 ceAbstractionStarter]: For program point L3739(lines 3739 3746) no Hoare annotation was computed. [2018-11-18 12:08:14,449 INFO L425 ceAbstractionStarter]: For program point aem_init_aem2EXIT(lines 3728 3766) no Hoare annotation was computed. [2018-11-18 12:08:14,449 INFO L425 ceAbstractionStarter]: For program point L3758(lines 3758 3762) no Hoare annotation was computed. [2018-11-18 12:08:14,449 INFO L421 ceAbstractionStarter]: At program point L3759(lines 3735 3765) the Hoare annotation is: (or (= (_ bv0 32) ~ldv_count_2~0) (not (= (_ bv2 32) ~ldv_count_1~0)) (not (= (_ bv0 32) |old(~ldv_count_2~0)|))) [2018-11-18 12:08:14,449 INFO L421 ceAbstractionStarter]: At program point aem_init_aem2ENTRY(lines 3728 3766) the Hoare annotation is: (or (and (= (_ bv0 32) ~ldv_count_2~0) (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|)) (not (= (_ bv2 32) ~ldv_count_1~0)) (not (= (_ bv0 32) |old(~ldv_count_2~0)|))) [2018-11-18 12:08:14,449 INFO L421 ceAbstractionStarter]: At program point L3756(lines 3735 3765) the Hoare annotation is: (or (= (_ bv0 32) ~ldv_count_2~0) (not (= (_ bv2 32) ~ldv_count_1~0)) (not (= (_ bv0 32) |old(~ldv_count_2~0)|))) [2018-11-18 12:08:14,449 INFO L425 ceAbstractionStarter]: For program point L3757(line 3757) no Hoare annotation was computed. [2018-11-18 12:08:14,449 INFO L425 ceAbstractionStarter]: For program point L3748(lines 3748 3754) no Hoare annotation was computed. [2018-11-18 12:08:14,449 INFO L425 ceAbstractionStarter]: For program point L3747-1(line 3747) no Hoare annotation was computed. [2018-11-18 12:08:14,449 INFO L421 ceAbstractionStarter]: At program point L3747(line 3747) the Hoare annotation is: (or (= (_ bv0 32) ~ldv_count_2~0) (not (= (_ bv2 32) ~ldv_count_1~0)) (not (= (_ bv0 32) |old(~ldv_count_2~0)|))) [2018-11-18 12:08:14,449 INFO L421 ceAbstractionStarter]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: (let ((.cse0 (= |old(#memory_int)| |#memory_int|)) (.cse1 (not (= (_ bv0 32) ~ldv_count_2~0))) (.cse2 (forall ((|v_aem_find_aem2_~#fi_req~0.base_BEFORE_CALL_1| (_ BitVec 32))) (not (= (_ bv1 1) (select |#valid| |v_aem_find_aem2_~#fi_req~0.base_BEFORE_CALL_1|)))))) (and (or (not (= (_ bv0 32) ~ldv_count_1~0)) .cse0 .cse1 (not (= (_ bv0 32) ~ldv_state_variable_3~0)) .cse2) (or .cse0 (not (= (_ bv2 32) ~ldv_count_1~0)) .cse1 .cse2))) [2018-11-18 12:08:14,449 INFO L425 ceAbstractionStarter]: For program point #Ultimate.meminitEXIT(line -1) no Hoare annotation was computed. [2018-11-18 12:08:14,449 INFO L425 ceAbstractionStarter]: For program point #Ultimate.meminitFINAL(line -1) no Hoare annotation was computed. [2018-11-18 12:08:14,450 INFO L428 ceAbstractionStarter]: At program point L4478(line 4478) the Hoare annotation is: true [2018-11-18 12:08:14,450 INFO L428 ceAbstractionStarter]: At program point ldv_undef_int_negativeENTRY(lines 4469 4484) the Hoare annotation is: true [2018-11-18 12:08:14,450 INFO L428 ceAbstractionStarter]: At program point L4475(line 4475) the Hoare annotation is: true [2018-11-18 12:08:14,450 INFO L425 ceAbstractionStarter]: For program point L4475-1(line 4475) no Hoare annotation was computed. [2018-11-18 12:08:14,450 INFO L425 ceAbstractionStarter]: For program point L4477(lines 4477 4481) no Hoare annotation was computed. [2018-11-18 12:08:14,450 INFO L425 ceAbstractionStarter]: For program point L4477-1(lines 4477 4481) no Hoare annotation was computed. [2018-11-18 12:08:14,450 INFO L425 ceAbstractionStarter]: For program point ldv_undef_int_negativeFINAL(lines 4469 4484) no Hoare annotation was computed. [2018-11-18 12:08:14,450 INFO L425 ceAbstractionStarter]: For program point ldv_undef_int_negativeEXIT(lines 4469 4484) no Hoare annotation was computed. [2018-11-18 12:08:14,450 INFO L425 ceAbstractionStarter]: For program point aem_init_ipmi_dataEXIT(lines 3104 3128) no Hoare annotation was computed. [2018-11-18 12:08:14,450 INFO L425 ceAbstractionStarter]: For program point L3119(lines 3119 3125) no Hoare annotation was computed. [2018-11-18 12:08:14,450 INFO L425 ceAbstractionStarter]: For program point aem_init_ipmi_dataFINAL(lines 3104 3128) no Hoare annotation was computed. [2018-11-18 12:08:14,450 INFO L421 ceAbstractionStarter]: At program point aem_init_ipmi_dataENTRY(lines 3104 3128) the Hoare annotation is: (or (and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|)) (not (= (_ bv2 32) ~ldv_count_1~0)) (not (= (_ bv0 32) ~ldv_count_2~0)) (forall ((|v_aem_find_aem2_~#fi_req~0.base_BEFORE_CALL_1| (_ BitVec 32))) (not (= (_ bv1 1) (select |old(#valid)| |v_aem_find_aem2_~#fi_req~0.base_BEFORE_CALL_1|))))) [2018-11-18 12:08:14,450 INFO L425 ceAbstractionStarter]: For program point L3109-1(line 3109) no Hoare annotation was computed. [2018-11-18 12:08:14,450 INFO L421 ceAbstractionStarter]: At program point L3109(line 3109) the Hoare annotation is: (or (and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|)) (not (= (_ bv2 32) ~ldv_count_1~0)) (not (= (_ bv0 32) ~ldv_count_2~0)) (forall ((|v_aem_find_aem2_~#fi_req~0.base_BEFORE_CALL_1| (_ BitVec 32))) (not (= (_ bv1 1) (select |old(#valid)| |v_aem_find_aem2_~#fi_req~0.base_BEFORE_CALL_1|))))) [2018-11-18 12:08:14,450 INFO L421 ceAbstractionStarter]: At program point #Ultimate.C_memcpyENTRY(line -1) the Hoare annotation is: (or (= |old(#memory_int)| |#memory_int|) (not (= (_ bv2 32) ~ldv_count_1~0)) (not (= (_ bv0 32) ~ldv_count_2~0))) [2018-11-18 12:08:14,450 INFO L428 ceAbstractionStarter]: At program point L-1-1(line -1) the Hoare annotation is: true [2018-11-18 12:08:14,450 INFO L425 ceAbstractionStarter]: For program point #Ultimate.C_memcpyEXIT(line -1) no Hoare annotation was computed. [2018-11-18 12:08:14,450 INFO L425 ceAbstractionStarter]: For program point #Ultimate.C_memcpyFINAL(line -1) no Hoare annotation was computed. [2018-11-18 12:08:14,450 INFO L428 ceAbstractionStarter]: At program point aem1_find_sensorsENTRY(lines 4142 4151) the Hoare annotation is: true [2018-11-18 12:08:14,450 INFO L425 ceAbstractionStarter]: For program point aem1_find_sensorsFINAL(lines 4142 4151) no Hoare annotation was computed. [2018-11-18 12:08:14,450 INFO L425 ceAbstractionStarter]: For program point L4147-1(lines 4147 4148) no Hoare annotation was computed. [2018-11-18 12:08:14,450 INFO L428 ceAbstractionStarter]: At program point L4147(lines 4147 4148) the Hoare annotation is: true [2018-11-18 12:08:14,450 INFO L425 ceAbstractionStarter]: For program point aem1_find_sensorsEXIT(lines 4142 4151) no Hoare annotation was computed. [2018-11-18 12:08:14,450 INFO L425 ceAbstractionStarter]: For program point ldv_is_errEXIT(lines 4485 4492) no Hoare annotation was computed. [2018-11-18 12:08:14,451 INFO L428 ceAbstractionStarter]: At program point ldv_is_errENTRY(lines 4485 4492) the Hoare annotation is: true [2018-11-18 12:08:14,451 INFO L425 ceAbstractionStarter]: For program point ldv_is_errFINAL(lines 4485 4492) no Hoare annotation was computed. [2018-11-18 12:08:14,451 INFO L425 ceAbstractionStarter]: For program point L3615(line 3615) no Hoare annotation was computed. [2018-11-18 12:08:14,451 INFO L425 ceAbstractionStarter]: For program point aem_find_aem2EXIT(lines 3590 3631) no Hoare annotation was computed. [2018-11-18 12:08:14,451 INFO L425 ceAbstractionStarter]: For program point L3615-2(lines 3615 3628) no Hoare annotation was computed. [2018-11-18 12:08:14,451 INFO L425 ceAbstractionStarter]: For program point L3610(lines 3610 3614) no Hoare annotation was computed. [2018-11-18 12:08:14,451 INFO L425 ceAbstractionStarter]: For program point L3607-1(line 3607) no Hoare annotation was computed. [2018-11-18 12:08:14,451 INFO L421 ceAbstractionStarter]: At program point L3607(line 3607) the Hoare annotation is: (or (not (= (_ bv2 32) ~ldv_count_1~0)) (not (= (_ bv0 32) ~ldv_count_2~0)) (and (= (_ bv0 1) (select |old(#valid)| |aem_find_aem2_~#fi_req~0.base|)) (= |#valid| (store |old(#valid)| |aem_find_aem2_~#fi_req~0.base| (_ bv1 1))))) [2018-11-18 12:08:14,451 INFO L421 ceAbstractionStarter]: At program point aem_find_aem2ENTRY(lines 3590 3631) the Hoare annotation is: (or (and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|)) (not (= (_ bv2 32) ~ldv_count_1~0)) (not (= (_ bv0 32) ~ldv_count_2~0))) [2018-11-18 12:08:14,451 INFO L425 ceAbstractionStarter]: For program point L3623(lines 3623 3627) no Hoare annotation was computed. [2018-11-18 12:08:14,451 INFO L425 ceAbstractionStarter]: For program point L3620(lines 3620 3627) no Hoare annotation was computed. [2018-11-18 12:08:14,451 INFO L425 ceAbstractionStarter]: For program point aem_find_aem2FINAL(lines 3590 3631) no Hoare annotation was computed. [2018-11-18 12:08:14,451 INFO L425 ceAbstractionStarter]: For program point ldv_kzalloc_6EXIT(lines 4415 4423) no Hoare annotation was computed. [2018-11-18 12:08:14,451 INFO L425 ceAbstractionStarter]: For program point L4420-1(line 4420) no Hoare annotation was computed. [2018-11-18 12:08:14,451 INFO L421 ceAbstractionStarter]: At program point ldv_kzalloc_6ENTRY(lines 4415 4423) the Hoare annotation is: (or (and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|)) (not (= (_ bv2 32) ~ldv_count_1~0)) (not (= (_ bv0 32) ~ldv_count_2~0)) (forall ((|v_aem_find_aem2_~#fi_req~0.base_BEFORE_CALL_1| (_ BitVec 32))) (not (= (_ bv1 1) (select |old(#valid)| |v_aem_find_aem2_~#fi_req~0.base_BEFORE_CALL_1|))))) [2018-11-18 12:08:14,451 INFO L425 ceAbstractionStarter]: For program point ldv_kzalloc_6FINAL(lines 4415 4423) no Hoare annotation was computed. [2018-11-18 12:08:14,451 INFO L421 ceAbstractionStarter]: At program point L4420(line 4420) the Hoare annotation is: (or (and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|)) (not (= (_ bv2 32) ~ldv_count_1~0)) (not (= (_ bv0 32) ~ldv_count_2~0)) (forall ((|v_aem_find_aem2_~#fi_req~0.base_BEFORE_CALL_1| (_ BitVec 32))) (not (= (_ bv1 1) (select |old(#valid)| |v_aem_find_aem2_~#fi_req~0.base_BEFORE_CALL_1|))))) [2018-11-18 12:08:14,452 INFO L421 ceAbstractionStarter]: At program point L3136(lines 3133 3155) the Hoare annotation is: (or (= |old(#memory_int)| |#memory_int|) (not (= (_ bv2 32) ~ldv_count_1~0)) (not (= (_ bv0 32) ~ldv_count_2~0)) (forall ((|v_aem_find_aem2_~#fi_req~0.base_BEFORE_CALL_1| (_ BitVec 32))) (not (= (_ bv1 1) (select |#valid| |v_aem_find_aem2_~#fi_req~0.base_BEFORE_CALL_1|))))) [2018-11-18 12:08:14,452 INFO L425 ceAbstractionStarter]: For program point L3135(lines 3135 3139) no Hoare annotation was computed. [2018-11-18 12:08:14,452 INFO L425 ceAbstractionStarter]: For program point aem_send_messageFINAL(lines 3129 3156) no Hoare annotation was computed. [2018-11-18 12:08:14,452 INFO L421 ceAbstractionStarter]: At program point L3144(lines 3133 3155) the Hoare annotation is: (or (not (= (_ bv2 32) ~ldv_count_1~0)) (not (= (_ bv0 32) ~ldv_count_2~0)) (forall ((|v_aem_find_aem2_~#fi_req~0.base_BEFORE_CALL_1| (_ BitVec 32))) (not (= (_ bv1 1) (select |#valid| |v_aem_find_aem2_~#fi_req~0.base_BEFORE_CALL_1|))))) [2018-11-18 12:08:14,452 INFO L421 ceAbstractionStarter]: At program point aem_send_messageENTRY(lines 3129 3156) the Hoare annotation is: (or (= |old(#memory_int)| |#memory_int|) (not (= (_ bv2 32) ~ldv_count_1~0)) (not (= (_ bv0 32) ~ldv_count_2~0)) (forall ((|v_aem_find_aem2_~#fi_req~0.base_BEFORE_CALL_1| (_ BitVec 32))) (not (= (_ bv1 1) (select |#valid| |v_aem_find_aem2_~#fi_req~0.base_BEFORE_CALL_1|))))) [2018-11-18 12:08:14,452 INFO L425 ceAbstractionStarter]: For program point L3143(lines 3143 3147) no Hoare annotation was computed. [2018-11-18 12:08:14,452 INFO L425 ceAbstractionStarter]: For program point aem_send_messageEXIT(lines 3129 3156) no Hoare annotation was computed. [2018-11-18 12:08:14,452 INFO L425 ceAbstractionStarter]: For program point L4028(lines 4028 4032) no Hoare annotation was computed. [2018-11-18 12:08:14,452 INFO L425 ceAbstractionStarter]: For program point L3995-1(line 3995) no Hoare annotation was computed. [2018-11-18 12:08:14,452 INFO L428 ceAbstractionStarter]: At program point L3995(line 3995) the Hoare annotation is: true [2018-11-18 12:08:14,452 INFO L428 ceAbstractionStarter]: At program point L4018(line 4018) the Hoare annotation is: true [2018-11-18 12:08:14,452 INFO L425 ceAbstractionStarter]: For program point L4018-1(line 4018) no Hoare annotation was computed. [2018-11-18 12:08:14,452 INFO L428 ceAbstractionStarter]: At program point L4006(lines 3986 4044) the Hoare annotation is: true [2018-11-18 12:08:14,452 INFO L425 ceAbstractionStarter]: For program point L4039-1(line 4039) no Hoare annotation was computed. [2018-11-18 12:08:14,452 INFO L428 ceAbstractionStarter]: At program point L4039(line 4039) the Hoare annotation is: true [2018-11-18 12:08:14,453 INFO L425 ceAbstractionStarter]: For program point aem_register_sensorsEXIT(lines 3979 4045) no Hoare annotation was computed. [2018-11-18 12:08:14,453 INFO L428 ceAbstractionStarter]: At program point L4004(lines 3986 4044) the Hoare annotation is: true [2018-11-18 12:08:14,453 INFO L428 ceAbstractionStarter]: At program point L4035(lines 3986 4044) the Hoare annotation is: true [2018-11-18 12:08:14,453 INFO L425 ceAbstractionStarter]: For program point L4033-1(line 4033) no Hoare annotation was computed. [2018-11-18 12:08:14,453 INFO L428 ceAbstractionStarter]: At program point L4033(line 4033) the Hoare annotation is: true [2018-11-18 12:08:14,453 INFO L425 ceAbstractionStarter]: For program point L3996(lines 3996 4001) no Hoare annotation was computed. [2018-11-18 12:08:14,453 INFO L428 ceAbstractionStarter]: At program point L4029(lines 3986 4044) the Hoare annotation is: true [2018-11-18 12:08:14,453 INFO L428 ceAbstractionStarter]: At program point L4027(lines 3986 4044) the Hoare annotation is: true [2018-11-18 12:08:14,453 INFO L428 ceAbstractionStarter]: At program point aem_register_sensorsENTRY(lines 3979 4045) the Hoare annotation is: true [2018-11-18 12:08:14,453 INFO L425 ceAbstractionStarter]: For program point L4019(lines 4019 4024) no Hoare annotation was computed. [2018-11-18 12:08:14,453 INFO L425 ceAbstractionStarter]: For program point aem_register_sensorsFINAL(lines 3979 4045) no Hoare annotation was computed. [2018-11-18 12:08:14,453 INFO L425 ceAbstractionStarter]: For program point L4042(line 4042) no Hoare annotation was computed. [2018-11-18 12:08:14,453 INFO L425 ceAbstractionStarter]: For program point L4005(lines 4005 4009) no Hoare annotation was computed. [2018-11-18 12:08:14,453 INFO L425 ceAbstractionStarter]: For program point L4034(lines 4034 4038) no Hoare annotation was computed. [2018-11-18 12:08:14,454 INFO L428 ceAbstractionStarter]: At program point L4207(lines 4194 4215) the Hoare annotation is: true [2018-11-18 12:08:14,454 INFO L428 ceAbstractionStarter]: At program point L4209(lines 4194 4215) the Hoare annotation is: true [2018-11-18 12:08:14,454 INFO L425 ceAbstractionStarter]: For program point L4203(line 4203) no Hoare annotation was computed. [2018-11-18 12:08:14,454 INFO L425 ceAbstractionStarter]: For program point aem_exitEXIT(lines 4186 4216) no Hoare annotation was computed. [2018-11-18 12:08:14,454 INFO L428 ceAbstractionStarter]: At program point aem_exitENTRY(lines 4186 4216) the Hoare annotation is: true [2018-11-18 12:08:14,454 INFO L425 ceAbstractionStarter]: For program point aem_exitFINAL(lines 4186 4216) no Hoare annotation was computed. [2018-11-18 12:08:14,454 INFO L421 ceAbstractionStarter]: At program point L3520(line 3520) the Hoare annotation is: (or (not (= (_ bv2 32) ~ldv_count_1~0)) (not (= (_ bv0 32) |old(~ldv_count_2~0)|))) [2018-11-18 12:08:14,454 INFO L421 ceAbstractionStarter]: At program point L3553(lines 3476 3558) the Hoare annotation is: (or (not (= (_ bv2 32) ~ldv_count_1~0)) (not (= (_ bv0 32) |old(~ldv_count_2~0)|))) [2018-11-18 12:08:14,454 INFO L425 ceAbstractionStarter]: For program point L3520-1(line 3520) no Hoare annotation was computed. [2018-11-18 12:08:14,454 INFO L425 ceAbstractionStarter]: For program point aem_init_aem1_instEXIT(lines 3464 3559) no Hoare annotation was computed. [2018-11-18 12:08:14,454 INFO L425 ceAbstractionStarter]: For program point L3537(lines 3537 3541) no Hoare annotation was computed. [2018-11-18 12:08:14,454 INFO L421 ceAbstractionStarter]: At program point L3500(line 3500) the Hoare annotation is: (or (not (= (_ bv2 32) ~ldv_count_1~0)) (not (= (_ bv0 32) |old(~ldv_count_2~0)|))) [2018-11-18 12:08:14,454 INFO L425 ceAbstractionStarter]: For program point L3500-1(line 3500) no Hoare annotation was computed. [2018-11-18 12:08:14,455 INFO L421 ceAbstractionStarter]: At program point L3496(lines 3476 3558) the Hoare annotation is: (or (and (= (_ bv0 32) ~ldv_count_2~0) (= (_ bv0 32) aem_init_aem1_inst_~i~2) (exists ((aem_init_aem1_inst_~module_handle (_ BitVec 8))) (= (select |#memory_int| aem_init_aem1_inst_~data~1.base) (store (store (store ((as const (Array (_ BitVec 32) (_ BitVec 32))) #b00000000000000000000000000000000) (bvadd aem_init_aem1_inst_~data~1.offset (_ bv193 32)) ((_ sign_extend 24) (_ bv1 8))) (bvadd aem_init_aem1_inst_~data~1.offset (_ bv194 32)) ((_ sign_extend 24) (_ bv0 8))) (bvadd aem_init_aem1_inst_~data~1.offset (_ bv195 32)) ((_ sign_extend 24) aem_init_aem1_inst_~module_handle)))) (= aem_init_aem1_inst_~data~1.offset (_ bv0 32))) (not (= (_ bv2 32) ~ldv_count_1~0)) (not (= (_ bv0 32) |old(~ldv_count_2~0)|))) [2018-11-18 12:08:14,455 INFO L421 ceAbstractionStarter]: At program point L3554(line 3554) the Hoare annotation is: (or (not (= (_ bv2 32) ~ldv_count_1~0)) (not (= (_ bv0 32) |old(~ldv_count_2~0)|))) [2018-11-18 12:08:14,455 INFO L425 ceAbstractionStarter]: For program point L3521(lines 3521 3525) no Hoare annotation was computed. [2018-11-18 12:08:14,455 INFO L425 ceAbstractionStarter]: For program point L3554-1(line 3554) no Hoare annotation was computed. [2018-11-18 12:08:14,455 INFO L421 ceAbstractionStarter]: At program point L3550(lines 3476 3558) the Hoare annotation is: (or (not (= (_ bv2 32) ~ldv_count_1~0)) (not (= (_ bv0 32) |old(~ldv_count_2~0)|))) [2018-11-18 12:08:14,455 INFO L425 ceAbstractionStarter]: For program point L3480(lines 3480 3484) no Hoare annotation was computed. [2018-11-18 12:08:14,455 INFO L421 ceAbstractionStarter]: At program point L3542(line 3542) the Hoare annotation is: (or (not (= (_ bv2 32) ~ldv_count_1~0)) (not (= (_ bv0 32) |old(~ldv_count_2~0)|))) [2018-11-18 12:08:14,455 INFO L425 ceAbstractionStarter]: For program point L3542-1(line 3542) no Hoare annotation was computed. [2018-11-18 12:08:14,455 INFO L421 ceAbstractionStarter]: At program point L3538(lines 3476 3558) the Hoare annotation is: (or (not (= (_ bv2 32) ~ldv_count_1~0)) (not (= (_ bv0 32) |old(~ldv_count_2~0)|))) [2018-11-18 12:08:14,455 INFO L425 ceAbstractionStarter]: For program point L3501(lines 3501 3505) no Hoare annotation was computed. [2018-11-18 12:08:14,455 INFO L421 ceAbstractionStarter]: At program point L3555(lines 3476 3558) the Hoare annotation is: (or (not (= (_ bv2 32) ~ldv_count_1~0)) (not (= (_ bv0 32) |old(~ldv_count_2~0)|))) [2018-11-18 12:08:14,455 INFO L425 ceAbstractionStarter]: For program point L3514(lines 3514 3518) no Hoare annotation was computed. [2018-11-18 12:08:14,456 INFO L421 ceAbstractionStarter]: At program point L3494(lines 3476 3558) the Hoare annotation is: (or (and (= (_ bv0 32) ~ldv_count_2~0) (= (_ bv0 32) aem_init_aem1_inst_~i~2) (exists ((aem_init_aem1_inst_~module_handle (_ BitVec 8))) (= (select |#memory_int| aem_init_aem1_inst_~data~1.base) (store (store (store ((as const (Array (_ BitVec 32) (_ BitVec 32))) #b00000000000000000000000000000000) (bvadd aem_init_aem1_inst_~data~1.offset (_ bv193 32)) ((_ sign_extend 24) (_ bv1 8))) (bvadd aem_init_aem1_inst_~data~1.offset (_ bv194 32)) ((_ sign_extend 24) (_ bv0 8))) (bvadd aem_init_aem1_inst_~data~1.offset (_ bv195 32)) ((_ sign_extend 24) aem_init_aem1_inst_~module_handle)))) (= aem_init_aem1_inst_~data~1.offset (_ bv0 32))) (not (= (_ bv2 32) ~ldv_count_1~0)) (not (= (_ bv0 32) |old(~ldv_count_2~0)|))) [2018-11-18 12:08:14,456 INFO L425 ceAbstractionStarter]: For program point L3527-1(line 3527) no Hoare annotation was computed. [2018-11-18 12:08:14,456 INFO L421 ceAbstractionStarter]: At program point L3527(line 3527) the Hoare annotation is: (or (not (= (_ bv2 32) ~ldv_count_1~0)) (not (= (_ bv0 32) |old(~ldv_count_2~0)|))) [2018-11-18 12:08:14,456 INFO L425 ceAbstractionStarter]: For program point aem_init_aem1_instFINAL(lines 3464 3559) no Hoare annotation was computed. [2018-11-18 12:08:14,456 INFO L421 ceAbstractionStarter]: At program point L3548(lines 3476 3558) the Hoare annotation is: (or (not (= (_ bv2 32) ~ldv_count_1~0)) (not (= (_ bv0 32) |old(~ldv_count_2~0)|))) [2018-11-18 12:08:14,456 INFO L421 ceAbstractionStarter]: At program point aem_init_aem1_instENTRY(lines 3464 3559) the Hoare annotation is: (or (and (= (_ bv0 32) ~ldv_count_2~0) (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|)) (not (= (_ bv2 32) ~ldv_count_1~0)) (not (= (_ bv0 32) |old(~ldv_count_2~0)|))) [2018-11-18 12:08:14,456 INFO L421 ceAbstractionStarter]: At program point L3478(line 3478) the Hoare annotation is: (or (not (= (_ bv2 32) ~ldv_count_1~0)) (not (= (_ bv0 32) |old(~ldv_count_2~0)|)) (and (= (_ bv0 32) ~ldv_count_2~0) (= |old(#memory_int)| |#memory_int|) (exists ((|v_aem_find_aem2_~#fi_req~0.base_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv1 1) (select |#valid| |v_aem_find_aem2_~#fi_req~0.base_BEFORE_CALL_1|))))) [2018-11-18 12:08:14,456 INFO L425 ceAbstractionStarter]: For program point L3478-1(line 3478) no Hoare annotation was computed. [2018-11-18 12:08:14,456 INFO L425 ceAbstractionStarter]: For program point L3507(lines 3507 3511) no Hoare annotation was computed. [2018-11-18 12:08:14,456 INFO L421 ceAbstractionStarter]: At program point L3536(line 3536) the Hoare annotation is: (or (not (= (_ bv2 32) ~ldv_count_1~0)) (not (= (_ bv0 32) |old(~ldv_count_2~0)|))) [2018-11-18 12:08:14,456 INFO L425 ceAbstractionStarter]: For program point L3536-1(line 3536) no Hoare annotation was computed. [2018-11-18 12:08:14,456 INFO L425 ceAbstractionStarter]: For program point L3528(lines 3528 3534) no Hoare annotation was computed. [2018-11-18 12:08:14,457 INFO L425 ceAbstractionStarter]: For program point aem_idr_putFINAL(lines 3235 3245) no Hoare annotation was computed. [2018-11-18 12:08:14,457 INFO L428 ceAbstractionStarter]: At program point L3242(line 3242) the Hoare annotation is: true [2018-11-18 12:08:14,457 INFO L428 ceAbstractionStarter]: At program point L3240(line 3240) the Hoare annotation is: true [2018-11-18 12:08:14,457 INFO L425 ceAbstractionStarter]: For program point aem_idr_putEXIT(lines 3235 3245) no Hoare annotation was computed. [2018-11-18 12:08:14,457 INFO L428 ceAbstractionStarter]: At program point aem_idr_putENTRY(lines 3235 3245) the Hoare annotation is: true [2018-11-18 12:08:14,457 INFO L425 ceAbstractionStarter]: For program point L3240-1(line 3240) no Hoare annotation was computed. [2018-11-18 12:08:14,457 INFO L425 ceAbstractionStarter]: For program point list_add_tailFINAL(lines 2878 2886) no Hoare annotation was computed. [2018-11-18 12:08:14,457 INFO L428 ceAbstractionStarter]: At program point list_add_tailENTRY(lines 2878 2886) the Hoare annotation is: true [2018-11-18 12:08:14,457 INFO L425 ceAbstractionStarter]: For program point list_add_tailEXIT(lines 2878 2886) no Hoare annotation was computed. [2018-11-18 12:08:14,457 INFO L421 ceAbstractionStarter]: At program point init_completionENTRY(lines 2923 2932) the Hoare annotation is: (or (and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|)) (not (= (_ bv2 32) ~ldv_count_1~0)) (not (= (_ bv0 32) ~ldv_count_2~0)) (forall ((|v_aem_find_aem2_~#fi_req~0.base_BEFORE_CALL_1| (_ BitVec 32))) (not (= (_ bv1 1) (select |old(#valid)| |v_aem_find_aem2_~#fi_req~0.base_BEFORE_CALL_1|))))) [2018-11-18 12:08:14,457 INFO L425 ceAbstractionStarter]: For program point init_completionFINAL(lines 2923 2932) no Hoare annotation was computed. [2018-11-18 12:08:14,457 INFO L425 ceAbstractionStarter]: For program point init_completionEXIT(lines 2923 2932) no Hoare annotation was computed. [2018-11-18 12:08:14,457 INFO L425 ceAbstractionStarter]: For program point ldv_device_create_file_10EXIT(lines 4433 4441) no Hoare annotation was computed. [2018-11-18 12:08:14,458 INFO L428 ceAbstractionStarter]: At program point ldv_device_create_file_10ENTRY(lines 4433 4441) the Hoare annotation is: true [2018-11-18 12:08:14,458 INFO L425 ceAbstractionStarter]: For program point ldv_device_create_file_10FINAL(lines 4433 4441) no Hoare annotation was computed. [2018-11-18 12:08:14,458 INFO L428 ceAbstractionStarter]: At program point L4438(line 4438) the Hoare annotation is: true [2018-11-18 12:08:14,458 INFO L425 ceAbstractionStarter]: For program point L4438-1(line 4438) no Hoare annotation was computed. [2018-11-18 12:08:14,458 INFO L425 ceAbstractionStarter]: For program point ldv_errorFINAL(lines 4460 4468) no Hoare annotation was computed. [2018-11-18 12:08:14,458 INFO L428 ceAbstractionStarter]: At program point ldv_errorENTRY(lines 4460 4468) the Hoare annotation is: true [2018-11-18 12:08:14,458 INFO L425 ceAbstractionStarter]: For program point ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4466) no Hoare annotation was computed. [2018-11-18 12:08:14,458 INFO L425 ceAbstractionStarter]: For program point ldv_errorEXIT(lines 4460 4468) no Hoare annotation was computed. [2018-11-18 12:08:14,458 INFO L428 ceAbstractionStarter]: At program point L4176(lines 4166 4184) the Hoare annotation is: true [2018-11-18 12:08:14,458 INFO L425 ceAbstractionStarter]: For program point aem_initFINAL(lines 4162 4185) no Hoare annotation was computed. [2018-11-18 12:08:14,458 INFO L425 ceAbstractionStarter]: For program point L4175(lines 4175 4179) no Hoare annotation was computed. [2018-11-18 12:08:14,458 INFO L425 ceAbstractionStarter]: For program point L4168(lines 4168 4173) no Hoare annotation was computed. [2018-11-18 12:08:14,459 INFO L428 ceAbstractionStarter]: At program point aem_initENTRY(lines 4162 4185) the Hoare annotation is: true [2018-11-18 12:08:14,459 INFO L425 ceAbstractionStarter]: For program point aem_initEXIT(lines 4162 4185) no Hoare annotation was computed. [2018-11-18 12:08:14,459 INFO L425 ceAbstractionStarter]: For program point aem2_find_sensorsEXIT(lines 4152 4161) no Hoare annotation was computed. [2018-11-18 12:08:14,459 INFO L425 ceAbstractionStarter]: For program point L4157-1(lines 4157 4158) no Hoare annotation was computed. [2018-11-18 12:08:14,459 INFO L428 ceAbstractionStarter]: At program point L4157(lines 4157 4158) the Hoare annotation is: true [2018-11-18 12:08:14,459 INFO L428 ceAbstractionStarter]: At program point aem2_find_sensorsENTRY(lines 4152 4161) the Hoare annotation is: true [2018-11-18 12:08:14,459 INFO L425 ceAbstractionStarter]: For program point aem2_find_sensorsFINAL(lines 4152 4161) no Hoare annotation was computed. [2018-11-18 12:08:14,459 INFO L428 ceAbstractionStarter]: At program point spin_lockENTRY(lines 2890 2898) the Hoare annotation is: true [2018-11-18 12:08:14,459 INFO L425 ceAbstractionStarter]: For program point spin_lockFINAL(lines 2890 2898) no Hoare annotation was computed. [2018-11-18 12:08:14,459 INFO L425 ceAbstractionStarter]: For program point spin_lockEXIT(lines 2890 2898) no Hoare annotation was computed. [2018-11-18 12:08:14,459 INFO L428 ceAbstractionStarter]: At program point ldv_device_create_file_12ENTRY(lines 4451 4459) the Hoare annotation is: true [2018-11-18 12:08:14,459 INFO L425 ceAbstractionStarter]: For program point L4456-1(line 4456) no Hoare annotation was computed. [2018-11-18 12:08:14,459 INFO L425 ceAbstractionStarter]: For program point ldv_device_create_file_12FINAL(lines 4451 4459) no Hoare annotation was computed. [2018-11-18 12:08:14,459 INFO L428 ceAbstractionStarter]: At program point L4456(line 4456) the Hoare annotation is: true [2018-11-18 12:08:14,459 INFO L425 ceAbstractionStarter]: For program point ldv_device_create_file_12EXIT(lines 4451 4459) no Hoare annotation was computed. [2018-11-18 12:08:14,460 INFO L425 ceAbstractionStarter]: For program point ldv__builtin_expectFINAL(lines 3051 3058) no Hoare annotation was computed. [2018-11-18 12:08:14,460 INFO L428 ceAbstractionStarter]: At program point ldv__builtin_expectENTRY(lines 3051 3058) the Hoare annotation is: true [2018-11-18 12:08:14,460 INFO L425 ceAbstractionStarter]: For program point ldv__builtin_expectEXIT(lines 3051 3058) no Hoare annotation was computed. [2018-11-18 12:08:14,460 INFO L428 ceAbstractionStarter]: At program point L4447(line 4447) the Hoare annotation is: true [2018-11-18 12:08:14,460 INFO L428 ceAbstractionStarter]: At program point ldv_device_create_file_11ENTRY(lines 4442 4450) the Hoare annotation is: true [2018-11-18 12:08:14,460 INFO L425 ceAbstractionStarter]: For program point L4447-1(line 4447) no Hoare annotation was computed. [2018-11-18 12:08:14,460 INFO L425 ceAbstractionStarter]: For program point ldv_device_create_file_11FINAL(lines 4442 4450) no Hoare annotation was computed. [2018-11-18 12:08:14,460 INFO L425 ceAbstractionStarter]: For program point ldv_device_create_file_11EXIT(lines 4442 4450) no Hoare annotation was computed. [2018-11-18 12:08:14,460 INFO L425 ceAbstractionStarter]: For program point L3648(lines 3648 3652) no Hoare annotation was computed. [2018-11-18 12:08:14,460 INFO L421 ceAbstractionStarter]: At program point L3710(line 3710) the Hoare annotation is: (or (not (= (_ bv2 32) ~ldv_count_1~0)) (not (= (_ bv0 32) |old(~ldv_count_2~0)|))) [2018-11-18 12:08:14,460 INFO L425 ceAbstractionStarter]: For program point L3710-1(line 3710) no Hoare annotation was computed. [2018-11-18 12:08:14,460 INFO L421 ceAbstractionStarter]: At program point L3706(lines 3644 3726) the Hoare annotation is: (or (not (= (_ bv2 32) ~ldv_count_1~0)) (not (= (_ bv0 32) |old(~ldv_count_2~0)|))) [2018-11-18 12:08:14,460 INFO L425 ceAbstractionStarter]: For program point L3669(lines 3669 3673) no Hoare annotation was computed. [2018-11-18 12:08:14,460 INFO L421 ceAbstractionStarter]: At program point L3723(lines 3644 3726) the Hoare annotation is: (or (not (= (_ bv2 32) ~ldv_count_1~0)) (not (= (_ bv0 32) |old(~ldv_count_2~0)|))) [2018-11-18 12:08:14,461 INFO L425 ceAbstractionStarter]: For program point L3682(lines 3682 3686) no Hoare annotation was computed. [2018-11-18 12:08:14,461 INFO L421 ceAbstractionStarter]: At program point L3662(lines 3644 3726) the Hoare annotation is: (let ((.cse0 (not (= (_ bv2 32) ~ldv_count_1~0))) (.cse1 (not (= (_ bv0 32) |old(~ldv_count_2~0)|)))) (and (or (not (= (_ bv0 32) |aem_init_aem2_inst_#in~fi_resp.offset|)) (= (select |old(#valid)| |aem_init_aem2_inst_#in~fi_resp.base|) (_ bv0 1)) .cse0 (forall ((|v_aem_find_aem2_~#fi_req~0.base_20| (_ BitVec 32))) (not (= (_ bv0 1) (select |old(#valid)| |v_aem_find_aem2_~#fi_req~0.base_20|)))) .cse1 (exists ((aem_init_aem2_inst_~fi_resp.base (_ BitVec 32))) (let ((.cse3 (select |#memory_int| aem_init_aem2_inst_~fi_resp.base))) (let ((.cse2 ((_ extract 7 0) (select .cse3 (_ bv4 32))))) (and (= (select |#memory_int| aem_init_aem2_inst_~data~2.base) (store (store (store ((as const (Array (_ BitVec 32) (_ BitVec 32))) #b00000000000000000000000000000000) (bvadd aem_init_aem2_inst_~data~2.offset (_ bv193 32)) ((_ sign_extend 24) .cse2)) (bvadd aem_init_aem2_inst_~data~2.offset (_ bv194 32)) ((_ sign_extend 24) ((_ extract 7 0) (select .cse3 (_ bv5 32))))) (bvadd aem_init_aem2_inst_~data~2.offset (_ bv195 32)) ((_ sign_extend 24) ((_ extract 7 0) (select .cse3 (_ bv6 32)))))) (= (bvadd ((_ zero_extend 24) .cse2) (_ bv4294967294 32)) (_ bv0 32)))))) (not (= (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select (select |old(#memory_int)| |aem_init_aem2_inst_#in~fi_resp.base|) (_ bv4 32)))) (_ bv4294967294 32)) (_ bv0 32)))) (or (and (= (_ bv0 32) ~ldv_count_2~0) (let ((.cse5 (= (_ bv0 32) aem_init_aem2_inst_~data~2.offset))) (or (and (exists ((v_prenex_2 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (and (= (select |#memory_int| aem_init_aem2_inst_~data~2.base) (let ((.cse4 (select |#memory_int| v_prenex_1))) (store (store (store ((as const (Array (_ BitVec 32) (_ BitVec 32))) #b00000000000000000000000000000000) (bvadd aem_init_aem2_inst_~data~2.offset (_ bv193 32)) ((_ sign_extend 24) ((_ extract 7 0) (select .cse4 (bvadd v_prenex_2 (_ bv4 32)))))) (bvadd aem_init_aem2_inst_~data~2.offset (_ bv194 32)) ((_ sign_extend 24) ((_ extract 7 0) (select .cse4 (bvadd v_prenex_2 (_ bv5 32)))))) (bvadd aem_init_aem2_inst_~data~2.offset (_ bv195 32)) ((_ sign_extend 24) ((_ extract 7 0) (select .cse4 (bvadd v_prenex_2 (_ bv6 32)))))))) (not (= aem_init_aem2_inst_~data~2.base v_prenex_1)))) .cse5) (and (exists ((aem_init_aem2_inst_~fi_resp.base (_ BitVec 32)) (aem_init_aem2_inst_~fi_resp.offset (_ BitVec 32))) (let ((.cse6 ((as const (Array (_ BitVec 32) (_ BitVec 32))) #b00000000000000000000000000000000)) (.cse7 (select |#memory_int| aem_init_aem2_inst_~fi_resp.base))) (and (= (select |#memory_int| aem_init_aem2_inst_~data~2.base) (store (store (store .cse6 (bvadd aem_init_aem2_inst_~data~2.offset (_ bv193 32)) ((_ sign_extend 24) ((_ extract 7 0) (select .cse7 (bvadd aem_init_aem2_inst_~fi_resp.offset (_ bv4 32)))))) (bvadd aem_init_aem2_inst_~data~2.offset (_ bv194 32)) ((_ sign_extend 24) ((_ extract 7 0) (select .cse7 (bvadd aem_init_aem2_inst_~fi_resp.offset (_ bv5 32)))))) (bvadd aem_init_aem2_inst_~data~2.offset (_ bv195 32)) ((_ sign_extend 24) ((_ extract 7 0) (select .cse7 (bvadd aem_init_aem2_inst_~fi_resp.offset (_ bv6 32))))))) (= .cse6 .cse7)))) .cse5))) (= aem_init_aem2_inst_~i~4 (_ bv0 32))) .cse0 .cse1))) [2018-11-18 12:08:14,461 INFO L425 ceAbstractionStarter]: For program point L3695-1(line 3695) no Hoare annotation was computed. [2018-11-18 12:08:14,461 INFO L421 ceAbstractionStarter]: At program point L3695(line 3695) the Hoare annotation is: (or (not (= (_ bv2 32) ~ldv_count_1~0)) (not (= (_ bv0 32) |old(~ldv_count_2~0)|))) [2018-11-18 12:08:14,461 INFO L421 ceAbstractionStarter]: At program point L3716(lines 3644 3726) the Hoare annotation is: (or (not (= (_ bv2 32) ~ldv_count_1~0)) (not (= (_ bv0 32) |old(~ldv_count_2~0)|))) [2018-11-18 12:08:14,461 INFO L421 ceAbstractionStarter]: At program point L3646(line 3646) the Hoare annotation is: (let ((.cse0 (not (= (_ bv2 32) ~ldv_count_1~0))) (.cse1 (not (= (_ bv0 32) |old(~ldv_count_2~0)|)))) (and (or (and (exists ((|v_aem_find_aem2_~#fi_req~0.base_20| (_ BitVec 32))) (and (not (= |v_aem_find_aem2_~#fi_req~0.base_20| aem_init_aem2_inst_~fi_resp.base)) (= (bvadd (select |#valid| |v_aem_find_aem2_~#fi_req~0.base_20|) (_ bv1 1)) (_ bv0 1)))) (= aem_init_aem2_inst_~fi_resp.offset (_ bv0 32)) (= (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int| aem_init_aem2_inst_~fi_resp.base) (_ bv4 32)))) (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select |#valid| aem_init_aem2_inst_~fi_resp.base) (_ bv1 1)) (_ bv0 1))) (not (= (_ bv0 32) |aem_init_aem2_inst_#in~fi_resp.offset|)) (= (select |old(#valid)| |aem_init_aem2_inst_#in~fi_resp.base|) (_ bv0 1)) .cse0 (forall ((|v_aem_find_aem2_~#fi_req~0.base_20| (_ BitVec 32))) (not (= (_ bv0 1) (select |old(#valid)| |v_aem_find_aem2_~#fi_req~0.base_20|)))) .cse1 (not (= (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select (select |old(#memory_int)| |aem_init_aem2_inst_#in~fi_resp.base|) (_ bv4 32)))) (_ bv4294967294 32)) (_ bv0 32)))) (or .cse0 .cse1 (and (= (_ bv0 32) ~ldv_count_2~0) (= |old(#memory_int)| |#memory_int|) (exists ((|v_aem_find_aem2_~#fi_req~0.base_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv1 1) (select |#valid| |v_aem_find_aem2_~#fi_req~0.base_BEFORE_CALL_1|))))))) [2018-11-18 12:08:14,461 INFO L425 ceAbstractionStarter]: For program point L3646-1(line 3646) no Hoare annotation was computed. [2018-11-18 12:08:14,462 INFO L425 ceAbstractionStarter]: For program point L3675(lines 3675 3679) no Hoare annotation was computed. [2018-11-18 12:08:14,462 INFO L421 ceAbstractionStarter]: At program point L3704(line 3704) the Hoare annotation is: (or (not (= (_ bv2 32) ~ldv_count_1~0)) (not (= (_ bv0 32) |old(~ldv_count_2~0)|))) [2018-11-18 12:08:14,462 INFO L425 ceAbstractionStarter]: For program point L3704-1(line 3704) no Hoare annotation was computed. [2018-11-18 12:08:14,462 INFO L425 ceAbstractionStarter]: For program point aem_init_aem2_instFINAL(lines 3632 3727) no Hoare annotation was computed. [2018-11-18 12:08:14,462 INFO L425 ceAbstractionStarter]: For program point L3696(lines 3696 3702) no Hoare annotation was computed. [2018-11-18 12:08:14,462 INFO L421 ceAbstractionStarter]: At program point L3688(line 3688) the Hoare annotation is: (or (not (= (_ bv2 32) ~ldv_count_1~0)) (not (= (_ bv0 32) |old(~ldv_count_2~0)|))) [2018-11-18 12:08:14,462 INFO L421 ceAbstractionStarter]: At program point L3721(lines 3644 3726) the Hoare annotation is: (or (not (= (_ bv2 32) ~ldv_count_1~0)) (not (= (_ bv0 32) |old(~ldv_count_2~0)|))) [2018-11-18 12:08:14,462 INFO L425 ceAbstractionStarter]: For program point L3688-1(line 3688) no Hoare annotation was computed. [2018-11-18 12:08:14,462 INFO L421 ceAbstractionStarter]: At program point aem_init_aem2_instENTRY(lines 3632 3727) the Hoare annotation is: (or (and (= (_ bv0 32) ~ldv_count_2~0) (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|)) (not (= (_ bv2 32) ~ldv_count_1~0)) (not (= (_ bv0 32) |old(~ldv_count_2~0)|))) [2018-11-18 12:08:14,462 INFO L425 ceAbstractionStarter]: For program point aem_init_aem2_instEXIT(lines 3632 3727) no Hoare annotation was computed. [2018-11-18 12:08:14,462 INFO L425 ceAbstractionStarter]: For program point L3705(lines 3705 3709) no Hoare annotation was computed. [2018-11-18 12:08:14,462 INFO L421 ceAbstractionStarter]: At program point L3668(line 3668) the Hoare annotation is: (or (not (= (_ bv2 32) ~ldv_count_1~0)) (not (= (_ bv0 32) |old(~ldv_count_2~0)|))) [2018-11-18 12:08:14,462 INFO L425 ceAbstractionStarter]: For program point L3668-1(line 3668) no Hoare annotation was computed. [2018-11-18 12:08:14,463 INFO L421 ceAbstractionStarter]: At program point L3664(lines 3644 3726) the Hoare annotation is: (let ((.cse4 (not (= (_ bv2 32) ~ldv_count_1~0))) (.cse5 (not (= (_ bv0 32) |old(~ldv_count_2~0)|)))) (and (or (and (= (_ bv0 32) ~ldv_count_2~0) (let ((.cse1 (= (_ bv0 32) aem_init_aem2_inst_~data~2.offset))) (or (and (exists ((v_prenex_2 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (and (= (select |#memory_int| aem_init_aem2_inst_~data~2.base) (let ((.cse0 (select |#memory_int| v_prenex_1))) (store (store (store ((as const (Array (_ BitVec 32) (_ BitVec 32))) #b00000000000000000000000000000000) (bvadd aem_init_aem2_inst_~data~2.offset (_ bv193 32)) ((_ sign_extend 24) ((_ extract 7 0) (select .cse0 (bvadd v_prenex_2 (_ bv4 32)))))) (bvadd aem_init_aem2_inst_~data~2.offset (_ bv194 32)) ((_ sign_extend 24) ((_ extract 7 0) (select .cse0 (bvadd v_prenex_2 (_ bv5 32)))))) (bvadd aem_init_aem2_inst_~data~2.offset (_ bv195 32)) ((_ sign_extend 24) ((_ extract 7 0) (select .cse0 (bvadd v_prenex_2 (_ bv6 32)))))))) (not (= aem_init_aem2_inst_~data~2.base v_prenex_1)))) .cse1) (and (exists ((aem_init_aem2_inst_~fi_resp.base (_ BitVec 32)) (aem_init_aem2_inst_~fi_resp.offset (_ BitVec 32))) (let ((.cse2 ((as const (Array (_ BitVec 32) (_ BitVec 32))) #b00000000000000000000000000000000)) (.cse3 (select |#memory_int| aem_init_aem2_inst_~fi_resp.base))) (and (= (select |#memory_int| aem_init_aem2_inst_~data~2.base) (store (store (store .cse2 (bvadd aem_init_aem2_inst_~data~2.offset (_ bv193 32)) ((_ sign_extend 24) ((_ extract 7 0) (select .cse3 (bvadd aem_init_aem2_inst_~fi_resp.offset (_ bv4 32)))))) (bvadd aem_init_aem2_inst_~data~2.offset (_ bv194 32)) ((_ sign_extend 24) ((_ extract 7 0) (select .cse3 (bvadd aem_init_aem2_inst_~fi_resp.offset (_ bv5 32)))))) (bvadd aem_init_aem2_inst_~data~2.offset (_ bv195 32)) ((_ sign_extend 24) ((_ extract 7 0) (select .cse3 (bvadd aem_init_aem2_inst_~fi_resp.offset (_ bv6 32))))))) (= .cse2 .cse3)))) .cse1))) (= aem_init_aem2_inst_~i~4 (_ bv0 32))) .cse4 .cse5) (or (not (= (_ bv0 32) |aem_init_aem2_inst_#in~fi_resp.offset|)) (= (select |old(#valid)| |aem_init_aem2_inst_#in~fi_resp.base|) (_ bv0 1)) .cse4 (exists ((aem_init_aem2_inst_~fi_resp.base (_ BitVec 32))) (let ((.cse7 (select |#memory_int| aem_init_aem2_inst_~fi_resp.base))) (let ((.cse6 ((_ extract 7 0) (select .cse7 (_ bv4 32))))) (and (= (select |#memory_int| aem_init_aem2_inst_~data~2.base) (store (store (store ((as const (Array (_ BitVec 32) (_ BitVec 32))) #b00000000000000000000000000000000) (bvadd aem_init_aem2_inst_~data~2.offset (_ bv193 32)) ((_ sign_extend 24) .cse6)) (bvadd aem_init_aem2_inst_~data~2.offset (_ bv194 32)) ((_ sign_extend 24) ((_ extract 7 0) (select .cse7 (_ bv5 32))))) (bvadd aem_init_aem2_inst_~data~2.offset (_ bv195 32)) ((_ sign_extend 24) ((_ extract 7 0) (select .cse7 (_ bv6 32)))))) (= (bvadd ((_ zero_extend 24) .cse6) (_ bv4294967294 32)) (_ bv0 32)))))) (forall ((|v_aem_find_aem2_~#fi_req~0.base_20| (_ BitVec 32))) (not (= (_ bv0 1) (select |old(#valid)| |v_aem_find_aem2_~#fi_req~0.base_20|)))) .cse5 (not (= (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select (select |old(#memory_int)| |aem_init_aem2_inst_#in~fi_resp.base|) (_ bv4 32)))) (_ bv4294967294 32)) (_ bv0 32)))))) [2018-11-18 12:08:14,463 INFO L421 ceAbstractionStarter]: At program point L3722(line 3722) the Hoare annotation is: (or (not (= (_ bv2 32) ~ldv_count_1~0)) (not (= (_ bv0 32) |old(~ldv_count_2~0)|))) [2018-11-18 12:08:14,463 INFO L425 ceAbstractionStarter]: For program point L3689(lines 3689 3693) no Hoare annotation was computed. [2018-11-18 12:08:14,463 INFO L425 ceAbstractionStarter]: For program point L3722-1(line 3722) no Hoare annotation was computed. [2018-11-18 12:08:14,463 INFO L421 ceAbstractionStarter]: At program point L3718(lines 3644 3726) the Hoare annotation is: (or (not (= (_ bv2 32) ~ldv_count_1~0)) (not (= (_ bv0 32) |old(~ldv_count_2~0)|))) [2018-11-18 12:08:14,463 INFO L425 ceAbstractionStarter]: For program point #Ultimate.C_memsetEXIT(line -1) no Hoare annotation was computed. [2018-11-18 12:08:14,467 INFO L428 ceAbstractionStarter]: At program point L-1-1(line -1) the Hoare annotation is: true [2018-11-18 12:08:14,467 INFO L421 ceAbstractionStarter]: At program point #Ultimate.C_memsetENTRY(line -1) the Hoare annotation is: (or (not (= (_ bv2 32) ~ldv_count_1~0)) (not (= (_ bv0 32) ~ldv_count_2~0)) (not (= (_ bv0 32) ~ldv_state_variable_3~0)) (= |old(#memory_int)| |#memory_int|)) [2018-11-18 12:08:14,467 INFO L425 ceAbstractionStarter]: For program point #Ultimate.C_memsetFINAL(line -1) no Hoare annotation was computed. [2018-11-18 12:08:14,467 INFO L425 ceAbstractionStarter]: For program point L3455(lines 3455 3459) no Hoare annotation was computed. [2018-11-18 12:08:14,467 INFO L425 ceAbstractionStarter]: For program point L3450(line 3450) no Hoare annotation was computed. [2018-11-18 12:08:14,467 INFO L425 ceAbstractionStarter]: For program point L3450-2(lines 3450 3460) no Hoare annotation was computed. [2018-11-18 12:08:14,467 INFO L425 ceAbstractionStarter]: For program point aem_find_aem1_countFINAL(lines 3425 3463) no Hoare annotation was computed. [2018-11-18 12:08:14,467 INFO L425 ceAbstractionStarter]: For program point L3445(lines 3445 3449) no Hoare annotation was computed. [2018-11-18 12:08:14,467 INFO L421 ceAbstractionStarter]: At program point L3442(line 3442) the Hoare annotation is: (or (exists ((|v_aem_find_aem2_~#fi_req~0.base_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv1 1) (select |#valid| |v_aem_find_aem2_~#fi_req~0.base_BEFORE_CALL_1|))) (not (= (_ bv2 32) ~ldv_count_1~0)) (not (= (_ bv0 32) ~ldv_count_2~0)) (forall ((|v_aem_find_aem2_~#fi_req~0.base_BEFORE_CALL_1| (_ BitVec 32))) (not (= (_ bv1 1) (select |old(#valid)| |v_aem_find_aem2_~#fi_req~0.base_BEFORE_CALL_1|))))) [2018-11-18 12:08:14,467 INFO L425 ceAbstractionStarter]: For program point aem_find_aem1_countEXIT(lines 3425 3463) no Hoare annotation was computed. [2018-11-18 12:08:14,467 INFO L425 ceAbstractionStarter]: For program point L3442-1(line 3442) no Hoare annotation was computed. [2018-11-18 12:08:14,468 INFO L421 ceAbstractionStarter]: At program point aem_find_aem1_countENTRY(lines 3425 3463) the Hoare annotation is: (or (and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|)) (not (= (_ bv2 32) ~ldv_count_1~0)) (not (= (_ bv0 32) ~ldv_count_2~0)) (forall ((|v_aem_find_aem2_~#fi_req~0.base_BEFORE_CALL_1| (_ BitVec 32))) (not (= (_ bv1 1) (select |old(#valid)| |v_aem_find_aem2_~#fi_req~0.base_BEFORE_CALL_1|))))) [2018-11-18 12:08:14,468 INFO L425 ceAbstractionStarter]: For program point ldv_device_create_file_9FINAL(lines 4424 4432) no Hoare annotation was computed. [2018-11-18 12:08:14,468 INFO L428 ceAbstractionStarter]: At program point L4429(line 4429) the Hoare annotation is: true [2018-11-18 12:08:14,468 INFO L425 ceAbstractionStarter]: For program point ldv_device_create_file_9EXIT(lines 4424 4432) no Hoare annotation was computed. [2018-11-18 12:08:14,468 INFO L425 ceAbstractionStarter]: For program point L4429-1(line 4429) no Hoare annotation was computed. [2018-11-18 12:08:14,468 INFO L428 ceAbstractionStarter]: At program point ldv_device_create_file_9ENTRY(lines 4424 4432) the Hoare annotation is: true [2018-11-18 12:08:14,468 INFO L428 ceAbstractionStarter]: At program point spin_unlockENTRY(lines 2899 2907) the Hoare annotation is: true [2018-11-18 12:08:14,468 INFO L425 ceAbstractionStarter]: For program point spin_unlockFINAL(lines 2899 2907) no Hoare annotation was computed. [2018-11-18 12:08:14,468 INFO L425 ceAbstractionStarter]: For program point spin_unlockEXIT(lines 2899 2907) no Hoare annotation was computed. [2018-11-18 12:08:14,468 INFO L425 ceAbstractionStarter]: For program point ldv_init_zallocFINAL(lines 2994 3005) no Hoare annotation was computed. [2018-11-18 12:08:14,468 INFO L425 ceAbstractionStarter]: For program point ldv_init_zallocEXIT(lines 2994 3005) no Hoare annotation was computed. [2018-11-18 12:08:14,475 INFO L421 ceAbstractionStarter]: At program point L3000(line 3000) the Hoare annotation is: (or (not (= (_ bv0 32) ~ldv_count_1~0)) (not (= (_ bv0 32) ~ldv_count_2~0)) (not (= (_ bv0 32) ~ldv_state_variable_3~0)) (and (= |old(#memory_int)| |#memory_int|) (exists ((|v_aem_find_aem2_~#fi_req~0.base_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv1 1) (select |#valid| |v_aem_find_aem2_~#fi_req~0.base_BEFORE_CALL_1|))))) [2018-11-18 12:08:14,475 INFO L421 ceAbstractionStarter]: At program point ldv_init_zallocENTRY(lines 2994 3005) the Hoare annotation is: (or (and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|)) (not (= (_ bv0 32) ~ldv_count_1~0)) (not (= (_ bv0 32) ~ldv_count_2~0)) (not (= (_ bv0 32) ~ldv_state_variable_3~0))) [2018-11-18 12:08:14,475 INFO L425 ceAbstractionStarter]: For program point L3000-1(line 3000) no Hoare annotation was computed. [2018-11-18 12:08:14,475 INFO L425 ceAbstractionStarter]: For program point aem_deleteEXIT(lines 3409 3424) no Hoare annotation was computed. [2018-11-18 12:08:14,475 INFO L428 ceAbstractionStarter]: At program point L3420(line 3420) the Hoare annotation is: true [2018-11-18 12:08:14,475 INFO L425 ceAbstractionStarter]: For program point L3420-1(line 3420) no Hoare annotation was computed. [2018-11-18 12:08:14,475 INFO L425 ceAbstractionStarter]: For program point L3415-1(line 3415) no Hoare annotation was computed. [2018-11-18 12:08:14,475 INFO L428 ceAbstractionStarter]: At program point L3415(line 3415) the Hoare annotation is: true [2018-11-18 12:08:14,475 INFO L428 ceAbstractionStarter]: At program point aem_deleteENTRY(lines 3409 3424) the Hoare annotation is: true [2018-11-18 12:08:14,475 INFO L425 ceAbstractionStarter]: For program point aem_deleteFINAL(lines 3409 3424) no Hoare annotation was computed. [2018-11-18 12:08:14,475 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-18 12:08:14,476 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|) (let ((.cse0 (bvadd ~ldv_count_2~0 (_ bv1 32)))) (or (bvslt (bvadd |old(~ldv_count_1~0)| (_ bv2 32)) .cse0) (not (bvslt (bvadd ~ldv_count_1~0 (_ bv2 32)) .cse0))))) [2018-11-18 12:08:14,476 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 12:08:14,476 INFO L425 ceAbstractionStarter]: For program point show_versionEXIT(lines 3837 3850) no Hoare annotation was computed. [2018-11-18 12:08:14,476 INFO L428 ceAbstractionStarter]: At program point show_versionENTRY(lines 3837 3850) the Hoare annotation is: true [2018-11-18 12:08:14,476 INFO L425 ceAbstractionStarter]: For program point show_versionFINAL(lines 3837 3850) no Hoare annotation was computed. [2018-11-18 12:08:14,476 INFO L428 ceAbstractionStarter]: At program point L3808(lines 3793 3816) the Hoare annotation is: true [2018-11-18 12:08:14,476 INFO L425 ceAbstractionStarter]: For program point L3800(lines 3800 3804) no Hoare annotation was computed. [2018-11-18 12:08:14,476 INFO L428 ceAbstractionStarter]: At program point L3801(line 3801) the Hoare annotation is: true [2018-11-18 12:08:14,476 INFO L425 ceAbstractionStarter]: For program point aem_bmc_goneFINAL(lines 3785 3817) no Hoare annotation was computed. [2018-11-18 12:08:14,476 INFO L425 ceAbstractionStarter]: For program point L3800-1(lines 3800 3804) no Hoare annotation was computed. [2018-11-18 12:08:14,476 INFO L428 ceAbstractionStarter]: At program point aem_bmc_goneENTRY(lines 3785 3817) the Hoare annotation is: true [2018-11-18 12:08:14,476 INFO L425 ceAbstractionStarter]: For program point aem_bmc_goneEXIT(lines 3785 3817) no Hoare annotation was computed. [2018-11-18 12:08:14,483 INFO L428 ceAbstractionStarter]: At program point L3810(lines 3793 3816) the Hoare annotation is: true [2018-11-18 12:08:14,483 INFO L425 ceAbstractionStarter]: For program point L2987-1(line 2987) no Hoare annotation was computed. [2018-11-18 12:08:14,483 INFO L421 ceAbstractionStarter]: At program point L2987(line 2987) the Hoare annotation is: (or (not (= (_ bv2 32) ~ldv_count_1~0)) (not (= (_ bv0 32) ~ldv_count_2~0)) (and (= |ldv_zalloc_#t~malloc65.offset| (_ bv0 32)) (= |old(#memory_int)| |#memory_int|) (= (_ bv0 1) (select |old(#valid)| |ldv_zalloc_#t~malloc65.base|)) (exists ((|v_aem_find_aem2_~#fi_req~0.base_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv1 1) (select |#valid| |v_aem_find_aem2_~#fi_req~0.base_BEFORE_CALL_1|)))) (forall ((|v_aem_find_aem2_~#fi_req~0.base_BEFORE_CALL_1| (_ BitVec 32))) (not (= (_ bv1 1) (select |old(#valid)| |v_aem_find_aem2_~#fi_req~0.base_BEFORE_CALL_1|))))) [2018-11-18 12:08:14,483 INFO L425 ceAbstractionStarter]: For program point L2984(lines 2984 2991) no Hoare annotation was computed. [2018-11-18 12:08:14,483 INFO L425 ceAbstractionStarter]: For program point ldv_zallocEXIT(lines 2976 2993) no Hoare annotation was computed. [2018-11-18 12:08:14,483 INFO L421 ceAbstractionStarter]: At program point ldv_zallocENTRY(lines 2976 2993) the Hoare annotation is: (or (and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|)) (not (= (_ bv2 32) ~ldv_count_1~0)) (not (= (_ bv0 32) ~ldv_count_2~0)) (forall ((|v_aem_find_aem2_~#fi_req~0.base_BEFORE_CALL_1| (_ BitVec 32))) (not (= (_ bv1 1) (select |old(#valid)| |v_aem_find_aem2_~#fi_req~0.base_BEFORE_CALL_1|))))) [2018-11-18 12:08:14,483 INFO L425 ceAbstractionStarter]: For program point ldv_zallocFINAL(lines 2976 2993) no Hoare annotation was computed. [2018-11-18 12:08:14,483 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 12:08:14,483 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= (_ bv0 32) ~ldv_count_1~0) (= (_ bv0 32) ~ldv_count_2~0) (= ~ldv_state_variable_3~0 (_ bv0 32))) [2018-11-18 12:08:14,484 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 12:08:14,484 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 12:08:14,484 INFO L425 ceAbstractionStarter]: For program point ldv_memsetFINAL(lines 3006 3014) no Hoare annotation was computed. [2018-11-18 12:08:14,484 INFO L421 ceAbstractionStarter]: At program point ldv_memsetENTRY(lines 3006 3014) the Hoare annotation is: (or (not (= (_ bv2 32) ~ldv_count_1~0)) (not (= (_ bv0 32) ~ldv_count_2~0)) (not (= (_ bv0 32) ~ldv_state_variable_3~0)) (= |old(#memory_int)| |#memory_int|)) [2018-11-18 12:08:14,484 INFO L425 ceAbstractionStarter]: For program point ldv_memsetEXIT(lines 3006 3014) no Hoare annotation was computed. [2018-11-18 12:08:14,484 INFO L425 ceAbstractionStarter]: For program point L3011-1(line 3011) no Hoare annotation was computed. [2018-11-18 12:08:14,484 INFO L421 ceAbstractionStarter]: At program point L3011(line 3011) the Hoare annotation is: (or (not (= (_ bv2 32) ~ldv_count_1~0)) (not (= (_ bv0 32) ~ldv_count_2~0)) (and (= |ldv_memset_#in~n| ldv_memset_~n) (= |old(#memory_int)| |#memory_int|)) (not (= (_ bv0 32) ~ldv_state_variable_3~0))) [2018-11-18 12:08:14,484 INFO L428 ceAbstractionStarter]: At program point ldv_device_create_fileENTRY(lines 4539 4559) the Hoare annotation is: true [2018-11-18 12:08:14,484 INFO L428 ceAbstractionStarter]: At program point L4545(line 4545) the Hoare annotation is: true [2018-11-18 12:08:14,484 INFO L425 ceAbstractionStarter]: For program point L4545-1(line 4545) no Hoare annotation was computed. [2018-11-18 12:08:14,489 INFO L425 ceAbstractionStarter]: For program point ldv_device_create_fileEXIT(lines 4539 4559) no Hoare annotation was computed. [2018-11-18 12:08:14,489 INFO L425 ceAbstractionStarter]: For program point ldv_device_create_fileFINAL(lines 4539 4559) no Hoare annotation was computed. [2018-11-18 12:08:14,489 INFO L428 ceAbstractionStarter]: At program point L4555(line 4555) the Hoare annotation is: true [2018-11-18 12:08:14,489 INFO L425 ceAbstractionStarter]: For program point L4555-1(line 4555) no Hoare annotation was computed. [2018-11-18 12:08:14,489 INFO L425 ceAbstractionStarter]: For program point L4548-1(lines 4548 4552) no Hoare annotation was computed. [2018-11-18 12:08:14,489 INFO L425 ceAbstractionStarter]: For program point L4546(lines 4546 4557) no Hoare annotation was computed. [2018-11-18 12:08:14,489 INFO L428 ceAbstractionStarter]: At program point L4549(line 4549) the Hoare annotation is: true [2018-11-18 12:08:14,489 INFO L425 ceAbstractionStarter]: For program point L4548(lines 4548 4552) no Hoare annotation was computed. [2018-11-18 12:08:14,489 INFO L425 ceAbstractionStarter]: For program point L4092(lines 4092 4096) no Hoare annotation was computed. [2018-11-18 12:08:14,489 INFO L428 ceAbstractionStarter]: At program point aem_remove_sensorsENTRY(lines 4084 4110) the Hoare annotation is: true [2018-11-18 12:08:14,489 INFO L425 ceAbstractionStarter]: For program point aem_remove_sensorsEXIT(lines 4084 4110) no Hoare annotation was computed. [2018-11-18 12:08:14,489 INFO L428 ceAbstractionStarter]: At program point L4102(lines 4088 4109) the Hoare annotation is: true [2018-11-18 12:08:14,489 INFO L425 ceAbstractionStarter]: For program point aem_remove_sensorsFINAL(lines 4084 4110) no Hoare annotation was computed. [2018-11-18 12:08:14,489 INFO L428 ceAbstractionStarter]: At program point L4100(lines 4088 4109) the Hoare annotation is: true [2018-11-18 12:08:14,489 INFO L428 ceAbstractionStarter]: At program point L4098(lines 4088 4109) the Hoare annotation is: true [2018-11-18 12:08:14,489 INFO L428 ceAbstractionStarter]: At program point L4411(line 4411) the Hoare annotation is: true [2018-11-18 12:08:14,489 INFO L425 ceAbstractionStarter]: For program point L4411-1(line 4411) no Hoare annotation was computed. [2018-11-18 12:08:14,489 INFO L428 ceAbstractionStarter]: At program point IS_ERRENTRY(lines 4406 4414) the Hoare annotation is: true [2018-11-18 12:08:14,489 INFO L425 ceAbstractionStarter]: For program point IS_ERRFINAL(lines 4406 4414) no Hoare annotation was computed. [2018-11-18 12:08:14,489 INFO L425 ceAbstractionStarter]: For program point IS_ERREXIT(lines 4406 4414) no Hoare annotation was computed. [2018-11-18 12:08:14,496 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: translation of (const (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32))) not yet implemented, please contact Matthias at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:312) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:312) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:312) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:446) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:135) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:373) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:108) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:92) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:537) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:237) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:194) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) 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) [2018-11-18 12:08:14,504 INFO L168 Benchmark]: Toolchain (without parser) took 329339.85 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 843.1 MB). Free memory was 944.4 MB in the beginning and 1.2 GB in the end (delta: -209.0 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2018-11-18 12:08:14,505 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:08:14,505 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1835.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 202.9 MB). Free memory was 944.4 MB in the beginning and 771.6 MB in the end (delta: 172.8 MB). Peak memory consumption was 395.5 MB. Max. memory is 11.5 GB. [2018-11-18 12:08:14,505 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.85 ms. Allocated memory is still 1.2 GB. Free memory is still 771.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:08:14,505 INFO L168 Benchmark]: Boogie Preprocessor took 99.92 ms. Allocated memory is still 1.2 GB. Free memory was 771.6 MB in the beginning and 762.5 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 11.5 GB. [2018-11-18 12:08:14,506 INFO L168 Benchmark]: RCFGBuilder took 4881.06 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 32.0 MB). Free memory was 762.5 MB in the beginning and 1.2 GB in the end (delta: -413.1 MB). Peak memory consumption was 71.7 MB. Max. memory is 11.5 GB. [2018-11-18 12:08:14,506 INFO L168 Benchmark]: TraceAbstraction took 322475.16 ms. Allocated memory was 1.3 GB in the beginning and 1.9 GB in the end (delta: 608.2 MB). Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 22.2 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2018-11-18 12:08:14,508 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1835.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 202.9 MB). Free memory was 944.4 MB in the beginning and 771.6 MB in the end (delta: 172.8 MB). Peak memory consumption was 395.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.85 ms. Allocated memory is still 1.2 GB. Free memory is still 771.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 99.92 ms. Allocated memory is still 1.2 GB. Free memory was 771.6 MB in the beginning and 762.5 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 4881.06 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 32.0 MB). Free memory was 762.5 MB in the beginning and 1.2 GB in the end (delta: -413.1 MB). Peak memory consumption was 71.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 322475.16 ms. Allocated memory was 1.3 GB in the beginning and 1.9 GB in the end (delta: 608.2 MB). Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 22.2 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4466]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ExceptionOrErrorResult: UnsupportedOperationException: translation of (const (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32))) not yet implemented, please contact Matthias de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: translation of (const (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32))) not yet implemented, please contact Matthias: de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...