./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/recursive/Primes.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ef146031-8795-4494-a6bd-b1707457bdf0/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ef146031-8795-4494-a6bd-b1707457bdf0/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ef146031-8795-4494-a6bd-b1707457bdf0/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ef146031-8795-4494-a6bd-b1707457bdf0/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive/Primes.c -s /tmp/vcloud-vcloud-master/worker/run_dir_ef146031-8795-4494-a6bd-b1707457bdf0/bin/utaipan/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ef146031-8795-4494-a6bd-b1707457bdf0/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 82151ec4435da78821025b3100fe51201edc8f02 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/run_dir_ef146031-8795-4494-a6bd-b1707457bdf0/bin/utaipan/config using search string *Overflow*32bit*_Bitvector*.epf No suitable settings file found using Overflow*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: IllegalArgumentException: Recursive programs are not supported. --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-26 02:26:14,749 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:26:14,751 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:26:14,761 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:26:14,762 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:26:14,763 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:26:14,764 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:26:14,766 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:26:14,768 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:26:14,768 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:26:14,769 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:26:14,770 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:26:14,771 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:26:14,772 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:26:14,773 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:26:14,774 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:26:14,774 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:26:14,775 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:26:14,777 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:26:14,779 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:26:14,780 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:26:14,781 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:26:14,783 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:26:14,783 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:26:14,786 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:26:14,786 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:26:14,786 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:26:14,787 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:26:14,788 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:26:14,788 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:26:14,789 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:26:14,789 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:26:14,790 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:26:14,791 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:26:14,792 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:26:14,792 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:26:14,793 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:26:14,793 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:26:14,793 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:26:14,794 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:26:14,794 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:26:14,795 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ef146031-8795-4494-a6bd-b1707457bdf0/bin/utaipan/config/svcomp-Overflow-32bit-Taipan_Default.epf [2019-11-26 02:26:14,808 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:26:14,808 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:26:14,809 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:26:14,809 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:26:14,809 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:26:14,810 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:26:14,810 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 02:26:14,810 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:26:14,810 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:26:14,811 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 02:26:14,811 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 02:26:14,811 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:26:14,811 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 02:26:14,811 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 02:26:14,812 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 02:26:14,812 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:26:14,812 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:26:14,813 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-26 02:26:14,813 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:26:14,813 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:26:14,813 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:26:14,813 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:26:14,814 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:26:14,814 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:26:14,814 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-26 02:26:14,814 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:26:14,814 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:26:14,815 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:26:14,815 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:26:14,815 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:26:14,815 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:26:14,816 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:26:14,816 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:26:14,816 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:26:14,816 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:26:14,816 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 02:26:14,817 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 02:26:14,817 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:26:14,817 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:26:14,817 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_ef146031-8795-4494-a6bd-b1707457bdf0/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 82151ec4435da78821025b3100fe51201edc8f02 [2019-11-26 02:26:14,946 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:26:14,956 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:26:14,959 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:26:14,960 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:26:14,960 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:26:14,961 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ef146031-8795-4494-a6bd-b1707457bdf0/bin/utaipan/../../sv-benchmarks/c/recursive/Primes.c [2019-11-26 02:26:15,016 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ef146031-8795-4494-a6bd-b1707457bdf0/bin/utaipan/data/c583d311f/b6b4a11e041f464d8b199b1912f619e2/FLAG034f58e47 [2019-11-26 02:26:15,419 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:26:15,419 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ef146031-8795-4494-a6bd-b1707457bdf0/sv-benchmarks/c/recursive/Primes.c [2019-11-26 02:26:15,425 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ef146031-8795-4494-a6bd-b1707457bdf0/bin/utaipan/data/c583d311f/b6b4a11e041f464d8b199b1912f619e2/FLAG034f58e47 [2019-11-26 02:26:15,798 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ef146031-8795-4494-a6bd-b1707457bdf0/bin/utaipan/data/c583d311f/b6b4a11e041f464d8b199b1912f619e2 [2019-11-26 02:26:15,801 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:26:15,801 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:26:15,802 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:26:15,802 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:26:15,806 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:26:15,806 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:26:15" (1/1) ... [2019-11-26 02:26:15,809 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3495567d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:26:15, skipping insertion in model container [2019-11-26 02:26:15,809 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:26:15" (1/1) ... [2019-11-26 02:26:15,816 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:26:15,832 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:26:15,982 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:26:16,072 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:26:16,115 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:26:16,127 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:26:16,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:26:16 WrapperNode [2019-11-26 02:26:16,128 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:26:16,128 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:26:16,128 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:26:16,128 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:26:16,136 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:26:16" (1/1) ... [2019-11-26 02:26:16,141 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:26:16" (1/1) ... [2019-11-26 02:26:16,158 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:26:16,159 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:26:16,159 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:26:16,159 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:26:16,165 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:26:16" (1/1) ... [2019-11-26 02:26:16,165 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:26:16" (1/1) ... [2019-11-26 02:26:16,167 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:26:16" (1/1) ... [2019-11-26 02:26:16,167 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:26:16" (1/1) ... [2019-11-26 02:26:16,170 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:26:16" (1/1) ... [2019-11-26 02:26:16,173 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:26:16" (1/1) ... [2019-11-26 02:26:16,174 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:26:16" (1/1) ... [2019-11-26 02:26:16,176 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:26:16,176 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:26:16,176 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:26:16,177 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:26:16,177 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:26:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ef146031-8795-4494-a6bd-b1707457bdf0/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:26:16,232 INFO L130 BoogieDeclarations]: Found specification of procedure multiple_of [2019-11-26 02:26:16,233 INFO L138 BoogieDeclarations]: Found implementation of procedure multiple_of [2019-11-26 02:26:16,233 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2019-11-26 02:26:16,233 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2019-11-26 02:26:16,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:26:16,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:26:16,234 INFO L130 BoogieDeclarations]: Found specification of procedure is_prime_ [2019-11-26 02:26:16,234 INFO L138 BoogieDeclarations]: Found implementation of procedure is_prime_ [2019-11-26 02:26:16,601 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:26:16,601 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-26 02:26:16,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:26:16 BoogieIcfgContainer [2019-11-26 02:26:16,602 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:26:16,603 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:26:16,603 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:26:16,606 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:26:16,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:26:15" (1/3) ... [2019-11-26 02:26:16,607 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a4236c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:26:16, skipping insertion in model container [2019-11-26 02:26:16,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:26:16" (2/3) ... [2019-11-26 02:26:16,607 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a4236c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:26:16, skipping insertion in model container [2019-11-26 02:26:16,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:26:16" (3/3) ... [2019-11-26 02:26:16,609 INFO L109 eAbstractionObserver]: Analyzing ICFG Primes.c [2019-11-26 02:26:16,615 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:26:16,620 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-11-26 02:26:16,627 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-11-26 02:26:16,647 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:26:16,648 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:26:16,648 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:26:16,648 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:26:16,648 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:26:16,648 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:26:16,648 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:26:16,649 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:26:16,668 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states. [2019-11-26 02:26:16,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-11-26 02:26:16,671 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:26:16,671 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-11-26 02:26:16,672 INFO L410 AbstractCegarLoop]: === Iteration 1 === [multiple_ofErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, is_prime_Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, is_prime_Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-26 02:26:16,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:26:16,677 INFO L82 PathProgramCache]: Analyzing trace with hash 96483, now seen corresponding path program 1 times [2019-11-26 02:26:16,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:26:16,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892125223] [2019-11-26 02:26:16,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:26:16,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:26:16,781 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-26 02:26:16,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892125223] [2019-11-26 02:26:16,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:26:16,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:26:16,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049167297] [2019-11-26 02:26:16,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:26:16,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:26:16,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:26:16,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:26:16,797 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 3 states. [2019-11-26 02:26:16,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:26:16,853 INFO L93 Difference]: Finished difference Result 81 states and 101 transitions. [2019-11-26 02:26:16,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:26:16,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-11-26 02:26:16,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:26:16,863 INFO L225 Difference]: With dead ends: 81 [2019-11-26 02:26:16,863 INFO L226 Difference]: Without dead ends: 74 [2019-11-26 02:26:16,866 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:26:16,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-26 02:26:16,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-26 02:26:16,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-26 02:26:16,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2019-11-26 02:26:16,905 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 3 [2019-11-26 02:26:16,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:26:16,905 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 91 transitions. [2019-11-26 02:26:16,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:26:16,905 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2019-11-26 02:26:16,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-11-26 02:26:16,906 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:26:16,906 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-11-26 02:26:16,907 INFO L410 AbstractCegarLoop]: === Iteration 2 === [multiple_ofErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, is_prime_Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, is_prime_Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-26 02:26:16,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:26:16,907 INFO L82 PathProgramCache]: Analyzing trace with hash 2991079, now seen corresponding path program 1 times [2019-11-26 02:26:16,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:26:16,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696715054] [2019-11-26 02:26:16,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:26:16,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:26:16,934 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-26 02:26:16,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696715054] [2019-11-26 02:26:16,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:26:16,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:26:16,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979809737] [2019-11-26 02:26:16,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:26:16,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:26:16,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:26:16,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:26:16,938 INFO L87 Difference]: Start difference. First operand 74 states and 91 transitions. Second operand 3 states. [2019-11-26 02:26:16,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:26:16,953 INFO L93 Difference]: Finished difference Result 74 states and 91 transitions. [2019-11-26 02:26:16,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:26:16,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-11-26 02:26:16,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:26:16,956 INFO L225 Difference]: With dead ends: 74 [2019-11-26 02:26:16,956 INFO L226 Difference]: Without dead ends: 73 [2019-11-26 02:26:16,957 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:26:16,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-26 02:26:16,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-11-26 02:26:16,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-26 02:26:16,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 90 transitions. [2019-11-26 02:26:16,970 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 90 transitions. Word has length 4 [2019-11-26 02:26:16,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:26:16,971 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 90 transitions. [2019-11-26 02:26:16,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:26:16,971 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 90 transitions. [2019-11-26 02:26:16,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-26 02:26:16,972 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:26:16,972 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:26:16,973 INFO L410 AbstractCegarLoop]: === Iteration 3 === [multiple_ofErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, is_prime_Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, is_prime_Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-26 02:26:16,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:26:16,973 INFO L82 PathProgramCache]: Analyzing trace with hash 610163120, now seen corresponding path program 1 times [2019-11-26 02:26:16,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:26:16,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994071660] [2019-11-26 02:26:16,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:26:16,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:26:17,015 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-26 02:26:17,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994071660] [2019-11-26 02:26:17,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:26:17,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:26:17,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997569573] [2019-11-26 02:26:17,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:26:17,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:26:17,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:26:17,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:26:17,017 INFO L87 Difference]: Start difference. First operand 73 states and 90 transitions. Second operand 5 states. [2019-11-26 02:26:17,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:26:17,108 INFO L93 Difference]: Finished difference Result 136 states and 175 transitions. [2019-11-26 02:26:17,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:26:17,109 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-26 02:26:17,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:26:17,112 INFO L225 Difference]: With dead ends: 136 [2019-11-26 02:26:17,112 INFO L226 Difference]: Without dead ends: 68 [2019-11-26 02:26:17,114 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:26:17,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-26 02:26:17,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-11-26 02:26:17,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-26 02:26:17,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 80 transitions. [2019-11-26 02:26:17,127 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 80 transitions. Word has length 14 [2019-11-26 02:26:17,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:26:17,127 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 80 transitions. [2019-11-26 02:26:17,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:26:17,128 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 80 transitions. [2019-11-26 02:26:17,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-26 02:26:17,132 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:26:17,132 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:26:17,132 INFO L410 AbstractCegarLoop]: === Iteration 4 === [multiple_ofErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, is_prime_Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, is_prime_Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-26 02:26:17,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:26:17,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1735194556, now seen corresponding path program 1 times [2019-11-26 02:26:17,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:26:17,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942224395] [2019-11-26 02:26:17,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:26:17,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:26:17,217 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-26 02:26:17,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942224395] [2019-11-26 02:26:17,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:26:17,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 02:26:17,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166399660] [2019-11-26 02:26:17,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-26 02:26:17,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:26:17,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-26 02:26:17,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-26 02:26:17,219 INFO L87 Difference]: Start difference. First operand 66 states and 80 transitions. Second operand 7 states. [2019-11-26 02:26:17,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:26:17,432 INFO L93 Difference]: Finished difference Result 85 states and 102 transitions. [2019-11-26 02:26:17,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-26 02:26:17,433 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-11-26 02:26:17,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:26:17,434 INFO L225 Difference]: With dead ends: 85 [2019-11-26 02:26:17,434 INFO L226 Difference]: Without dead ends: 84 [2019-11-26 02:26:17,435 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-26 02:26:17,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-11-26 02:26:17,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2019-11-26 02:26:17,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-26 02:26:17,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 101 transitions. [2019-11-26 02:26:17,445 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 101 transitions. Word has length 15 [2019-11-26 02:26:17,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:26:17,445 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 101 transitions. [2019-11-26 02:26:17,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-26 02:26:17,446 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 101 transitions. [2019-11-26 02:26:17,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-26 02:26:17,446 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:26:17,446 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:26:17,447 INFO L410 AbstractCegarLoop]: === Iteration 5 === [multiple_ofErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, is_prime_Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, is_prime_Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-26 02:26:17,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:26:17,447 INFO L82 PathProgramCache]: Analyzing trace with hash -2043543565, now seen corresponding path program 1 times [2019-11-26 02:26:17,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:26:17,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742611642] [2019-11-26 02:26:17,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:26:17,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:26:17,481 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-26 02:26:17,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742611642] [2019-11-26 02:26:17,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:26:17,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:26:17,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988199866] [2019-11-26 02:26:17,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:26:17,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:26:17,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:26:17,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:26:17,483 INFO L87 Difference]: Start difference. First operand 81 states and 101 transitions. Second operand 3 states. [2019-11-26 02:26:17,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:26:17,507 INFO L93 Difference]: Finished difference Result 85 states and 108 transitions. [2019-11-26 02:26:17,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:26:17,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-26 02:26:17,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:26:17,509 INFO L225 Difference]: With dead ends: 85 [2019-11-26 02:26:17,509 INFO L226 Difference]: Without dead ends: 84 [2019-11-26 02:26:17,510 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:26:17,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-11-26 02:26:17,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 80. [2019-11-26 02:26:17,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-26 02:26:17,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 99 transitions. [2019-11-26 02:26:17,519 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 99 transitions. Word has length 16 [2019-11-26 02:26:17,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:26:17,520 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 99 transitions. [2019-11-26 02:26:17,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:26:17,520 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 99 transitions. [2019-11-26 02:26:17,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-26 02:26:17,521 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:26:17,521 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:26:17,521 INFO L410 AbstractCegarLoop]: === Iteration 6 === [multiple_ofErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, is_prime_Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, is_prime_Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-26 02:26:17,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:26:17,522 INFO L82 PathProgramCache]: Analyzing trace with hash 175666309, now seen corresponding path program 1 times [2019-11-26 02:26:17,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:26:17,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091076512] [2019-11-26 02:26:17,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:26:17,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:26:17,617 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-26 02:26:17,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091076512] [2019-11-26 02:26:17,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:26:17,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-26 02:26:17,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345161149] [2019-11-26 02:26:17,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-26 02:26:17,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:26:17,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-26 02:26:17,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-26 02:26:17,620 INFO L87 Difference]: Start difference. First operand 80 states and 99 transitions. Second operand 9 states. [2019-11-26 02:26:17,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:26:17,787 INFO L93 Difference]: Finished difference Result 124 states and 152 transitions. [2019-11-26 02:26:17,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-26 02:26:17,788 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2019-11-26 02:26:17,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:26:17,790 INFO L225 Difference]: With dead ends: 124 [2019-11-26 02:26:17,790 INFO L226 Difference]: Without dead ends: 100 [2019-11-26 02:26:17,791 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-26 02:26:17,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-26 02:26:17,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2019-11-26 02:26:17,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-26 02:26:17,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 120 transitions. [2019-11-26 02:26:17,807 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 120 transitions. Word has length 17 [2019-11-26 02:26:17,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:26:17,807 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 120 transitions. [2019-11-26 02:26:17,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-26 02:26:17,808 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 120 transitions. [2019-11-26 02:26:17,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-26 02:26:17,816 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:26:17,817 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:26:17,817 INFO L410 AbstractCegarLoop]: === Iteration 7 === [multiple_ofErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, is_prime_Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, is_prime_Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-26 02:26:17,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:26:17,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1074876512, now seen corresponding path program 1 times [2019-11-26 02:26:17,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:26:17,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372223222] [2019-11-26 02:26:17,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:26:17,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:26:17,882 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-26 02:26:17,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372223222] [2019-11-26 02:26:17,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:26:17,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:26:17,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116499070] [2019-11-26 02:26:17,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:26:17,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:26:17,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:26:17,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:26:17,884 INFO L87 Difference]: Start difference. First operand 97 states and 120 transitions. Second operand 6 states. [2019-11-26 02:26:18,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:26:18,049 INFO L93 Difference]: Finished difference Result 131 states and 163 transitions. [2019-11-26 02:26:18,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 02:26:18,050 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-11-26 02:26:18,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:26:18,052 INFO L225 Difference]: With dead ends: 131 [2019-11-26 02:26:18,052 INFO L226 Difference]: Without dead ends: 130 [2019-11-26 02:26:18,052 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:26:18,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-26 02:26:18,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2019-11-26 02:26:18,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-26 02:26:18,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 159 transitions. [2019-11-26 02:26:18,077 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 159 transitions. Word has length 17 [2019-11-26 02:26:18,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:26:18,077 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 159 transitions. [2019-11-26 02:26:18,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:26:18,078 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 159 transitions. [2019-11-26 02:26:18,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-26 02:26:18,079 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:26:18,079 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:26:18,079 INFO L410 AbstractCegarLoop]: === Iteration 8 === [multiple_ofErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, is_prime_Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, is_prime_Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-26 02:26:18,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:26:18,080 INFO L82 PathProgramCache]: Analyzing trace with hash 638182200, now seen corresponding path program 1 times [2019-11-26 02:26:18,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:26:18,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716492862] [2019-11-26 02:26:18,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:26:18,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:26:18,116 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-26 02:26:18,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716492862] [2019-11-26 02:26:18,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:26:18,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:26:18,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132987956] [2019-11-26 02:26:18,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:26:18,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:26:18,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:26:18,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:26:18,119 INFO L87 Difference]: Start difference. First operand 126 states and 159 transitions. Second operand 5 states. [2019-11-26 02:26:18,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:26:18,184 INFO L93 Difference]: Finished difference Result 165 states and 209 transitions. [2019-11-26 02:26:18,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:26:18,188 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-26 02:26:18,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:26:18,189 INFO L225 Difference]: With dead ends: 165 [2019-11-26 02:26:18,189 INFO L226 Difference]: Without dead ends: 141 [2019-11-26 02:26:18,190 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:26:18,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-11-26 02:26:18,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 119. [2019-11-26 02:26:18,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-11-26 02:26:18,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 152 transitions. [2019-11-26 02:26:18,202 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 152 transitions. Word has length 18 [2019-11-26 02:26:18,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:26:18,203 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 152 transitions. [2019-11-26 02:26:18,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:26:18,203 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 152 transitions. [2019-11-26 02:26:18,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-26 02:26:18,204 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:26:18,204 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:26:18,205 INFO L410 AbstractCegarLoop]: === Iteration 9 === [multiple_ofErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, is_prime_Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, is_prime_Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-26 02:26:18,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:26:18,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1038566434, now seen corresponding path program 1 times [2019-11-26 02:26:18,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:26:18,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024872263] [2019-11-26 02:26:18,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:26:18,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:26:18,271 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-26 02:26:18,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024872263] [2019-11-26 02:26:18,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:26:18,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:26:18,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55919425] [2019-11-26 02:26:18,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:26:18,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:26:18,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:26:18,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:26:18,274 INFO L87 Difference]: Start difference. First operand 119 states and 152 transitions. Second operand 6 states. [2019-11-26 02:26:18,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:26:18,424 INFO L93 Difference]: Finished difference Result 121 states and 152 transitions. [2019-11-26 02:26:18,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 02:26:18,425 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-11-26 02:26:18,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:26:18,426 INFO L225 Difference]: With dead ends: 121 [2019-11-26 02:26:18,426 INFO L226 Difference]: Without dead ends: 120 [2019-11-26 02:26:18,427 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:26:18,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-11-26 02:26:18,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2019-11-26 02:26:18,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-11-26 02:26:18,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 150 transitions. [2019-11-26 02:26:18,447 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 150 transitions. Word has length 18 [2019-11-26 02:26:18,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:26:18,448 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 150 transitions. [2019-11-26 02:26:18,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:26:18,449 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 150 transitions. [2019-11-26 02:26:18,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-26 02:26:18,451 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:26:18,451 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:26:18,451 INFO L410 AbstractCegarLoop]: === Iteration 10 === [multiple_ofErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, is_prime_Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, is_prime_Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-26 02:26:18,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:26:18,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1311818281, now seen corresponding path program 1 times [2019-11-26 02:26:18,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:26:18,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475655270] [2019-11-26 02:26:18,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:26:18,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:26:18,553 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-26 02:26:18,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475655270] [2019-11-26 02:26:18,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:26:18,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-26 02:26:18,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46167230] [2019-11-26 02:26:18,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-26 02:26:18,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:26:18,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-26 02:26:18,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-26 02:26:18,555 INFO L87 Difference]: Start difference. First operand 119 states and 150 transitions. Second operand 9 states. [2019-11-26 02:26:18,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:26:18,729 INFO L93 Difference]: Finished difference Result 161 states and 204 transitions. [2019-11-26 02:26:18,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-26 02:26:18,730 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2019-11-26 02:26:18,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:26:18,732 INFO L225 Difference]: With dead ends: 161 [2019-11-26 02:26:18,732 INFO L226 Difference]: Without dead ends: 159 [2019-11-26 02:26:18,732 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-26 02:26:18,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-26 02:26:18,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 148. [2019-11-26 02:26:18,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-11-26 02:26:18,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 188 transitions. [2019-11-26 02:26:18,746 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 188 transitions. Word has length 19 [2019-11-26 02:26:18,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:26:18,746 INFO L462 AbstractCegarLoop]: Abstraction has 148 states and 188 transitions. [2019-11-26 02:26:18,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-26 02:26:18,747 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 188 transitions. [2019-11-26 02:26:18,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-26 02:26:18,748 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:26:18,748 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-26 02:26:18,748 INFO L410 AbstractCegarLoop]: === Iteration 11 === [multiple_ofErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, is_prime_Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, is_prime_Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-26 02:26:18,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:26:18,749 INFO L82 PathProgramCache]: Analyzing trace with hash -887009252, now seen corresponding path program 1 times [2019-11-26 02:26:18,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:26:18,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910500796] [2019-11-26 02:26:18,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:26:18,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:26:18,799 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-26 02:26:18,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910500796] [2019-11-26 02:26:18,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:26:18,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:26:18,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95653532] [2019-11-26 02:26:18,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:26:18,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:26:18,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:26:18,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:26:18,800 INFO L87 Difference]: Start difference. First operand 148 states and 188 transitions. Second operand 5 states. [2019-11-26 02:26:18,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:26:18,873 INFO L93 Difference]: Finished difference Result 171 states and 218 transitions. [2019-11-26 02:26:18,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:26:18,873 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-11-26 02:26:18,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:26:18,875 INFO L225 Difference]: With dead ends: 171 [2019-11-26 02:26:18,875 INFO L226 Difference]: Without dead ends: 170 [2019-11-26 02:26:18,875 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:26:18,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-11-26 02:26:18,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 134. [2019-11-26 02:26:18,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-11-26 02:26:18,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 172 transitions. [2019-11-26 02:26:18,885 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 172 transitions. Word has length 20 [2019-11-26 02:26:18,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:26:18,885 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 172 transitions. [2019-11-26 02:26:18,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:26:18,885 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 172 transitions. [2019-11-26 02:26:18,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-26 02:26:18,886 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:26:18,886 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:26:18,887 INFO L410 AbstractCegarLoop]: === Iteration 12 === [multiple_ofErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, is_prime_Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, is_prime_Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-26 02:26:18,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:26:18,887 INFO L82 PathProgramCache]: Analyzing trace with hash 2086072772, now seen corresponding path program 1 times [2019-11-26 02:26:18,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:26:18,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575364954] [2019-11-26 02:26:18,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:26:18,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:26:18,985 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:26:18,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575364954] [2019-11-26 02:26:18,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588655980] [2019-11-26 02:26:18,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ef146031-8795-4494-a6bd-b1707457bdf0/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:26:19,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:26:19,030 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-26 02:26:19,035 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:26:19,102 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-26 02:26:19,103 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:26:19,157 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-26 02:26:19,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-26 02:26:19,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [9] total 16 [2019-11-26 02:26:19,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697946432] [2019-11-26 02:26:19,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-26 02:26:19,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:26:19,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-26 02:26:19,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2019-11-26 02:26:19,158 INFO L87 Difference]: Start difference. First operand 134 states and 172 transitions. Second operand 8 states. [2019-11-26 02:26:19,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:26:19,270 INFO L93 Difference]: Finished difference Result 247 states and 320 transitions. [2019-11-26 02:26:19,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:26:19,271 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-11-26 02:26:19,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:26:19,272 INFO L225 Difference]: With dead ends: 247 [2019-11-26 02:26:19,272 INFO L226 Difference]: Without dead ends: 133 [2019-11-26 02:26:19,274 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2019-11-26 02:26:19,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-11-26 02:26:19,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 126. [2019-11-26 02:26:19,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-26 02:26:19,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 158 transitions. [2019-11-26 02:26:19,284 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 158 transitions. Word has length 21 [2019-11-26 02:26:19,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:26:19,284 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 158 transitions. [2019-11-26 02:26:19,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-26 02:26:19,284 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 158 transitions. [2019-11-26 02:26:19,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-26 02:26:19,285 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:26:19,285 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:26:19,489 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:26:19,490 INFO L410 AbstractCegarLoop]: === Iteration 13 === [multiple_ofErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, is_prime_Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, is_prime_Err1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-26 02:26:19,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:26:19,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1804345275, now seen corresponding path program 1 times [2019-11-26 02:26:19,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:26:19,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38338842] [2019-11-26 02:26:19,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:26:19,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:26:19,590 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:26:19,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38338842] [2019-11-26 02:26:19,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128926363] [2019-11-26 02:26:19,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ef146031-8795-4494-a6bd-b1707457bdf0/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:26:19,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:26:19,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-26 02:26:19,630 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:26:19,781 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:26:19,782 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:26:19,979 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:26:19,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2088284787] [2019-11-26 02:26:19,997 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2019-11-26 02:26:19,998 INFO L166 IcfgInterpreter]: Building call graph [2019-11-26 02:26:20,003 FATAL L310 FreeRefinementEngine]: Exception during interpolant generation: IllegalArgumentException [2019-11-26 02:26:20,206 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:26:20,208 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-26 02:26:20,219 INFO L168 Benchmark]: Toolchain (without parser) took 4415.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 217.1 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -192.2 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2019-11-26 02:26:20,221 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:26:20,222 INFO L168 Benchmark]: CACSL2BoogieTranslator took 325.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -198.9 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:26:20,224 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.19 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.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-11-26 02:26:20,224 INFO L168 Benchmark]: Boogie Preprocessor took 17.50 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:26:20,226 INFO L168 Benchmark]: RCFGBuilder took 426.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.1 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. [2019-11-26 02:26:20,228 INFO L168 Benchmark]: TraceAbstraction took 3612.39 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -25.2 MB). Peak memory consumption was 39.8 MB. Max. memory is 11.5 GB. [2019-11-26 02:26:20,234 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 325.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -198.9 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.19 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.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.50 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 426.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.1 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3612.39 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -25.2 MB). Peak memory consumption was 39.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalArgumentException: Recursive programs are not supported. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: Recursive programs are not supported.: de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...