./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/recursive-simple/id2_b5_o10_true-unreach-call_true-termination_true-no-overflow.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c477e7a8-0515-4927-bd0a-0ceac13e4bf5/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c477e7a8-0515-4927-bd0a-0ceac13e4bf5/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c477e7a8-0515-4927-bd0a-0ceac13e4bf5/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c477e7a8-0515-4927-bd0a-0ceac13e4bf5/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/id2_b5_o10_true-unreach-call_true-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_c477e7a8-0515-4927-bd0a-0ceac13e4bf5/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c477e7a8-0515-4927-bd0a-0ceac13e4bf5/bin-2019/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 6f330f622534898bf170bbd5a7ac37bee3deb574 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-26 21:15:00,097 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 21:15:00,099 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 21:15:00,115 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 21:15:00,115 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 21:15:00,116 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 21:15:00,117 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 21:15:00,119 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 21:15:00,121 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 21:15:00,121 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 21:15:00,122 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 21:15:00,122 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 21:15:00,123 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 21:15:00,124 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 21:15:00,125 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 21:15:00,126 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 21:15:00,127 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 21:15:00,128 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 21:15:00,130 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 21:15:00,131 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 21:15:00,132 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 21:15:00,133 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 21:15:00,135 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 21:15:00,135 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 21:15:00,136 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 21:15:00,137 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 21:15:00,138 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 21:15:00,138 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 21:15:00,139 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 21:15:00,140 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 21:15:00,141 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 21:15:00,141 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 21:15:00,142 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 21:15:00,142 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 21:15:00,143 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 21:15:00,144 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 21:15:00,144 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c477e7a8-0515-4927-bd0a-0ceac13e4bf5/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-26 21:15:00,156 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 21:15:00,156 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 21:15:00,157 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 21:15:00,157 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 21:15:00,157 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 21:15:00,157 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 21:15:00,158 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-26 21:15:00,158 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 21:15:00,158 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-26 21:15:00,158 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-26 21:15:00,158 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 21:15:00,159 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 21:15:00,159 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 21:15:00,159 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 21:15:00,159 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 21:15:00,159 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 21:15:00,160 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 21:15:00,160 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 21:15:00,160 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 21:15:00,160 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 21:15:00,162 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 21:15:00,162 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 21:15:00,162 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 21:15:00,163 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 21:15:00,163 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 21:15:00,163 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 21:15:00,163 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 21:15:00,163 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 21:15:00,163 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 21:15:00,164 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 21:15:00,164 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-26 21:15:00,164 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 21:15:00,164 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 21:15:00,164 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 21:15:00,164 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_c477e7a8-0515-4927-bd0a-0ceac13e4bf5/bin-2019/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 -> 6f330f622534898bf170bbd5a7ac37bee3deb574 [2018-10-26 21:15:00,195 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 21:15:00,206 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 21:15:00,214 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 21:15:00,216 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 21:15:00,216 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 21:15:00,217 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c477e7a8-0515-4927-bd0a-0ceac13e4bf5/bin-2019/utaipan/../../sv-benchmarks/c/recursive-simple/id2_b5_o10_true-unreach-call_true-termination_true-no-overflow.c [2018-10-26 21:15:00,275 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c477e7a8-0515-4927-bd0a-0ceac13e4bf5/bin-2019/utaipan/data/b431d5110/24cc0b402d864d01a4c202bc3f3b247d/FLAG23454e372 [2018-10-26 21:15:00,670 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 21:15:00,670 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c477e7a8-0515-4927-bd0a-0ceac13e4bf5/sv-benchmarks/c/recursive-simple/id2_b5_o10_true-unreach-call_true-termination_true-no-overflow.c [2018-10-26 21:15:00,676 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c477e7a8-0515-4927-bd0a-0ceac13e4bf5/bin-2019/utaipan/data/b431d5110/24cc0b402d864d01a4c202bc3f3b247d/FLAG23454e372 [2018-10-26 21:15:00,687 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c477e7a8-0515-4927-bd0a-0ceac13e4bf5/bin-2019/utaipan/data/b431d5110/24cc0b402d864d01a4c202bc3f3b247d [2018-10-26 21:15:00,690 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 21:15:00,691 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 21:15:00,692 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 21:15:00,693 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 21:15:00,696 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 21:15:00,696 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:15:00" (1/1) ... [2018-10-26 21:15:00,699 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@209f669a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:15:00, skipping insertion in model container [2018-10-26 21:15:00,699 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:15:00" (1/1) ... [2018-10-26 21:15:00,707 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 21:15:00,723 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 21:15:00,862 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:15:00,864 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 21:15:00,879 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:15:00,890 INFO L193 MainTranslator]: Completed translation [2018-10-26 21:15:00,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:15:00 WrapperNode [2018-10-26 21:15:00,890 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 21:15:00,891 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 21:15:00,891 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 21:15:00,891 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 21:15:00,900 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:15:00" (1/1) ... [2018-10-26 21:15:00,905 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:15:00" (1/1) ... [2018-10-26 21:15:00,910 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 21:15:00,911 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 21:15:00,911 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 21:15:00,911 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 21:15:00,919 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:15:00" (1/1) ... [2018-10-26 21:15:00,920 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:15:00" (1/1) ... [2018-10-26 21:15:00,920 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:15:00" (1/1) ... [2018-10-26 21:15:00,921 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:15:00" (1/1) ... [2018-10-26 21:15:00,923 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:15:00" (1/1) ... [2018-10-26 21:15:00,925 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:15:00" (1/1) ... [2018-10-26 21:15:00,926 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:15:00" (1/1) ... [2018-10-26 21:15:00,927 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 21:15:00,928 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 21:15:00,928 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 21:15:00,928 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 21:15:00,929 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:15:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c477e7a8-0515-4927-bd0a-0ceac13e4bf5/bin-2019/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 [2018-10-26 21:15:01,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 21:15:01,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 21:15:01,044 INFO L130 BoogieDeclarations]: Found specification of procedure id2 [2018-10-26 21:15:01,044 INFO L138 BoogieDeclarations]: Found implementation of procedure id2 [2018-10-26 21:15:01,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 21:15:01,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 21:15:01,045 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 21:15:01,045 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 21:15:01,045 INFO L130 BoogieDeclarations]: Found specification of procedure id [2018-10-26 21:15:01,045 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2018-10-26 21:15:01,324 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 21:15:01,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:15:01 BoogieIcfgContainer [2018-10-26 21:15:01,324 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 21:15:01,325 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 21:15:01,325 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 21:15:01,328 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 21:15:01,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 09:15:00" (1/3) ... [2018-10-26 21:15:01,329 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@201baecb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:15:01, skipping insertion in model container [2018-10-26 21:15:01,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:15:00" (2/3) ... [2018-10-26 21:15:01,329 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@201baecb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:15:01, skipping insertion in model container [2018-10-26 21:15:01,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:15:01" (3/3) ... [2018-10-26 21:15:01,331 INFO L112 eAbstractionObserver]: Analyzing ICFG id2_b5_o10_true-unreach-call_true-termination_true-no-overflow.c [2018-10-26 21:15:01,339 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 21:15:01,345 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 21:15:01,358 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 21:15:01,386 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 21:15:01,387 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 21:15:01,387 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 21:15:01,387 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 21:15:01,387 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 21:15:01,387 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 21:15:01,387 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 21:15:01,387 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 21:15:01,403 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-10-26 21:15:01,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-26 21:15:01,409 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:15:01,410 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:15:01,412 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:15:01,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:15:01,418 INFO L82 PathProgramCache]: Analyzing trace with hash 128923731, now seen corresponding path program 1 times [2018-10-26 21:15:01,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:15:01,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:15:01,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:15:01,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:15:01,465 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:15:01,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:15:01,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:15:01,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:15:01,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 21:15:01,637 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:15:01,641 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:15:01,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:15:01,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:15:01,651 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 5 states. [2018-10-26 21:15:01,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:15:01,707 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2018-10-26 21:15:01,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 21:15:01,709 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-10-26 21:15:01,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:15:01,719 INFO L225 Difference]: With dead ends: 40 [2018-10-26 21:15:01,719 INFO L226 Difference]: Without dead ends: 26 [2018-10-26 21:15:01,722 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:15:01,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-10-26 21:15:01,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-10-26 21:15:01,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-26 21:15:01,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-10-26 21:15:01,756 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 13 [2018-10-26 21:15:01,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:15:01,756 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-10-26 21:15:01,757 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:15:01,757 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-10-26 21:15:01,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-26 21:15:01,758 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:15:01,758 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:15:01,759 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:15:01,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:15:01,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1945633833, now seen corresponding path program 1 times [2018-10-26 21:15:01,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:15:01,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:15:01,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:15:01,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:15:01,761 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:15:01,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:15:01,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:15:01,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:15:01,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 21:15:01,871 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:15:01,873 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:15:01,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:15:01,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:15:01,873 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 5 states. [2018-10-26 21:15:01,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:15:01,933 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2018-10-26 21:15:01,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 21:15:01,934 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-10-26 21:15:01,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:15:01,935 INFO L225 Difference]: With dead ends: 44 [2018-10-26 21:15:01,935 INFO L226 Difference]: Without dead ends: 32 [2018-10-26 21:15:01,936 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:15:01,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-10-26 21:15:01,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-10-26 21:15:01,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-26 21:15:01,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-10-26 21:15:01,943 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 20 [2018-10-26 21:15:01,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:15:01,944 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-10-26 21:15:01,944 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:15:01,944 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-10-26 21:15:01,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-26 21:15:01,945 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:15:01,945 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:15:01,945 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:15:01,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:15:01,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1974262984, now seen corresponding path program 1 times [2018-10-26 21:15:01,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:15:01,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:15:01,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:15:01,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:15:01,947 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:15:01,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:15:02,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:15:02,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:15:02,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-26 21:15:02,301 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:15:02,301 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-26 21:15:02,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-26 21:15:02,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-26 21:15:02,302 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 8 states. [2018-10-26 21:15:02,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:15:02,369 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-10-26 21:15:02,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-26 21:15:02,371 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-10-26 21:15:02,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:15:02,372 INFO L225 Difference]: With dead ends: 36 [2018-10-26 21:15:02,372 INFO L226 Difference]: Without dead ends: 32 [2018-10-26 21:15:02,372 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-10-26 21:15:02,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-10-26 21:15:02,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-10-26 21:15:02,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-26 21:15:02,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-10-26 21:15:02,378 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 20 [2018-10-26 21:15:02,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:15:02,378 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-10-26 21:15:02,378 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-26 21:15:02,378 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-10-26 21:15:02,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-26 21:15:02,379 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:15:02,379 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:15:02,380 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:15:02,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:15:02,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1423155149, now seen corresponding path program 1 times [2018-10-26 21:15:02,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:15:02,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:15:02,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:15:02,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:15:02,381 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:15:02,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:15:02,458 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-26 21:15:02,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:15:02,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 21:15:02,459 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:15:02,459 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:15:02,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:15:02,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:15:02,460 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 5 states. [2018-10-26 21:15:02,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:15:02,558 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2018-10-26 21:15:02,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 21:15:02,559 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-10-26 21:15:02,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:15:02,560 INFO L225 Difference]: With dead ends: 48 [2018-10-26 21:15:02,560 INFO L226 Difference]: Without dead ends: 36 [2018-10-26 21:15:02,561 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:15:02,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-26 21:15:02,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-10-26 21:15:02,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-26 21:15:02,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-10-26 21:15:02,566 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 27 [2018-10-26 21:15:02,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:15:02,567 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-10-26 21:15:02,567 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:15:02,567 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-10-26 21:15:02,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-26 21:15:02,568 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:15:02,568 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:15:02,568 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:15:02,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:15:02,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1226641644, now seen corresponding path program 1 times [2018-10-26 21:15:02,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:15:02,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:15:02,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:15:02,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:15:02,570 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:15:02,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:15:02,640 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-26 21:15:02,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:15:02,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 21:15:02,641 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:15:02,641 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:15:02,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:15:02,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:15:02,642 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 5 states. [2018-10-26 21:15:02,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:15:02,691 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-10-26 21:15:02,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 21:15:02,691 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-10-26 21:15:02,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:15:02,692 INFO L225 Difference]: With dead ends: 40 [2018-10-26 21:15:02,692 INFO L226 Difference]: Without dead ends: 36 [2018-10-26 21:15:02,693 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:15:02,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-26 21:15:02,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-10-26 21:15:02,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-26 21:15:02,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-10-26 21:15:02,698 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 27 [2018-10-26 21:15:02,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:15:02,698 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-10-26 21:15:02,698 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:15:02,698 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-10-26 21:15:02,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-26 21:15:02,699 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:15:02,699 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:15:02,699 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:15:02,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:15:02,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1255270795, now seen corresponding path program 1 times [2018-10-26 21:15:02,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:15:02,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:15:02,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:15:02,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:15:02,701 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:15:02,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:15:03,155 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-26 21:15:03,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:15:03,156 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 21:15:03,157 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-10-26 21:15:03,158 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [7], [11], [12], [16], [18], [21], [23], [29], [32], [33], [35], [39], [40], [41], [42], [43], [44], [45], [47], [48], [49], [50] [2018-10-26 21:15:03,206 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 21:15:03,206 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 21:15:03,304 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 21:15:03,421 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 21:15:03,422 INFO L272 AbstractInterpreter]: Visited 24 different actions 60 times. Merged at 10 different actions 16 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 5 variables. [2018-10-26 21:15:03,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:15:03,437 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 21:15:03,539 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 74.44% of their original sizes. [2018-10-26 21:15:03,539 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 21:15:03,863 INFO L415 sIntCurrentIteration]: We unified 26 AI predicates to 26 [2018-10-26 21:15:03,864 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 21:15:03,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 21:15:03,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [11] total 22 [2018-10-26 21:15:03,865 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:15:03,865 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-26 21:15:03,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-26 21:15:03,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-10-26 21:15:03,866 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 13 states. [2018-10-26 21:15:04,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:15:04,514 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2018-10-26 21:15:04,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-26 21:15:04,514 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2018-10-26 21:15:04,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:15:04,515 INFO L225 Difference]: With dead ends: 56 [2018-10-26 21:15:04,515 INFO L226 Difference]: Without dead ends: 40 [2018-10-26 21:15:04,516 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2018-10-26 21:15:04,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-10-26 21:15:04,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2018-10-26 21:15:04,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-26 21:15:04,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-10-26 21:15:04,523 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 27 [2018-10-26 21:15:04,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:15:04,523 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-10-26 21:15:04,523 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-26 21:15:04,523 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-10-26 21:15:04,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-26 21:15:04,524 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:15:04,524 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:15:04,525 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:15:04,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:15:04,525 INFO L82 PathProgramCache]: Analyzing trace with hash 906172561, now seen corresponding path program 1 times [2018-10-26 21:15:04,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:15:04,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:15:04,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:15:04,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:15:04,526 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:15:04,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:15:04,679 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-26 21:15:04,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:15:04,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 21:15:04,680 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:15:04,680 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:15:04,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:15:04,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:15:04,681 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 5 states. [2018-10-26 21:15:04,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:15:04,719 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-10-26 21:15:04,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 21:15:04,721 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-10-26 21:15:04,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:15:04,722 INFO L225 Difference]: With dead ends: 54 [2018-10-26 21:15:04,722 INFO L226 Difference]: Without dead ends: 40 [2018-10-26 21:15:04,723 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:15:04,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-10-26 21:15:04,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-10-26 21:15:04,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-10-26 21:15:04,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-10-26 21:15:04,727 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 34 [2018-10-26 21:15:04,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:15:04,728 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2018-10-26 21:15:04,728 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:15:04,728 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-10-26 21:15:04,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-26 21:15:04,729 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:15:04,729 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:15:04,729 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:15:04,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:15:04,730 INFO L82 PathProgramCache]: Analyzing trace with hash 709659056, now seen corresponding path program 1 times [2018-10-26 21:15:04,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:15:04,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:15:04,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:15:04,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:15:04,731 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:15:04,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:15:05,229 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-26 21:15:05,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:15:05,229 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 21:15:05,230 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-10-26 21:15:05,230 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [5], [7], [11], [12], [16], [18], [21], [23], [29], [33], [35], [39], [40], [41], [42], [43], [44], [45], [47], [48], [49], [50] [2018-10-26 21:15:05,231 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 21:15:05,232 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 21:15:05,236 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 21:15:05,279 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 21:15:05,279 INFO L272 AbstractInterpreter]: Visited 24 different actions 47 times. Merged at 8 different actions 8 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 5 variables. [2018-10-26 21:15:05,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:15:05,292 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 21:15:05,339 INFO L227 lantSequenceWeakener]: Weakened 21 states. On average, predicates are now at 73.02% of their original sizes. [2018-10-26 21:15:05,343 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 21:15:05,754 INFO L415 sIntCurrentIteration]: We unified 33 AI predicates to 33 [2018-10-26 21:15:05,754 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 21:15:05,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 21:15:05,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [14] total 28 [2018-10-26 21:15:05,755 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:15:05,755 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-26 21:15:05,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-26 21:15:05,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2018-10-26 21:15:05,756 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 16 states. [2018-10-26 21:15:06,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:15:06,525 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2018-10-26 21:15:06,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-26 21:15:06,525 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 34 [2018-10-26 21:15:06,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:15:06,526 INFO L225 Difference]: With dead ends: 72 [2018-10-26 21:15:06,526 INFO L226 Difference]: Without dead ends: 52 [2018-10-26 21:15:06,527 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 42 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2018-10-26 21:15:06,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-10-26 21:15:06,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 42. [2018-10-26 21:15:06,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-10-26 21:15:06,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-10-26 21:15:06,534 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 34 [2018-10-26 21:15:06,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:15:06,534 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-10-26 21:15:06,534 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-26 21:15:06,534 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-10-26 21:15:06,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-26 21:15:06,535 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:15:06,535 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:15:06,535 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:15:06,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:15:06,536 INFO L82 PathProgramCache]: Analyzing trace with hash -797786941, now seen corresponding path program 2 times [2018-10-26 21:15:06,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:15:06,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:15:06,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:15:06,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:15:06,540 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:15:06,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:15:06,816 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-26 21:15:06,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:15:06,816 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 21:15:06,817 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 21:15:06,818 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 21:15:06,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:15:06,818 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c477e7a8-0515-4927-bd0a-0ceac13e4bf5/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:15:06,837 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 21:15:06,837 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-26 21:15:06,860 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-26 21:15:06,860 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 21:15:06,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:15:06,947 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-26 21:15:06,947 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 21:15:07,165 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-26 21:15:07,183 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-26 21:15:07,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [17] total 23 [2018-10-26 21:15:07,183 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:15:07,184 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:15:07,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:15:07,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2018-10-26 21:15:07,184 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 5 states. [2018-10-26 21:15:07,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:15:07,194 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-10-26 21:15:07,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 21:15:07,195 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-10-26 21:15:07,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:15:07,195 INFO L225 Difference]: With dead ends: 42 [2018-10-26 21:15:07,195 INFO L226 Difference]: Without dead ends: 0 [2018-10-26 21:15:07,196 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2018-10-26 21:15:07,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-26 21:15:07,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-26 21:15:07,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-26 21:15:07,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-26 21:15:07,197 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2018-10-26 21:15:07,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:15:07,197 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-26 21:15:07,197 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:15:07,197 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-26 21:15:07,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-26 21:15:07,201 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-26 21:15:07,222 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-10-26 21:15:07,222 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-26 21:15:07,222 INFO L425 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2018-10-26 21:15:07,222 INFO L421 ceAbstractionStarter]: At program point L16(line 16) the Hoare annotation is: (not (= id2_~x 0)) [2018-10-26 21:15:07,223 INFO L425 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2018-10-26 21:15:07,223 INFO L425 ceAbstractionStarter]: For program point L16-1(line 16) no Hoare annotation was computed. [2018-10-26 21:15:07,223 INFO L425 ceAbstractionStarter]: For program point id2EXIT(lines 14 19) no Hoare annotation was computed. [2018-10-26 21:15:07,223 INFO L428 ceAbstractionStarter]: At program point id2ENTRY(lines 14 19) the Hoare annotation is: true [2018-10-26 21:15:07,223 INFO L425 ceAbstractionStarter]: For program point id2FINAL(lines 14 19) no Hoare annotation was computed. [2018-10-26 21:15:07,223 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-26 21:15:07,223 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-26 21:15:07,223 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-26 21:15:07,223 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-26 21:15:07,223 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 21 27) the Hoare annotation is: true [2018-10-26 21:15:07,223 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-10-26 21:15:07,223 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 21 27) no Hoare annotation was computed. [2018-10-26 21:15:07,224 INFO L425 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2018-10-26 21:15:07,224 INFO L428 ceAbstractionStarter]: At program point L23(line 23) the Hoare annotation is: true [2018-10-26 21:15:07,224 INFO L425 ceAbstractionStarter]: For program point L23-1(line 23) no Hoare annotation was computed. [2018-10-26 21:15:07,224 INFO L425 ceAbstractionStarter]: For program point L24-2(lines 21 27) no Hoare annotation was computed. [2018-10-26 21:15:07,224 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 25) no Hoare annotation was computed. [2018-10-26 21:15:07,224 INFO L425 ceAbstractionStarter]: For program point idFINAL(lines 7 12) no Hoare annotation was computed. [2018-10-26 21:15:07,224 INFO L425 ceAbstractionStarter]: For program point idEXIT(lines 7 12) no Hoare annotation was computed. [2018-10-26 21:15:07,224 INFO L425 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2018-10-26 21:15:07,224 INFO L421 ceAbstractionStarter]: At program point L9(line 9) the Hoare annotation is: (not (= id_~x 0)) [2018-10-26 21:15:07,224 INFO L425 ceAbstractionStarter]: For program point L8(line 8) no Hoare annotation was computed. [2018-10-26 21:15:07,224 INFO L425 ceAbstractionStarter]: For program point L9-1(line 9) no Hoare annotation was computed. [2018-10-26 21:15:07,224 INFO L428 ceAbstractionStarter]: At program point idENTRY(lines 7 12) the Hoare annotation is: true [2018-10-26 21:15:07,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 09:15:07 BoogieIcfgContainer [2018-10-26 21:15:07,227 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 21:15:07,227 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 21:15:07,227 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 21:15:07,227 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 21:15:07,228 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:15:01" (3/4) ... [2018-10-26 21:15:07,231 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-26 21:15:07,236 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-26 21:15:07,236 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure id2 [2018-10-26 21:15:07,236 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-26 21:15:07,236 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure id [2018-10-26 21:15:07,241 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-10-26 21:15:07,241 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-10-26 21:15:07,241 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-10-26 21:15:07,272 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_c477e7a8-0515-4927-bd0a-0ceac13e4bf5/bin-2019/utaipan/witness.graphml [2018-10-26 21:15:07,272 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 21:15:07,273 INFO L168 Benchmark]: Toolchain (without parser) took 6582.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 961.8 MB in the beginning and 1.0 GB in the end (delta: -54.2 MB). Peak memory consumption was 97.4 MB. Max. memory is 11.5 GB. [2018-10-26 21:15:07,274 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 21:15:07,275 INFO L168 Benchmark]: CACSL2BoogieTranslator took 198.45 ms. Allocated memory is still 1.0 GB. Free memory was 961.8 MB in the beginning and 951.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-10-26 21:15:07,275 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.30 ms. Allocated memory is still 1.0 GB. Free memory is still 951.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 21:15:07,275 INFO L168 Benchmark]: Boogie Preprocessor took 16.98 ms. Allocated memory is still 1.0 GB. Free memory was 951.1 MB in the beginning and 948.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-26 21:15:07,276 INFO L168 Benchmark]: RCFGBuilder took 396.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 948.4 MB in the beginning and 1.1 GB in the end (delta: -192.4 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. [2018-10-26 21:15:07,276 INFO L168 Benchmark]: TraceAbstraction took 5902.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 121.3 MB). Peak memory consumption was 121.3 MB. Max. memory is 11.5 GB. [2018-10-26 21:15:07,279 INFO L168 Benchmark]: Witness Printer took 45.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-10-26 21:15:07,281 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 198.45 ms. Allocated memory is still 1.0 GB. Free memory was 961.8 MB in the beginning and 951.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.30 ms. Allocated memory is still 1.0 GB. Free memory is still 951.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.98 ms. Allocated memory is still 1.0 GB. Free memory was 951.1 MB in the beginning and 948.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 396.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 948.4 MB in the beginning and 1.1 GB in the end (delta: -192.4 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5902.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 121.3 MB). Peak memory consumption was 121.3 MB. Max. memory is 11.5 GB. * Witness Printer took 45.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 25]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 28 locations, 1 error locations. SAFE Result, 5.8s OverallTime, 9 OverallIterations, 3 TraceHistogramMax, 1.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 262 SDtfs, 42 SDslu, 1234 SDs, 0 SdLazy, 97 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 206 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 2 AbstIntIterations, 2 AbstIntStrong, 0.8779661016949148 AbsIntWeakeningRatio, 0.6271186440677966 AbsIntAvgWeakeningVarsNumRemoved, 0.9322033898305084 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 26 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 11 PreInvPairs, 11 NumberOfFragments, 15 HoareAnnotationTreeSize, 11 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 284 NumberOfCodeBlocks, 270 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 314 ConstructedInterpolants, 0 QuantifiedInterpolants, 24688 SizeOfPredicates, 3 NumberOfNonLiveVariables, 60 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 80/100 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...