./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/forester-heap/sll-circular-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_5846a7aa-45e4-42a4-b4a1-c9ba0b66c377/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5846a7aa-45e4-42a4-b4a1-c9ba0b66c377/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5846a7aa-45e4-42a4-b4a1-c9ba0b66c377/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5846a7aa-45e4-42a4-b4a1-c9ba0b66c377/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/forester-heap/sll-circular-1.i -s /tmp/vcloud-vcloud-master/worker/working_dir_5846a7aa-45e4-42a4-b4a1-c9ba0b66c377/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5846a7aa-45e4-42a4-b4a1-c9ba0b66c377/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 811c06b4616c360d68e825b8fa9e0b4596e5faf8 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_5846a7aa-45e4-42a4-b4a1-c9ba0b66c377/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5846a7aa-45e4-42a4-b4a1-c9ba0b66c377/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5846a7aa-45e4-42a4-b4a1-c9ba0b66c377/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5846a7aa-45e4-42a4-b4a1-c9ba0b66c377/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/forester-heap/sll-circular-1.i -s /tmp/vcloud-vcloud-master/worker/working_dir_5846a7aa-45e4-42a4-b4a1-c9ba0b66c377/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5846a7aa-45e4-42a4-b4a1-c9ba0b66c377/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 811c06b4616c360d68e825b8fa9e0b4596e5faf8 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:22:08,855 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:22:08,856 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:22:08,865 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:22:08,866 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:22:08,867 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:22:08,868 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:22:08,869 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:22:08,871 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:22:08,872 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:22:08,872 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:22:08,875 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:22:08,875 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:22:08,876 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:22:08,877 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:22:08,877 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:22:08,881 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:22:08,882 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:22:08,883 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:22:08,885 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:22:08,886 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:22:08,887 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:22:08,888 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:22:08,888 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:22:08,894 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:22:08,895 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:22:08,895 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:22:08,896 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:22:08,896 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:22:08,897 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:22:08,897 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:22:08,897 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:22:08,898 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:22:08,899 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:22:08,905 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:22:08,905 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:22:08,906 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:22:08,906 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:22:08,906 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:22:08,907 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:22:08,908 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:22:08,908 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5846a7aa-45e4-42a4-b4a1-c9ba0b66c377/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:22:08,919 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:22:08,919 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:22:08,920 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:22:08,920 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:22:08,921 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:22:08,921 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:22:08,921 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:22:08,921 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:22:08,921 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:22:08,921 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:22:08,921 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:22:08,922 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:22:08,922 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:22:08,922 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:22:08,922 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:22:08,923 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:22:08,923 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:22:08,923 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:22:08,923 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:22:08,923 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:22:08,923 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:22:08,923 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:22:08,924 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:22:08,924 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:22:08,924 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:22:08,924 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:22:08,924 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:22:08,924 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:22:08,925 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:22:08,925 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:22:08,925 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:22:08,925 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:22:08,926 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:22:08,926 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:22:08,926 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:22:08,926 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_5846a7aa-45e4-42a4-b4a1-c9ba0b66c377/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 -> 811c06b4616c360d68e825b8fa9e0b4596e5faf8 [2019-10-22 11:22:08,950 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:22:08,960 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:22:08,965 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:22:08,967 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:22:08,967 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:22:08,968 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5846a7aa-45e4-42a4-b4a1-c9ba0b66c377/bin/utaipan/../../sv-benchmarks/c/forester-heap/sll-circular-1.i [2019-10-22 11:22:09,023 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5846a7aa-45e4-42a4-b4a1-c9ba0b66c377/bin/utaipan/data/2001c6151/06a3522ecc8c4a9795f293fb5365c8b4/FLAGb98c6a54a [2019-10-22 11:22:09,464 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:22:09,465 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5846a7aa-45e4-42a4-b4a1-c9ba0b66c377/sv-benchmarks/c/forester-heap/sll-circular-1.i [2019-10-22 11:22:09,482 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5846a7aa-45e4-42a4-b4a1-c9ba0b66c377/bin/utaipan/data/2001c6151/06a3522ecc8c4a9795f293fb5365c8b4/FLAGb98c6a54a [2019-10-22 11:22:09,986 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5846a7aa-45e4-42a4-b4a1-c9ba0b66c377/bin/utaipan/data/2001c6151/06a3522ecc8c4a9795f293fb5365c8b4 [2019-10-22 11:22:09,990 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:22:09,991 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:22:09,992 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:22:09,992 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:22:09,996 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:22:09,996 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:22:09" (1/1) ... [2019-10-22 11:22:09,999 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b3c99f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:09, skipping insertion in model container [2019-10-22 11:22:09,999 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:22:09" (1/1) ... [2019-10-22 11:22:10,007 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:22:10,054 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:22:10,402 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:22:10,412 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:22:10,452 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:22:10,510 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:22:10,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:10 WrapperNode [2019-10-22 11:22:10,511 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:22:10,512 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:22:10,512 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:22:10,512 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:22:10,521 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:22:10" (1/1) ... [2019-10-22 11:22:10,535 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:22:10" (1/1) ... [2019-10-22 11:22:10,558 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:22:10,560 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:22:10,560 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:22:10,560 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:22:10,568 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:10" (1/1) ... [2019-10-22 11:22:10,569 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:10" (1/1) ... [2019-10-22 11:22:10,571 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:10" (1/1) ... [2019-10-22 11:22:10,571 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:10" (1/1) ... [2019-10-22 11:22:10,585 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:10" (1/1) ... [2019-10-22 11:22:10,595 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:10" (1/1) ... [2019-10-22 11:22:10,600 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:10" (1/1) ... [2019-10-22 11:22:10,609 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:22:10,610 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:22:10,610 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:22:10,610 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:22:10,611 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5846a7aa-45e4-42a4-b4a1-c9ba0b66c377/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:22:10,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 11:22:10,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 11:22:10,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 11:22:10,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 11:22:10,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 11:22:10,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:22:10,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:22:10,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:22:10,974 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:22:10,974 INFO L284 CfgBuilder]: Removed 13 assume(true) statements. [2019-10-22 11:22:10,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:22:10 BoogieIcfgContainer [2019-10-22 11:22:10,976 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:22:10,976 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:22:10,977 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:22:10,979 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:22:10,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:22:09" (1/3) ... [2019-10-22 11:22:10,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24340af6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:22:10, skipping insertion in model container [2019-10-22 11:22:10,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:10" (2/3) ... [2019-10-22 11:22:10,981 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24340af6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:22:10, skipping insertion in model container [2019-10-22 11:22:10,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:22:10" (3/3) ... [2019-10-22 11:22:10,983 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-circular-1.i [2019-10-22 11:22:10,991 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:22:10,997 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-10-22 11:22:11,004 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-10-22 11:22:11,026 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:22:11,026 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:22:11,026 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:22:11,026 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:22:11,026 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:22:11,027 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:22:11,027 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:22:11,027 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:22:11,040 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2019-10-22 11:22:11,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-10-22 11:22:11,045 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:11,046 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-10-22 11:22:11,047 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:11,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:11,053 INFO L82 PathProgramCache]: Analyzing trace with hash 890892102, now seen corresponding path program 1 times [2019-10-22 11:22:11,061 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:11,061 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129343522] [2019-10-22 11:22:11,062 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:11,062 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:11,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:11,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:11,168 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:22:11,169 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129343522] [2019-10-22 11:22:11,169 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:11,170 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:22:11,170 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325113971] [2019-10-22 11:22:11,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-22 11:22:11,174 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:11,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 11:22:11,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 11:22:11,192 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2019-10-22 11:22:11,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:11,205 INFO L93 Difference]: Finished difference Result 64 states and 100 transitions. [2019-10-22 11:22:11,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 11:22:11,206 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2019-10-22 11:22:11,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:11,215 INFO L225 Difference]: With dead ends: 64 [2019-10-22 11:22:11,216 INFO L226 Difference]: Without dead ends: 26 [2019-10-22 11:22:11,219 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:22:11,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-22 11:22:11,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-10-22 11:22:11,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-22 11:22:11,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2019-10-22 11:22:11,256 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 6 [2019-10-22 11:22:11,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:11,256 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2019-10-22 11:22:11,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-22 11:22:11,257 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2019-10-22 11:22:11,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-10-22 11:22:11,257 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:11,257 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:11,257 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:11,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:11,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1806883023, now seen corresponding path program 1 times [2019-10-22 11:22:11,258 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:11,258 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943639380] [2019-10-22 11:22:11,258 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:11,258 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:11,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:11,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:11,375 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:22:11,375 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943639380] [2019-10-22 11:22:11,375 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:11,375 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:22:11,376 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95277523] [2019-10-22 11:22:11,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:22:11,377 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:11,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:22:11,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:22:11,378 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand 4 states. [2019-10-22 11:22:11,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:11,487 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2019-10-22 11:22:11,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:22:11,488 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-10-22 11:22:11,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:11,489 INFO L225 Difference]: With dead ends: 42 [2019-10-22 11:22:11,489 INFO L226 Difference]: Without dead ends: 38 [2019-10-22 11:22:11,490 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:22:11,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-22 11:22:11,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2019-10-22 11:22:11,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-22 11:22:11,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2019-10-22 11:22:11,500 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 7 [2019-10-22 11:22:11,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:11,501 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2019-10-22 11:22:11,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:22:11,502 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2019-10-22 11:22:11,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-22 11:22:11,502 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:11,502 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:11,502 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:11,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:11,503 INFO L82 PathProgramCache]: Analyzing trace with hash 706691337, now seen corresponding path program 1 times [2019-10-22 11:22:11,503 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:11,503 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889520386] [2019-10-22 11:22:11,503 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:11,503 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:11,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:11,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:11,560 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:22:11,560 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889520386] [2019-10-22 11:22:11,561 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:11,561 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:22:11,561 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415439038] [2019-10-22 11:22:11,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:22:11,561 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:11,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:22:11,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:22:11,562 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand 3 states. [2019-10-22 11:22:11,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:11,589 INFO L93 Difference]: Finished difference Result 71 states and 86 transitions. [2019-10-22 11:22:11,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:22:11,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-10-22 11:22:11,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:11,592 INFO L225 Difference]: With dead ends: 71 [2019-10-22 11:22:11,592 INFO L226 Difference]: Without dead ends: 49 [2019-10-22 11:22:11,593 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:22:11,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-22 11:22:11,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 35. [2019-10-22 11:22:11,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-22 11:22:11,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2019-10-22 11:22:11,602 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 10 [2019-10-22 11:22:11,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:11,602 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2019-10-22 11:22:11,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:22:11,602 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2019-10-22 11:22:11,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-22 11:22:11,603 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:11,603 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:11,603 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:11,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:11,603 INFO L82 PathProgramCache]: Analyzing trace with hash -84804677, now seen corresponding path program 1 times [2019-10-22 11:22:11,604 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:11,604 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885113040] [2019-10-22 11:22:11,604 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:11,604 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:11,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:11,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:11,664 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:22:11,665 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885113040] [2019-10-22 11:22:11,665 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:11,665 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:22:11,665 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169737565] [2019-10-22 11:22:11,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:22:11,666 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:11,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:22:11,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:22:11,670 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand 3 states. [2019-10-22 11:22:11,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:11,690 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2019-10-22 11:22:11,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:22:11,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-22 11:22:11,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:11,693 INFO L225 Difference]: With dead ends: 38 [2019-10-22 11:22:11,693 INFO L226 Difference]: Without dead ends: 36 [2019-10-22 11:22:11,694 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:22:11,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-22 11:22:11,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-10-22 11:22:11,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-22 11:22:11,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2019-10-22 11:22:11,698 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 13 [2019-10-22 11:22:11,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:11,698 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2019-10-22 11:22:11,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:22:11,698 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2019-10-22 11:22:11,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-22 11:22:11,699 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:11,699 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:11,701 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:11,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:11,701 INFO L82 PathProgramCache]: Analyzing trace with hash -84802755, now seen corresponding path program 1 times [2019-10-22 11:22:11,701 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:11,701 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506342835] [2019-10-22 11:22:11,701 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:11,702 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:11,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:11,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:11,886 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:22:11,886 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506342835] [2019-10-22 11:22:11,886 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:11,886 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:22:11,887 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30136408] [2019-10-22 11:22:11,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:22:11,887 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:11,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:22:11,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:22:11,888 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand 5 states. [2019-10-22 11:22:12,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:12,033 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2019-10-22 11:22:12,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:22:12,034 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-10-22 11:22:12,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:12,035 INFO L225 Difference]: With dead ends: 47 [2019-10-22 11:22:12,035 INFO L226 Difference]: Without dead ends: 34 [2019-10-22 11:22:12,035 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:22:12,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-22 11:22:12,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-10-22 11:22:12,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-22 11:22:12,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2019-10-22 11:22:12,040 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 13 [2019-10-22 11:22:12,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:12,040 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2019-10-22 11:22:12,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:22:12,041 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2019-10-22 11:22:12,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-22 11:22:12,041 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:12,041 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:12,041 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:12,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:12,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1783178116, now seen corresponding path program 1 times [2019-10-22 11:22:12,042 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:12,042 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369605991] [2019-10-22 11:22:12,042 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:12,042 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:12,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:12,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:12,096 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:12,096 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369605991] [2019-10-22 11:22:12,096 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308934731] [2019-10-22 11:22:12,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5846a7aa-45e4-42a4-b4a1-c9ba0b66c377/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:22:12,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:12,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-22 11:22:12,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:22:12,224 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 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-22 11:22:12,224 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:12,231 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:12,232 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:22:12,232 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-10-22 11:22:12,250 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:12,251 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-22 11:22:12,252 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:12,260 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:12,265 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-10-22 11:22:12,266 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:12,274 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:12,274 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:22:12,274 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:23 [2019-10-22 11:22:12,305 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-10-22 11:22:12,306 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-10-22 11:22:12,307 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:12,318 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:12,319 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:22:12,319 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:23 [2019-10-22 11:22:12,326 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.base|], 6=[|v_#memory_$Pointer$.base_18|]} [2019-10-22 11:22:12,331 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:22:12,341 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:12,352 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:12,353 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 55 [2019-10-22 11:22:12,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:12,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:12,361 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:12,377 INFO L567 ElimStorePlain]: treesize reduction 19, result has 32.1 percent of original size [2019-10-22 11:22:12,378 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:22:12,378 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:66, output treesize:4 [2019-10-22 11:22:12,380 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:12,380 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:22:12,388 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:22:12,390 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:12,391 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:22:12,392 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:18 [2019-10-22 11:22:12,428 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:12,430 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:12,431 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:22:12,431 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:18 [2019-10-22 11:22:12,441 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 178 treesize of output 174 [2019-10-22 11:22:12,443 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-22 11:22:12,566 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 32 [2019-10-22 11:22:12,566 INFO L567 ElimStorePlain]: treesize reduction 127, result has 28.7 percent of original size [2019-10-22 11:22:12,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:12,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:12,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:12,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:12,574 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-10-22 11:22:12,574 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:43 [2019-10-22 11:22:12,645 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:12,645 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [5205969] [2019-10-22 11:22:12,652 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 14 [2019-10-22 11:22:12,691 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-10-22 11:22:12,691 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-22 11:22:13,010 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:22:13,010 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:22:13,014 INFO L168 Benchmark]: Toolchain (without parser) took 3023.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 939.1 MB in the beginning and 912.3 MB in the end (delta: 26.8 MB). Peak memory consumption was 167.3 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:13,014 INFO L168 Benchmark]: CDTParser took 0.16 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:22:13,015 INFO L168 Benchmark]: CACSL2BoogieTranslator took 519.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -183.7 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:13,015 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.30 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:22:13,016 INFO L168 Benchmark]: Boogie Preprocessor took 50.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:13,016 INFO L168 Benchmark]: RCFGBuilder took 365.64 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:13,017 INFO L168 Benchmark]: TraceAbstraction took 2036.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 912.3 MB in the end (delta: 182.7 MB). Peak memory consumption was 182.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:13,019 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.16 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 519.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -183.7 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 47.30 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 50.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 365.64 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2036.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 912.3 MB in the end (delta: 182.7 MB). Peak memory consumption was 182.7 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:22:15,031 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:22:15,032 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:22:15,042 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:22:15,042 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:22:15,043 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:22:15,044 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:22:15,045 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:22:15,047 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:22:15,047 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:22:15,048 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:22:15,049 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:22:15,049 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:22:15,050 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:22:15,051 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:22:15,052 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:22:15,052 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:22:15,053 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:22:15,054 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:22:15,056 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:22:15,057 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:22:15,058 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:22:15,059 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:22:15,060 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:22:15,062 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:22:15,062 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:22:15,062 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:22:15,063 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:22:15,063 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:22:15,064 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:22:15,064 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:22:15,065 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:22:15,065 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:22:15,066 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:22:15,067 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:22:15,067 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:22:15,067 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:22:15,067 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:22:15,068 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:22:15,068 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:22:15,069 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:22:15,070 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5846a7aa-45e4-42a4-b4a1-c9ba0b66c377/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2019-10-22 11:22:15,081 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:22:15,081 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:22:15,081 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:22:15,082 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:22:15,082 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:22:15,082 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:22:15,082 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:22:15,082 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:22:15,082 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:22:15,083 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:22:15,083 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:22:15,084 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:22:15,084 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:22:15,084 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:22:15,084 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:22:15,084 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:22:15,084 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-10-22 11:22:15,084 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-10-22 11:22:15,085 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:22:15,085 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:22:15,085 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 11:22:15,085 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:22:15,085 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:22:15,085 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:22:15,085 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:22:15,086 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:22:15,086 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:22:15,086 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:22:15,086 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:22:15,086 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:22:15,086 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-10-22 11:22:15,087 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-10-22 11:22:15,087 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:22:15,087 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:22:15,087 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_5846a7aa-45e4-42a4-b4a1-c9ba0b66c377/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 -> 811c06b4616c360d68e825b8fa9e0b4596e5faf8 [2019-10-22 11:22:15,113 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:22:15,123 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:22:15,126 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:22:15,128 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:22:15,128 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:22:15,129 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5846a7aa-45e4-42a4-b4a1-c9ba0b66c377/bin/utaipan/../../sv-benchmarks/c/forester-heap/sll-circular-1.i [2019-10-22 11:22:15,174 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5846a7aa-45e4-42a4-b4a1-c9ba0b66c377/bin/utaipan/data/42ce38b64/a1be008b94ef48a18480c43472a3501c/FLAG461a8bf2e [2019-10-22 11:22:15,609 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:22:15,610 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5846a7aa-45e4-42a4-b4a1-c9ba0b66c377/sv-benchmarks/c/forester-heap/sll-circular-1.i [2019-10-22 11:22:15,620 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5846a7aa-45e4-42a4-b4a1-c9ba0b66c377/bin/utaipan/data/42ce38b64/a1be008b94ef48a18480c43472a3501c/FLAG461a8bf2e [2019-10-22 11:22:15,634 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5846a7aa-45e4-42a4-b4a1-c9ba0b66c377/bin/utaipan/data/42ce38b64/a1be008b94ef48a18480c43472a3501c [2019-10-22 11:22:15,636 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:22:15,637 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:22:15,638 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:22:15,638 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:22:15,641 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:22:15,642 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:22:15" (1/1) ... [2019-10-22 11:22:15,644 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58413066 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:15, skipping insertion in model container [2019-10-22 11:22:15,644 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:22:15" (1/1) ... [2019-10-22 11:22:15,649 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:22:15,694 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:22:16,082 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:22:16,095 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:22:16,140 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:22:16,187 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:22:16,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:16 WrapperNode [2019-10-22 11:22:16,190 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:22:16,191 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:22:16,191 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:22:16,191 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:22:16,199 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:22:16" (1/1) ... [2019-10-22 11:22:16,217 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:22:16" (1/1) ... [2019-10-22 11:22:16,242 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:22:16,244 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:22:16,244 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:22:16,244 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:22:16,253 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:16" (1/1) ... [2019-10-22 11:22:16,253 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:16" (1/1) ... [2019-10-22 11:22:16,262 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:16" (1/1) ... [2019-10-22 11:22:16,264 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:16" (1/1) ... [2019-10-22 11:22:16,274 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:16" (1/1) ... [2019-10-22 11:22:16,280 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:16" (1/1) ... [2019-10-22 11:22:16,282 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:16" (1/1) ... [2019-10-22 11:22:16,284 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:22:16,285 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:22:16,285 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:22:16,285 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:22:16,286 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5846a7aa-45e4-42a4-b4a1-c9ba0b66c377/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:22:16,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-10-22 11:22:16,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 11:22:16,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 11:22:16,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 11:22:16,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:22:16,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-10-22 11:22:16,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:22:16,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:22:16,688 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:22:16,689 INFO L284 CfgBuilder]: Removed 13 assume(true) statements. [2019-10-22 11:22:16,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:22:16 BoogieIcfgContainer [2019-10-22 11:22:16,690 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:22:16,691 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:22:16,691 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:22:16,693 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:22:16,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:22:15" (1/3) ... [2019-10-22 11:22:16,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6474cd0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:22:16, skipping insertion in model container [2019-10-22 11:22:16,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:16" (2/3) ... [2019-10-22 11:22:16,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6474cd0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:22:16, skipping insertion in model container [2019-10-22 11:22:16,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:22:16" (3/3) ... [2019-10-22 11:22:16,696 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-circular-1.i [2019-10-22 11:22:16,705 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:22:16,717 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-10-22 11:22:16,725 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-10-22 11:22:16,744 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:22:16,744 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:22:16,744 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:22:16,744 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:22:16,745 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:22:16,745 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:22:16,745 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:22:16,745 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:22:16,755 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-10-22 11:22:16,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-10-22 11:22:16,759 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:16,760 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-10-22 11:22:16,761 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:16,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:16,766 INFO L82 PathProgramCache]: Analyzing trace with hash 890861318, now seen corresponding path program 1 times [2019-10-22 11:22:16,775 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:22:16,775 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1373389428] [2019-10-22 11:22:16,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5846a7aa-45e4-42a4-b4a1-c9ba0b66c377/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:22:16,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:16,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 1 conjunts are in the unsatisfiable core [2019-10-22 11:22:16,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:22:16,922 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:22:16,922 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:22:16,924 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:22:16,924 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1373389428] [2019-10-22 11:22:16,925 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:16,925 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-10-22 11:22:16,925 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751075403] [2019-10-22 11:22:16,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-22 11:22:16,929 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:22:16,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 11:22:16,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 11:22:16,944 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2019-10-22 11:22:16,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:16,961 INFO L93 Difference]: Finished difference Result 62 states and 98 transitions. [2019-10-22 11:22:16,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 11:22:16,962 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2019-10-22 11:22:16,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:16,969 INFO L225 Difference]: With dead ends: 62 [2019-10-22 11:22:16,970 INFO L226 Difference]: Without dead ends: 25 [2019-10-22 11:22:16,972 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:22:16,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-10-22 11:22:17,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-10-22 11:22:17,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-22 11:22:17,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2019-10-22 11:22:17,007 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 6 [2019-10-22 11:22:17,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:17,007 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2019-10-22 11:22:17,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-22 11:22:17,007 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2019-10-22 11:22:17,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-10-22 11:22:17,008 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:17,008 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-10-22 11:22:17,208 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:22:17,209 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:17,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:17,209 INFO L82 PathProgramCache]: Analyzing trace with hash 889669678, now seen corresponding path program 1 times [2019-10-22 11:22:17,209 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:22:17,210 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1929062738] [2019-10-22 11:22:17,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5846a7aa-45e4-42a4-b4a1-c9ba0b66c377/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:22:17,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:17,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-22 11:22:17,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:22:17,349 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:22:17,360 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2019-10-22 11:22:17,363 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:17,383 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:17,384 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:22:17,384 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2019-10-22 11:22:17,415 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:22:17,424 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:17,431 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2019-10-22 11:22:17,443 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 11 treesize of output 7 [2019-10-22 11:22:17,444 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:17,454 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:17,454 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:22:17,460 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:17,461 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:22:17,461 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:34, output treesize:4 [2019-10-22 11:22:17,473 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:22:17,474 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:22:17,486 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:22:17,493 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:17,494 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:22:17,494 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:18 [2019-10-22 11:22:17,519 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:22:17,520 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1929062738] [2019-10-22 11:22:17,520 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:17,520 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2019-10-22 11:22:17,520 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028739768] [2019-10-22 11:22:17,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:22:17,522 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:22:17,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:22:17,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:22:17,523 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand 5 states. [2019-10-22 11:22:17,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:17,813 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2019-10-22 11:22:17,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:22:17,814 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-10-22 11:22:17,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:17,815 INFO L225 Difference]: With dead ends: 48 [2019-10-22 11:22:17,815 INFO L226 Difference]: Without dead ends: 44 [2019-10-22 11:22:17,816 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:22:17,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-10-22 11:22:17,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 33. [2019-10-22 11:22:17,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-22 11:22:17,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2019-10-22 11:22:17,822 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 6 [2019-10-22 11:22:17,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:17,823 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2019-10-22 11:22:17,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:22:17,823 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2019-10-22 11:22:17,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-22 11:22:17,824 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:17,824 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:18,024 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:22:18,025 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:18,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:18,025 INFO L82 PathProgramCache]: Analyzing trace with hash -391921798, now seen corresponding path program 1 times [2019-10-22 11:22:18,025 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:22:18,026 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1974906867] [2019-10-22 11:22:18,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5846a7aa-45e4-42a4-b4a1-c9ba0b66c377/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:22:18,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:18,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 11:22:18,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:22:18,101 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:22:18,101 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:22:18,103 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:22:18,103 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1974906867] [2019-10-22 11:22:18,103 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:18,103 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-10-22 11:22:18,104 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419573598] [2019-10-22 11:22:18,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:22:18,104 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:22:18,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:22:18,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:22:18,105 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand 3 states. [2019-10-22 11:22:18,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:18,131 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2019-10-22 11:22:18,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:22:18,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-22 11:22:18,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:18,132 INFO L225 Difference]: With dead ends: 36 [2019-10-22 11:22:18,133 INFO L226 Difference]: Without dead ends: 34 [2019-10-22 11:22:18,133 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:22:18,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-22 11:22:18,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-10-22 11:22:18,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-22 11:22:18,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2019-10-22 11:22:18,138 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 44 transitions. Word has length 12 [2019-10-22 11:22:18,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:18,138 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 44 transitions. [2019-10-22 11:22:18,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:22:18,139 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2019-10-22 11:22:18,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-22 11:22:18,139 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:18,139 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:18,340 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:22:18,340 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:18,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:18,341 INFO L82 PathProgramCache]: Analyzing trace with hash -391919876, now seen corresponding path program 1 times [2019-10-22 11:22:18,341 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:22:18,341 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1967038028] [2019-10-22 11:22:18,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5846a7aa-45e4-42a4-b4a1-c9ba0b66c377/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:22:18,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:18,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-22 11:22:18,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:22:18,464 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:22:18,466 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2019-10-22 11:22:18,466 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:18,494 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:18,500 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:22:18,502 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2019-10-22 11:22:18,502 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:18,518 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:18,518 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:22:18,519 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:57, output treesize:27 [2019-10-22 11:22:18,562 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-10-22 11:22:18,563 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:18,596 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:18,606 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-10-22 11:22:18,607 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:18,629 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:18,634 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 11 treesize of output 7 [2019-10-22 11:22:18,634 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:18,647 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:18,649 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:22:18,649 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:70, output treesize:36 [2019-10-22 11:22:18,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,722 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:22:18,722 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:22:18,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,777 INFO L392 ElimStorePlain]: Different costs {4=[|#memory_int|], 6=[|v_#memory_$Pointer$.offset_21|, |v_#memory_$Pointer$.base_23|]} [2019-10-22 11:22:18,811 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:18,811 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 258 treesize of output 221 [2019-10-22 11:22:18,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:22:18,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:22:18,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:22:18,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:22:18,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:22:18,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:22:18,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:22:18,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:22:18,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,900 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-22 11:22:19,570 WARN L191 SmtUtils]: Spent 669.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2019-10-22 11:22:19,571 INFO L567 ElimStorePlain]: treesize reduction 50, result has 80.8 percent of original size [2019-10-22 11:22:19,771 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:22:19,772 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.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:335) 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:22:19,776 INFO L168 Benchmark]: Toolchain (without parser) took 4138.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.7 MB). Free memory was 941.6 MB in the beginning and 944.5 MB in the end (delta: -2.9 MB). Peak memory consumption was 162.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:19,776 INFO L168 Benchmark]: CDTParser took 0.22 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:22:19,777 INFO L168 Benchmark]: CACSL2BoogieTranslator took 552.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.7 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -204.6 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:19,777 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:19,777 INFO L168 Benchmark]: Boogie Preprocessor took 40.62 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:22:19,778 INFO L168 Benchmark]: RCFGBuilder took 405.28 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: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:19,778 INFO L168 Benchmark]: TraceAbstraction took 3083.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 944.5 MB in the end (delta: 170.8 MB). Peak memory consumption was 170.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:19,781 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.22 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 552.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.7 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -204.6 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.62 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 405.28 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: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3083.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 944.5 MB in the end (delta: 170.8 MB). Peak memory consumption was 170.8 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...