./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/forester-heap/sll-circular-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) 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_9a01c2c9-aafc-44d5-aa33-0b05dab46c12/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9a01c2c9-aafc-44d5-aa33-0b05dab46c12/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9a01c2c9-aafc-44d5-aa33-0b05dab46c12/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9a01c2c9-aafc-44d5-aa33-0b05dab46c12/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-circular-2.i -s /tmp/vcloud-vcloud-master/worker/working_dir_9a01c2c9-aafc-44d5-aa33-0b05dab46c12/bin/utaipan/config/svcomp-MemCleanup-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9a01c2c9-aafc-44d5-aa33-0b05dab46c12/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b651d63eb42259dfd3a213a6671e4c58ee528ad0 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_9a01c2c9-aafc-44d5-aa33-0b05dab46c12/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9a01c2c9-aafc-44d5-aa33-0b05dab46c12/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9a01c2c9-aafc-44d5-aa33-0b05dab46c12/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9a01c2c9-aafc-44d5-aa33-0b05dab46c12/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-circular-2.i -s /tmp/vcloud-vcloud-master/worker/working_dir_9a01c2c9-aafc-44d5-aa33-0b05dab46c12/bin/utaipan/config/svcomp-MemCleanup-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9a01c2c9-aafc-44d5-aa33-0b05dab46c12/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b651d63eb42259dfd3a213a6671e4c58ee528ad0 .................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: Sort FloatRoundingMode not declared --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 11:24:16,186 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:24:16,188 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:24:16,197 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:24:16,197 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:24:16,198 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:24:16,199 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:24:16,201 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:24:16,202 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:24:16,203 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:24:16,204 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:24:16,205 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:24:16,205 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:24:16,206 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:24:16,207 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:24:16,207 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:24:16,208 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:24:16,209 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:24:16,210 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:24:16,211 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:24:16,213 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:24:16,214 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:24:16,215 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:24:16,215 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:24:16,217 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:24:16,218 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:24:16,218 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:24:16,218 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:24:16,219 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:24:16,220 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:24:16,220 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:24:16,221 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:24:16,221 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:24:16,222 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:24:16,222 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:24:16,222 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:24:16,223 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:24:16,223 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:24:16,223 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:24:16,224 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:24:16,225 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:24:16,225 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9a01c2c9-aafc-44d5-aa33-0b05dab46c12/bin/utaipan/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2019-10-22 11:24:16,236 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:24:16,236 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:24:16,237 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:24:16,237 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:24:16,237 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:24:16,237 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:24:16,237 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:24:16,237 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:24:16,238 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:24:16,238 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:24:16,238 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:24:16,238 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:24:16,239 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 11:24:16,239 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 11:24:16,239 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:24:16,239 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:24:16,239 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 11:24:16,239 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:24:16,240 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:24:16,240 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:24:16,240 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-10-22 11:24:16,241 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-10-22 11:24:16,241 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:24:16,241 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:24:16,241 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:24:16,241 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:24:16,241 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:24:16,242 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:24:16,242 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:24:16,242 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:24:16,242 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:24:16,242 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:24:16,242 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:24:16,243 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:24:16,243 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_9a01c2c9-aafc-44d5-aa33-0b05dab46c12/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 valid-memcleanup) ) 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 -> b651d63eb42259dfd3a213a6671e4c58ee528ad0 [2019-10-22 11:24:16,275 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:24:16,284 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:24:16,287 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:24:16,292 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:24:16,292 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:24:16,293 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9a01c2c9-aafc-44d5-aa33-0b05dab46c12/bin/utaipan/../../sv-benchmarks/c/forester-heap/sll-circular-2.i [2019-10-22 11:24:16,340 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9a01c2c9-aafc-44d5-aa33-0b05dab46c12/bin/utaipan/data/bcefeafbd/7852c73ae1b0476e8181f6df29b5ca70/FLAGdaafbf57b [2019-10-22 11:24:16,782 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:24:16,782 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9a01c2c9-aafc-44d5-aa33-0b05dab46c12/sv-benchmarks/c/forester-heap/sll-circular-2.i [2019-10-22 11:24:16,794 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9a01c2c9-aafc-44d5-aa33-0b05dab46c12/bin/utaipan/data/bcefeafbd/7852c73ae1b0476e8181f6df29b5ca70/FLAGdaafbf57b [2019-10-22 11:24:16,805 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9a01c2c9-aafc-44d5-aa33-0b05dab46c12/bin/utaipan/data/bcefeafbd/7852c73ae1b0476e8181f6df29b5ca70 [2019-10-22 11:24:16,807 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:24:16,809 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:24:16,810 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:24:16,810 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:24:16,813 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:24:16,814 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:24:16" (1/1) ... [2019-10-22 11:24:16,816 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2db68e24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:16, skipping insertion in model container [2019-10-22 11:24:16,817 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:24:16" (1/1) ... [2019-10-22 11:24:16,823 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:24:16,857 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:24:17,230 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:24:17,238 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:24:17,275 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:24:17,330 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:24:17,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:17 WrapperNode [2019-10-22 11:24:17,330 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:24:17,331 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:24:17,332 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:24:17,332 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:24:17,340 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:24:17" (1/1) ... [2019-10-22 11:24:17,353 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:24:17" (1/1) ... [2019-10-22 11:24:17,382 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:24:17,383 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:24:17,383 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:24:17,383 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:24:17,391 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:17" (1/1) ... [2019-10-22 11:24:17,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:17" (1/1) ... [2019-10-22 11:24:17,395 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:17" (1/1) ... [2019-10-22 11:24:17,397 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:17" (1/1) ... [2019-10-22 11:24:17,409 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:17" (1/1) ... [2019-10-22 11:24:17,417 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:17" (1/1) ... [2019-10-22 11:24:17,423 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:17" (1/1) ... [2019-10-22 11:24:17,432 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:24:17,432 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:24:17,432 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:24:17,432 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:24:17,433 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a01c2c9-aafc-44d5-aa33-0b05dab46c12/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:24:17,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 11:24:17,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 11:24:17,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 11:24:17,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 11:24:17,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 11:24:17,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:24:17,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:24:17,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:24:17,884 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:24:17,884 INFO L284 CfgBuilder]: Removed 13 assume(true) statements. [2019-10-22 11:24:17,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:24:17 BoogieIcfgContainer [2019-10-22 11:24:17,885 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:24:17,886 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:24:17,886 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:24:17,889 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:24:17,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:24:16" (1/3) ... [2019-10-22 11:24:17,889 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40dae539 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:24:17, skipping insertion in model container [2019-10-22 11:24:17,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:17" (2/3) ... [2019-10-22 11:24:17,890 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40dae539 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:24:17, skipping insertion in model container [2019-10-22 11:24:17,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:24:17" (3/3) ... [2019-10-22 11:24:17,891 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-circular-2.i [2019-10-22 11:24:17,900 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:24:17,911 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 43 error locations. [2019-10-22 11:24:17,919 INFO L249 AbstractCegarLoop]: Starting to check reachability of 43 error locations. [2019-10-22 11:24:17,932 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:24:17,933 INFO L374 AbstractCegarLoop]: Hoare is false [2019-10-22 11:24:17,933 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:24:17,933 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:24:17,933 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:24:17,933 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:24:17,933 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:24:17,934 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:24:17,946 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states. [2019-10-22 11:24:17,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-10-22 11:24:17,953 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:17,953 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-10-22 11:24:17,955 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION]=== [2019-10-22 11:24:17,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:17,959 INFO L82 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2019-10-22 11:24:17,967 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:17,968 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140387453] [2019-10-22 11:24:17,968 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:17,968 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:17,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:18,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:18,083 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:24:18,084 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140387453] [2019-10-22 11:24:18,084 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:18,085 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:24:18,085 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224342907] [2019-10-22 11:24:18,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:18,088 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:18,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:18,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:18,100 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 3 states. [2019-10-22 11:24:18,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:18,259 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2019-10-22 11:24:18,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:18,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-10-22 11:24:18,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:18,270 INFO L225 Difference]: With dead ends: 101 [2019-10-22 11:24:18,271 INFO L226 Difference]: Without dead ends: 99 [2019-10-22 11:24:18,274 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:24:18,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-10-22 11:24:18,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 89. [2019-10-22 11:24:18,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-10-22 11:24:18,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2019-10-22 11:24:18,311 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 3 [2019-10-22 11:24:18,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:18,312 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2019-10-22 11:24:18,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:18,312 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2019-10-22 11:24:18,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-10-22 11:24:18,312 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:18,313 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-10-22 11:24:18,313 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION]=== [2019-10-22 11:24:18,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:18,313 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2019-10-22 11:24:18,314 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:18,314 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911238527] [2019-10-22 11:24:18,314 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:18,314 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:18,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:18,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:18,350 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:24:18,351 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911238527] [2019-10-22 11:24:18,351 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:18,351 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:24:18,351 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985141113] [2019-10-22 11:24:18,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:18,352 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:18,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:18,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:18,353 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand 3 states. [2019-10-22 11:24:18,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:18,432 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2019-10-22 11:24:18,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:18,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-10-22 11:24:18,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:18,434 INFO L225 Difference]: With dead ends: 97 [2019-10-22 11:24:18,434 INFO L226 Difference]: Without dead ends: 97 [2019-10-22 11:24:18,435 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:24:18,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-10-22 11:24:18,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 85. [2019-10-22 11:24:18,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-10-22 11:24:18,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2019-10-22 11:24:18,445 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 3 [2019-10-22 11:24:18,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:18,446 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2019-10-22 11:24:18,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:18,446 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2019-10-22 11:24:18,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-10-22 11:24:18,446 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:18,446 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:18,447 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION]=== [2019-10-22 11:24:18,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:18,447 INFO L82 PathProgramCache]: Analyzing trace with hash 59263649, now seen corresponding path program 1 times [2019-10-22 11:24:18,447 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:18,447 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505434524] [2019-10-22 11:24:18,447 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:18,448 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:18,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:18,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:18,487 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:24:18,488 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505434524] [2019-10-22 11:24:18,488 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:18,488 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:24:18,488 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961447020] [2019-10-22 11:24:18,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:24:18,489 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:18,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:24:18,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:24:18,489 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand 4 states. [2019-10-22 11:24:18,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:18,606 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2019-10-22 11:24:18,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:24:18,607 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-10-22 11:24:18,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:18,608 INFO L225 Difference]: With dead ends: 83 [2019-10-22 11:24:18,608 INFO L226 Difference]: Without dead ends: 83 [2019-10-22 11:24:18,608 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:24:18,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-10-22 11:24:18,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 74. [2019-10-22 11:24:18,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-10-22 11:24:18,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2019-10-22 11:24:18,613 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 8 [2019-10-22 11:24:18,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:18,614 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2019-10-22 11:24:18,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:24:18,614 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2019-10-22 11:24:18,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-10-22 11:24:18,614 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:18,614 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:18,615 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION]=== [2019-10-22 11:24:18,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:18,615 INFO L82 PathProgramCache]: Analyzing trace with hash 59263650, now seen corresponding path program 1 times [2019-10-22 11:24:18,615 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:18,615 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093273911] [2019-10-22 11:24:18,615 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:18,616 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:18,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:18,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:18,662 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:24:18,662 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093273911] [2019-10-22 11:24:18,663 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:18,663 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:24:18,663 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968976721] [2019-10-22 11:24:18,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:24:18,663 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:18,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:24:18,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:24:18,664 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 4 states. [2019-10-22 11:24:18,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:18,799 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2019-10-22 11:24:18,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:24:18,800 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-10-22 11:24:18,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:18,800 INFO L225 Difference]: With dead ends: 93 [2019-10-22 11:24:18,801 INFO L226 Difference]: Without dead ends: 93 [2019-10-22 11:24:18,801 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:24:18,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-10-22 11:24:18,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 79. [2019-10-22 11:24:18,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-10-22 11:24:18,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2019-10-22 11:24:18,809 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 8 [2019-10-22 11:24:18,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:18,810 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2019-10-22 11:24:18,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:24:18,810 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2019-10-22 11:24:18,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-22 11:24:18,810 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:18,810 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:18,811 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION]=== [2019-10-22 11:24:18,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:18,811 INFO L82 PathProgramCache]: Analyzing trace with hash 292159341, now seen corresponding path program 1 times [2019-10-22 11:24:18,811 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:18,812 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449298601] [2019-10-22 11:24:18,815 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:18,815 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:18,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:18,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:18,902 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:24:18,902 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449298601] [2019-10-22 11:24:18,902 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:18,902 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:24:18,902 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067336053] [2019-10-22 11:24:18,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:24:18,903 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:18,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:24:18,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:24:18,903 INFO L87 Difference]: Start difference. First operand 79 states and 86 transitions. Second operand 6 states. [2019-10-22 11:24:19,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:19,214 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2019-10-22 11:24:19,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:24:19,214 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-10-22 11:24:19,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:19,215 INFO L225 Difference]: With dead ends: 125 [2019-10-22 11:24:19,215 INFO L226 Difference]: Without dead ends: 125 [2019-10-22 11:24:19,216 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:24:19,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-10-22 11:24:19,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 78. [2019-10-22 11:24:19,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-10-22 11:24:19,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2019-10-22 11:24:19,221 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 11 [2019-10-22 11:24:19,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:19,222 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2019-10-22 11:24:19,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:24:19,222 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2019-10-22 11:24:19,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-22 11:24:19,223 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:19,223 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:19,223 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION]=== [2019-10-22 11:24:19,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:19,224 INFO L82 PathProgramCache]: Analyzing trace with hash 292159342, now seen corresponding path program 1 times [2019-10-22 11:24:19,224 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:19,224 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105174913] [2019-10-22 11:24:19,224 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:19,224 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:19,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:19,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:19,354 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:24:19,354 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105174913] [2019-10-22 11:24:19,354 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:19,354 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:24:19,354 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22493821] [2019-10-22 11:24:19,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:24:19,355 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:19,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:24:19,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:24:19,356 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand 6 states. [2019-10-22 11:24:19,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:19,676 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2019-10-22 11:24:19,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:24:19,676 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-10-22 11:24:19,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:19,677 INFO L225 Difference]: With dead ends: 123 [2019-10-22 11:24:19,677 INFO L226 Difference]: Without dead ends: 123 [2019-10-22 11:24:19,678 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-10-22 11:24:19,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-10-22 11:24:19,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 68. [2019-10-22 11:24:19,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-22 11:24:19,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2019-10-22 11:24:19,682 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 11 [2019-10-22 11:24:19,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:19,682 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2019-10-22 11:24:19,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:24:19,683 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2019-10-22 11:24:19,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-22 11:24:19,683 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:19,683 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:19,684 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION]=== [2019-10-22 11:24:19,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:19,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1296424890, now seen corresponding path program 1 times [2019-10-22 11:24:19,684 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:19,684 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30070647] [2019-10-22 11:24:19,684 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:19,685 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:19,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:19,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:19,792 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:24:19,793 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30070647] [2019-10-22 11:24:19,793 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:19,793 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 11:24:19,793 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961268685] [2019-10-22 11:24:19,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 11:24:19,793 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:19,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 11:24:19,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:24:19,794 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand 8 states. [2019-10-22 11:24:20,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:20,093 INFO L93 Difference]: Finished difference Result 115 states and 124 transitions. [2019-10-22 11:24:20,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 11:24:20,094 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-10-22 11:24:20,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:20,094 INFO L225 Difference]: With dead ends: 115 [2019-10-22 11:24:20,094 INFO L226 Difference]: Without dead ends: 115 [2019-10-22 11:24:20,095 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-10-22 11:24:20,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-10-22 11:24:20,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 76. [2019-10-22 11:24:20,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-10-22 11:24:20,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2019-10-22 11:24:20,106 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 13 [2019-10-22 11:24:20,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:20,106 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2019-10-22 11:24:20,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 11:24:20,107 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2019-10-22 11:24:20,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-22 11:24:20,107 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:20,107 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:20,108 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION]=== [2019-10-22 11:24:20,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:20,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1296424891, now seen corresponding path program 1 times [2019-10-22 11:24:20,108 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:20,108 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620038818] [2019-10-22 11:24:20,108 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:20,109 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:20,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:20,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:20,264 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:24:20,265 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620038818] [2019-10-22 11:24:20,265 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:20,265 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 11:24:20,265 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575811548] [2019-10-22 11:24:20,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 11:24:20,266 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:20,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 11:24:20,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:24:20,266 INFO L87 Difference]: Start difference. First operand 76 states and 84 transitions. Second operand 8 states. [2019-10-22 11:24:20,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:20,616 INFO L93 Difference]: Finished difference Result 146 states and 157 transitions. [2019-10-22 11:24:20,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:24:20,616 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-10-22 11:24:20,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:20,617 INFO L225 Difference]: With dead ends: 146 [2019-10-22 11:24:20,617 INFO L226 Difference]: Without dead ends: 146 [2019-10-22 11:24:20,618 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-10-22 11:24:20,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-10-22 11:24:20,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 88. [2019-10-22 11:24:20,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-10-22 11:24:20,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 101 transitions. [2019-10-22 11:24:20,621 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 101 transitions. Word has length 13 [2019-10-22 11:24:20,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:20,622 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 101 transitions. [2019-10-22 11:24:20,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 11:24:20,622 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 101 transitions. [2019-10-22 11:24:20,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-22 11:24:20,622 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:20,622 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:20,623 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION]=== [2019-10-22 11:24:20,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:20,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1448044979, now seen corresponding path program 1 times [2019-10-22 11:24:20,623 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:20,623 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775968861] [2019-10-22 11:24:20,624 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:20,624 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:20,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:20,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:20,772 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:24:20,772 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775968861] [2019-10-22 11:24:20,772 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:20,772 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 11:24:20,773 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732126242] [2019-10-22 11:24:20,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 11:24:20,773 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:20,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 11:24:20,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:24:20,774 INFO L87 Difference]: Start difference. First operand 88 states and 101 transitions. Second operand 8 states. [2019-10-22 11:24:21,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:21,092 INFO L93 Difference]: Finished difference Result 143 states and 154 transitions. [2019-10-22 11:24:21,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 11:24:21,092 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-10-22 11:24:21,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:21,093 INFO L225 Difference]: With dead ends: 143 [2019-10-22 11:24:21,093 INFO L226 Difference]: Without dead ends: 143 [2019-10-22 11:24:21,093 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-10-22 11:24:21,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-10-22 11:24:21,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 88. [2019-10-22 11:24:21,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-10-22 11:24:21,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 100 transitions. [2019-10-22 11:24:21,102 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 100 transitions. Word has length 16 [2019-10-22 11:24:21,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:21,102 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 100 transitions. [2019-10-22 11:24:21,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 11:24:21,102 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 100 transitions. [2019-10-22 11:24:21,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-22 11:24:21,102 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:21,102 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:21,103 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION]=== [2019-10-22 11:24:21,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:21,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1448044978, now seen corresponding path program 1 times [2019-10-22 11:24:21,103 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:21,103 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070946387] [2019-10-22 11:24:21,103 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:21,104 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:21,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:21,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:21,229 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:24:21,230 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070946387] [2019-10-22 11:24:21,230 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:21,230 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 11:24:21,230 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345466945] [2019-10-22 11:24:21,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 11:24:21,230 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:21,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 11:24:21,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:24:21,231 INFO L87 Difference]: Start difference. First operand 88 states and 100 transitions. Second operand 9 states. [2019-10-22 11:24:21,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:21,587 INFO L93 Difference]: Finished difference Result 131 states and 142 transitions. [2019-10-22 11:24:21,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 11:24:21,588 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2019-10-22 11:24:21,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:21,588 INFO L225 Difference]: With dead ends: 131 [2019-10-22 11:24:21,588 INFO L226 Difference]: Without dead ends: 131 [2019-10-22 11:24:21,589 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-10-22 11:24:21,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-10-22 11:24:21,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 88. [2019-10-22 11:24:21,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-10-22 11:24:21,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 99 transitions. [2019-10-22 11:24:21,592 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 99 transitions. Word has length 16 [2019-10-22 11:24:21,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:21,592 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 99 transitions. [2019-10-22 11:24:21,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 11:24:21,592 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 99 transitions. [2019-10-22 11:24:21,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-22 11:24:21,593 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:21,593 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:21,593 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION]=== [2019-10-22 11:24:21,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:21,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1939704561, now seen corresponding path program 1 times [2019-10-22 11:24:21,594 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:21,594 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675537846] [2019-10-22 11:24:21,594 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:21,594 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:21,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:21,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:21,696 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:24:21,696 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675537846] [2019-10-22 11:24:21,696 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:21,696 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 11:24:21,696 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009493605] [2019-10-22 11:24:21,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 11:24:21,697 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:21,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 11:24:21,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:24:21,697 INFO L87 Difference]: Start difference. First operand 88 states and 99 transitions. Second operand 8 states. [2019-10-22 11:24:21,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:21,984 INFO L93 Difference]: Finished difference Result 143 states and 156 transitions. [2019-10-22 11:24:21,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:24:21,985 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-10-22 11:24:21,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:21,985 INFO L225 Difference]: With dead ends: 143 [2019-10-22 11:24:21,985 INFO L226 Difference]: Without dead ends: 143 [2019-10-22 11:24:21,986 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2019-10-22 11:24:21,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-10-22 11:24:21,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 110. [2019-10-22 11:24:21,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-10-22 11:24:21,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 135 transitions. [2019-10-22 11:24:21,989 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 135 transitions. Word has length 17 [2019-10-22 11:24:21,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:21,989 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 135 transitions. [2019-10-22 11:24:21,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 11:24:21,989 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 135 transitions. [2019-10-22 11:24:21,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-22 11:24:21,990 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:21,990 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:21,990 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION]=== [2019-10-22 11:24:21,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:21,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1939704560, now seen corresponding path program 1 times [2019-10-22 11:24:21,991 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:21,991 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015086137] [2019-10-22 11:24:21,991 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:21,991 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:21,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:21,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:22,083 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:24:22,084 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015086137] [2019-10-22 11:24:22,084 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:22,084 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 11:24:22,084 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895548905] [2019-10-22 11:24:22,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 11:24:22,084 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:22,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 11:24:22,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:24:22,085 INFO L87 Difference]: Start difference. First operand 110 states and 135 transitions. Second operand 8 states. [2019-10-22 11:24:22,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:22,337 INFO L93 Difference]: Finished difference Result 126 states and 139 transitions. [2019-10-22 11:24:22,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 11:24:22,338 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-10-22 11:24:22,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:22,338 INFO L225 Difference]: With dead ends: 126 [2019-10-22 11:24:22,338 INFO L226 Difference]: Without dead ends: 126 [2019-10-22 11:24:22,339 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2019-10-22 11:24:22,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-10-22 11:24:22,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 110. [2019-10-22 11:24:22,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-10-22 11:24:22,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 134 transitions. [2019-10-22 11:24:22,341 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 134 transitions. Word has length 17 [2019-10-22 11:24:22,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:22,342 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 134 transitions. [2019-10-22 11:24:22,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 11:24:22,342 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 134 transitions. [2019-10-22 11:24:22,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-22 11:24:22,342 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:22,342 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:22,343 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION]=== [2019-10-22 11:24:22,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:22,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1248679189, now seen corresponding path program 1 times [2019-10-22 11:24:22,343 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:22,343 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495999044] [2019-10-22 11:24:22,343 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:22,343 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:22,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:22,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:22,472 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:24:22,472 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495999044] [2019-10-22 11:24:22,473 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:22,473 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 11:24:22,473 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129157306] [2019-10-22 11:24:22,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 11:24:22,473 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:22,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 11:24:22,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:24:22,474 INFO L87 Difference]: Start difference. First operand 110 states and 134 transitions. Second operand 8 states. [2019-10-22 11:24:22,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:22,690 INFO L93 Difference]: Finished difference Result 138 states and 151 transitions. [2019-10-22 11:24:22,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 11:24:22,690 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2019-10-22 11:24:22,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:22,691 INFO L225 Difference]: With dead ends: 138 [2019-10-22 11:24:22,691 INFO L226 Difference]: Without dead ends: 138 [2019-10-22 11:24:22,691 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2019-10-22 11:24:22,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-10-22 11:24:22,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 111. [2019-10-22 11:24:22,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-10-22 11:24:22,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 135 transitions. [2019-10-22 11:24:22,695 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 135 transitions. Word has length 20 [2019-10-22 11:24:22,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:22,695 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 135 transitions. [2019-10-22 11:24:22,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 11:24:22,695 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 135 transitions. [2019-10-22 11:24:22,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-22 11:24:22,696 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:22,696 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:22,696 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION]=== [2019-10-22 11:24:22,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:22,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1537024475, now seen corresponding path program 1 times [2019-10-22 11:24:22,697 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:22,697 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566548608] [2019-10-22 11:24:22,697 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:22,697 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:22,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:22,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:22,751 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:24:22,751 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566548608] [2019-10-22 11:24:22,751 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:22,752 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:24:22,752 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278108577] [2019-10-22 11:24:22,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:24:22,752 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:22,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:24:22,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:24:22,753 INFO L87 Difference]: Start difference. First operand 111 states and 135 transitions. Second operand 5 states. [2019-10-22 11:24:22,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:22,878 INFO L93 Difference]: Finished difference Result 113 states and 135 transitions. [2019-10-22 11:24:22,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:24:22,879 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-10-22 11:24:22,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:22,879 INFO L225 Difference]: With dead ends: 113 [2019-10-22 11:24:22,879 INFO L226 Difference]: Without dead ends: 113 [2019-10-22 11:24:22,879 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:24:22,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-10-22 11:24:22,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 110. [2019-10-22 11:24:22,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-10-22 11:24:22,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 132 transitions. [2019-10-22 11:24:22,882 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 132 transitions. Word has length 21 [2019-10-22 11:24:22,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:22,882 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 132 transitions. [2019-10-22 11:24:22,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:24:22,882 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 132 transitions. [2019-10-22 11:24:22,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-22 11:24:22,883 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:22,883 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:22,883 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION]=== [2019-10-22 11:24:22,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:22,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1537024474, now seen corresponding path program 1 times [2019-10-22 11:24:22,887 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:22,887 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555625368] [2019-10-22 11:24:22,888 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:22,888 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:22,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:22,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:23,048 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:24:23,048 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555625368] [2019-10-22 11:24:23,048 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:23,048 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 11:24:23,048 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989553133] [2019-10-22 11:24:23,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 11:24:23,049 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:23,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 11:24:23,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:24:23,049 INFO L87 Difference]: Start difference. First operand 110 states and 132 transitions. Second operand 9 states. [2019-10-22 11:24:23,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:23,327 INFO L93 Difference]: Finished difference Result 138 states and 149 transitions. [2019-10-22 11:24:23,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 11:24:23,327 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-10-22 11:24:23,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:23,328 INFO L225 Difference]: With dead ends: 138 [2019-10-22 11:24:23,328 INFO L226 Difference]: Without dead ends: 138 [2019-10-22 11:24:23,329 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-10-22 11:24:23,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-10-22 11:24:23,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 110. [2019-10-22 11:24:23,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-10-22 11:24:23,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 131 transitions. [2019-10-22 11:24:23,331 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 131 transitions. Word has length 21 [2019-10-22 11:24:23,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:23,331 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 131 transitions. [2019-10-22 11:24:23,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 11:24:23,331 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 131 transitions. [2019-10-22 11:24:23,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-22 11:24:23,338 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:23,338 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:23,338 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION]=== [2019-10-22 11:24:23,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:23,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1205114888, now seen corresponding path program 1 times [2019-10-22 11:24:23,338 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:23,339 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031010408] [2019-10-22 11:24:23,339 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:23,339 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:23,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:23,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:23,363 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:24:23,363 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031010408] [2019-10-22 11:24:23,363 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:23,364 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:24:23,364 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15191117] [2019-10-22 11:24:23,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:23,364 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:23,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:23,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:23,365 INFO L87 Difference]: Start difference. First operand 110 states and 131 transitions. Second operand 3 states. [2019-10-22 11:24:23,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:23,379 INFO L93 Difference]: Finished difference Result 171 states and 196 transitions. [2019-10-22 11:24:23,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:23,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-22 11:24:23,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:23,381 INFO L225 Difference]: With dead ends: 171 [2019-10-22 11:24:23,381 INFO L226 Difference]: Without dead ends: 171 [2019-10-22 11:24:23,381 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:24:23,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-10-22 11:24:23,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 122. [2019-10-22 11:24:23,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-10-22 11:24:23,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 145 transitions. [2019-10-22 11:24:23,385 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 145 transitions. Word has length 21 [2019-10-22 11:24:23,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:23,386 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 145 transitions. [2019-10-22 11:24:23,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:23,386 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 145 transitions. [2019-10-22 11:24:23,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-22 11:24:23,386 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:23,387 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:23,387 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION]=== [2019-10-22 11:24:23,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:23,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1684831896, now seen corresponding path program 1 times [2019-10-22 11:24:23,387 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:23,387 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994272861] [2019-10-22 11:24:23,387 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:23,388 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:23,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:23,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:23,563 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:24:23,564 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994272861] [2019-10-22 11:24:23,564 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:23,564 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-22 11:24:23,564 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546177401] [2019-10-22 11:24:23,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 11:24:23,564 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:23,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 11:24:23,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:24:23,565 INFO L87 Difference]: Start difference. First operand 122 states and 145 transitions. Second operand 9 states. [2019-10-22 11:24:23,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:23,802 INFO L93 Difference]: Finished difference Result 136 states and 148 transitions. [2019-10-22 11:24:23,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 11:24:23,803 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-10-22 11:24:23,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:23,803 INFO L225 Difference]: With dead ends: 136 [2019-10-22 11:24:23,803 INFO L226 Difference]: Without dead ends: 136 [2019-10-22 11:24:23,803 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-10-22 11:24:23,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-10-22 11:24:23,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 122. [2019-10-22 11:24:23,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-10-22 11:24:23,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 144 transitions. [2019-10-22 11:24:23,806 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 144 transitions. Word has length 22 [2019-10-22 11:24:23,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:23,806 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 144 transitions. [2019-10-22 11:24:23,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 11:24:23,807 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 144 transitions. [2019-10-22 11:24:23,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-22 11:24:23,807 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:23,807 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:23,807 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION]=== [2019-10-22 11:24:23,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:23,808 INFO L82 PathProgramCache]: Analyzing trace with hash 748038138, now seen corresponding path program 1 times [2019-10-22 11:24:23,808 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:23,808 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193511035] [2019-10-22 11:24:23,808 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:23,808 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:23,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:23,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:23,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:23,830 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193511035] [2019-10-22 11:24:23,830 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:23,830 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:24:23,830 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617131890] [2019-10-22 11:24:23,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:23,831 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:23,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:23,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:23,831 INFO L87 Difference]: Start difference. First operand 122 states and 144 transitions. Second operand 3 states. [2019-10-22 11:24:23,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:23,837 INFO L93 Difference]: Finished difference Result 125 states and 144 transitions. [2019-10-22 11:24:23,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:23,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-22 11:24:23,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:23,838 INFO L225 Difference]: With dead ends: 125 [2019-10-22 11:24:23,838 INFO L226 Difference]: Without dead ends: 122 [2019-10-22 11:24:23,838 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:24:23,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-10-22 11:24:23,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2019-10-22 11:24:23,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-10-22 11:24:23,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 141 transitions. [2019-10-22 11:24:23,841 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 141 transitions. Word has length 23 [2019-10-22 11:24:23,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:23,841 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 141 transitions. [2019-10-22 11:24:23,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:23,841 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 141 transitions. [2019-10-22 11:24:23,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-22 11:24:23,842 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:23,842 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:23,842 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION]=== [2019-10-22 11:24:23,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:23,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1523443953, now seen corresponding path program 1 times [2019-10-22 11:24:23,843 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:23,843 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347041073] [2019-10-22 11:24:23,843 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:23,843 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:23,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:23,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:23,951 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:24:23,951 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347041073] [2019-10-22 11:24:23,951 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824170817] [2019-10-22 11:24:23,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a01c2c9-aafc-44d5-aa33-0b05dab46c12/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:24:24,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:24,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-22 11:24:24,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:24:24,095 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:24,095 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-22 11:24:24,096 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:24,115 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-10-22 11:24:24,115 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:24:24,115 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2019-10-22 11:24:24,139 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 11 treesize of output 7 [2019-10-22 11:24:24,139 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:24,148 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:24,149 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:24:24,149 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2019-10-22 11:24:24,239 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:24,240 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 51 [2019-10-22 11:24:24,241 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:24,266 INFO L567 ElimStorePlain]: treesize reduction 24, result has 54.7 percent of original size [2019-10-22 11:24:24,266 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:24:24,266 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:29 [2019-10-22 11:24:24,305 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-10-22 11:24:24,305 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-10-22 11:24:24,306 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:24,316 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:24,316 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:24:24,317 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:48, output treesize:29 [2019-10-22 11:24:24,371 INFO L341 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size [2019-10-22 11:24:24,371 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 79 [2019-10-22 11:24:24,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:24,375 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:24,391 INFO L567 ElimStorePlain]: treesize reduction 32, result has 51.5 percent of original size [2019-10-22 11:24:24,392 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:24:24,392 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:65, output treesize:34 [2019-10-22 11:24:24,441 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:24,442 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 36 treesize of output 31 [2019-10-22 11:24:24,442 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:24,455 INFO L567 ElimStorePlain]: treesize reduction 12, result has 55.6 percent of original size [2019-10-22 11:24:24,455 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:24:24,456 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15 [2019-10-22 11:24:24,507 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:24:24,511 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:24:24,521 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:24:24,524 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:24,525 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:24:24,525 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:19 [2019-10-22 11:24:24,563 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:24,564 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:24,565 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:24:24,565 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:19 [2019-10-22 11:24:27,056 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-10-22 11:24:27,077 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 778 treesize of output 762 [2019-10-22 11:24:27,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:27,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:24:27,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:27,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:27,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:24:27,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:27,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:27,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:24:27,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:27,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:24:27,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:27,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:27,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:24:27,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:27,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:24:27,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:27,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:27,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:24:27,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:27,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:27,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:27,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:27,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:27,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:27,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:24:27,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:27,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:24:27,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:27,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:27,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:24:27,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:27,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:27,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:27,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:27,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:24:27,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:27,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:27,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:24:27,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:27,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:27,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:24:27,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:27,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:27,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:24:27,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:27,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:24:27,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:27,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:27,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:24:27,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:27,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:24:27,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:27,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:27,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:24:27,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:27,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:27,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:27,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:27,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:27,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:27,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:24:27,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:27,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:24:27,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:27,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:27,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:24:27,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:27,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:27,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:27,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:27,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:24:27,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:27,135 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:24:27,436 WARN L191 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 42 [2019-10-22 11:24:27,436 INFO L567 ElimStorePlain]: treesize reduction 684, result has 10.2 percent of original size [2019-10-22 11:24:27,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:27,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:27,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:24:27,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:27,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:27,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:24:27,443 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2019-10-22 11:24:27,443 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:103 [2019-10-22 11:24:27,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:27,684 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:24:27,685 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1735734525] [2019-10-22 11:24:27,691 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 25 [2019-10-22 11:24:27,739 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-10-22 11:24:27,739 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-22 11:24:28,048 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:24:28,048 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:24:28,053 INFO L168 Benchmark]: Toolchain (without parser) took 11244.07 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 315.6 MB). Free memory was 943.2 MB in the beginning and 837.1 MB in the end (delta: 106.1 MB). Peak memory consumption was 421.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:28,053 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:24:28,053 INFO L168 Benchmark]: CACSL2BoogieTranslator took 520.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 943.2 MB in the beginning and 1.1 GB in the end (delta: -199.2 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:28,054 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.76 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: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:28,054 INFO L168 Benchmark]: Boogie Preprocessor took 48.79 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:24:28,054 INFO L168 Benchmark]: RCFGBuilder took 453.23 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: 36.3 MB). Peak memory consumption was 36.3 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:28,055 INFO L168 Benchmark]: TraceAbstraction took 10165.42 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 156.8 MB). Free memory was 1.1 GB in the beginning and 837.1 MB in the end (delta: 260.1 MB). Peak memory consumption was 416.9 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:28,057 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 520.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 943.2 MB in the beginning and 1.1 GB in the end (delta: -199.2 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.76 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: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 48.79 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 453.23 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: 36.3 MB). Peak memory consumption was 36.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10165.42 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 156.8 MB). Free memory was 1.1 GB in the beginning and 837.1 MB in the end (delta: 260.1 MB). Peak memory consumption was 416.9 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:24:30,182 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:24:30,183 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:24:30,193 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:24:30,193 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:24:30,194 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:24:30,195 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:24:30,197 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:24:30,199 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:24:30,199 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:24:30,200 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:24:30,201 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:24:30,202 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:24:30,202 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:24:30,203 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:24:30,204 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:24:30,205 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:24:30,206 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:24:30,208 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:24:30,209 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:24:30,211 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:24:30,212 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:24:30,213 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:24:30,214 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:24:30,216 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:24:30,218 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:24:30,218 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:24:30,219 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:24:30,219 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:24:30,220 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:24:30,220 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:24:30,221 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:24:30,222 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:24:30,222 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:24:30,223 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:24:30,228 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:24:30,229 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:24:30,229 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:24:30,229 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:24:30,230 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:24:30,230 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:24:30,231 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9a01c2c9-aafc-44d5-aa33-0b05dab46c12/bin/utaipan/config/svcomp-MemCleanup-32bit-Taipan_Bitvector.epf [2019-10-22 11:24:30,254 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:24:30,256 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:24:30,258 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:24:30,258 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:24:30,258 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:24:30,259 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:24:30,259 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:24:30,259 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:24:30,259 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:24:30,260 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 11:24:30,260 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 11:24:30,260 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:24:30,260 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:24:30,260 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 11:24:30,260 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:24:30,261 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:24:30,261 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:24:30,261 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-10-22 11:24:30,261 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-10-22 11:24:30,261 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:24:30,261 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-10-22 11:24:30,262 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-10-22 11:24:30,262 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:24:30,262 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 11:24:30,262 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:24:30,262 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:24:30,262 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:24:30,263 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:24:30,263 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:24:30,263 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:24:30,263 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:24:30,263 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-10-22 11:24:30,263 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-10-22 11:24:30,263 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:24:30,265 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_9a01c2c9-aafc-44d5-aa33-0b05dab46c12/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 valid-memcleanup) ) 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 -> b651d63eb42259dfd3a213a6671e4c58ee528ad0 [2019-10-22 11:24:30,296 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:24:30,307 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:24:30,310 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:24:30,311 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:24:30,311 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:24:30,312 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9a01c2c9-aafc-44d5-aa33-0b05dab46c12/bin/utaipan/../../sv-benchmarks/c/forester-heap/sll-circular-2.i [2019-10-22 11:24:30,355 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9a01c2c9-aafc-44d5-aa33-0b05dab46c12/bin/utaipan/data/11fd87fe1/e6617273a6b2470ba777b7eb1edc665b/FLAG587879b5b [2019-10-22 11:24:30,817 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:24:30,823 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9a01c2c9-aafc-44d5-aa33-0b05dab46c12/sv-benchmarks/c/forester-heap/sll-circular-2.i [2019-10-22 11:24:30,837 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9a01c2c9-aafc-44d5-aa33-0b05dab46c12/bin/utaipan/data/11fd87fe1/e6617273a6b2470ba777b7eb1edc665b/FLAG587879b5b [2019-10-22 11:24:31,106 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9a01c2c9-aafc-44d5-aa33-0b05dab46c12/bin/utaipan/data/11fd87fe1/e6617273a6b2470ba777b7eb1edc665b [2019-10-22 11:24:31,108 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:24:31,109 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:24:31,110 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:24:31,110 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:24:31,113 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:24:31,114 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:24:31" (1/1) ... [2019-10-22 11:24:31,118 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12422877 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:31, skipping insertion in model container [2019-10-22 11:24:31,118 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:24:31" (1/1) ... [2019-10-22 11:24:31,125 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:24:31,162 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:24:31,481 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:24:31,561 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:24:31,613 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:24:31,655 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:24:31,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:31 WrapperNode [2019-10-22 11:24:31,656 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:24:31,656 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:24:31,657 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:24:31,657 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:24:31,665 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:24:31" (1/1) ... [2019-10-22 11:24:31,689 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:24:31" (1/1) ... [2019-10-22 11:24:31,712 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:24:31,712 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:24:31,712 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:24:31,712 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:24:31,720 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:31" (1/1) ... [2019-10-22 11:24:31,720 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:31" (1/1) ... [2019-10-22 11:24:31,724 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:31" (1/1) ... [2019-10-22 11:24:31,724 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:31" (1/1) ... [2019-10-22 11:24:31,733 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:31" (1/1) ... [2019-10-22 11:24:31,738 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:31" (1/1) ... [2019-10-22 11:24:31,740 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:31" (1/1) ... [2019-10-22 11:24:31,742 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:24:31,743 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:24:31,743 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:24:31,743 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:24:31,744 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a01c2c9-aafc-44d5-aa33-0b05dab46c12/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:24:31,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-10-22 11:24:31,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 11:24:31,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 11:24:31,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 11:24:31,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:24:31,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-10-22 11:24:31,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:24:31,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:24:32,337 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:24:32,337 INFO L284 CfgBuilder]: Removed 13 assume(true) statements. [2019-10-22 11:24:32,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:24:32 BoogieIcfgContainer [2019-10-22 11:24:32,339 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:24:32,340 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:24:32,340 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:24:32,343 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:24:32,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:24:31" (1/3) ... [2019-10-22 11:24:32,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@211c1cca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:24:32, skipping insertion in model container [2019-10-22 11:24:32,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:31" (2/3) ... [2019-10-22 11:24:32,345 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@211c1cca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:24:32, skipping insertion in model container [2019-10-22 11:24:32,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:24:32" (3/3) ... [2019-10-22 11:24:32,346 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-circular-2.i [2019-10-22 11:24:32,356 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:24:32,364 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 43 error locations. [2019-10-22 11:24:32,375 INFO L249 AbstractCegarLoop]: Starting to check reachability of 43 error locations. [2019-10-22 11:24:32,394 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:24:32,394 INFO L374 AbstractCegarLoop]: Hoare is false [2019-10-22 11:24:32,394 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:24:32,394 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:24:32,394 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:24:32,395 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:24:32,395 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:24:32,395 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:24:32,411 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states. [2019-10-22 11:24:32,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-10-22 11:24:32,419 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:32,420 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-10-22 11:24:32,422 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION]=== [2019-10-22 11:24:32,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:32,428 INFO L82 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2019-10-22 11:24:32,438 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:24:32,438 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1270871738] [2019-10-22 11:24:32,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a01c2c9-aafc-44d5-aa33-0b05dab46c12/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:24:32,685 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:24:32,685 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Sort FloatRoundingMode not declared at de.uni_freiburg.informatik.ultimate.logic.NoopScript.sort(NoopScript.java:412) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.sort(WrapperScript.java:223) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.NonDeclaringTermTransferrer.transferSort(NonDeclaringTermTransferrer.java:111) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.DeclarableFunctionSymbol.defineOrDeclare(DeclarableFunctionSymbol.java:160) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.transferHistoryFromRecord(HistoryRecordingScript.java:143) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.transferHistoryFromRecord(HistoryRecordingScript.java:168) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.SmtFunctionsAndAxioms.transferSymbols(SmtFunctionsAndAxioms.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleTraceCheck.createExternalManagedScript(IpTcStrategyModuleTraceCheck.java:81) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCvc4.constructManagedScript(IpTcStrategyModuleCvc4.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) 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:24:32,690 INFO L168 Benchmark]: Toolchain (without parser) took 1579.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 940.2 MB in the beginning and 1.1 GB in the end (delta: -134.9 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:32,690 INFO L168 Benchmark]: CDTParser took 0.14 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:24:32,691 INFO L168 Benchmark]: CACSL2BoogieTranslator took 545.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 940.2 MB in the beginning and 1.1 GB in the end (delta: -197.0 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:32,692 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:32,693 INFO L168 Benchmark]: Boogie Preprocessor took 30.60 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:24:32,694 INFO L168 Benchmark]: RCFGBuilder took 596.04 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: 43.6 MB). Peak memory consumption was 43.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:32,694 INFO L168 Benchmark]: TraceAbstraction took 347.98 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: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:32,697 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.14 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 545.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 940.2 MB in the beginning and 1.1 GB in the end (delta: -197.0 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 55.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.60 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 596.04 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: 43.6 MB). Peak memory consumption was 43.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 347.98 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: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Sort FloatRoundingMode not declared de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Sort FloatRoundingMode not declared: de.uni_freiburg.informatik.ultimate.logic.NoopScript.sort(NoopScript.java:412) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...