./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 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_8f484ec2-fba2-4c40-9be9-45a7a1928bb4/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8f484ec2-fba2-4c40-9be9-45a7a1928bb4/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8f484ec2-fba2-4c40-9be9-45a7a1928bb4/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8f484ec2-fba2-4c40-9be9-45a7a1928bb4/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/forester-heap/sll-01-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_8f484ec2-fba2-4c40-9be9-45a7a1928bb4/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8f484ec2-fba2-4c40-9be9-45a7a1928bb4/bin/uautomizer --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 Automizer --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.24-678e011 [2019-11-19 22:17:38,710 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 22:17:38,712 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 22:17:38,722 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 22:17:38,722 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 22:17:38,723 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 22:17:38,724 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 22:17:38,726 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 22:17:38,728 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 22:17:38,728 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 22:17:38,729 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 22:17:38,730 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 22:17:38,731 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 22:17:38,732 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 22:17:38,732 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 22:17:38,734 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 22:17:38,734 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 22:17:38,735 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 22:17:38,737 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 22:17:38,739 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 22:17:38,740 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 22:17:38,741 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 22:17:38,742 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 22:17:38,743 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 22:17:38,745 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 22:17:38,746 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 22:17:38,746 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 22:17:38,747 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 22:17:38,747 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 22:17:38,748 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 22:17:38,748 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 22:17:38,749 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 22:17:38,749 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 22:17:38,750 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 22:17:38,751 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 22:17:38,751 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 22:17:38,751 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 22:17:38,752 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 22:17:38,752 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 22:17:38,754 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 22:17:38,755 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 22:17:38,755 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8f484ec2-fba2-4c40-9be9-45a7a1928bb4/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 22:17:38,767 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 22:17:38,768 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 22:17:38,769 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 22:17:38,769 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 22:17:38,769 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 22:17:38,769 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 22:17:38,769 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 22:17:38,769 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 22:17:38,774 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 22:17:38,774 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 22:17:38,775 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 22:17:38,775 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 22:17:38,775 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 22:17:38,775 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 22:17:38,775 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 22:17:38,776 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 22:17:38,776 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 22:17:38,776 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 22:17:38,776 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 22:17:38,776 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 22:17:38,777 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 22:17:38,777 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 22:17:38,777 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 22:17:38,777 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 22:17:38,778 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 22:17:38,778 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 22:17:38,778 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 22:17:38,778 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 22:17:38,778 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_8f484ec2-fba2-4c40-9be9-45a7a1928bb4/bin/uautomizer 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 -> Automizer 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-11-19 22:17:38,930 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 22:17:38,940 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 22:17:38,943 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 22:17:38,944 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 22:17:38,944 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 22:17:38,945 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8f484ec2-fba2-4c40-9be9-45a7a1928bb4/bin/uautomizer/../../sv-benchmarks/c/forester-heap/sll-01-2.i [2019-11-19 22:17:38,992 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8f484ec2-fba2-4c40-9be9-45a7a1928bb4/bin/uautomizer/data/65218dda5/59a0318fb9294092b10a9c407d6bde7b/FLAG02cb3986a [2019-11-19 22:17:39,451 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 22:17:39,452 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8f484ec2-fba2-4c40-9be9-45a7a1928bb4/sv-benchmarks/c/forester-heap/sll-01-2.i [2019-11-19 22:17:39,470 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8f484ec2-fba2-4c40-9be9-45a7a1928bb4/bin/uautomizer/data/65218dda5/59a0318fb9294092b10a9c407d6bde7b/FLAG02cb3986a [2019-11-19 22:17:39,480 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8f484ec2-fba2-4c40-9be9-45a7a1928bb4/bin/uautomizer/data/65218dda5/59a0318fb9294092b10a9c407d6bde7b [2019-11-19 22:17:39,482 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 22:17:39,483 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 22:17:39,485 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 22:17:39,485 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 22:17:39,488 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 22:17:39,488 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:17:39" (1/1) ... [2019-11-19 22:17:39,491 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18f97bab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:17:39, skipping insertion in model container [2019-11-19 22:17:39,491 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:17:39" (1/1) ... [2019-11-19 22:17:39,497 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 22:17:39,541 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 22:17:39,860 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:17:39,866 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 22:17:39,907 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:17:39,952 INFO L192 MainTranslator]: Completed translation [2019-11-19 22:17:39,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:17:39 WrapperNode [2019-11-19 22:17:39,952 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 22:17:39,953 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 22:17:39,953 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 22:17:39,953 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 22:17:39,961 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:17:39" (1/1) ... [2019-11-19 22:17:39,975 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:17:39" (1/1) ... [2019-11-19 22:17:40,000 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 22:17:40,001 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 22:17:40,001 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 22:17:40,001 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 22:17:40,010 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:17:39" (1/1) ... [2019-11-19 22:17:40,011 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:17:39" (1/1) ... [2019-11-19 22:17:40,015 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:17:39" (1/1) ... [2019-11-19 22:17:40,015 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:17:39" (1/1) ... [2019-11-19 22:17:40,024 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:17:39" (1/1) ... [2019-11-19 22:17:40,031 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:17:39" (1/1) ... [2019-11-19 22:17:40,033 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:17:39" (1/1) ... [2019-11-19 22:17:40,037 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 22:17:40,037 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 22:17:40,037 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 22:17:40,037 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 22:17:40,038 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:17:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8f484ec2-fba2-4c40-9be9-45a7a1928bb4/bin/uautomizer/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-11-19 22:17:40,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-19 22:17:40,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-19 22:17:40,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-19 22:17:40,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-19 22:17:40,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 22:17:40,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 22:17:40,631 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 22:17:40,631 INFO L285 CfgBuilder]: Removed 34 assume(true) statements. [2019-11-19 22:17:40,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:17:40 BoogieIcfgContainer [2019-11-19 22:17:40,632 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 22:17:40,633 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 22:17:40,634 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 22:17:40,636 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 22:17:40,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:17:39" (1/3) ... [2019-11-19 22:17:40,637 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@383f665b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:17:40, skipping insertion in model container [2019-11-19 22:17:40,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:17:39" (2/3) ... [2019-11-19 22:17:40,638 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@383f665b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:17:40, skipping insertion in model container [2019-11-19 22:17:40,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:17:40" (3/3) ... [2019-11-19 22:17:40,641 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-01-2.i [2019-11-19 22:17:40,650 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 22:17:40,663 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2019-11-19 22:17:40,671 INFO L249 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2019-11-19 22:17:40,700 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 22:17:40,700 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 22:17:40,700 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 22:17:40,700 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 22:17:40,700 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 22:17:40,701 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 22:17:40,701 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 22:17:40,701 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 22:17:40,725 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2019-11-19 22:17:40,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-11-19 22:17:40,731 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:17:40,732 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-11-19 22:17:40,732 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-11-19 22:17:40,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:17:40,736 INFO L82 PathProgramCache]: Analyzing trace with hash 925700, now seen corresponding path program 1 times [2019-11-19 22:17:40,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:17:40,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541055344] [2019-11-19 22:17:40,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:17:40,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:17:40,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:17:40,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541055344] [2019-11-19 22:17:40,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:17:40,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:17:40,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181399304] [2019-11-19 22:17:40,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:17:40,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:17:40,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:17:40,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:17:40,882 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 3 states. [2019-11-19 22:17:41,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:17:41,021 INFO L93 Difference]: Finished difference Result 182 states and 300 transitions. [2019-11-19 22:17:41,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:17:41,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-11-19 22:17:41,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:17:41,032 INFO L225 Difference]: With dead ends: 182 [2019-11-19 22:17:41,033 INFO L226 Difference]: Without dead ends: 96 [2019-11-19 22:17:41,036 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-11-19 22:17:41,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-19 22:17:41,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 78. [2019-11-19 22:17:41,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-19 22:17:41,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2019-11-19 22:17:41,088 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 4 [2019-11-19 22:17:41,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:17:41,088 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2019-11-19 22:17:41,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:17:41,089 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2019-11-19 22:17:41,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-19 22:17:41,089 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:17:41,089 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:17:41,096 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-11-19 22:17:41,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:17:41,097 INFO L82 PathProgramCache]: Analyzing trace with hash 261454926, now seen corresponding path program 1 times [2019-11-19 22:17:41,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:17:41,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842341839] [2019-11-19 22:17:41,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:17:41,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:17:41,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:17:41,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842341839] [2019-11-19 22:17:41,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:17:41,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:17:41,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194763017] [2019-11-19 22:17:41,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:17:41,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:17:41,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:17:41,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:17:41,152 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand 3 states. [2019-11-19 22:17:41,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:17:41,173 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2019-11-19 22:17:41,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:17:41,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-19 22:17:41,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:17:41,175 INFO L225 Difference]: With dead ends: 81 [2019-11-19 22:17:41,175 INFO L226 Difference]: Without dead ends: 79 [2019-11-19 22:17:41,176 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-11-19 22:17:41,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-11-19 22:17:41,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-11-19 22:17:41,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-19 22:17:41,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2019-11-19 22:17:41,186 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 10 [2019-11-19 22:17:41,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:17:41,186 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2019-11-19 22:17:41,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:17:41,187 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2019-11-19 22:17:41,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-19 22:17:41,187 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:17:41,187 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:17:41,188 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-11-19 22:17:41,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:17:41,188 INFO L82 PathProgramCache]: Analyzing trace with hash 261456848, now seen corresponding path program 1 times [2019-11-19 22:17:41,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:17:41,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090473246] [2019-11-19 22:17:41,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:17:41,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:17:41,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:17:41,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090473246] [2019-11-19 22:17:41,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:17:41,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 22:17:41,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018996434] [2019-11-19 22:17:41,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 22:17:41,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:17:41,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 22:17:41,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 22:17:41,256 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand 4 states. [2019-11-19 22:17:41,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:17:41,361 INFO L93 Difference]: Finished difference Result 80 states and 90 transitions. [2019-11-19 22:17:41,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 22:17:41,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-19 22:17:41,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:17:41,363 INFO L225 Difference]: With dead ends: 80 [2019-11-19 22:17:41,363 INFO L226 Difference]: Without dead ends: 78 [2019-11-19 22:17:41,364 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 22:17:41,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-19 22:17:41,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2019-11-19 22:17:41,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-19 22:17:41,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2019-11-19 22:17:41,372 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 10 [2019-11-19 22:17:41,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:17:41,373 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2019-11-19 22:17:41,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 22:17:41,373 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2019-11-19 22:17:41,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-19 22:17:41,373 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:17:41,374 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:17:41,374 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-11-19 22:17:41,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:17:41,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1712619113, now seen corresponding path program 1 times [2019-11-19 22:17:41,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:17:41,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647081765] [2019-11-19 22:17:41,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:17:41,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:17:41,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:17:41,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647081765] [2019-11-19 22:17:41,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:17:41,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:17:41,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630931123] [2019-11-19 22:17:41,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:17:41,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:17:41,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:17:41,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:17:41,419 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand 3 states. [2019-11-19 22:17:41,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:17:41,477 INFO L93 Difference]: Finished difference Result 79 states and 90 transitions. [2019-11-19 22:17:41,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:17:41,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-19 22:17:41,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:17:41,479 INFO L225 Difference]: With dead ends: 79 [2019-11-19 22:17:41,479 INFO L226 Difference]: Without dead ends: 75 [2019-11-19 22:17:41,480 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-11-19 22:17:41,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-19 22:17:41,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2019-11-19 22:17:41,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-19 22:17:41,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2019-11-19 22:17:41,487 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 15 [2019-11-19 22:17:41,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:17:41,487 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2019-11-19 22:17:41,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:17:41,487 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2019-11-19 22:17:41,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-19 22:17:41,488 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:17:41,488 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:17:41,488 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-11-19 22:17:41,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:17:41,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1551589151, now seen corresponding path program 1 times [2019-11-19 22:17:41,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:17:41,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802098083] [2019-11-19 22:17:41,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:17:41,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:17:41,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:17:41,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802098083] [2019-11-19 22:17:41,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:17:41,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 22:17:41,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913673752] [2019-11-19 22:17:41,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 22:17:41,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:17:41,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 22:17:41,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 22:17:41,549 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand 4 states. [2019-11-19 22:17:41,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:17:41,694 INFO L93 Difference]: Finished difference Result 190 states and 215 transitions. [2019-11-19 22:17:41,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 22:17:41,694 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-19 22:17:41,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:17:41,696 INFO L225 Difference]: With dead ends: 190 [2019-11-19 22:17:41,696 INFO L226 Difference]: Without dead ends: 126 [2019-11-19 22:17:41,697 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 22:17:41,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-11-19 22:17:41,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 74. [2019-11-19 22:17:41,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-19 22:17:41,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2019-11-19 22:17:41,704 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 16 [2019-11-19 22:17:41,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:17:41,705 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2019-11-19 22:17:41,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 22:17:41,705 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2019-11-19 22:17:41,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-19 22:17:41,706 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:17:41,706 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:17:41,707 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-11-19 22:17:41,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:17:41,707 INFO L82 PathProgramCache]: Analyzing trace with hash -2063319775, now seen corresponding path program 1 times [2019-11-19 22:17:41,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:17:41,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748446389] [2019-11-19 22:17:41,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:17:41,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:17:41,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:17:41,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748446389] [2019-11-19 22:17:41,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:17:41,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 22:17:41,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902618586] [2019-11-19 22:17:41,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 22:17:41,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:17:41,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 22:17:41,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 22:17:41,793 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand 5 states. [2019-11-19 22:17:41,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:17:41,899 INFO L93 Difference]: Finished difference Result 134 states and 150 transitions. [2019-11-19 22:17:41,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 22:17:41,899 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-19 22:17:41,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:17:41,900 INFO L225 Difference]: With dead ends: 134 [2019-11-19 22:17:41,900 INFO L226 Difference]: Without dead ends: 114 [2019-11-19 22:17:41,901 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-11-19 22:17:41,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-19 22:17:41,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 73. [2019-11-19 22:17:41,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-19 22:17:41,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2019-11-19 22:17:41,908 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 16 [2019-11-19 22:17:41,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:17:41,908 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2019-11-19 22:17:41,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 22:17:41,908 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2019-11-19 22:17:41,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-19 22:17:41,909 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:17:41,909 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-11-19 22:17:41,910 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-11-19 22:17:41,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:17:41,910 INFO L82 PathProgramCache]: Analyzing trace with hash -940628020, now seen corresponding path program 1 times [2019-11-19 22:17:41,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:17:41,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006137377] [2019-11-19 22:17:41,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:17:41,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:17:41,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:17:41,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006137377] [2019-11-19 22:17:41,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:17:41,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:17:41,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166311700] [2019-11-19 22:17:41,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:17:41,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:17:41,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:17:41,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:17:41,943 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand 3 states. [2019-11-19 22:17:41,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:17:41,963 INFO L93 Difference]: Finished difference Result 139 states and 159 transitions. [2019-11-19 22:17:41,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:17:41,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-19 22:17:41,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:17:41,965 INFO L225 Difference]: With dead ends: 139 [2019-11-19 22:17:41,965 INFO L226 Difference]: Without dead ends: 97 [2019-11-19 22:17:41,966 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-11-19 22:17:41,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-11-19 22:17:41,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 76. [2019-11-19 22:17:41,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-19 22:17:41,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2019-11-19 22:17:41,971 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 20 [2019-11-19 22:17:41,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:17:41,972 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2019-11-19 22:17:41,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:17:41,972 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2019-11-19 22:17:41,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-19 22:17:41,973 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:17:41,973 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] [2019-11-19 22:17:41,973 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-11-19 22:17:41,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:17:41,973 INFO L82 PathProgramCache]: Analyzing trace with hash 905291998, now seen corresponding path program 1 times [2019-11-19 22:17:41,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:17:41,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609198302] [2019-11-19 22:17:41,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:17:41,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:17:42,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:17:42,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609198302] [2019-11-19 22:17:42,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:17:42,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:17:42,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11072053] [2019-11-19 22:17:42,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:17:42,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:17:42,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:17:42,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:17:42,007 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand 3 states. [2019-11-19 22:17:42,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:17:42,027 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2019-11-19 22:17:42,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:17:42,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-19 22:17:42,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:17:42,028 INFO L225 Difference]: With dead ends: 76 [2019-11-19 22:17:42,028 INFO L226 Difference]: Without dead ends: 74 [2019-11-19 22:17:42,029 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-11-19 22:17:42,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-19 22:17:42,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-19 22:17:42,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-19 22:17:42,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2019-11-19 22:17:42,034 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 21 [2019-11-19 22:17:42,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:17:42,034 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2019-11-19 22:17:42,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:17:42,034 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2019-11-19 22:17:42,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-19 22:17:42,035 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:17:42,035 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-11-19 22:17:42,036 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-11-19 22:17:42,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:17:42,036 INFO L82 PathProgramCache]: Analyzing trace with hash 886650935, now seen corresponding path program 1 times [2019-11-19 22:17:42,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:17:42,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9759629] [2019-11-19 22:17:42,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:17:42,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:17:42,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:17:42,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9759629] [2019-11-19 22:17:42,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:17:42,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 22:17:42,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679033492] [2019-11-19 22:17:42,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 22:17:42,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:17:42,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 22:17:42,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 22:17:42,114 INFO L87 Difference]: Start difference. First operand 74 states and 85 transitions. Second operand 4 states. [2019-11-19 22:17:42,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:17:42,196 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2019-11-19 22:17:42,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 22:17:42,196 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-11-19 22:17:42,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:17:42,197 INFO L225 Difference]: With dead ends: 75 [2019-11-19 22:17:42,197 INFO L226 Difference]: Without dead ends: 73 [2019-11-19 22:17:42,198 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 22:17:42,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-19 22:17:42,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2019-11-19 22:17:42,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-19 22:17:42,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 83 transitions. [2019-11-19 22:17:42,203 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 83 transitions. Word has length 23 [2019-11-19 22:17:42,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:17:42,203 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 83 transitions. [2019-11-19 22:17:42,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 22:17:42,203 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2019-11-19 22:17:42,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-19 22:17:42,204 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:17:42,204 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] [2019-11-19 22:17:42,205 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-11-19 22:17:42,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:17:42,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1458355201, now seen corresponding path program 1 times [2019-11-19 22:17:42,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:17:42,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143293144] [2019-11-19 22:17:42,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:17:42,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:17:42,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:17:42,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143293144] [2019-11-19 22:17:42,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:17:42,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-19 22:17:42,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820878113] [2019-11-19 22:17:42,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 22:17:42,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:17:42,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 22:17:42,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-19 22:17:42,334 INFO L87 Difference]: Start difference. First operand 72 states and 83 transitions. Second operand 6 states. [2019-11-19 22:17:42,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:17:42,575 INFO L93 Difference]: Finished difference Result 178 states and 205 transitions. [2019-11-19 22:17:42,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 22:17:42,576 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-11-19 22:17:42,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:17:42,577 INFO L225 Difference]: With dead ends: 178 [2019-11-19 22:17:42,578 INFO L226 Difference]: Without dead ends: 135 [2019-11-19 22:17:42,578 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-11-19 22:17:42,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-19 22:17:42,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 82. [2019-11-19 22:17:42,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-19 22:17:42,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 94 transitions. [2019-11-19 22:17:42,587 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 94 transitions. Word has length 24 [2019-11-19 22:17:42,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:17:42,588 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 94 transitions. [2019-11-19 22:17:42,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 22:17:42,588 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 94 transitions. [2019-11-19 22:17:42,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-19 22:17:42,589 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:17:42,589 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] [2019-11-19 22:17:42,590 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-11-19 22:17:42,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:17:42,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1357759361, now seen corresponding path program 1 times [2019-11-19 22:17:42,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:17:42,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78312786] [2019-11-19 22:17:42,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:17:42,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:17:42,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:17:42,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78312786] [2019-11-19 22:17:42,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:17:42,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-19 22:17:42,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821669761] [2019-11-19 22:17:42,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 22:17:42,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:17:42,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 22:17:42,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-19 22:17:42,931 INFO L87 Difference]: Start difference. First operand 82 states and 94 transitions. Second operand 8 states. [2019-11-19 22:17:43,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:17:43,646 INFO L93 Difference]: Finished difference Result 190 states and 217 transitions. [2019-11-19 22:17:43,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-19 22:17:43,647 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-11-19 22:17:43,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:17:43,649 INFO L225 Difference]: With dead ends: 190 [2019-11-19 22:17:43,649 INFO L226 Difference]: Without dead ends: 188 [2019-11-19 22:17:43,650 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2019-11-19 22:17:43,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-11-19 22:17:43,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 102. [2019-11-19 22:17:43,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-19 22:17:43,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 120 transitions. [2019-11-19 22:17:43,666 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 120 transitions. Word has length 24 [2019-11-19 22:17:43,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:17:43,667 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 120 transitions. [2019-11-19 22:17:43,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 22:17:43,667 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 120 transitions. [2019-11-19 22:17:43,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-19 22:17:43,671 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:17:43,671 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-11-19 22:17:43,671 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-11-19 22:17:43,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:17:43,672 INFO L82 PathProgramCache]: Analyzing trace with hash -545310703, now seen corresponding path program 1 times [2019-11-19 22:17:43,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:17:43,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334336103] [2019-11-19 22:17:43,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:17:43,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:17:43,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-19 22:17:43,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334336103] [2019-11-19 22:17:43,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:17:43,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 22:17:43,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199424434] [2019-11-19 22:17:43,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 22:17:43,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:17:43,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 22:17:43,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-19 22:17:43,742 INFO L87 Difference]: Start difference. First operand 102 states and 120 transitions. Second operand 5 states. [2019-11-19 22:17:43,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:17:43,877 INFO L93 Difference]: Finished difference Result 149 states and 174 transitions. [2019-11-19 22:17:43,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 22:17:43,878 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-19 22:17:43,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:17:43,878 INFO L225 Difference]: With dead ends: 149 [2019-11-19 22:17:43,878 INFO L226 Difference]: Without dead ends: 131 [2019-11-19 22:17:43,879 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-19 22:17:43,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-19 22:17:43,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 123. [2019-11-19 22:17:43,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-11-19 22:17:43,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 149 transitions. [2019-11-19 22:17:43,886 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 149 transitions. Word has length 26 [2019-11-19 22:17:43,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:17:43,887 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 149 transitions. [2019-11-19 22:17:43,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 22:17:43,887 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 149 transitions. [2019-11-19 22:17:43,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-19 22:17:43,888 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:17:43,888 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-11-19 22:17:43,888 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-11-19 22:17:43,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:17:43,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1566334865, now seen corresponding path program 1 times [2019-11-19 22:17:43,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:17:43,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898385405] [2019-11-19 22:17:43,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:17:43,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:17:43,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-19 22:17:43,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898385405] [2019-11-19 22:17:43,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:17:43,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:17:43,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990258637] [2019-11-19 22:17:43,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:17:43,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:17:43,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:17:43,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:17:43,914 INFO L87 Difference]: Start difference. First operand 123 states and 149 transitions. Second operand 3 states. [2019-11-19 22:17:43,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:17:43,959 INFO L93 Difference]: Finished difference Result 123 states and 149 transitions. [2019-11-19 22:17:43,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:17:43,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-19 22:17:43,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:17:43,960 INFO L225 Difference]: With dead ends: 123 [2019-11-19 22:17:43,960 INFO L226 Difference]: Without dead ends: 121 [2019-11-19 22:17:43,961 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-11-19 22:17:43,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-11-19 22:17:43,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-11-19 22:17:43,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-19 22:17:43,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 147 transitions. [2019-11-19 22:17:43,967 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 147 transitions. Word has length 26 [2019-11-19 22:17:43,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:17:43,968 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 147 transitions. [2019-11-19 22:17:43,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:17:43,968 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 147 transitions. [2019-11-19 22:17:43,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-19 22:17:43,975 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:17:43,975 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-11-19 22:17:43,975 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-11-19 22:17:43,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:17:43,975 INFO L82 PathProgramCache]: Analyzing trace with hash -988757936, now seen corresponding path program 1 times [2019-11-19 22:17:43,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:17:43,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754394282] [2019-11-19 22:17:43,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:17:43,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:17:44,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:17:44,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754394282] [2019-11-19 22:17:44,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:17:44,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-19 22:17:44,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961019859] [2019-11-19 22:17:44,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 22:17:44,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:17:44,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 22:17:44,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-19 22:17:44,179 INFO L87 Difference]: Start difference. First operand 121 states and 147 transitions. Second operand 8 states. [2019-11-19 22:17:44,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:17:44,713 INFO L93 Difference]: Finished difference Result 285 states and 334 transitions. [2019-11-19 22:17:44,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-19 22:17:44,713 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-11-19 22:17:44,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:17:44,715 INFO L225 Difference]: With dead ends: 285 [2019-11-19 22:17:44,715 INFO L226 Difference]: Without dead ends: 283 [2019-11-19 22:17:44,716 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-11-19 22:17:44,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-11-19 22:17:44,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 128. [2019-11-19 22:17:44,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-11-19 22:17:44,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 154 transitions. [2019-11-19 22:17:44,726 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 154 transitions. Word has length 27 [2019-11-19 22:17:44,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:17:44,726 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 154 transitions. [2019-11-19 22:17:44,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 22:17:44,726 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 154 transitions. [2019-11-19 22:17:44,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-19 22:17:44,727 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:17:44,727 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-11-19 22:17:44,727 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-11-19 22:17:44,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:17:44,727 INFO L82 PathProgramCache]: Analyzing trace with hash 2026653164, now seen corresponding path program 1 times [2019-11-19 22:17:44,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:17:44,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498175334] [2019-11-19 22:17:44,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:17:44,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:17:44,780 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:17:44,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498175334] [2019-11-19 22:17:44,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721397161] [2019-11-19 22:17:44,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8f484ec2-fba2-4c40-9be9-45a7a1928bb4/bin/uautomizer/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-11-19 22:17:44,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:17:44,849 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-19 22:17:44,854 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:17:44,911 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-11-19 22:17:44,912 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:17:44,920 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:17:44,923 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-11-19 22:17:44,923 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:17:44,935 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:17:44,935 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:17:44,936 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2019-11-19 22:17:44,973 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:17:44,975 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-11-19 22:17:44,976 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:17:44,991 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:17:44,995 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:17:44,996 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-11-19 22:17:44,997 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:17:45,007 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:17:45,007 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:17:45,008 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2019-11-19 22:17:45,074 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-11-19 22:17:45,074 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:17:45,117 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:17:45,123 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:17:45,124 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-11-19 22:17:45,124 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:17:45,129 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:17:45,129 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:17:45,129 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:7 [2019-11-19 22:17:45,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:17:45,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:17:45,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2019-11-19 22:17:45,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517853287] [2019-11-19 22:17:45,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 22:17:45,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:17:45,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 22:17:45,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-19 22:17:45,137 INFO L87 Difference]: Start difference. First operand 128 states and 154 transitions. Second operand 8 states. [2019-11-19 22:17:45,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:17:45,465 INFO L93 Difference]: Finished difference Result 232 states and 272 transitions. [2019-11-19 22:17:45,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-19 22:17:45,466 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-11-19 22:17:45,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:17:45,467 INFO L225 Difference]: With dead ends: 232 [2019-11-19 22:17:45,467 INFO L226 Difference]: Without dead ends: 170 [2019-11-19 22:17:45,468 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-19 22:17:45,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-11-19 22:17:45,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 130. [2019-11-19 22:17:45,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-19 22:17:45,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 154 transitions. [2019-11-19 22:17:45,475 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 154 transitions. Word has length 29 [2019-11-19 22:17:45,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:17:45,476 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 154 transitions. [2019-11-19 22:17:45,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 22:17:45,476 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 154 transitions. [2019-11-19 22:17:45,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-19 22:17:45,476 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:17:45,477 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, 1, 1] [2019-11-19 22:17:45,687 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:17:45,688 INFO L410 AbstractCegarLoop]: === Iteration 16 === [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-11-19 22:17:45,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:17:45,688 INFO L82 PathProgramCache]: Analyzing trace with hash -2133518130, now seen corresponding path program 1 times [2019-11-19 22:17:45,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:17:45,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304141346] [2019-11-19 22:17:45,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:17:45,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:17:45,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:17:45,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304141346] [2019-11-19 22:17:45,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346933581] [2019-11-19 22:17:45,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8f484ec2-fba2-4c40-9be9-45a7a1928bb4/bin/uautomizer/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-11-19 22:17:45,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:17:45,930 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-19 22:17:45,933 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:17:46,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:17:46,041 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2019-11-19 22:17:46,042 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:17:46,047 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-19 22:17:46,047 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:17:46,062 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:17:46,068 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2019-11-19 22:17:46,068 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 22:17:46,075 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-11-19 22:17:46,075 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-19 22:17:46,080 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:17:46,080 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-19 22:17:46,081 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:47, output treesize:9 [2019-11-19 22:17:46,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:17:46,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 22:17:46,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2019-11-19 22:17:46,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67995325] [2019-11-19 22:17:46,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 22:17:46,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:17:46,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 22:17:46,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-19 22:17:46,103 INFO L87 Difference]: Start difference. First operand 130 states and 154 transitions. Second operand 7 states. [2019-11-19 22:17:46,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:17:46,441 INFO L93 Difference]: Finished difference Result 193 states and 218 transitions. [2019-11-19 22:17:46,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 22:17:46,442 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2019-11-19 22:17:46,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:17:46,443 INFO L225 Difference]: With dead ends: 193 [2019-11-19 22:17:46,443 INFO L226 Difference]: Without dead ends: 173 [2019-11-19 22:17:46,443 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-11-19 22:17:46,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-11-19 22:17:46,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 129. [2019-11-19 22:17:46,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-11-19 22:17:46,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 152 transitions. [2019-11-19 22:17:46,455 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 152 transitions. Word has length 29 [2019-11-19 22:17:46,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:17:46,456 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 152 transitions. [2019-11-19 22:17:46,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 22:17:46,456 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 152 transitions. [2019-11-19 22:17:46,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-19 22:17:46,457 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:17:46,457 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, 1, 1, 1] [2019-11-19 22:17:46,670 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:17:46,672 INFO L410 AbstractCegarLoop]: === Iteration 17 === [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-11-19 22:17:46,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:17:46,672 INFO L82 PathProgramCache]: Analyzing trace with hash 830518973, now seen corresponding path program 1 times [2019-11-19 22:17:46,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:17:46,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645027775] [2019-11-19 22:17:46,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:17:46,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:17:46,760 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:17:46,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645027775] [2019-11-19 22:17:46,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822507840] [2019-11-19 22:17:46,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8f484ec2-fba2-4c40-9be9-45a7a1928bb4/bin/uautomizer/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-11-19 22:17:46,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:17:46,820 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-19 22:17:46,824 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:17:46,835 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 13 treesize of output 9 [2019-11-19 22:17:46,836 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:17:46,841 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:17:46,841 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:17:46,841 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-19 22:17:46,930 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|], 2=[|#memory_$Pointer$.offset|]} [2019-11-19 22:17:46,935 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-19 22:17:46,936 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:17:46,948 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:17:46,952 INFO L343 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-11-19 22:17:46,952 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 10 [2019-11-19 22:17:46,952 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:17:46,957 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:17:46,957 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:17:46,957 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:7 [2019-11-19 22:17:46,963 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:17:46,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:17:46,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 10 [2019-11-19 22:17:46,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997806405] [2019-11-19 22:17:46,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-19 22:17:46,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:17:46,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 22:17:46,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-19 22:17:46,968 INFO L87 Difference]: Start difference. First operand 129 states and 152 transitions. Second operand 10 states. [2019-11-19 22:17:47,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:17:47,276 INFO L93 Difference]: Finished difference Result 233 states and 265 transitions. [2019-11-19 22:17:47,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-19 22:17:47,276 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2019-11-19 22:17:47,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:17:47,277 INFO L225 Difference]: With dead ends: 233 [2019-11-19 22:17:47,277 INFO L226 Difference]: Without dead ends: 202 [2019-11-19 22:17:47,278 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-11-19 22:17:47,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-11-19 22:17:47,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 146. [2019-11-19 22:17:47,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-19 22:17:47,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 177 transitions. [2019-11-19 22:17:47,286 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 177 transitions. Word has length 32 [2019-11-19 22:17:47,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:17:47,286 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 177 transitions. [2019-11-19 22:17:47,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-19 22:17:47,286 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 177 transitions. [2019-11-19 22:17:47,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-19 22:17:47,287 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:17:47,287 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, 1, 1, 1, 1, 1] [2019-11-19 22:17:47,491 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:17:47,491 INFO L410 AbstractCegarLoop]: === Iteration 18 === [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-11-19 22:17:47,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:17:47,491 INFO L82 PathProgramCache]: Analyzing trace with hash -60835504, now seen corresponding path program 1 times [2019-11-19 22:17:47,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:17:47,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923971150] [2019-11-19 22:17:47,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:17:47,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:17:47,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:17:47,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923971150] [2019-11-19 22:17:47,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:17:47,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:17:47,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361416695] [2019-11-19 22:17:47,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:17:47,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:17:47,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:17:47,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:17:47,529 INFO L87 Difference]: Start difference. First operand 146 states and 177 transitions. Second operand 3 states. [2019-11-19 22:17:47,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:17:47,551 INFO L93 Difference]: Finished difference Result 308 states and 380 transitions. [2019-11-19 22:17:47,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:17:47,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-19 22:17:47,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:17:47,553 INFO L225 Difference]: With dead ends: 308 [2019-11-19 22:17:47,553 INFO L226 Difference]: Without dead ends: 214 [2019-11-19 22:17:47,554 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-11-19 22:17:47,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-11-19 22:17:47,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 171. [2019-11-19 22:17:47,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-11-19 22:17:47,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 207 transitions. [2019-11-19 22:17:47,562 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 207 transitions. Word has length 32 [2019-11-19 22:17:47,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:17:47,563 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 207 transitions. [2019-11-19 22:17:47,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:17:47,563 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 207 transitions. [2019-11-19 22:17:47,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-19 22:17:47,563 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:17:47,564 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:17:47,564 INFO L410 AbstractCegarLoop]: === Iteration 19 === [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-11-19 22:17:47,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:17:47,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1562646056, now seen corresponding path program 1 times [2019-11-19 22:17:47,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:17:47,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309559772] [2019-11-19 22:17:47,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:17:47,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:17:47,804 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:17:47,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309559772] [2019-11-19 22:17:47,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554448319] [2019-11-19 22:17:47,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8f484ec2-fba2-4c40-9be9-45a7a1928bb4/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:17:47,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:17:47,868 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-19 22:17:47,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:17:47,878 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-19 22:17:47,879 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:17:47,884 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:17:47,884 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:17:47,884 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-19 22:17:47,896 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 13 treesize of output 9 [2019-11-19 22:17:47,896 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:17:47,907 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:17:47,911 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 13 treesize of output 9 [2019-11-19 22:17:47,912 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:17:47,921 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:17:47,922 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:17:47,922 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2019-11-19 22:17:47,979 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:17:47,979 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-11-19 22:17:47,980 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:17:48,010 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:17:48,026 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:17:48,029 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 0 case distinctions, treesize of input 37 treesize of output 27 [2019-11-19 22:17:48,030 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:17:48,054 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:17:48,062 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:17:48,066 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 0 case distinctions, treesize of input 37 treesize of output 27 [2019-11-19 22:17:48,066 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 22:17:48,092 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:17:48,093 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:17:48,093 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:86, output treesize:47 [2019-11-19 22:17:48,126 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_37|], 12=[|v_#memory_$Pointer$.base_36|]} [2019-11-19 22:17:48,131 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:17:48,131 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2019-11-19 22:17:48,132 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:17:48,147 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:17:48,150 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:17:48,217 INFO L343 Elim1Store]: treesize reduction 46, result has 65.2 percent of original size [2019-11-19 22:17:48,217 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 74 treesize of output 124 [2019-11-19 22:17:48,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:17:48,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:17:48,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:17:48,222 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-19 22:17:48,310 INFO L567 ElimStorePlain]: treesize reduction 272, result has 22.5 percent of original size [2019-11-19 22:17:48,311 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:17:48,311 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:94, output treesize:78 [2019-11-19 22:17:48,421 INFO L392 ElimStorePlain]: Different costs {6=[|#memory_$Pointer$.offset|], 10=[|#memory_$Pointer$.base|]} [2019-11-19 22:17:48,425 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:17:48,426 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 13 [2019-11-19 22:17:48,426 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:17:48,442 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:17:48,505 INFO L343 Elim1Store]: treesize reduction 10, result has 84.1 percent of original size [2019-11-19 22:17:48,506 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 72 [2019-11-19 22:17:48,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:17:48,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:17:48,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:17:48,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:17:48,509 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:17:48,514 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:17:48,515 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:17:48,515 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:85, output treesize:7 [2019-11-19 22:17:48,532 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:17:48,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:17:48,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2019-11-19 22:17:48,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288705048] [2019-11-19 22:17:48,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-19 22:17:48,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:17:48,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-19 22:17:48,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-11-19 22:17:48,534 INFO L87 Difference]: Start difference. First operand 171 states and 207 transitions. Second operand 13 states. [2019-11-19 22:17:49,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:17:49,449 INFO L93 Difference]: Finished difference Result 479 states and 569 transitions. [2019-11-19 22:17:49,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-19 22:17:49,449 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2019-11-19 22:17:49,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:17:49,451 INFO L225 Difference]: With dead ends: 479 [2019-11-19 22:17:49,451 INFO L226 Difference]: Without dead ends: 387 [2019-11-19 22:17:49,452 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=207, Invalid=605, Unknown=0, NotChecked=0, Total=812 [2019-11-19 22:17:49,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-11-19 22:17:49,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 205. [2019-11-19 22:17:49,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-11-19 22:17:49,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 247 transitions. [2019-11-19 22:17:49,465 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 247 transitions. Word has length 36 [2019-11-19 22:17:49,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:17:49,465 INFO L462 AbstractCegarLoop]: Abstraction has 205 states and 247 transitions. [2019-11-19 22:17:49,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-19 22:17:49,465 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 247 transitions. [2019-11-19 22:17:49,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-19 22:17:49,466 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:17:49,466 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, 1, 1, 1, 1, 1, 1] [2019-11-19 22:17:49,668 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:17:49,669 INFO L410 AbstractCegarLoop]: === Iteration 20 === [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-11-19 22:17:49,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:17:49,669 INFO L82 PathProgramCache]: Analyzing trace with hash -648373053, now seen corresponding path program 1 times [2019-11-19 22:17:49,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:17:49,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522688359] [2019-11-19 22:17:49,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:17:49,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:17:49,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:17:49,719 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:17:49,720 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-19 22:17:49,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 10:17:49 BoogieIcfgContainer [2019-11-19 22:17:49,769 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 22:17:49,770 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 22:17:49,770 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 22:17:49,770 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 22:17:49,774 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:17:40" (3/4) ... [2019-11-19 22:17:49,776 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-19 22:17:49,819 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_8f484ec2-fba2-4c40-9be9-45a7a1928bb4/bin/uautomizer/witness.graphml [2019-11-19 22:17:49,819 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 22:17:49,820 INFO L168 Benchmark]: Toolchain (without parser) took 10336.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 194.5 MB). Free memory was 946.1 MB in the beginning and 948.0 MB in the end (delta: -1.9 MB). Peak memory consumption was 192.6 MB. Max. memory is 11.5 GB. [2019-11-19 22:17:49,820 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:17:49,821 INFO L168 Benchmark]: CACSL2BoogieTranslator took 467.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -184.6 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-11-19 22:17:49,821 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-19 22:17:49,822 INFO L168 Benchmark]: Boogie Preprocessor took 36.10 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-11-19 22:17:49,822 INFO L168 Benchmark]: RCFGBuilder took 595.44 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: 39.8 MB). Peak memory consumption was 39.8 MB. Max. memory is 11.5 GB. [2019-11-19 22:17:49,822 INFO L168 Benchmark]: TraceAbstraction took 9135.81 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 47.7 MB). Free memory was 1.1 GB in the beginning and 956.1 MB in the end (delta: 128.1 MB). Peak memory consumption was 175.8 MB. Max. memory is 11.5 GB. [2019-11-19 22:17:49,823 INFO L168 Benchmark]: Witness Printer took 49.39 ms. Allocated memory is still 1.2 GB. Free memory was 956.1 MB in the beginning and 948.0 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2019-11-19 22:17:49,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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 467.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -184.6 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 47.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.10 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 595.44 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: 39.8 MB). Peak memory consumption was 39.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9135.81 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 47.7 MB). Free memory was 1.1 GB in the beginning and 956.1 MB in the end (delta: 128.1 MB). Peak memory consumption was 175.8 MB. Max. memory is 11.5 GB. * Witness Printer took 49.39 ms. Allocated memory is still 1.2 GB. Free memory was 956.1 MB in the beginning and 948.0 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 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, 84 locations, 13 error locations. Result: UNSAFE, OverallTime: 9.0s, OverallIterations: 20, TraceHistogramMax: 2, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1413 SDtfs, 2534 SDslu, 2750 SDs, 0 SdLazy, 1602 SolverSat, 242 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 269 GetRequests, 149 SyntacticMatches, 1 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=205occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 805 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 582 NumberOfCodeBlocks, 582 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 523 ConstructedInterpolants, 10 QuantifiedInterpolants, 187056 SizeOfPredicates, 41 NumberOfNonLiveVariables, 412 ConjunctsInSsa, 91 ConjunctsInUnsatCore, 23 InterpolantComputations, 16 PerfectInterpolantSequences, 8/19 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...