./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_563d2e2b-a768-472c-b397-b1e2167acd71/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_563d2e2b-a768-472c-b397-b1e2167acd71/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_563d2e2b-a768-472c-b397-b1e2167acd71/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_563d2e2b-a768-472c-b397-b1e2167acd71/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i -s /tmp/vcloud-vcloud-master/worker/working_dir_563d2e2b-a768-472c-b397-b1e2167acd71/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_563d2e2b-a768-472c-b397-b1e2167acd71/bin/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 32bit --witnessprinter.graph.data.programhash b9633ec6dc7e01a7231c1be5ed310faef61ba6b0 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_563d2e2b-a768-472c-b397-b1e2167acd71/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_563d2e2b-a768-472c-b397-b1e2167acd71/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_563d2e2b-a768-472c-b397-b1e2167acd71/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_563d2e2b-a768-472c-b397-b1e2167acd71/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i -s /tmp/vcloud-vcloud-master/worker/working_dir_563d2e2b-a768-472c-b397-b1e2167acd71/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_563d2e2b-a768-472c-b397-b1e2167acd71/bin/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 32bit --witnessprinter.graph.data.programhash b9633ec6dc7e01a7231c1be5ed310faef61ba6b0 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: expected NNF --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 11:20:55,366 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:20:55,367 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:20:55,377 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:20:55,377 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:20:55,377 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:20:55,379 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:20:55,380 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:20:55,382 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:20:55,383 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:20:55,383 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:20:55,384 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:20:55,384 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:20:55,385 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:20:55,386 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:20:55,387 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:20:55,387 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:20:55,388 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:20:55,390 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:20:55,391 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:20:55,392 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:20:55,393 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:20:55,394 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:20:55,395 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:20:55,397 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:20:55,397 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:20:55,398 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:20:55,398 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:20:55,399 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:20:55,404 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:20:55,404 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:20:55,405 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:20:55,405 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:20:55,406 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:20:55,407 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:20:55,407 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:20:55,408 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:20:55,409 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:20:55,409 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:20:55,410 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:20:55,410 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:20:55,411 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_563d2e2b-a768-472c-b397-b1e2167acd71/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:20:55,423 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:20:55,423 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:20:55,424 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:20:55,424 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:20:55,424 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:20:55,424 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:20:55,424 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:20:55,425 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:20:55,425 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:20:55,425 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:20:55,425 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:20:55,425 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:20:55,426 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:20:55,426 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:20:55,426 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:20:55,426 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:20:55,427 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:20:55,427 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:20:55,427 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:20:55,427 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:20:55,427 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:20:55,427 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:20:55,427 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:20:55,428 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:20:55,428 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:20:55,428 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:20:55,428 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:20:55,428 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:20:55,428 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:20:55,429 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:20:55,429 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:20:55,429 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:20:55,429 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:20:55,429 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:20:55,429 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:20:55,429 INFO L138 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_563d2e2b-a768-472c-b397-b1e2167acd71/bin/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b9633ec6dc7e01a7231c1be5ed310faef61ba6b0 [2019-10-22 11:20:55,465 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:20:55,475 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:20:55,478 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:20:55,479 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:20:55,480 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:20:55,481 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_563d2e2b-a768-472c-b397-b1e2167acd71/bin/utaipan/../../sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i [2019-10-22 11:20:55,529 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_563d2e2b-a768-472c-b397-b1e2167acd71/bin/utaipan/data/cb6e3ce72/79297121ef2e42e79831646b4a192dd5/FLAGf05b2bf06 [2019-10-22 11:20:55,966 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:20:55,967 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_563d2e2b-a768-472c-b397-b1e2167acd71/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i [2019-10-22 11:20:55,977 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_563d2e2b-a768-472c-b397-b1e2167acd71/bin/utaipan/data/cb6e3ce72/79297121ef2e42e79831646b4a192dd5/FLAGf05b2bf06 [2019-10-22 11:20:55,986 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_563d2e2b-a768-472c-b397-b1e2167acd71/bin/utaipan/data/cb6e3ce72/79297121ef2e42e79831646b4a192dd5 [2019-10-22 11:20:55,988 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:20:55,989 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:20:55,990 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:20:55,990 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:20:55,994 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:20:55,994 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:20:55" (1/1) ... [2019-10-22 11:20:55,997 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@636b271b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:55, skipping insertion in model container [2019-10-22 11:20:55,997 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:20:55" (1/1) ... [2019-10-22 11:20:56,004 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:20:56,036 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:20:56,397 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:20:56,409 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:20:56,453 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:20:56,488 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:20:56,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:56 WrapperNode [2019-10-22 11:20:56,488 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:20:56,489 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:20:56,489 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:20:56,489 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:20:56,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:56" (1/1) ... [2019-10-22 11:20:56,509 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:56" (1/1) ... [2019-10-22 11:20:56,530 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:20:56,530 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:20:56,530 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:20:56,531 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:20:56,537 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:56" (1/1) ... [2019-10-22 11:20:56,537 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:56" (1/1) ... [2019-10-22 11:20:56,540 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:56" (1/1) ... [2019-10-22 11:20:56,540 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:56" (1/1) ... [2019-10-22 11:20:56,548 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:56" (1/1) ... [2019-10-22 11:20:56,555 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:56" (1/1) ... [2019-10-22 11:20:56,557 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:56" (1/1) ... [2019-10-22 11:20:56,559 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:20:56,560 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:20:56,560 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:20:56,560 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:20:56,561 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_563d2e2b-a768-472c-b397-b1e2167acd71/bin/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 [2019-10-22 11:20:56,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 11:20:56,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 11:20:56,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 11:20:56,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 11:20:56,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 11:20:56,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:20:56,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:20:56,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:20:57,066 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:20:57,066 INFO L284 CfgBuilder]: Removed 21 assume(true) statements. [2019-10-22 11:20:57,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:20:57 BoogieIcfgContainer [2019-10-22 11:20:57,067 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:20:57,068 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:20:57,068 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:20:57,071 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:20:57,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:20:55" (1/3) ... [2019-10-22 11:20:57,072 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@866e65f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:20:57, skipping insertion in model container [2019-10-22 11:20:57,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:56" (2/3) ... [2019-10-22 11:20:57,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@866e65f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:20:57, skipping insertion in model container [2019-10-22 11:20:57,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:20:57" (3/3) ... [2019-10-22 11:20:57,075 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel-1.i [2019-10-22 11:20:57,084 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:20:57,091 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-10-22 11:20:57,102 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-10-22 11:20:57,123 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:20:57,123 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:20:57,123 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:20:57,123 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:20:57,130 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:20:57,130 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:20:57,130 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:20:57,130 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:20:57,146 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-10-22 11:20:57,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-10-22 11:20:57,154 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:20:57,155 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-10-22 11:20:57,157 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:20:57,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:20:57,164 INFO L82 PathProgramCache]: Analyzing trace with hash 891600134, now seen corresponding path program 1 times [2019-10-22 11:20:57,172 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:20:57,173 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346520133] [2019-10-22 11:20:57,173 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:57,173 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:57,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:20:57,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:20:57,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:20:57,333 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346520133] [2019-10-22 11:20:57,334 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:20:57,335 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:20:57,335 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067191640] [2019-10-22 11:20:57,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-22 11:20:57,341 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:20:57,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 11:20:57,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 11:20:57,357 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 2 states. [2019-10-22 11:20:57,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:20:57,382 INFO L93 Difference]: Finished difference Result 92 states and 150 transitions. [2019-10-22 11:20:57,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 11:20:57,383 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2019-10-22 11:20:57,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:20:57,393 INFO L225 Difference]: With dead ends: 92 [2019-10-22 11:20:57,394 INFO L226 Difference]: Without dead ends: 41 [2019-10-22 11:20:57,397 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 11:20:57,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-22 11:20:57,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-10-22 11:20:57,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-22 11:20:57,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2019-10-22 11:20:57,428 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 6 [2019-10-22 11:20:57,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:20:57,428 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2019-10-22 11:20:57,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-22 11:20:57,428 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2019-10-22 11:20:57,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-10-22 11:20:57,429 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:20:57,429 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:20:57,429 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:20:57,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:20:57,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1806905862, now seen corresponding path program 1 times [2019-10-22 11:20:57,430 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:20:57,430 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661671711] [2019-10-22 11:20:57,430 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:57,430 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:57,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:20:57,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:20:57,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:20:57,540 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661671711] [2019-10-22 11:20:57,541 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:20:57,541 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:20:57,541 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21507884] [2019-10-22 11:20:57,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:20:57,542 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:20:57,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:20:57,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:20:57,543 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 4 states. [2019-10-22 11:20:57,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:20:57,647 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2019-10-22 11:20:57,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:20:57,647 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-10-22 11:20:57,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:20:57,648 INFO L225 Difference]: With dead ends: 47 [2019-10-22 11:20:57,648 INFO L226 Difference]: Without dead ends: 45 [2019-10-22 11:20:57,649 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:20:57,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-22 11:20:57,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2019-10-22 11:20:57,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-22 11:20:57,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-10-22 11:20:57,653 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 7 [2019-10-22 11:20:57,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:20:57,659 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-10-22 11:20:57,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:20:57,659 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-10-22 11:20:57,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-10-22 11:20:57,660 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:20:57,660 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:20:57,660 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:20:57,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:20:57,661 INFO L82 PathProgramCache]: Analyzing trace with hash 179566605, now seen corresponding path program 1 times [2019-10-22 11:20:57,661 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:20:57,661 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554533494] [2019-10-22 11:20:57,661 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:57,661 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:57,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:20:57,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:20:57,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:20:57,771 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554533494] [2019-10-22 11:20:57,772 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:20:57,772 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:20:57,772 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76207743] [2019-10-22 11:20:57,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:20:57,772 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:20:57,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:20:57,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:20:57,773 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 4 states. [2019-10-22 11:20:57,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:20:57,839 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2019-10-22 11:20:57,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:20:57,840 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-10-22 11:20:57,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:20:57,840 INFO L225 Difference]: With dead ends: 39 [2019-10-22 11:20:57,840 INFO L226 Difference]: Without dead ends: 37 [2019-10-22 11:20:57,841 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:20:57,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-22 11:20:57,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-10-22 11:20:57,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-22 11:20:57,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2019-10-22 11:20:57,844 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 8 [2019-10-22 11:20:57,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:20:57,844 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2019-10-22 11:20:57,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:20:57,844 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2019-10-22 11:20:57,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-22 11:20:57,845 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:20:57,845 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:20:57,845 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:20:57,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:20:57,845 INFO L82 PathProgramCache]: Analyzing trace with hash 711412120, now seen corresponding path program 1 times [2019-10-22 11:20:57,846 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:20:57,846 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797868082] [2019-10-22 11:20:57,846 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:57,846 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:57,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:20:57,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:20:57,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:20:57,962 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797868082] [2019-10-22 11:20:57,962 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:20:57,962 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:20:57,962 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820549875] [2019-10-22 11:20:57,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:20:57,963 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:20:57,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:20:57,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:20:57,963 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 6 states. [2019-10-22 11:20:58,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:20:58,221 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2019-10-22 11:20:58,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:20:58,223 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-10-22 11:20:58,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:20:58,223 INFO L225 Difference]: With dead ends: 78 [2019-10-22 11:20:58,223 INFO L226 Difference]: Without dead ends: 76 [2019-10-22 11:20:58,224 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:20:58,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-10-22 11:20:58,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 55. [2019-10-22 11:20:58,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-22 11:20:58,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2019-10-22 11:20:58,240 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 10 [2019-10-22 11:20:58,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:20:58,240 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2019-10-22 11:20:58,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:20:58,240 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2019-10-22 11:20:58,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-22 11:20:58,241 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:20:58,241 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:20:58,241 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:20:58,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:20:58,241 INFO L82 PathProgramCache]: Analyzing trace with hash -2056579816, now seen corresponding path program 1 times [2019-10-22 11:20:58,242 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:20:58,245 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228496431] [2019-10-22 11:20:58,245 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:58,245 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:58,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:20:58,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:20:58,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:20:58,332 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228496431] [2019-10-22 11:20:58,332 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:20:58,332 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:20:58,332 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126630681] [2019-10-22 11:20:58,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:20:58,333 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:20:58,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:20:58,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:20:58,333 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 4 states. [2019-10-22 11:20:58,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:20:58,435 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2019-10-22 11:20:58,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:20:58,435 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-22 11:20:58,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:20:58,436 INFO L225 Difference]: With dead ends: 55 [2019-10-22 11:20:58,436 INFO L226 Difference]: Without dead ends: 53 [2019-10-22 11:20:58,436 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:20:58,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-10-22 11:20:58,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-10-22 11:20:58,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-22 11:20:58,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2019-10-22 11:20:58,442 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 11 [2019-10-22 11:20:58,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:20:58,442 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2019-10-22 11:20:58,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:20:58,442 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2019-10-22 11:20:58,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-22 11:20:58,443 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:20:58,443 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:20:58,443 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:20:58,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:20:58,443 INFO L82 PathProgramCache]: Analyzing trace with hash -688119236, now seen corresponding path program 1 times [2019-10-22 11:20:58,443 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:20:58,444 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635941205] [2019-10-22 11:20:58,444 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:58,444 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:58,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:20:58,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:20:58,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:20:58,506 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635941205] [2019-10-22 11:20:58,507 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:20:58,507 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:20:58,507 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120161150] [2019-10-22 11:20:58,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:20:58,507 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:20:58,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:20:58,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:20:58,508 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 4 states. [2019-10-22 11:20:58,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:20:58,563 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2019-10-22 11:20:58,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:20:58,564 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-10-22 11:20:58,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:20:58,565 INFO L225 Difference]: With dead ends: 53 [2019-10-22 11:20:58,565 INFO L226 Difference]: Without dead ends: 51 [2019-10-22 11:20:58,565 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:20:58,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-10-22 11:20:58,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-10-22 11:20:58,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-10-22 11:20:58,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2019-10-22 11:20:58,571 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 13 [2019-10-22 11:20:58,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:20:58,571 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2019-10-22 11:20:58,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:20:58,571 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2019-10-22 11:20:58,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-22 11:20:58,572 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:20:58,572 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:20:58,572 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:20:58,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:20:58,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1285114177, now seen corresponding path program 1 times [2019-10-22 11:20:58,573 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:20:58,573 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133131047] [2019-10-22 11:20:58,573 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:58,573 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:58,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:20:58,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:20:58,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:20:58,676 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133131047] [2019-10-22 11:20:58,676 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:20:58,676 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:20:58,676 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49061952] [2019-10-22 11:20:58,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:20:58,677 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:20:58,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:20:58,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:20:58,677 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 5 states. [2019-10-22 11:20:58,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:20:58,792 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2019-10-22 11:20:58,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:20:58,793 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-10-22 11:20:58,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:20:58,793 INFO L225 Difference]: With dead ends: 66 [2019-10-22 11:20:58,794 INFO L226 Difference]: Without dead ends: 54 [2019-10-22 11:20:58,794 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:20:58,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-10-22 11:20:58,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-10-22 11:20:58,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-22 11:20:58,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2019-10-22 11:20:58,806 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 14 [2019-10-22 11:20:58,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:20:58,806 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2019-10-22 11:20:58,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:20:58,806 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2019-10-22 11:20:58,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-22 11:20:58,807 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:20:58,807 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:20:58,807 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:20:58,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:20:58,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1621160418, now seen corresponding path program 1 times [2019-10-22 11:20:58,808 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:20:58,808 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426833990] [2019-10-22 11:20:58,808 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:58,808 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:58,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:20:58,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:20:58,876 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:20:58,877 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426833990] [2019-10-22 11:20:58,877 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234134651] [2019-10-22 11:20:58,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_563d2e2b-a768-472c-b397-b1e2167acd71/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:20:58,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:20:58,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-22 11:20:58,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:20:58,995 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:20:58,998 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:20:59,001 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:20:59,016 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2019-10-22 11:20:59,018 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:20:59,029 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:20:59,033 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:20:59,035 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:20:59,036 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:20:59,038 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2019-10-22 11:20:59,038 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:20:59,047 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:20:59,048 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:20:59,048 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-10-22 11:20:59,090 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:20:59,092 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2019-10-22 11:20:59,092 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:20:59,101 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:20:59,105 INFO L341 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-10-22 11:20:59,105 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 10 [2019-10-22 11:20:59,106 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:20:59,111 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:20:59,111 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:20:59,111 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:7 [2019-10-22 11:20:59,114 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:20:59,115 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:20:59,126 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:20:59,126 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [140318277] [2019-10-22 11:20:59,132 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 18 [2019-10-22 11:20:59,167 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-10-22 11:20:59,167 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-22 11:20:59,463 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:20:59,464 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inappropriate decl info IMPLEMENTATION at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Boogie2SmtSymbolTable.getBoogieVar(Boogie2SmtSymbolTable.java:222) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.getBoogieVar(NonrelationalStatementProcessor.java:348) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.handleHavocStatement(NonrelationalStatementProcessor.java:325) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processStatement(NonrelationalStatementProcessor.java:159) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:138) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:107) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:422) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:413) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:140) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.applyInternally(CompoundDomainPostOperator.java:306) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:131) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormanCachedPostOperation.restoreOriginalStateVariables(PoormanCachedPostOperation.java:322) 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:120) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:323) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:519) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:323) 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:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner.(CegarAbsIntRunner.java:158) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAbstractInterpretation.getOrConstructRunner(IpTcStrategyModuleAbstractInterpretation.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAbstractInterpretation.construct(IpTcStrategyModuleAbstractInterpretation.java:81) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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) [2019-10-22 11:20:59,469 INFO L168 Benchmark]: Toolchain (without parser) took 3480.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 940.4 MB in the beginning and 884.7 MB in the end (delta: 55.7 MB). Peak memory consumption was 195.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:20:59,470 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:20:59,471 INFO L168 Benchmark]: CACSL2BoogieTranslator took 498.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 940.4 MB in the beginning and 1.1 GB in the end (delta: -182.8 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:20:59,471 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.35 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:20:59,471 INFO L168 Benchmark]: Boogie Preprocessor took 29.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:20:59,472 INFO L168 Benchmark]: RCFGBuilder took 507.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:20:59,472 INFO L168 Benchmark]: TraceAbstraction took 2400.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 884.7 MB in the end (delta: 198.8 MB). Peak memory consumption was 198.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:20:59,475 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 498.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 940.4 MB in the beginning and 1.1 GB in the end (delta: -182.8 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.35 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 507.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2400.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 884.7 MB in the end (delta: 198.8 MB). Peak memory consumption was 198.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inappropriate decl info IMPLEMENTATION de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inappropriate decl info IMPLEMENTATION: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Boogie2SmtSymbolTable.getBoogieVar(Boogie2SmtSymbolTable.java:222) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-10-22 11:21:01,544 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:21:01,546 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:21:01,555 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:21:01,555 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:21:01,556 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:21:01,557 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:21:01,558 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:21:01,560 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:21:01,560 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:21:01,561 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:21:01,562 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:21:01,562 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:21:01,563 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:21:01,564 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:21:01,565 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:21:01,565 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:21:01,566 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:21:01,568 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:21:01,569 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:21:01,571 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:21:01,572 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:21:01,572 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:21:01,573 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:21:01,575 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:21:01,575 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:21:01,575 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:21:01,576 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:21:01,577 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:21:01,577 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:21:01,578 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:21:01,578 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:21:01,579 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:21:01,579 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:21:01,580 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:21:01,580 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:21:01,581 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:21:01,581 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:21:01,581 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:21:01,582 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:21:01,583 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:21:01,583 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_563d2e2b-a768-472c-b397-b1e2167acd71/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2019-10-22 11:21:01,594 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:21:01,594 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:21:01,595 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:21:01,595 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:21:01,595 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:21:01,595 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:21:01,596 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:21:01,596 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:21:01,596 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:21:01,596 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:21:01,597 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:21:01,597 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:21:01,597 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:21:01,597 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:21:01,597 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:21:01,597 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:21:01,597 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-10-22 11:21:01,598 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-10-22 11:21:01,598 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:21:01,598 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:21:01,598 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 11:21:01,599 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:21:01,599 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:21:01,599 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:21:01,599 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:21:01,599 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:21:01,599 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:21:01,600 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:21:01,600 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:21:01,600 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:21:01,600 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-10-22 11:21:01,600 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-10-22 11:21:01,601 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:21:01,601 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:21:01,601 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_563d2e2b-a768-472c-b397-b1e2167acd71/bin/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b9633ec6dc7e01a7231c1be5ed310faef61ba6b0 [2019-10-22 11:21:01,627 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:21:01,642 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:21:01,645 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:21:01,647 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:21:01,648 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:21:01,648 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_563d2e2b-a768-472c-b397-b1e2167acd71/bin/utaipan/../../sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i [2019-10-22 11:21:01,699 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_563d2e2b-a768-472c-b397-b1e2167acd71/bin/utaipan/data/d1c0c362f/8afee07f85a14ac8b35e991ad4f806cc/FLAG7fe48a2b6 [2019-10-22 11:21:02,150 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:21:02,151 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_563d2e2b-a768-472c-b397-b1e2167acd71/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i [2019-10-22 11:21:02,162 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_563d2e2b-a768-472c-b397-b1e2167acd71/bin/utaipan/data/d1c0c362f/8afee07f85a14ac8b35e991ad4f806cc/FLAG7fe48a2b6 [2019-10-22 11:21:02,436 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_563d2e2b-a768-472c-b397-b1e2167acd71/bin/utaipan/data/d1c0c362f/8afee07f85a14ac8b35e991ad4f806cc [2019-10-22 11:21:02,448 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:21:02,450 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:21:02,450 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:21:02,451 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:21:02,454 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:21:02,455 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:21:02" (1/1) ... [2019-10-22 11:21:02,457 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a5015dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:02, skipping insertion in model container [2019-10-22 11:21:02,458 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:21:02" (1/1) ... [2019-10-22 11:21:02,465 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:21:02,517 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:21:02,809 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:21:02,902 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:21:02,961 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:21:03,005 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:21:03,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:03 WrapperNode [2019-10-22 11:21:03,006 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:21:03,007 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:21:03,007 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:21:03,007 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:21:03,015 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:03" (1/1) ... [2019-10-22 11:21:03,030 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:03" (1/1) ... [2019-10-22 11:21:03,053 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:21:03,053 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:21:03,053 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:21:03,053 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:21:03,066 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:03" (1/1) ... [2019-10-22 11:21:03,066 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:03" (1/1) ... [2019-10-22 11:21:03,070 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:03" (1/1) ... [2019-10-22 11:21:03,071 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:03" (1/1) ... [2019-10-22 11:21:03,086 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:03" (1/1) ... [2019-10-22 11:21:03,097 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:03" (1/1) ... [2019-10-22 11:21:03,098 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:03" (1/1) ... [2019-10-22 11:21:03,107 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:21:03,107 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:21:03,107 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:21:03,107 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:21:03,108 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_563d2e2b-a768-472c-b397-b1e2167acd71/bin/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 [2019-10-22 11:21:03,165 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-10-22 11:21:03,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 11:21:03,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 11:21:03,165 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 11:21:03,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:21:03,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-10-22 11:21:03,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:21:03,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:21:03,856 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:21:03,856 INFO L284 CfgBuilder]: Removed 21 assume(true) statements. [2019-10-22 11:21:03,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:21:03 BoogieIcfgContainer [2019-10-22 11:21:03,857 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:21:03,858 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:21:03,858 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:21:03,860 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:21:03,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:21:02" (1/3) ... [2019-10-22 11:21:03,861 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cf9bb16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:21:03, skipping insertion in model container [2019-10-22 11:21:03,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:03" (2/3) ... [2019-10-22 11:21:03,862 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cf9bb16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:21:03, skipping insertion in model container [2019-10-22 11:21:03,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:21:03" (3/3) ... [2019-10-22 11:21:03,864 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel-1.i [2019-10-22 11:21:03,873 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:21:03,879 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-10-22 11:21:03,888 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-10-22 11:21:03,911 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:21:03,911 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:21:03,911 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:21:03,912 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:21:03,912 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:21:03,912 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:21:03,912 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:21:03,912 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:21:03,925 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2019-10-22 11:21:03,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-10-22 11:21:03,930 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:03,931 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-10-22 11:21:03,932 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:03,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:03,936 INFO L82 PathProgramCache]: Analyzing trace with hash 891569350, now seen corresponding path program 1 times [2019-10-22 11:21:03,943 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:21:03,943 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [452292534] [2019-10-22 11:21:03,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_563d2e2b-a768-472c-b397-b1e2167acd71/bin/utaipan/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:21:04,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:04,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 1 conjunts are in the unsatisfiable core [2019-10-22 11:21:04,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:21:04,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:04,051 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:21:04,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:04,055 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [452292534] [2019-10-22 11:21:04,055 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:04,056 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-10-22 11:21:04,056 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194593039] [2019-10-22 11:21:04,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-22 11:21:04,060 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:21:04,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 11:21:04,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 11:21:04,074 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 2 states. [2019-10-22 11:21:04,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:04,089 INFO L93 Difference]: Finished difference Result 90 states and 148 transitions. [2019-10-22 11:21:04,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 11:21:04,091 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2019-10-22 11:21:04,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:04,098 INFO L225 Difference]: With dead ends: 90 [2019-10-22 11:21:04,099 INFO L226 Difference]: Without dead ends: 40 [2019-10-22 11:21:04,102 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 11:21:04,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-22 11:21:04,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-10-22 11:21:04,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-22 11:21:04,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2019-10-22 11:21:04,135 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 6 [2019-10-22 11:21:04,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:04,135 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2019-10-22 11:21:04,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-22 11:21:04,136 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2019-10-22 11:21:04,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-10-22 11:21:04,136 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:04,136 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-10-22 11:21:04,337 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:21:04,337 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:04,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:04,337 INFO L82 PathProgramCache]: Analyzing trace with hash 889692517, now seen corresponding path program 1 times [2019-10-22 11:21:04,338 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:21:04,338 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1901413272] [2019-10-22 11:21:04,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_563d2e2b-a768-472c-b397-b1e2167acd71/bin/utaipan/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:21:04,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:04,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 11:21:04,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:21:04,483 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-10-22 11:21:04,484 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:21:04,491 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:21:04,492 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:21:04,492 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2019-10-22 11:21:04,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:04,503 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:21:04,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:04,507 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1901413272] [2019-10-22 11:21:04,507 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:04,507 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-10-22 11:21:04,507 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736082228] [2019-10-22 11:21:04,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:21:04,509 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:21:04,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:21:04,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:04,510 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 4 states. [2019-10-22 11:21:05,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:05,084 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2019-10-22 11:21:05,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:21:05,085 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-10-22 11:21:05,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:05,086 INFO L225 Difference]: With dead ends: 45 [2019-10-22 11:21:05,086 INFO L226 Difference]: Without dead ends: 43 [2019-10-22 11:21:05,087 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:21:05,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-22 11:21:05,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 38. [2019-10-22 11:21:05,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-22 11:21:05,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2019-10-22 11:21:05,096 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 6 [2019-10-22 11:21:05,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:05,097 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2019-10-22 11:21:05,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:21:05,097 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2019-10-22 11:21:05,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-10-22 11:21:05,098 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:05,098 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:05,298 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:21:05,299 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:05,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:05,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1810723981, now seen corresponding path program 1 times [2019-10-22 11:21:05,300 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:21:05,300 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1024698992] [2019-10-22 11:21:05,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_563d2e2b-a768-472c-b397-b1e2167acd71/bin/utaipan/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:21:05,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:05,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 11:21:05,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:21:05,447 INFO L375 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 13 treesize of output 9 [2019-10-22 11:21:05,447 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:21:05,453 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:21:05,453 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:21:05,454 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-10-22 11:21:05,471 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-10-22 11:21:05,472 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:21:05,478 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:21:05,479 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:21:05,479 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-10-22 11:21:05,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:05,489 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:21:05,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:05,491 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1024698992] [2019-10-22 11:21:05,491 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:05,492 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-10-22 11:21:05,492 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71197108] [2019-10-22 11:21:05,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:21:05,492 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:21:05,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:21:05,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:05,493 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 4 states. [2019-10-22 11:21:05,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:05,888 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2019-10-22 11:21:05,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:21:05,889 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-10-22 11:21:05,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:05,890 INFO L225 Difference]: With dead ends: 38 [2019-10-22 11:21:05,890 INFO L226 Difference]: Without dead ends: 36 [2019-10-22 11:21:05,891 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:21:05,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-22 11:21:05,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-10-22 11:21:05,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-22 11:21:05,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2019-10-22 11:21:05,898 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 7 [2019-10-22 11:21:05,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:05,898 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2019-10-22 11:21:05,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:21:05,898 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2019-10-22 11:21:05,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-10-22 11:21:05,899 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:05,899 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:06,100 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:21:06,101 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:06,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:06,101 INFO L82 PathProgramCache]: Analyzing trace with hash 590587384, now seen corresponding path program 1 times [2019-10-22 11:21:06,101 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:21:06,102 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1022289358] [2019-10-22 11:21:06,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_563d2e2b-a768-472c-b397-b1e2167acd71/bin/utaipan/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:21:06,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:06,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 11:21:06,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:21:06,202 INFO L375 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 13 treesize of output 9 [2019-10-22 11:21:06,203 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:21:06,210 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:21:06,210 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:21:06,211 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-10-22 11:21:06,243 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-22 11:21:06,244 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:21:06,247 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:21:06,247 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:21:06,247 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-22 11:21:06,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:06,258 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:21:06,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:06,303 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1022289358] [2019-10-22 11:21:06,303 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:06,303 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2019-10-22 11:21:06,303 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853537200] [2019-10-22 11:21:06,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 11:21:06,304 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:21:06,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 11:21:06,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:21:06,304 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 7 states. [2019-10-22 11:21:08,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:08,247 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2019-10-22 11:21:08,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:21:08,249 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-10-22 11:21:08,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:08,251 INFO L225 Difference]: With dead ends: 75 [2019-10-22 11:21:08,251 INFO L226 Difference]: Without dead ends: 73 [2019-10-22 11:21:08,252 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:21:08,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-10-22 11:21:08,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 52. [2019-10-22 11:21:08,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-10-22 11:21:08,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2019-10-22 11:21:08,259 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 9 [2019-10-22 11:21:08,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:08,259 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2019-10-22 11:21:08,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 11:21:08,259 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2019-10-22 11:21:08,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-22 11:21:08,260 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:08,260 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:08,461 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:21:08,461 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:08,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:08,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1507179337, now seen corresponding path program 1 times [2019-10-22 11:21:08,462 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:21:08,462 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1327190052] [2019-10-22 11:21:08,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_563d2e2b-a768-472c-b397-b1e2167acd71/bin/utaipan/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:21:08,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:08,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-22 11:21:08,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:21:08,699 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-10-22 11:21:08,699 INFO L375 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-10-22 11:21:08,700 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:21:08,708 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:21:08,708 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:21:08,709 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:14 [2019-10-22 11:21:08,816 INFO L341 Elim1Store]: treesize reduction 8, result has 87.3 percent of original size [2019-10-22 11:21:08,817 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 73 [2019-10-22 11:21:08,820 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:21:08,864 INFO L567 ElimStorePlain]: treesize reduction 28, result has 68.2 percent of original size [2019-10-22 11:21:08,871 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:21:08,872 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:21:08,886 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:21:08,888 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:21:08,888 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:62, output treesize:29 [2019-10-22 11:21:09,114 INFO L235 Elim1Store]: Index analysis took 105 ms [2019-10-22 11:21:09,141 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:21:09,142 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-10-22 11:21:09,143 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:21:10,138 WARN L191 SmtUtils]: Spent 993.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-10-22 11:21:10,138 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:21:10,140 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_30|], 10=[|v_#memory_$Pointer$.offset_30|]} [2019-10-22 11:21:10,187 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:21:10,221 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:21:10,228 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:21:10,301 INFO L341 Elim1Store]: treesize reduction 33, result has 55.4 percent of original size [2019-10-22 11:21:10,301 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 55 [2019-10-22 11:21:10,302 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:21:10,832 WARN L191 SmtUtils]: Spent 529.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-10-22 11:21:10,833 INFO L567 ElimStorePlain]: treesize reduction 16, result has 90.6 percent of original size [2019-10-22 11:21:10,838 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:21:10,848 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:21:10,992 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-10-22 11:21:10,992 INFO L341 Elim1Store]: treesize reduction 66, result has 55.1 percent of original size [2019-10-22 11:21:10,992 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 91 [2019-10-22 11:21:10,993 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-22 11:21:11,122 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-10-22 11:21:11,122 INFO L567 ElimStorePlain]: treesize reduction 56, result has 61.1 percent of original size [2019-10-22 11:21:11,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:11,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:11,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:11,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:11,131 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:21:11,132 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:198, output treesize:122 [2019-10-22 11:21:11,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:11,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:11,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:11,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:11,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:11,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:11,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:11,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:11,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:11,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:11,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:11,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:11,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:11,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:11,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:11,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:11,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:11,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:11,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:11,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:11,347 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:21:11,347 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 85 [2019-10-22 11:21:11,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:11,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:11,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:11,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:11,354 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:21:11,387 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:21:11,388 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 57 [2019-10-22 11:21:11,390 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:21:11,404 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:21:11,404 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 48 [2019-10-22 11:21:11,405 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:21:11,572 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-10-22 11:21:11,572 INFO L567 ElimStorePlain]: treesize reduction 27, result has 84.1 percent of original size [2019-10-22 11:21:11,592 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:21:11,592 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 39 [2019-10-22 11:21:11,593 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-22 11:21:11,794 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:21:11,794 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:195) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:275) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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) [2019-10-22 11:21:11,798 INFO L168 Benchmark]: Toolchain (without parser) took 9348.61 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 221.2 MB). Free memory was 940.3 MB in the beginning and 1.2 GB in the end (delta: -244.1 MB). Peak memory consumption was 270.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:11,798 INFO L168 Benchmark]: CDTParser took 0.41 ms. Allocated memory is still 1.0 GB. Free memory is still 972.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:21:11,799 INFO L168 Benchmark]: CACSL2BoogieTranslator took 556.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.8 MB). Free memory was 940.3 MB in the beginning and 1.2 GB in the end (delta: -210.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:11,799 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:11,799 INFO L168 Benchmark]: Boogie Preprocessor took 54.06 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:21:11,800 INFO L168 Benchmark]: RCFGBuilder took 750.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:11,800 INFO L168 Benchmark]: TraceAbstraction took 7938.48 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 52.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -72.3 MB). Peak memory consumption was 273.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:11,803 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.41 ms. Allocated memory is still 1.0 GB. Free memory is still 972.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 556.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.8 MB). Free memory was 940.3 MB in the beginning and 1.2 GB in the end (delta: -210.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 54.06 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 750.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7938.48 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 52.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -72.3 MB). Peak memory consumption was 273.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: expected NNF de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: expected NNF: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...