./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/forester-heap/sll-01-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_7611e1ca-44cc-426b-90ce-379cd718ede7/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_7611e1ca-44cc-426b-90ce-379cd718ede7/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7611e1ca-44cc-426b-90ce-379cd718ede7/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7611e1ca-44cc-426b-90ce-379cd718ede7/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/forester-heap/sll-01-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_7611e1ca-44cc-426b-90ce-379cd718ede7/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7611e1ca-44cc-426b-90ce-379cd718ede7/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 31de2fb67e84e52bb7705ac8720e6b139fef2d91 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 12:35:02,349 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:35:02,350 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:35:02,360 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:35:02,360 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:35:02,361 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:35:02,362 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:35:02,363 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:35:02,365 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:35:02,366 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:35:02,367 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:35:02,368 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:35:02,368 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:35:02,369 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:35:02,370 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:35:02,371 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:35:02,372 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:35:02,372 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:35:02,374 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:35:02,376 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:35:02,377 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:35:02,377 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:35:02,378 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:35:02,378 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:35:02,380 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:35:02,380 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:35:02,380 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:35:02,381 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:35:02,381 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:35:02,382 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:35:02,382 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:35:02,382 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:35:02,383 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:35:02,383 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:35:02,384 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:35:02,384 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:35:02,384 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:35:02,384 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:35:02,384 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:35:02,385 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:35:02,385 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:35:02,386 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7611e1ca-44cc-426b-90ce-379cd718ede7/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 12:35:02,396 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:35:02,396 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:35:02,397 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 12:35:02,397 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 12:35:02,397 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 12:35:02,397 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 12:35:02,397 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 12:35:02,397 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 12:35:02,397 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 12:35:02,397 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 12:35:02,398 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 12:35:02,398 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 12:35:02,398 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 12:35:02,398 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 12:35:02,398 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 12:35:02,399 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:35:02,399 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:35:02,399 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:35:02,399 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:35:02,399 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:35:02,399 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 12:35:02,399 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:35:02,399 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 12:35:02,399 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 12:35:02,400 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:35:02,400 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 12:35:02,400 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:35:02,400 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 12:35:02,400 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:35:02,400 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:35:02,400 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:35:02,400 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:35:02,400 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:35:02,400 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:35:02,401 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 12:35:02,401 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 12:35:02,401 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 12:35:02,401 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 12:35:02,401 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:35:02,401 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 12:35:02,401 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/run_dir_7611e1ca-44cc-426b-90ce-379cd718ede7/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 31de2fb67e84e52bb7705ac8720e6b139fef2d91 [2019-12-07 12:35:02,500 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:35:02,508 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:35:02,511 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:35:02,512 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:35:02,512 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:35:02,513 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7611e1ca-44cc-426b-90ce-379cd718ede7/bin/utaipan/../../sv-benchmarks/c/forester-heap/sll-01-2.i [2019-12-07 12:35:02,552 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7611e1ca-44cc-426b-90ce-379cd718ede7/bin/utaipan/data/1cb6f7b0c/5b72e51bf0f74f3fb130fb9b61b4b705/FLAGc7f163e58 [2019-12-07 12:35:02,992 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:35:02,993 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7611e1ca-44cc-426b-90ce-379cd718ede7/sv-benchmarks/c/forester-heap/sll-01-2.i [2019-12-07 12:35:03,002 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7611e1ca-44cc-426b-90ce-379cd718ede7/bin/utaipan/data/1cb6f7b0c/5b72e51bf0f74f3fb130fb9b61b4b705/FLAGc7f163e58 [2019-12-07 12:35:03,010 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7611e1ca-44cc-426b-90ce-379cd718ede7/bin/utaipan/data/1cb6f7b0c/5b72e51bf0f74f3fb130fb9b61b4b705 [2019-12-07 12:35:03,012 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:35:03,013 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:35:03,013 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:35:03,014 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:35:03,016 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:35:03,016 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:35:03" (1/1) ... [2019-12-07 12:35:03,018 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53457aa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:35:03, skipping insertion in model container [2019-12-07 12:35:03,018 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:35:03" (1/1) ... [2019-12-07 12:35:03,023 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:35:03,053 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:35:03,278 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:35:03,284 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:35:03,324 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:35:03,356 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:35:03,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:35:03 WrapperNode [2019-12-07 12:35:03,356 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:35:03,357 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:35:03,357 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:35:03,357 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:35:03,362 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:35:03" (1/1) ... [2019-12-07 12:35:03,372 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:35:03" (1/1) ... [2019-12-07 12:35:03,391 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:35:03,391 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:35:03,392 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:35:03,392 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:35:03,398 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:35:03" (1/1) ... [2019-12-07 12:35:03,398 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:35:03" (1/1) ... [2019-12-07 12:35:03,401 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:35:03" (1/1) ... [2019-12-07 12:35:03,401 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:35:03" (1/1) ... [2019-12-07 12:35:03,407 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:35:03" (1/1) ... [2019-12-07 12:35:03,413 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:35:03" (1/1) ... [2019-12-07 12:35:03,414 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:35:03" (1/1) ... [2019-12-07 12:35:03,417 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:35:03,417 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:35:03,417 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:35:03,417 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:35:03,418 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:35:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7611e1ca-44cc-426b-90ce-379cd718ede7/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-12-07 12:35:03,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 12:35:03,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 12:35:03,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 12:35:03,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 12:35:03,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:35:03,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:35:03,819 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:35:03,819 INFO L287 CfgBuilder]: Removed 34 assume(true) statements. [2019-12-07 12:35:03,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:35:03 BoogieIcfgContainer [2019-12-07 12:35:03,820 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:35:03,821 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:35:03,821 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:35:03,823 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:35:03,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:35:03" (1/3) ... [2019-12-07 12:35:03,823 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49d861f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:35:03, skipping insertion in model container [2019-12-07 12:35:03,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:35:03" (2/3) ... [2019-12-07 12:35:03,824 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49d861f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:35:03, skipping insertion in model container [2019-12-07 12:35:03,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:35:03" (3/3) ... [2019-12-07 12:35:03,825 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-01-2.i [2019-12-07 12:35:03,831 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:35:03,835 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2019-12-07 12:35:03,843 INFO L249 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2019-12-07 12:35:03,859 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:35:03,859 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 12:35:03,859 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:35:03,859 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:35:03,859 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:35:03,859 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:35:03,859 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:35:03,859 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:35:03,871 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states. [2019-12-07 12:35:03,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 12:35:03,875 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:35:03,875 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 12:35:03,876 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:35:03,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:35:03,879 INFO L82 PathProgramCache]: Analyzing trace with hash 351983, now seen corresponding path program 1 times [2019-12-07 12:35:03,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:35:03,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47961730] [2019-12-07 12:35:03,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:35:03,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:35:03,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:35:03,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47961730] [2019-12-07 12:35:03,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:35:03,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:35:03,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426884454] [2019-12-07 12:35:03,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:35:03,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:35:03,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:35:03,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:35:03,998 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 3 states. [2019-12-07 12:35:04,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:35:04,043 INFO L93 Difference]: Finished difference Result 163 states and 262 transitions. [2019-12-07 12:35:04,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:35:04,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 12:35:04,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:35:04,052 INFO L225 Difference]: With dead ends: 163 [2019-12-07 12:35:04,052 INFO L226 Difference]: Without dead ends: 89 [2019-12-07 12:35:04,055 INFO L630 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-12-07 12:35:04,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-12-07 12:35:04,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 71. [2019-12-07 12:35:04,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-12-07 12:35:04,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2019-12-07 12:35:04,085 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 3 [2019-12-07 12:35:04,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:35:04,086 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2019-12-07 12:35:04,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:35:04,086 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2019-12-07 12:35:04,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 12:35:04,086 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:35:04,086 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:35:04,086 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:35:04,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:35:04,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1222085302, now seen corresponding path program 1 times [2019-12-07 12:35:04,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:35:04,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293220264] [2019-12-07 12:35:04,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:35:04,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:35:04,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:35:04,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293220264] [2019-12-07 12:35:04,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:35:04,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:35:04,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22681865] [2019-12-07 12:35:04,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:35:04,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:35:04,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:35:04,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:35:04,143 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 3 states. [2019-12-07 12:35:04,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:35:04,151 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2019-12-07 12:35:04,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:35:04,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 12:35:04,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:35:04,153 INFO L225 Difference]: With dead ends: 71 [2019-12-07 12:35:04,153 INFO L226 Difference]: Without dead ends: 69 [2019-12-07 12:35:04,153 INFO L630 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-12-07 12:35:04,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-12-07 12:35:04,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-12-07 12:35:04,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-12-07 12:35:04,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-12-07 12:35:04,159 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 7 [2019-12-07 12:35:04,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:35:04,159 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-12-07 12:35:04,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:35:04,159 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-12-07 12:35:04,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 12:35:04,159 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:35:04,159 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:35:04,160 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:35:04,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:35:04,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1985887507, now seen corresponding path program 1 times [2019-12-07 12:35:04,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:35:04,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995644665] [2019-12-07 12:35:04,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:35:04,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:35:04,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:35:04,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995644665] [2019-12-07 12:35:04,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:35:04,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:35:04,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138445772] [2019-12-07 12:35:04,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:35:04,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:35:04,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:35:04,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:35:04,193 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 3 states. [2019-12-07 12:35:04,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:35:04,229 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2019-12-07 12:35:04,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:35:04,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-12-07 12:35:04,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:35:04,230 INFO L225 Difference]: With dead ends: 72 [2019-12-07 12:35:04,230 INFO L226 Difference]: Without dead ends: 68 [2019-12-07 12:35:04,230 INFO L630 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-12-07 12:35:04,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-12-07 12:35:04,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2019-12-07 12:35:04,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-12-07 12:35:04,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-12-07 12:35:04,235 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 12 [2019-12-07 12:35:04,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:35:04,235 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-12-07 12:35:04,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:35:04,235 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-12-07 12:35:04,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 12:35:04,235 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:35:04,235 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:35:04,236 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:35:04,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:35:04,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1432966373, now seen corresponding path program 1 times [2019-12-07 12:35:04,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:35:04,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642772142] [2019-12-07 12:35:04,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:35:04,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:35:04,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:35:04,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642772142] [2019-12-07 12:35:04,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:35:04,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:35:04,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242286465] [2019-12-07 12:35:04,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:35:04,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:35:04,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:35:04,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:35:04,273 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 5 states. [2019-12-07 12:35:04,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:35:04,339 INFO L93 Difference]: Finished difference Result 123 states and 131 transitions. [2019-12-07 12:35:04,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:35:04,339 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-07 12:35:04,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:35:04,340 INFO L225 Difference]: With dead ends: 123 [2019-12-07 12:35:04,340 INFO L226 Difference]: Without dead ends: 103 [2019-12-07 12:35:04,341 INFO L630 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-12-07 12:35:04,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-12-07 12:35:04,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 64. [2019-12-07 12:35:04,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-12-07 12:35:04,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2019-12-07 12:35:04,346 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 13 [2019-12-07 12:35:04,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:35:04,346 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2019-12-07 12:35:04,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:35:04,346 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2019-12-07 12:35:04,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 12:35:04,347 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:35:04,347 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:35:04,347 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:35:04,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:35:04,347 INFO L82 PathProgramCache]: Analyzing trace with hash -498554695, now seen corresponding path program 1 times [2019-12-07 12:35:04,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:35:04,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380758627] [2019-12-07 12:35:04,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:35:04,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:35:04,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:35:04,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380758627] [2019-12-07 12:35:04,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:35:04,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:35:04,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637459353] [2019-12-07 12:35:04,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:35:04,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:35:04,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:35:04,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:35:04,372 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 3 states. [2019-12-07 12:35:04,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:35:04,382 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2019-12-07 12:35:04,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:35:04,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 12:35:04,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:35:04,383 INFO L225 Difference]: With dead ends: 89 [2019-12-07 12:35:04,384 INFO L226 Difference]: Without dead ends: 87 [2019-12-07 12:35:04,384 INFO L630 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-12-07 12:35:04,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-12-07 12:35:04,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 66. [2019-12-07 12:35:04,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-12-07 12:35:04,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2019-12-07 12:35:04,388 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 17 [2019-12-07 12:35:04,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:35:04,388 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2019-12-07 12:35:04,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:35:04,388 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2019-12-07 12:35:04,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 12:35:04,389 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:35:04,389 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:35:04,389 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:35:04,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:35:04,389 INFO L82 PathProgramCache]: Analyzing trace with hash -498554789, now seen corresponding path program 1 times [2019-12-07 12:35:04,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:35:04,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690371304] [2019-12-07 12:35:04,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:35:04,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:35:04,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:35:04,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690371304] [2019-12-07 12:35:04,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:35:04,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:35:04,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892875253] [2019-12-07 12:35:04,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:35:04,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:35:04,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:35:04,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:35:04,414 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand 3 states. [2019-12-07 12:35:04,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:35:04,426 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2019-12-07 12:35:04,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:35:04,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 12:35:04,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:35:04,427 INFO L225 Difference]: With dead ends: 66 [2019-12-07 12:35:04,428 INFO L226 Difference]: Without dead ends: 64 [2019-12-07 12:35:04,428 INFO L630 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-12-07 12:35:04,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-12-07 12:35:04,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-12-07 12:35:04,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-12-07 12:35:04,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2019-12-07 12:35:04,433 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 17 [2019-12-07 12:35:04,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:35:04,433 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2019-12-07 12:35:04,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:35:04,434 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2019-12-07 12:35:04,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 12:35:04,434 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:35:04,434 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:35:04,435 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:35:04,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:35:04,435 INFO L82 PathProgramCache]: Analyzing trace with hash 777809791, now seen corresponding path program 1 times [2019-12-07 12:35:04,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:35:04,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5674278] [2019-12-07 12:35:04,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:35:04,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:35:04,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:35:04,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5674278] [2019-12-07 12:35:04,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:35:04,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:35:04,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152249489] [2019-12-07 12:35:04,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:35:04,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:35:04,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:35:04,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:35:04,479 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand 3 states. [2019-12-07 12:35:04,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:35:04,484 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2019-12-07 12:35:04,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:35:04,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 12:35:04,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:35:04,485 INFO L225 Difference]: With dead ends: 64 [2019-12-07 12:35:04,485 INFO L226 Difference]: Without dead ends: 62 [2019-12-07 12:35:04,485 INFO L630 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-12-07 12:35:04,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-12-07 12:35:04,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-12-07 12:35:04,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-12-07 12:35:04,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2019-12-07 12:35:04,489 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 18 [2019-12-07 12:35:04,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:35:04,489 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2019-12-07 12:35:04,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:35:04,490 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2019-12-07 12:35:04,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 12:35:04,490 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:35:04,490 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:35:04,490 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:35:04,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:35:04,491 INFO L82 PathProgramCache]: Analyzing trace with hash -444715164, now seen corresponding path program 1 times [2019-12-07 12:35:04,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:35:04,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057283665] [2019-12-07 12:35:04,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:35:04,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:35:04,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:35:04,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057283665] [2019-12-07 12:35:04,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:35:04,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 12:35:04,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584945251] [2019-12-07 12:35:04,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 12:35:04,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:35:04,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 12:35:04,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-07 12:35:04,735 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand 9 states. [2019-12-07 12:35:05,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:35:05,392 INFO L93 Difference]: Finished difference Result 161 states and 174 transitions. [2019-12-07 12:35:05,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 12:35:05,393 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-12-07 12:35:05,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:35:05,395 INFO L225 Difference]: With dead ends: 161 [2019-12-07 12:35:05,395 INFO L226 Difference]: Without dead ends: 159 [2019-12-07 12:35:05,395 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2019-12-07 12:35:05,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-12-07 12:35:05,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 73. [2019-12-07 12:35:05,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-12-07 12:35:05,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2019-12-07 12:35:05,402 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 20 [2019-12-07 12:35:05,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:35:05,402 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2019-12-07 12:35:05,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 12:35:05,402 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2019-12-07 12:35:05,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 12:35:05,403 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:35:05,403 INFO L410 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-12-07 12:35:05,403 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:35:05,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:35:05,404 INFO L82 PathProgramCache]: Analyzing trace with hash 882473601, now seen corresponding path program 1 times [2019-12-07 12:35:05,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:35:05,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673935406] [2019-12-07 12:35:05,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:35:05,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:35:05,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:35:05,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673935406] [2019-12-07 12:35:05,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:35:05,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:35:05,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852213929] [2019-12-07 12:35:05,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:35:05,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:35:05,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:35:05,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:35:05,423 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand 3 states. [2019-12-07 12:35:05,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:35:05,448 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2019-12-07 12:35:05,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:35:05,448 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-12-07 12:35:05,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:35:05,449 INFO L225 Difference]: With dead ends: 73 [2019-12-07 12:35:05,449 INFO L226 Difference]: Without dead ends: 71 [2019-12-07 12:35:05,449 INFO L630 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-12-07 12:35:05,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-12-07 12:35:05,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-12-07 12:35:05,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-12-07 12:35:05,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2019-12-07 12:35:05,454 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 23 [2019-12-07 12:35:05,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:35:05,454 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2019-12-07 12:35:05,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:35:05,454 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2019-12-07 12:35:05,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 12:35:05,455 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:35:05,455 INFO L410 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-12-07 12:35:05,455 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:35:05,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:35:05,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1468769677, now seen corresponding path program 1 times [2019-12-07 12:35:05,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:35:05,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732081714] [2019-12-07 12:35:05,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:35:05,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:35:05,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:35:05,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732081714] [2019-12-07 12:35:05,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:35:05,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 12:35:05,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316138525] [2019-12-07 12:35:05,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 12:35:05,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:35:05,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 12:35:05,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-07 12:35:05,596 INFO L87 Difference]: Start difference. First operand 71 states and 78 transitions. Second operand 9 states. [2019-12-07 12:35:06,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:35:06,080 INFO L93 Difference]: Finished difference Result 153 states and 166 transitions. [2019-12-07 12:35:06,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 12:35:06,081 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-12-07 12:35:06,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:35:06,082 INFO L225 Difference]: With dead ends: 153 [2019-12-07 12:35:06,082 INFO L226 Difference]: Without dead ends: 151 [2019-12-07 12:35:06,083 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2019-12-07 12:35:06,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-12-07 12:35:06,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 74. [2019-12-07 12:35:06,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-12-07 12:35:06,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2019-12-07 12:35:06,092 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 23 [2019-12-07 12:35:06,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:35:06,092 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2019-12-07 12:35:06,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 12:35:06,092 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2019-12-07 12:35:06,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 12:35:06,093 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:35:06,093 INFO L410 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, 1] [2019-12-07 12:35:06,094 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:35:06,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:35:06,094 INFO L82 PathProgramCache]: Analyzing trace with hash 400931648, now seen corresponding path program 1 times [2019-12-07 12:35:06,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:35:06,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285451151] [2019-12-07 12:35:06,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:35:06,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:35:06,164 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:35:06,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285451151] [2019-12-07 12:35:06,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089258990] [2019-12-07 12:35:06,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7611e1ca-44cc-426b-90ce-379cd718ede7/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-12-07 12:35:06,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:35:06,204 INFO L264 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 23 conjunts are in the unsatisfiable core [2019-12-07 12:35:06,208 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:35:06,253 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:35:06,253 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-12-07 12:35:06,254 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:35:06,275 INFO L614 ElimStorePlain]: treesize reduction 10, result has 80.0 percent of original size [2019-12-07 12:35:06,280 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 12:35:06,280 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:35:06,288 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:35:06,291 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 12:35:06,291 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 12:35:06,298 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:35:06,299 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:35:06,299 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:35, output treesize:32 [2019-12-07 12:35:06,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:35:06,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:35:06,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:35:06,347 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_3], 1=[v_prenex_6, |v_#valid_30|], 3=[v_prenex_10]} [2019-12-07 12:35:06,406 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-12-07 12:35:06,406 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:35:09,917 WARN L192 SmtUtils]: Spent 3.51 s on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2019-12-07 12:35:09,917 INFO L614 ElimStorePlain]: treesize reduction 4, result has 99.5 percent of original size [2019-12-07 12:35:10,006 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:35:10,006 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 12:35:10,007 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:35:11,497 WARN L192 SmtUtils]: Spent 1.49 s on a formula simplification that was a NOOP. DAG size: 123 [2019-12-07 12:35:11,497 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:35:11,570 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:35:11,571 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 12:35:11,571 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 12:35:12,922 WARN L192 SmtUtils]: Spent 1.35 s on a formula simplification that was a NOOP. DAG size: 119 [2019-12-07 12:35:12,922 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:35:13,006 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:35:13,006 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-12-07 12:35:13,007 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 12:35:14,290 WARN L192 SmtUtils]: Spent 1.28 s on a formula simplification that was a NOOP. DAG size: 113 [2019-12-07 12:35:14,291 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:35:14,296 INFO L430 ElimStorePlain]: Different costs {2=[v_prenex_1, v_prenex_2, |v_#memory_$Pointer$.base_51|, |v_#memory_$Pointer$.offset_51|], 16=[v_prenex_8, v_prenex_9, v_prenex_4, v_prenex_5]} [2019-12-07 12:35:14,350 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:35:14,399 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-12-07 12:35:14,399 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 12:35:15,640 WARN L192 SmtUtils]: Spent 1.24 s on a formula simplification that was a NOOP. DAG size: 111 [2019-12-07 12:35:15,640 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:35:15,671 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:35:15,714 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-12-07 12:35:15,715 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-07 12:35:17,674 WARN L192 SmtUtils]: Spent 1.96 s on a formula simplification. DAG size of input: 109 DAG size of output: 107 [2019-12-07 12:35:17,674 INFO L614 ElimStorePlain]: treesize reduction 8, result has 99.0 percent of original size [2019-12-07 12:35:17,710 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:35:17,742 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-12-07 12:35:17,742 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-07 12:35:18,394 WARN L192 SmtUtils]: Spent 651.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-12-07 12:35:18,394 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:35:18,422 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:35:18,449 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-12-07 12:35:18,449 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-07 12:35:19,368 WARN L192 SmtUtils]: Spent 918.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 88 [2019-12-07 12:35:19,368 INFO L614 ElimStorePlain]: treesize reduction 47, result has 94.2 percent of original size [2019-12-07 12:35:19,373 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:35:19,378 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:35:19,452 INFO L343 Elim1Store]: treesize reduction 226, result has 38.6 percent of original size [2019-12-07 12:35:19,452 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 148 treesize of output 258 [2019-12-07 12:35:19,453 INFO L534 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-12-07 12:35:19,972 WARN L192 SmtUtils]: Spent 518.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2019-12-07 12:35:19,973 INFO L614 ElimStorePlain]: treesize reduction 118, result has 82.4 percent of original size [2019-12-07 12:35:19,976 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:35:19,979 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:35:19,982 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 12:35:20,002 INFO L343 Elim1Store]: treesize reduction 18, result has 64.7 percent of original size [2019-12-07 12:35:20,003 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 57 [2019-12-07 12:35:20,003 INFO L534 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-12-07 12:35:20,266 WARN L192 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-12-07 12:35:20,266 INFO L614 ElimStorePlain]: treesize reduction 16, result has 96.7 percent of original size [2019-12-07 12:35:20,269 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:35:20,272 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:35:20,338 INFO L343 Elim1Store]: treesize reduction 226, result has 38.6 percent of original size [2019-12-07 12:35:20,339 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 148 treesize of output 258 [2019-12-07 12:35:20,339 INFO L534 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-12-07 12:35:20,460 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2019-12-07 12:35:20,460 INFO L614 ElimStorePlain]: treesize reduction 118, result has 68.4 percent of original size [2019-12-07 12:35:20,463 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:35:20,465 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:35:20,467 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 12:35:20,487 INFO L343 Elim1Store]: treesize reduction 18, result has 64.7 percent of original size [2019-12-07 12:35:20,487 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 57 [2019-12-07 12:35:20,488 INFO L534 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-12-07 12:35:20,565 INFO L614 ElimStorePlain]: treesize reduction 16, result has 91.5 percent of original size [2019-12-07 12:35:20,566 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, 8 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-07 12:35:20,566 INFO L239 ElimStorePlain]: Needed 13 recursive calls to eliminate 14 variables, input treesize:863, output treesize:202 [2019-12-07 12:35:20,735 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-12-07 12:35:20,735 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:35:20,741 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:35:20,744 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:35:20,744 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-12-07 12:35:20,745 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:35:20,748 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:35:20,748 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:35:20,748 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:7 [2019-12-07 12:35:20,754 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:35:20,754 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:35:20,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:35:20,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:35:20,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:35:22,815 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_ULTIMATE.start_main_~list~0.offset 4))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc2.base_10| Int)) (let ((.cse3 (+ c_ULTIMATE.start_main_~list~0.offset 4))) (let ((.cse4 (let ((.cse6 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~list~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~list~0.base) .cse3 0)))) (store .cse6 |v_ULTIMATE.start_main_#t~malloc2.base_10| (store (select .cse6 |v_ULTIMATE.start_main_#t~malloc2.base_10|) 0 0)))) (.cse0 (let ((.cse5 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~list~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~list~0.base) .cse3 |v_ULTIMATE.start_main_#t~malloc2.base_10|)))) (store .cse5 |v_ULTIMATE.start_main_#t~malloc2.base_10| (store (select .cse5 |v_ULTIMATE.start_main_#t~malloc2.base_10|) 0 0))))) (let ((.cse1 (select (select .cse0 c_ULTIMATE.start_main_~list~0.base) .cse3)) (.cse2 (+ (select (select .cse4 c_ULTIMATE.start_main_~list~0.base) .cse3) 4))) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc2.base_10|))) (not (= 0 (select (select (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 0)) c_ULTIMATE.start_main_~list~0.base) .cse3))) (= 0 |v_ULTIMATE.start_main_#t~malloc2.base_10|) (= (select (select (store .cse4 .cse1 (store (select .cse4 .cse1) .cse2 0)) c_ULTIMATE.start_main_~list~0.base) c_ULTIMATE.start_main_~list~0.offset) 0)))))) (= (select (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~list~0.base) .cse7 0) c_ULTIMATE.start_main_~list~0.offset) 0) (forall ((|v_ULTIMATE.start_main_#t~malloc2.base_10| Int)) (let ((.cse9 (+ c_ULTIMATE.start_main_~list~0.offset 4))) (let ((.cse8 (select (let ((.cse10 (let ((.cse13 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~list~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~list~0.base) .cse9 |v_ULTIMATE.start_main_#t~malloc2.base_10|)))) (store .cse13 |v_ULTIMATE.start_main_#t~malloc2.base_10| (store (select .cse13 |v_ULTIMATE.start_main_#t~malloc2.base_10|) 0 0))))) (let ((.cse11 (select (select .cse10 c_ULTIMATE.start_main_~list~0.base) .cse9))) (store .cse10 .cse11 (store (select .cse10 .cse11) (+ (select (select (let ((.cse12 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~list~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~list~0.base) .cse9 0)))) (store .cse12 |v_ULTIMATE.start_main_#t~malloc2.base_10| (store (select .cse12 |v_ULTIMATE.start_main_#t~malloc2.base_10|) 0 0))) c_ULTIMATE.start_main_~list~0.base) .cse9) 4) 0)))) c_ULTIMATE.start_main_~list~0.base))) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc2.base_10|))) (not (= 0 (select .cse8 .cse9))) (= 0 |v_ULTIMATE.start_main_#t~malloc2.base_10|) (= (select .cse8 c_ULTIMATE.start_main_~list~0.offset) 0))))) (= (select (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~list~0.base) .cse7 0) c_ULTIMATE.start_main_~list~0.offset) 0))) is different from false [2019-12-07 12:35:24,903 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:35:24,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [575938695] [2019-12-07 12:35:24,919 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2019-12-07 12:35:24,919 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 12:35:24,923 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 12:35:24,927 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 12:35:24,927 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 12:35:25,009 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:35:25,146 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:35:25,352 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 12:35:25,674 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-12-07 12:35:26,033 WARN L192 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 78 [2019-12-07 12:35:26,329 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-12-07 12:35:26,581 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-12-07 12:35:26,861 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 12:35:26,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 12:35:26,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 8] total 14 [2019-12-07 12:35:26,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883247043] [2019-12-07 12:35:26,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 12:35:26,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:35:26,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 12:35:26,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=490, Unknown=1, NotChecked=46, Total=650 [2019-12-07 12:35:26,862 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 15 states. [2019-12-07 12:35:27,245 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 67 [2019-12-07 12:35:27,410 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 69 [2019-12-07 12:35:27,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:35:27,790 INFO L93 Difference]: Finished difference Result 155 states and 169 transitions. [2019-12-07 12:35:27,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 12:35:27,790 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2019-12-07 12:35:27,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:35:27,791 INFO L225 Difference]: With dead ends: 155 [2019-12-07 12:35:27,791 INFO L226 Difference]: Without dead ends: 117 [2019-12-07 12:35:27,792 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 48 SyntacticMatches, 7 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=184, Invalid=749, Unknown=1, NotChecked=58, Total=992 [2019-12-07 12:35:27,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-12-07 12:35:27,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 89. [2019-12-07 12:35:27,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-12-07 12:35:27,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 100 transitions. [2019-12-07 12:35:27,796 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 100 transitions. Word has length 25 [2019-12-07 12:35:27,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:35:27,797 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 100 transitions. [2019-12-07 12:35:27,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 12:35:27,797 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 100 transitions. [2019-12-07 12:35:27,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 12:35:27,797 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:35:27,797 INFO L410 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, 1, 1, 1] [2019-12-07 12:35:27,998 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:35:27,998 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:35:27,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:35:27,999 INFO L82 PathProgramCache]: Analyzing trace with hash 280418270, now seen corresponding path program 1 times [2019-12-07 12:35:27,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:35:27,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572566764] [2019-12-07 12:35:27,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:35:28,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:35:28,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:35:28,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572566764] [2019-12-07 12:35:28,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:35:28,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 12:35:28,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330699121] [2019-12-07 12:35:28,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 12:35:28,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:35:28,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 12:35:28,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:35:28,120 INFO L87 Difference]: Start difference. First operand 89 states and 100 transitions. Second operand 8 states. [2019-12-07 12:35:28,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:35:28,307 INFO L93 Difference]: Finished difference Result 185 states and 204 transitions. [2019-12-07 12:35:28,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 12:35:28,307 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2019-12-07 12:35:28,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:35:28,308 INFO L225 Difference]: With dead ends: 185 [2019-12-07 12:35:28,308 INFO L226 Difference]: Without dead ends: 169 [2019-12-07 12:35:28,309 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-07 12:35:28,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-12-07 12:35:28,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 111. [2019-12-07 12:35:28,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-12-07 12:35:28,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 129 transitions. [2019-12-07 12:35:28,314 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 129 transitions. Word has length 26 [2019-12-07 12:35:28,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:35:28,314 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 129 transitions. [2019-12-07 12:35:28,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 12:35:28,314 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 129 transitions. [2019-12-07 12:35:28,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 12:35:28,315 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:35:28,315 INFO L410 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, 1, 1, 1, 1] [2019-12-07 12:35:28,315 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:35:28,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:35:28,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1094098602, now seen corresponding path program 1 times [2019-12-07 12:35:28,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:35:28,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346592688] [2019-12-07 12:35:28,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:35:28,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:35:28,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:35:28,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346592688] [2019-12-07 12:35:28,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405589275] [2019-12-07 12:35:28,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7611e1ca-44cc-426b-90ce-379cd718ede7/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:35:28,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:35:28,376 INFO L264 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 12:35:28,377 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:35:28,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:35:28,382 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:35:28,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:35:28,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1105174189] [2019-12-07 12:35:28,387 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2019-12-07 12:35:28,387 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 12:35:28,387 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 12:35:28,387 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 12:35:28,387 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 12:35:28,444 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:35:28,567 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:35:28,713 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 12:35:28,958 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-12-07 12:35:29,296 WARN L192 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 78 [2019-12-07 12:35:29,533 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-12-07 12:35:29,753 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-12-07 12:35:29,922 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 12:35:29,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 12:35:29,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2019-12-07 12:35:29,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65156569] [2019-12-07 12:35:29,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:35:29,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:35:29,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:35:29,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2019-12-07 12:35:29,924 INFO L87 Difference]: Start difference. First operand 111 states and 129 transitions. Second operand 5 states. [2019-12-07 12:35:29,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:35:29,944 INFO L93 Difference]: Finished difference Result 194 states and 225 transitions. [2019-12-07 12:35:29,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:35:29,944 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-07 12:35:29,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:35:29,945 INFO L225 Difference]: With dead ends: 194 [2019-12-07 12:35:29,945 INFO L226 Difference]: Without dead ends: 192 [2019-12-07 12:35:29,945 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 62 SyntacticMatches, 7 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2019-12-07 12:35:29,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-12-07 12:35:29,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 135. [2019-12-07 12:35:29,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-12-07 12:35:29,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 160 transitions. [2019-12-07 12:35:29,953 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 160 transitions. Word has length 27 [2019-12-07 12:35:29,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:35:29,953 INFO L462 AbstractCegarLoop]: Abstraction has 135 states and 160 transitions. [2019-12-07 12:35:29,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:35:29,953 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 160 transitions. [2019-12-07 12:35:29,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 12:35:29,954 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:35:29,954 INFO L410 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, 1, 1, 1, 1, 1] [2019-12-07 12:35:30,155 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:35:30,155 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:35:30,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:35:30,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1260086573, now seen corresponding path program 1 times [2019-12-07 12:35:30,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:35:30,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759189863] [2019-12-07 12:35:30,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:35:30,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:35:30,238 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:35:30,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759189863] [2019-12-07 12:35:30,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312872873] [2019-12-07 12:35:30,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7611e1ca-44cc-426b-90ce-379cd718ede7/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:35:30,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:35:30,273 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 21 conjunts are in the unsatisfiable core [2019-12-07 12:35:30,275 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:35:30,297 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:35:30,297 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:35:30,325 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-12-07 12:35:30,336 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:35:30,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [382979135] [2019-12-07 12:35:30,337 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2019-12-07 12:35:30,337 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 12:35:30,338 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 12:35:30,338 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 12:35:30,338 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 12:35:30,435 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:35:30,491 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:35:30,677 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 12:35:30,937 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-12-07 12:35:31,273 WARN L192 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 78 [2019-12-07 12:35:31,526 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-12-07 12:35:31,766 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-12-07 12:35:32,264 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 12:35:32,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 12:35:32,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2019-12-07 12:35:32,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341680018] [2019-12-07 12:35:32,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 12:35:32,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:35:32,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 12:35:32,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2019-12-07 12:35:32,266 INFO L87 Difference]: Start difference. First operand 135 states and 160 transitions. Second operand 8 states. [2019-12-07 12:35:32,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:35:32,475 INFO L93 Difference]: Finished difference Result 268 states and 311 transitions. [2019-12-07 12:35:32,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 12:35:32,475 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-12-07 12:35:32,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:35:32,477 INFO L225 Difference]: With dead ends: 268 [2019-12-07 12:35:32,477 INFO L226 Difference]: Without dead ends: 242 [2019-12-07 12:35:32,477 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 67 SyntacticMatches, 7 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2019-12-07 12:35:32,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-12-07 12:35:32,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 169. [2019-12-07 12:35:32,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-12-07 12:35:32,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 202 transitions. [2019-12-07 12:35:32,487 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 202 transitions. Word has length 29 [2019-12-07 12:35:32,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:35:32,487 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 202 transitions. [2019-12-07 12:35:32,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 12:35:32,488 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 202 transitions. [2019-12-07 12:35:32,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 12:35:32,488 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:35:32,488 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:35:32,689 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:35:32,689 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:35:32,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:35:32,690 INFO L82 PathProgramCache]: Analyzing trace with hash 216651175, now seen corresponding path program 1 times [2019-12-07 12:35:32,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:35:32,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221140062] [2019-12-07 12:35:32,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:35:32,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:35:32,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:35:32,757 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 12:35:32,757 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 12:35:32,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:35:32 BoogieIcfgContainer [2019-12-07 12:35:32,787 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 12:35:32,788 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 12:35:32,788 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 12:35:32,788 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 12:35:32,788 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:35:03" (3/4) ... [2019-12-07 12:35:32,789 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 12:35:32,821 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_7611e1ca-44cc-426b-90ce-379cd718ede7/bin/utaipan/witness.graphml [2019-12-07 12:35:32,821 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 12:35:32,822 INFO L168 Benchmark]: Toolchain (without parser) took 29809.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 210.2 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -163.1 MB). Peak memory consumption was 47.1 MB. Max. memory is 11.5 GB. [2019-12-07 12:35:32,822 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:35:32,822 INFO L168 Benchmark]: CACSL2BoogieTranslator took 342.87 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 89.7 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -134.4 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-12-07 12:35:32,823 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.77 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 12:35:32,823 INFO L168 Benchmark]: Boogie Preprocessor took 25.25 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:35:32,823 INFO L168 Benchmark]: RCFGBuilder took 403.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 56.0 MB). Peak memory consumption was 56.0 MB. Max. memory is 11.5 GB. [2019-12-07 12:35:32,823 INFO L168 Benchmark]: TraceAbstraction took 28966.72 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 120.6 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -99.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2019-12-07 12:35:32,824 INFO L168 Benchmark]: Witness Printer took 33.53 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: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-12-07 12:35:32,825 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 342.87 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 89.7 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -134.4 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.77 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.25 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 403.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 56.0 MB). Peak memory consumption was 56.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 28966.72 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 120.6 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -99.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * Witness Printer took 33.53 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: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1025]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L991] SLL* list = malloc(sizeof(SLL)); [L992] list->next = ((void*)0) [L993] COND FALSE !(!(list != ((void*)0))) [L993] COND FALSE !(__VERIFIER_nondet_int()) [L993] list->inner = malloc(sizeof(SLL)) [L993] EXPR list->inner [L993] list->inner->next = ((void*)0) [L993] EXPR list->inner [L993] list->inner->inner = ((void*)0) [L993] EXPR list->inner [L993] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) [L993] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L995] SLL* end = list; [L998] COND FALSE !(__VERIFIER_nondet_int()) [L1008] end = ((void*)0) [L1009] end = list [L1012] COND FALSE !(!(((void*)0) != end)) [L1014] COND TRUE ((void*)0) != end [L1016] int len = 0; [L1017] EXPR end->inner [L1017] SLL* inner = end->inner; [L1018] COND TRUE ((void*)0) != inner [L1020] COND TRUE len == 0 [L1021] len = 1 [L1024] COND FALSE !(!(((void*)0) != inner)) [L1025] EXPR inner->inner [L1025] COND FALSE !(!(((void*)0) == inner->inner)) [L1026] EXPR inner->next [L1026] COND FALSE !(!(((void*)0) == inner->next)) [L1027] EXPR inner->inner [L1027] inner = inner->inner [L1028] COND TRUE len == 1 [L1029] EXPR inner->inner [L1029] inner = inner->inner [L1018] COND TRUE ((void*)0) != inner [L1020] COND FALSE !(len == 0) [L1023] len = 2 [L1024] COND FALSE !(!(((void*)0) != inner)) [L1025] EXPR inner->inner [L1025] COND TRUE !(((void*)0) == inner->inner) [L1025] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 74 locations, 13 error locations. Result: UNSAFE, OverallTime: 28.9s, OverallIterations: 15, TraceHistogramMax: 2, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 836 SDtfs, 1626 SDslu, 1649 SDs, 0 SdLazy, 879 SolverSat, 146 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 342 GetRequests, 196 SyntacticMatches, 22 SemanticMatches, 124 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 10.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=169occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 460 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 19.5s InterpolantComputationTime, 371 NumberOfCodeBlocks, 371 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 402 ConstructedInterpolants, 1 QuantifiedInterpolants, 130314 SizeOfPredicates, 38 NumberOfNonLiveVariables, 267 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 20 InterpolantComputations, 11 PerfectInterpolantSequences, 8/20 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...