./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loops/sum03-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_4d36984d-1c73-4ea6-8357-14cc57c2c476/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_4d36984d-1c73-4ea6-8357-14cc57c2c476/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_4d36984d-1c73-4ea6-8357-14cc57c2c476/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_4d36984d-1c73-4ea6-8357-14cc57c2c476/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loops/sum03-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_4d36984d-1c73-4ea6-8357-14cc57c2c476/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_4d36984d-1c73-4ea6-8357-14cc57c2c476/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a5bec83c84f47b7653d49cdbe6bc7857a2bc0080 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 10:49:53,724 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:49:53,725 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:49:53,733 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:49:53,733 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:49:53,734 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:49:53,735 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:49:53,736 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:49:53,738 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:49:53,738 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:49:53,739 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:49:53,740 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:49:53,740 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:49:53,740 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:49:53,741 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:49:53,742 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:49:53,743 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:49:53,744 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:49:53,745 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:49:53,747 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:49:53,748 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:49:53,749 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:49:53,749 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:49:53,750 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:49:53,752 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:49:53,752 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:49:53,752 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:49:53,752 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:49:53,753 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:49:53,753 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:49:53,753 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:49:53,754 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:49:53,754 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:49:53,755 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:49:53,756 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:49:53,756 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:49:53,756 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:49:53,757 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:49:53,757 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:49:53,757 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:49:53,758 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:49:53,759 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_4d36984d-1c73-4ea6-8357-14cc57c2c476/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 10:49:53,770 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:49:53,771 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:49:53,771 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 10:49:53,772 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 10:49:53,772 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 10:49:53,772 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 10:49:53,772 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 10:49:53,772 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 10:49:53,772 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 10:49:53,773 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 10:49:53,773 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 10:49:53,773 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 10:49:53,773 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 10:49:53,773 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 10:49:53,774 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 10:49:53,774 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:49:53,774 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:49:53,775 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:49:53,775 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:49:53,775 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:49:53,775 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 10:49:53,775 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:49:53,775 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 10:49:53,776 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 10:49:53,776 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:49:53,776 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 10:49:53,776 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:49:53,776 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 10:49:53,776 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:49:53,777 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:49:53,777 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:49:53,777 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:49:53,777 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:49:53,777 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:49:53,777 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 10:49:53,778 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 10:49:53,778 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 10:49:53,778 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 10:49:53,778 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:49:53,778 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 10:49:53,778 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_4d36984d-1c73-4ea6-8357-14cc57c2c476/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a5bec83c84f47b7653d49cdbe6bc7857a2bc0080 [2019-12-07 10:49:53,892 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:49:53,900 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:49:53,902 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:49:53,903 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:49:53,903 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:49:53,904 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_4d36984d-1c73-4ea6-8357-14cc57c2c476/bin/utaipan/../../sv-benchmarks/c/loops/sum03-1.i [2019-12-07 10:49:53,939 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4d36984d-1c73-4ea6-8357-14cc57c2c476/bin/utaipan/data/441ca7d32/8807f07874474fc389e303009ad36284/FLAG7c508e9bd [2019-12-07 10:49:54,336 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:49:54,337 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_4d36984d-1c73-4ea6-8357-14cc57c2c476/sv-benchmarks/c/loops/sum03-1.i [2019-12-07 10:49:54,340 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4d36984d-1c73-4ea6-8357-14cc57c2c476/bin/utaipan/data/441ca7d32/8807f07874474fc389e303009ad36284/FLAG7c508e9bd [2019-12-07 10:49:54,349 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_4d36984d-1c73-4ea6-8357-14cc57c2c476/bin/utaipan/data/441ca7d32/8807f07874474fc389e303009ad36284 [2019-12-07 10:49:54,351 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:49:54,352 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:49:54,352 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:49:54,352 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:49:54,354 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:49:54,355 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:49:54" (1/1) ... [2019-12-07 10:49:54,357 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a8ebb28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:49:54, skipping insertion in model container [2019-12-07 10:49:54,357 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:49:54" (1/1) ... [2019-12-07 10:49:54,362 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:49:54,376 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:49:54,518 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:49:54,521 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:49:54,535 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:49:54,544 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:49:54,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:49:54 WrapperNode [2019-12-07 10:49:54,544 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:49:54,545 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:49:54,545 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:49:54,545 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:49:54,550 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:49:54" (1/1) ... [2019-12-07 10:49:54,553 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:49:54" (1/1) ... [2019-12-07 10:49:54,565 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:49:54,566 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:49:54,566 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:49:54,566 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:49:54,572 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:49:54" (1/1) ... [2019-12-07 10:49:54,572 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:49:54" (1/1) ... [2019-12-07 10:49:54,572 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:49:54" (1/1) ... [2019-12-07 10:49:54,573 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:49:54" (1/1) ... [2019-12-07 10:49:54,574 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:49:54" (1/1) ... [2019-12-07 10:49:54,577 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:49:54" (1/1) ... [2019-12-07 10:49:54,577 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:49:54" (1/1) ... [2019-12-07 10:49:54,578 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:49:54,578 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:49:54,578 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:49:54,578 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:49:54,579 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:49:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4d36984d-1c73-4ea6-8357-14cc57c2c476/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:49:54,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:49:54,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:49:54,742 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:49:54,742 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 10:49:54,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:49:54 BoogieIcfgContainer [2019-12-07 10:49:54,743 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:49:54,743 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:49:54,743 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:49:54,745 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:49:54,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:49:54" (1/3) ... [2019-12-07 10:49:54,746 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5704963c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:49:54, skipping insertion in model container [2019-12-07 10:49:54,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:49:54" (2/3) ... [2019-12-07 10:49:54,746 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5704963c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:49:54, skipping insertion in model container [2019-12-07 10:49:54,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:49:54" (3/3) ... [2019-12-07 10:49:54,747 INFO L109 eAbstractionObserver]: Analyzing ICFG sum03-1.i [2019-12-07 10:49:54,754 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:49:54,758 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 10:49:54,765 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 10:49:54,779 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:49:54,779 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 10:49:54,779 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:49:54,779 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:49:54,779 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:49:54,779 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:49:54,779 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:49:54,779 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:49:54,788 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-12-07 10:49:54,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 10:49:54,791 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:49:54,791 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 10:49:54,792 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:49:54,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:49:54,795 INFO L82 PathProgramCache]: Analyzing trace with hash 990472, now seen corresponding path program 1 times [2019-12-07 10:49:54,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:49:54,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370195489] [2019-12-07 10:49:54,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:49:54,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:49:54,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:49:54,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370195489] [2019-12-07 10:49:54,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:49:54,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:49:54,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443518274] [2019-12-07 10:49:54,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:49:54,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:49:54,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:49:54,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:49:54,995 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2019-12-07 10:49:55,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:49:55,028 INFO L93 Difference]: Finished difference Result 12 states and 17 transitions. [2019-12-07 10:49:55,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:49:55,029 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-12-07 10:49:55,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:49:55,035 INFO L225 Difference]: With dead ends: 12 [2019-12-07 10:49:55,035 INFO L226 Difference]: Without dead ends: 7 [2019-12-07 10:49:55,038 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:49:55,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-12-07 10:49:55,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-12-07 10:49:55,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-12-07 10:49:55,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-12-07 10:49:55,060 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2019-12-07 10:49:55,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:49:55,061 INFO L462 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-12-07 10:49:55,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:49:55,061 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-12-07 10:49:55,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 10:49:55,061 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:49:55,061 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-12-07 10:49:55,062 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:49:55,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:49:55,062 INFO L82 PathProgramCache]: Analyzing trace with hash 952008565, now seen corresponding path program 1 times [2019-12-07 10:49:55,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:49:55,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998061251] [2019-12-07 10:49:55,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:49:55,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:49:57,211 WARN L192 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 26 DAG size of output: 21 [2019-12-07 10:49:57,219 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:49:57,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998061251] [2019-12-07 10:49:57,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187872631] [2019-12-07 10:49:57,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4d36984d-1c73-4ea6-8357-14cc57c2c476/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:49:57,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:49:57,246 WARN L262 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 21 conjunts are in the unsatisfiable core [2019-12-07 10:49:57,251 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:49:57,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:49:57,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:49:57,376 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:49:57,376 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:49:57,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:49:59,535 WARN L192 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 25 [2019-12-07 10:49:59,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:49:59,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:49:59,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:49:59,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:49:59,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:50:01,820 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse14 (+ c_ULTIMATE.start_main_~sn~0 2)) (.cse15 (* c_ULTIMATE.start_main_~x~0 2))) (let ((.cse1 (mod (+ .cse15 4) 4294967296)) (.cse5 (= c_ULTIMATE.start_main_~sn~0 0)) (.cse2 (mod c_ULTIMATE.start_main_~sn~0 4294967296)) (.cse11 (mod c_ULTIMATE.start_main_~x~0 4294967296)) (.cse13 (mod (+ .cse15 2) 4294967296)) (.cse12 (mod .cse14 4294967296)) (.cse8 (= 0 .cse14))) (let ((.cse0 (mod (+ c_ULTIMATE.start_main_~x~0 1) 4294967296)) (.cse6 (and (not (= .cse13 .cse12)) (not .cse8))) (.cse9 (<= 10 .cse11)) (.cse3 (and (not .cse5) (not (= .cse13 .cse2)))) (.cse7 (= .cse12 .cse1)) (.cse4 (< .cse11 10))) (and (or (< .cse0 10) (and (or (= .cse1 .cse2) .cse3 .cse4 .cse5) (or .cse6 .cse7 .cse8 .cse9))) (or (<= 10 .cse0) (and (let ((.cse10 (+ c_ULTIMATE.start_main_~sn~0 4))) (or .cse6 (= 0 .cse10) (= (mod .cse10 4294967296) .cse1) .cse9)) (or .cse3 .cse7 .cse4 .cse8))))))) is different from true [2019-12-07 10:50:01,821 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2019-12-07 10:50:01,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1957763453] [2019-12-07 10:50:01,837 INFO L159 IcfgInterpreter]: Started Sifa with 5 locations of interest [2019-12-07 10:50:01,837 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 10:50:01,840 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 10:50:01,845 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 10:50:01,845 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 10:50:01,934 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 10:50:02,030 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 10:50:02,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 10:50:02,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 10 [2019-12-07 10:50:02,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981222425] [2019-12-07 10:50:02,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 10:50:02,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:50:02,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 10:50:02,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=115, Unknown=1, NotChecked=22, Total=182 [2019-12-07 10:50:02,033 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 11 states. [2019-12-07 10:50:04,107 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_ULTIMATE.start_main_~x~0 4294967296)) (.cse2 (mod (+ (* c_ULTIMATE.start_main_~x~0 2) 2) 4294967296))) (and (let ((.cse0 (+ c_ULTIMATE.start_main_~sn~0 2))) (or (= 0 .cse0) (<= 10 .cse1) (= .cse2 (mod .cse0 4294967296)))) (= 1 c_ULTIMATE.start___VERIFIER_assert_~cond) (or (< .cse1 10) (= c_ULTIMATE.start_main_~sn~0 0) (= .cse2 (mod c_ULTIMATE.start_main_~sn~0 4294967296))))) is different from false [2019-12-07 10:50:06,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:50:06,785 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2019-12-07 10:50:06,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 10:50:06,786 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-12-07 10:50:06,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:50:06,786 INFO L225 Difference]: With dead ends: 14 [2019-12-07 10:50:06,786 INFO L226 Difference]: Without dead ends: 12 [2019-12-07 10:50:06,787 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=46, Invalid=116, Unknown=2, NotChecked=46, Total=210 [2019-12-07 10:50:06,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-12-07 10:50:06,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-12-07 10:50:06,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-12-07 10:50:06,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-12-07 10:50:06,789 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 6 [2019-12-07 10:50:06,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:50:06,789 INFO L462 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-12-07 10:50:06,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 10:50:06,790 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-12-07 10:50:06,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 10:50:06,790 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:50:06,790 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2019-12-07 10:50:06,990 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:50:06,991 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:50:06,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:50:06,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1219666289, now seen corresponding path program 2 times [2019-12-07 10:50:06,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:50:06,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511350947] [2019-12-07 10:50:06,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:50:07,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:50:07,257 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:50:07,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511350947] [2019-12-07 10:50:07,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130281009] [2019-12-07 10:50:07,258 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4d36984d-1c73-4ea6-8357-14cc57c2c476/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:50:07,355 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-07 10:50:07,355 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:50:07,356 WARN L262 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 27 conjunts are in the unsatisfiable core [2019-12-07 10:50:07,357 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:50:07,498 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:50:07,498 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:50:09,508 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_ULTIMATE.start_main_~x~0 4294967296)) (.cse2 (mod (+ (* c_ULTIMATE.start_main_~x~0 2) 2) 4294967296))) (and (let ((.cse0 (+ c_ULTIMATE.start_main_~sn~0 2))) (or (= 0 .cse0) (<= 10 .cse1) (= .cse2 (mod .cse0 4294967296)))) (or (< .cse1 10) (= c_ULTIMATE.start_main_~sn~0 0) (= .cse2 (mod c_ULTIMATE.start_main_~sn~0 4294967296))))) is different from false [2019-12-07 10:50:10,403 WARN L192 SmtUtils]: Spent 631.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-12-07 10:50:27,951 WARN L192 SmtUtils]: Spent 12.83 s on a formula simplification that was a NOOP. DAG size: 56 [2019-12-07 10:50:39,683 WARN L192 SmtUtils]: Spent 6.39 s on a formula simplification that was a NOOP. DAG size: 59 [2019-12-07 10:50:41,796 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse34 (+ c_ULTIMATE.start_main_~sn~0 2)) (.cse35 (* c_ULTIMATE.start_main_~x~0 2))) (let ((.cse30 (+ c_ULTIMATE.start_main_~sn~0 6)) (.cse31 (mod (+ .cse35 2) 4294967296)) (.cse10 (mod c_ULTIMATE.start_main_~sn~0 4294967296)) (.cse33 (+ c_ULTIMATE.start_main_~sn~0 4)) (.cse29 (mod c_ULTIMATE.start_main_~x~0 4294967296)) (.cse9 (mod (+ .cse35 8) 4294967296)) (.cse32 (mod .cse34 4294967296))) (let ((.cse6 (= .cse9 .cse32)) (.cse7 (= 0 .cse34)) (.cse28 (mod (+ c_ULTIMATE.start_main_~x~0 1) 4294967296)) (.cse11 (< .cse29 10)) (.cse26 (= .cse9 (mod .cse33 4294967296))) (.cse27 (= 0 .cse33)) (.cse13 (not (= .cse31 .cse10))) (.cse21 (= .cse9 (mod .cse30 4294967296))) (.cse5 (not (= .cse31 .cse32))) (.cse22 (= 0 .cse30)) (.cse8 (<= 10 .cse29))) (let ((.cse23 (and (or .cse11 .cse26 .cse27 .cse13) (or .cse21 .cse5 .cse22 .cse8))) (.cse3 (<= 10 .cse28)) (.cse4 (< .cse28 10)) (.cse2 (and (or .cse5 .cse26 .cse27 .cse8) (or .cse6 .cse11 .cse7 .cse13))) (.cse25 (mod (+ c_ULTIMATE.start_main_~x~0 3) 4294967296)) (.cse24 (mod (+ c_ULTIMATE.start_main_~x~0 2) 4294967296))) (let ((.cse0 (< .cse24 10)) (.cse12 (= c_ULTIMATE.start_main_~sn~0 0)) (.cse15 (<= 10 .cse25)) (.cse1 (< .cse25 10)) (.cse14 (and (or .cse23 .cse3) (or .cse4 .cse2))) (.cse19 (<= 10 .cse24))) (and (or .cse0 (and (or .cse1 (and (or .cse2 .cse3) (or .cse4 (and (or .cse5 .cse6 .cse7 .cse8) (or (= .cse9 .cse10) .cse11 .cse12 .cse13))))) (or .cse14 .cse15))) (or (let ((.cse18 (= .cse9 4)) (.cse16 (= .cse9 2))) (let ((.cse17 (and (or .cse18 .cse3) (or .cse4 .cse16)))) (and (or (and (or .cse1 .cse16 .cse3) (or .cse17 .cse15)) .cse0) (or (and (or .cse1 .cse17) (or .cse15 (and (or (= .cse9 6) .cse3) (or .cse4 .cse18)))) .cse19)))) (and (or (not .cse12) .cse11) (or (not .cse7) .cse8))) (or (and (or (and (or .cse3 (and (let ((.cse20 (+ c_ULTIMATE.start_main_~sn~0 8))) (or (= 0 .cse20) .cse5 (= .cse9 (mod .cse20 4294967296)) .cse8)) (or .cse21 .cse11 .cse22 .cse13))) (or .cse4 .cse23)) .cse15) (or .cse1 .cse14)) .cse19))))))) is different from true [2019-12-07 10:50:41,798 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 1 times theorem prover too weak. 0 trivial. 8 not checked. [2019-12-07 10:50:41,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [959172281] [2019-12-07 10:50:41,800 INFO L159 IcfgInterpreter]: Started Sifa with 5 locations of interest [2019-12-07 10:50:41,800 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 10:50:41,800 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 10:50:41,800 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 10:50:41,801 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 10:50:41,835 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 10:50:41,976 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 10:50:41,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 10:50:41,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2019-12-07 10:50:41,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177697568] [2019-12-07 10:50:41,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 10:50:41,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:50:41,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 10:50:41,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=161, Unknown=3, NotChecked=54, Total=272 [2019-12-07 10:50:41,978 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 14 states. [2019-12-07 10:50:44,343 WARN L192 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 38 DAG size of output: 22 [2019-12-07 10:52:06,190 WARN L192 SmtUtils]: Spent 1.36 m on a formula simplification. DAG size of input: 77 DAG size of output: 44 [2019-12-07 10:52:48,530 WARN L192 SmtUtils]: Spent 21.28 s on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2019-12-07 10:52:59,242 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_ULTIMATE.start_main_~x~0 4294967296)) (.cse2 (mod (+ (* c_ULTIMATE.start_main_~x~0 2) 2) 4294967296))) (and (let ((.cse0 (+ c_ULTIMATE.start_main_~sn~0 2))) (or (= 0 .cse0) (<= 10 .cse1) (= .cse2 (mod .cse0 4294967296)))) (not (= 0 c_ULTIMATE.start___VERIFIER_assert_~cond)) (or (< .cse1 10) (= c_ULTIMATE.start_main_~sn~0 0) (= .cse2 (mod c_ULTIMATE.start_main_~sn~0 4294967296))))) is different from false [2019-12-07 10:53:05,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:53:05,481 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2019-12-07 10:53:05,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 10:53:05,481 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2019-12-07 10:53:05,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:53:05,482 INFO L225 Difference]: With dead ends: 21 [2019-12-07 10:53:05,482 INFO L226 Difference]: Without dead ends: 19 [2019-12-07 10:53:05,482 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 15 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 156.8s TimeCoverageRelationStatistics Valid=89, Invalid=254, Unknown=11, NotChecked=108, Total=462 [2019-12-07 10:53:05,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-12-07 10:53:05,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-12-07 10:53:05,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-12-07 10:53:05,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-12-07 10:53:05,485 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 10 [2019-12-07 10:53:05,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:53:05,485 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-12-07 10:53:05,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 10:53:05,485 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-12-07 10:53:05,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 10:53:05,486 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:53:05,486 INFO L410 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2019-12-07 10:53:05,686 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:53:05,687 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:53:05,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:53:05,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1123435971, now seen corresponding path program 3 times [2019-12-07 10:53:05,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:53:05,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747662478] [2019-12-07 10:53:05,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:53:05,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:53:06,352 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:53:06,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747662478] [2019-12-07 10:53:06,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225740024] [2019-12-07 10:53:06,353 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4d36984d-1c73-4ea6-8357-14cc57c2c476/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:53:06,392 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 10:53:06,392 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:53:06,393 WARN L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 49 conjunts are in the unsatisfiable core [2019-12-07 10:53:06,394 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:53:06,672 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 21 [2019-12-07 10:53:09,070 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 22 [2019-12-07 10:53:10,390 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:53:10,390 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:53:19,129 WARN L192 SmtUtils]: Spent 2.29 s on a formula simplification that was a NOOP. DAG size: 22 [2019-12-07 10:53:29,232 WARN L192 SmtUtils]: Spent 7.63 s on a formula simplification that was a NOOP. DAG size: 38 [2019-12-07 10:54:01,460 WARN L192 SmtUtils]: Spent 24.75 s on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-12-07 10:55:22,059 WARN L192 SmtUtils]: Spent 1.14 m on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2019-12-07 10:56:18,124 WARN L192 SmtUtils]: Spent 42.65 s on a formula simplification that was a NOOP. DAG size: 92 [2019-12-07 10:56:20,184 WARN L838 $PredicateComparison]: unable to prove that (or (let ((.cse25 (+ c_ULTIMATE.start_main_~sn~0 2)) (.cse26 (mod c_ULTIMATE.start_main_~x~0 4294967296)) (.cse27 (+ c_ULTIMATE.start_main_~sn~0 4)) (.cse28 (+ c_ULTIMATE.start_main_~sn~0 6)) (.cse29 (+ c_ULTIMATE.start_main_~sn~0 8)) (.cse10 (mod (+ (* c_ULTIMATE.start_main_~x~0 2) 10) 4294967296))) (let ((.cse23 (mod (+ c_ULTIMATE.start_main_~x~0 2) 4294967296)) (.cse12 (= (mod .cse29 4294967296) .cse10)) (.cse13 (= 0 .cse29)) (.cse19 (= (mod .cse28 4294967296) .cse10)) (.cse20 (= 0 .cse28)) (.cse21 (= (mod .cse27 4294967296) .cse10)) (.cse22 (= 0 .cse27)) (.cse11 (<= 10 .cse26)) (.cse14 (< .cse26 10)) (.cse16 (= 0 .cse25)) (.cse17 (= (mod .cse25 4294967296) .cse10)) (.cse24 (mod (+ c_ULTIMATE.start_main_~x~0 4) 4294967296)) (.cse18 (mod (+ c_ULTIMATE.start_main_~x~0 3) 4294967296))) (let ((.cse0 (mod (+ c_ULTIMATE.start_main_~x~0 1) 4294967296)) (.cse1 (< .cse18 10)) (.cse7 (< .cse24 10)) (.cse5 (and (or .cse21 .cse22 .cse11) (or .cse14 .cse16 .cse17))) (.cse8 (<= 10 .cse24)) (.cse6 (and (or .cse12 .cse13 .cse11) (or .cse19 .cse14 .cse20))) (.cse3 (<= 10 .cse23)) (.cse4 (< .cse23 10)) (.cse2 (and (or .cse19 .cse20 .cse11) (or .cse21 .cse14 .cse22))) (.cse15 (<= 10 .cse18))) (and (or (<= 10 .cse0) (and (or .cse1 (and (or .cse2 .cse3) (or .cse4 .cse5))) (or (and (or .cse6 .cse7) (or .cse8 (and (let ((.cse9 (+ c_ULTIMATE.start_main_~sn~0 10))) (or (= (mod .cse9 4294967296) .cse10) (= .cse9 0) .cse11)) (or .cse12 .cse13 .cse14)))) .cse15))) (or (< .cse0 10) (and (or .cse1 (and (or .cse7 (and (or .cse16 .cse11 .cse17) (or .cse14 (= .cse10 (mod c_ULTIMATE.start_main_~sn~0 4294967296)) (= c_ULTIMATE.start_main_~sn~0 0)))) (or .cse5 .cse8))) (or (and (or .cse6 .cse3) (or .cse4 .cse2)) .cse15))))))) (= 0 c_ULTIMATE.start___VERIFIER_assert_~cond)) is different from false [2019-12-07 10:56:22,297 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse40 (+ c_ULTIMATE.start_main_~sn~0 2)) (.cse54 (* c_ULTIMATE.start_main_~x~0 2))) (let ((.cse29 (mod c_ULTIMATE.start_main_~sn~0 4294967296)) (.cse49 (+ c_ULTIMATE.start_main_~sn~0 4)) (.cse50 (mod c_ULTIMATE.start_main_~x~0 4294967296)) (.cse48 (mod (+ .cse54 2) 4294967296)) (.cse41 (mod .cse40 4294967296)) (.cse51 (+ c_ULTIMATE.start_main_~sn~0 6)) (.cse52 (+ c_ULTIMATE.start_main_~sn~0 8)) (.cse7 (mod (+ .cse54 12) 4294967296)) (.cse53 (+ c_ULTIMATE.start_main_~sn~0 10))) (let ((.cse35 (= .cse53 0)) (.cse36 (= (mod .cse53 4294967296) .cse7)) (.cse45 (= 0 .cse52)) (.cse46 (= (mod .cse52 4294967296) .cse7)) (.cse47 (mod (+ c_ULTIMATE.start_main_~x~0 1) 4294967296)) (.cse26 (= (mod .cse51 4294967296) .cse7)) (.cse22 (not (= .cse48 .cse41))) (.cse27 (= 0 .cse51)) (.cse3 (<= 10 .cse50)) (.cse24 (= .cse7 (mod .cse49 4294967296))) (.cse1 (< .cse50 10)) (.cse25 (= 0 .cse49)) (.cse30 (not (= .cse48 .cse29)))) (let ((.cse42 (mod (+ c_ULTIMATE.start_main_~x~0 3) 4294967296)) (.cse37 (and (or .cse26 .cse22 .cse27 .cse3) (or .cse24 .cse1 .cse25 .cse30))) (.cse39 (mod (+ c_ULTIMATE.start_main_~x~0 4) 4294967296)) (.cse8 (< .cse47 10)) (.cse43 (and (or .cse26 .cse1 .cse27 .cse30) (or .cse45 .cse22 .cse46 .cse3))) (.cse6 (<= 10 .cse47)) (.cse33 (and (or .cse45 .cse1 .cse46 .cse30) (or .cse22 .cse35 .cse3 .cse36))) (.cse44 (mod (+ c_ULTIMATE.start_main_~x~0 5) 4294967296)) (.cse38 (mod (+ c_ULTIMATE.start_main_~x~0 2) 4294967296))) (let ((.cse18 (< .cse38 10)) (.cse0 (= c_ULTIMATE.start_main_~sn~0 0)) (.cse5 (< .cse44 10)) (.cse32 (and (or .cse8 .cse43) (or .cse6 .cse33))) (.cse10 (<= 10 .cse44)) (.cse11 (<= 10 .cse39)) (.cse31 (and (or .cse8 .cse37) (or .cse6 .cse43))) (.cse16 (<= 10 .cse42)) (.cse13 (< .cse42 10)) (.cse28 (= .cse41 .cse7)) (.cse2 (= 0 .cse40)) (.cse12 (< .cse39 10)) (.cse17 (<= 10 .cse38))) (and (or (and (or (not .cse0) .cse1) (or (not .cse2) .cse3)) (let ((.cse19 (= 2 .cse7)) (.cse9 (= 8 .cse7)) (.cse21 (= 6 .cse7)) (.cse20 (= 4 .cse7))) (let ((.cse15 (and (or .cse21 .cse6) (or .cse8 .cse20))) (.cse4 (and (or .cse9 .cse6) (or .cse8 .cse21))) (.cse14 (and (or .cse20 .cse6) (or .cse8 .cse19)))) (and (or (and (or (and (or .cse4 .cse5) (or (and (or .cse6 (= 10 .cse7)) (or .cse8 .cse9)) .cse10)) .cse11) (or .cse12 (and (or .cse13 .cse14) (or .cse15 .cse16)))) .cse17) (or .cse18 (and (or .cse11 (and (or .cse13 .cse15) (or .cse4 .cse16))) (or .cse12 (and (or .cse6 .cse5 .cse19) (or .cse10 .cse14))))))))) (or .cse18 (and (or .cse12 (let ((.cse23 (and (or .cse8 .cse28 .cse2) (or .cse24 .cse6 .cse25)))) (and (or .cse22 (and (or .cse23 .cse5) (or .cse10 (and (or .cse24 .cse8 .cse25) (or .cse26 .cse6 .cse27)))) .cse3) (or (and (or .cse10 .cse23) (or .cse5 (and (or .cse28 .cse6 .cse2) (or (= .cse7 .cse29) .cse8 .cse0)))) .cse1 .cse30)))) (or .cse11 (and (or .cse13 .cse31) (or .cse32 .cse16))))) (or (and (or (and (or .cse5 .cse32) (or .cse10 (and (or .cse8 .cse33) (or (and (let ((.cse34 (+ c_ULTIMATE.start_main_~sn~0 12))) (or (= 0 .cse34) .cse22 (= (mod .cse34 4294967296) .cse7) .cse3)) (or .cse35 .cse1 .cse36 .cse30)) .cse6)))) .cse11) (or (and (or .cse31 .cse16) (or .cse13 (and (or .cse8 (and (or .cse24 .cse22 .cse25 .cse3) (or .cse28 .cse1 .cse2 .cse30))) (or .cse6 .cse37)))) .cse12)) .cse17))))))) is different from true [2019-12-07 10:56:24,395 WARN L860 $PredicateComparison]: unable to prove that (or (let ((.cse40 (+ c_ULTIMATE.start_main_~sn~0 2)) (.cse54 (* c_ULTIMATE.start_main_~x~0 2))) (let ((.cse29 (mod c_ULTIMATE.start_main_~sn~0 4294967296)) (.cse49 (+ c_ULTIMATE.start_main_~sn~0 4)) (.cse50 (mod c_ULTIMATE.start_main_~x~0 4294967296)) (.cse48 (mod (+ .cse54 2) 4294967296)) (.cse41 (mod .cse40 4294967296)) (.cse51 (+ c_ULTIMATE.start_main_~sn~0 6)) (.cse52 (+ c_ULTIMATE.start_main_~sn~0 8)) (.cse7 (mod (+ .cse54 12) 4294967296)) (.cse53 (+ c_ULTIMATE.start_main_~sn~0 10))) (let ((.cse35 (= .cse53 0)) (.cse36 (= (mod .cse53 4294967296) .cse7)) (.cse45 (= 0 .cse52)) (.cse46 (= (mod .cse52 4294967296) .cse7)) (.cse47 (mod (+ c_ULTIMATE.start_main_~x~0 1) 4294967296)) (.cse26 (= (mod .cse51 4294967296) .cse7)) (.cse22 (not (= .cse48 .cse41))) (.cse27 (= 0 .cse51)) (.cse3 (<= 10 .cse50)) (.cse24 (= .cse7 (mod .cse49 4294967296))) (.cse1 (< .cse50 10)) (.cse25 (= 0 .cse49)) (.cse30 (not (= .cse48 .cse29)))) (let ((.cse42 (mod (+ c_ULTIMATE.start_main_~x~0 3) 4294967296)) (.cse37 (and (or .cse26 .cse22 .cse27 .cse3) (or .cse24 .cse1 .cse25 .cse30))) (.cse39 (mod (+ c_ULTIMATE.start_main_~x~0 4) 4294967296)) (.cse8 (< .cse47 10)) (.cse43 (and (or .cse26 .cse1 .cse27 .cse30) (or .cse45 .cse22 .cse46 .cse3))) (.cse6 (<= 10 .cse47)) (.cse33 (and (or .cse45 .cse1 .cse46 .cse30) (or .cse22 .cse35 .cse3 .cse36))) (.cse44 (mod (+ c_ULTIMATE.start_main_~x~0 5) 4294967296)) (.cse38 (mod (+ c_ULTIMATE.start_main_~x~0 2) 4294967296))) (let ((.cse18 (< .cse38 10)) (.cse0 (= c_ULTIMATE.start_main_~sn~0 0)) (.cse5 (< .cse44 10)) (.cse32 (and (or .cse8 .cse43) (or .cse6 .cse33))) (.cse10 (<= 10 .cse44)) (.cse11 (<= 10 .cse39)) (.cse31 (and (or .cse8 .cse37) (or .cse6 .cse43))) (.cse16 (<= 10 .cse42)) (.cse13 (< .cse42 10)) (.cse28 (= .cse41 .cse7)) (.cse2 (= 0 .cse40)) (.cse12 (< .cse39 10)) (.cse17 (<= 10 .cse38))) (and (or (and (or (not .cse0) .cse1) (or (not .cse2) .cse3)) (let ((.cse19 (= 2 .cse7)) (.cse9 (= 8 .cse7)) (.cse21 (= 6 .cse7)) (.cse20 (= 4 .cse7))) (let ((.cse15 (and (or .cse21 .cse6) (or .cse8 .cse20))) (.cse4 (and (or .cse9 .cse6) (or .cse8 .cse21))) (.cse14 (and (or .cse20 .cse6) (or .cse8 .cse19)))) (and (or (and (or (and (or .cse4 .cse5) (or (and (or .cse6 (= 10 .cse7)) (or .cse8 .cse9)) .cse10)) .cse11) (or .cse12 (and (or .cse13 .cse14) (or .cse15 .cse16)))) .cse17) (or .cse18 (and (or .cse11 (and (or .cse13 .cse15) (or .cse4 .cse16))) (or .cse12 (and (or .cse6 .cse5 .cse19) (or .cse10 .cse14))))))))) (or .cse18 (and (or .cse12 (let ((.cse23 (and (or .cse8 .cse28 .cse2) (or .cse24 .cse6 .cse25)))) (and (or .cse22 (and (or .cse23 .cse5) (or .cse10 (and (or .cse24 .cse8 .cse25) (or .cse26 .cse6 .cse27)))) .cse3) (or (and (or .cse10 .cse23) (or .cse5 (and (or .cse28 .cse6 .cse2) (or (= .cse7 .cse29) .cse8 .cse0)))) .cse1 .cse30)))) (or .cse11 (and (or .cse13 .cse31) (or .cse32 .cse16))))) (or (and (or (and (or .cse5 .cse32) (or .cse10 (and (or .cse8 .cse33) (or (and (let ((.cse34 (+ c_ULTIMATE.start_main_~sn~0 12))) (or (= 0 .cse34) .cse22 (= (mod .cse34 4294967296) .cse7) .cse3)) (or .cse35 .cse1 .cse36 .cse30)) .cse6)))) .cse11) (or (and (or .cse31 .cse16) (or .cse13 (and (or .cse8 (and (or .cse24 .cse22 .cse25 .cse3) (or .cse28 .cse1 .cse2 .cse30))) (or .cse6 .cse37)))) .cse12)) .cse17))))))) (= 0 c_ULTIMATE.start___VERIFIER_assert_~cond)) is different from true [2019-12-07 11:00:42,211 WARN L192 SmtUtils]: Spent 4.07 m on a formula simplification. DAG size of input: 260 DAG size of output: 30 [2019-12-07 11:00:52,584 WARN L192 SmtUtils]: Spent 9.16 s on a formula simplification. DAG size of input: 31 DAG size of output: 25 [2019-12-07 11:00:54,594 WARN L860 $PredicateComparison]: unable to prove that (or (< (mod (+ c_ULTIMATE.start_main_~x~0 7) 4294967296) 10) (let ((.cse4 (* c_ULTIMATE.start_main_~x~0 2))) (let ((.cse1 (mod (+ .cse4 2) 4294967296)) (.cse0 (mod (+ .cse4 6) 4294967296)) (.cse2 (mod c_ULTIMATE.start_main_~x~0 4294967296))) (and (or (not (= .cse0 (mod (+ c_ULTIMATE.start_main_~sn~0 4) 4294967296))) (and (not (= c_ULTIMATE.start_main_~sn~0 0)) (not (= .cse1 (mod c_ULTIMATE.start_main_~sn~0 4294967296)))) (< .cse2 10)) (or (let ((.cse3 (+ c_ULTIMATE.start_main_~sn~0 2))) (and (not (= .cse1 (mod .cse3 4294967296))) (not (= 0 .cse3)))) (not (= (mod (+ c_ULTIMATE.start_main_~sn~0 6) 4294967296) .cse0)) (<= 10 .cse2))))) (<= 10 (mod (+ c_ULTIMATE.start_main_~x~0 2) 4294967296))) is different from true [2019-12-07 11:00:54,602 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 26 refuted. 4 times theorem prover too weak. 0 trivial. 26 not checked. [2019-12-07 11:00:54,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [970214646] [2019-12-07 11:00:54,603 INFO L159 IcfgInterpreter]: Started Sifa with 5 locations of interest [2019-12-07 11:00:54,603 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 11:00:54,603 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 11:00:54,604 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 11:00:54,604 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 11:00:54,636 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 11:00:54,918 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 11:00:54,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 11:00:54,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 31 [2019-12-07 11:00:54,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285762838] [2019-12-07 11:00:54,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-07 11:00:54,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:00:54,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-07 11:00:54,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=726, Unknown=19, NotChecked=244, Total=1190 [2019-12-07 11:00:54,920 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 32 states. [2019-12-07 11:02:21,813 WARN L192 SmtUtils]: Spent 1.41 m on a formula simplification. DAG size of input: 240 DAG size of output: 21 [2019-12-07 11:02:27,023 WARN L192 SmtUtils]: Spent 4.85 s on a formula simplification. DAG size of input: 109 DAG size of output: 21 [2019-12-07 11:02:55,724 WARN L192 SmtUtils]: Spent 21.03 s on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-12-07 11:03:14,389 WARN L192 SmtUtils]: Spent 4.07 s on a formula simplification that was a NOOP. DAG size: 25 [2019-12-07 11:03:19,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:03:19,456 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2019-12-07 11:03:19,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 11:03:19,456 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 18 [2019-12-07 11:03:19,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:03:19,457 INFO L225 Difference]: With dead ends: 27 [2019-12-07 11:03:19,457 INFO L226 Difference]: Without dead ends: 25 [2019-12-07 11:03:19,458 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 28 SyntacticMatches, 10 SemanticMatches, 39 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 601.4s TimeCoverageRelationStatistics Valid=270, Invalid=1053, Unknown=25, NotChecked=292, Total=1640 [2019-12-07 11:03:19,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-12-07 11:03:19,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-12-07 11:03:19,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-12-07 11:03:19,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-12-07 11:03:19,461 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 18 [2019-12-07 11:03:19,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:03:19,462 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-12-07 11:03:19,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-07 11:03:19,462 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-12-07 11:03:19,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 11:03:19,462 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:03:19,462 INFO L410 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1] [2019-12-07 11:03:19,663 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:03:19,663 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:03:19,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:03:19,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1906061558, now seen corresponding path program 4 times [2019-12-07 11:03:19,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:03:19,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275601916] [2019-12-07 11:03:19,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:03:19,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:03:19,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:03:19,774 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 11:03:19,774 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 11:03:19,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:03:19 BoogieIcfgContainer [2019-12-07 11:03:19,791 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:03:19,792 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:03:19,792 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:03:19,792 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:03:19,792 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:49:54" (3/4) ... [2019-12-07 11:03:19,794 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 11:03:19,833 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_4d36984d-1c73-4ea6-8357-14cc57c2c476/bin/utaipan/witness.graphml [2019-12-07 11:03:19,833 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:03:19,834 INFO L168 Benchmark]: Toolchain (without parser) took 805482.71 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 944.7 MB in the beginning and 885.5 MB in the end (delta: 59.2 MB). Peak memory consumption was 172.9 MB. Max. memory is 11.5 GB. [2019-12-07 11:03:19,835 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:03:19,835 INFO L168 Benchmark]: CACSL2BoogieTranslator took 192.28 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -154.7 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2019-12-07 11:03:19,835 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.86 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:03:19,835 INFO L168 Benchmark]: Boogie Preprocessor took 12.19 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:03:19,836 INFO L168 Benchmark]: RCFGBuilder took 164.77 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2019-12-07 11:03:19,836 INFO L168 Benchmark]: TraceAbstraction took 805047.95 ms. Allocated memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.4 MB). Free memory was 1.1 GB in the beginning and 887.3 MB in the end (delta: 189.7 MB). Peak memory consumption was 199.1 MB. Max. memory is 11.5 GB. [2019-12-07 11:03:19,836 INFO L168 Benchmark]: Witness Printer took 41.66 ms. Allocated memory is still 1.1 GB. Free memory was 887.3 MB in the beginning and 885.5 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 11.5 GB. [2019-12-07 11:03:19,838 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 192.28 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -154.7 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.86 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 12.19 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 164.77 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 805047.95 ms. Allocated memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.4 MB). Free memory was 1.1 GB in the beginning and 887.3 MB in the end (delta: 189.7 MB). Peak memory consumption was 199.1 MB. Max. memory is 11.5 GB. * Witness Printer took 41.66 ms. Allocated memory is still 1.1 GB. Free memory was 887.3 MB in the beginning and 885.5 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L10] int sn=0; [L11] unsigned int loop1=__VERIFIER_nondet_uint(), n1=__VERIFIER_nondet_uint(); [L11] unsigned int loop1=__VERIFIER_nondet_uint(), n1=__VERIFIER_nondet_uint(); [L12] unsigned int x=0; [L13] COND TRUE 1 [L14] COND TRUE x<10 [L15] sn = sn + (2) [L17] x++ [L3] COND FALSE !(!(cond)) [L13] COND TRUE 1 [L14] COND TRUE x<10 [L15] sn = sn + (2) [L17] x++ [L3] COND FALSE !(!(cond)) [L13] COND TRUE 1 [L14] COND TRUE x<10 [L15] sn = sn + (2) [L17] x++ [L3] COND FALSE !(!(cond)) [L13] COND TRUE 1 [L14] COND TRUE x<10 [L15] sn = sn + (2) [L17] x++ [L3] COND FALSE !(!(cond)) [L13] COND TRUE 1 [L14] COND TRUE x<10 [L15] sn = sn + (2) [L17] x++ [L3] COND FALSE !(!(cond)) [L13] COND TRUE 1 [L14] COND TRUE x<10 [L15] sn = sn + (2) [L17] x++ [L3] COND FALSE !(!(cond)) [L13] COND TRUE 1 [L14] COND TRUE x<10 [L15] sn = sn + (2) [L17] x++ [L3] COND FALSE !(!(cond)) [L13] COND TRUE 1 [L14] COND TRUE x<10 [L15] sn = sn + (2) [L17] x++ [L3] COND FALSE !(!(cond)) [L13] COND TRUE 1 [L14] COND TRUE x<10 [L15] sn = sn + (2) [L17] x++ [L3] COND FALSE !(!(cond)) [L13] COND TRUE 1 [L14] COND TRUE x<10 [L15] sn = sn + (2) [L17] x++ [L3] COND FALSE !(!(cond)) [L13] COND TRUE 1 [L14] COND FALSE !(x<10) [L17] x++ [L3] COND TRUE !(cond) [L4] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. Result: UNSAFE, OverallTime: 804.9s, OverallIterations: 5, TraceHistogramMax: 11, AutomataDifference: 292.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 13 SDtfs, 31 SDslu, 55 SDs, 0 SdLazy, 198 SolverSat, 48 SolverUnsat, 16 SolverUnknown, 0 SolverNotchecked, 34.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 143 GetRequests, 51 SyntacticMatches, 18 SemanticMatches, 74 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 500 ImplicationChecksByTransitivity, 767.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 510.2s InterpolantComputationTime, 96 NumberOfCodeBlocks, 96 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 96 ConstructedInterpolants, 0 QuantifiedInterpolants, 137921 SizeOfPredicates, 22 NumberOfNonLiveVariables, 148 ConjunctsInSsa, 97 ConjunctsInUnsatCore, 10 InterpolantComputations, 1 PerfectInterpolantSequences, 0/210 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...