./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/reducercommutativity/rangesum60_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b9821446-f850-48e2-b805-d1cf1bf34a6c/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b9821446-f850-48e2-b805-d1cf1bf34a6c/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b9821446-f850-48e2-b805-d1cf1bf34a6c/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b9821446-f850-48e2-b805-d1cf1bf34a6c/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/reducercommutativity/rangesum60_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_b9821446-f850-48e2-b805-d1cf1bf34a6c/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b9821446-f850-48e2-b805-d1cf1bf34a6c/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 4405509d043dde59d941f33192dd2cdce1daabca ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 11:00:17,641 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 11:00:17,642 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 11:00:17,648 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 11:00:17,648 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 11:00:17,649 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 11:00:17,650 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 11:00:17,651 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 11:00:17,651 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 11:00:17,652 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 11:00:17,652 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 11:00:17,652 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 11:00:17,653 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 11:00:17,653 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 11:00:17,654 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 11:00:17,654 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 11:00:17,655 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 11:00:17,656 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 11:00:17,657 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 11:00:17,657 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 11:00:17,658 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 11:00:17,659 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 11:00:17,660 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 11:00:17,660 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 11:00:17,660 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 11:00:17,661 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 11:00:17,661 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 11:00:17,662 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 11:00:17,662 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 11:00:17,663 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 11:00:17,663 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 11:00:17,663 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 11:00:17,663 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 11:00:17,663 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 11:00:17,664 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 11:00:17,664 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 11:00:17,664 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b9821446-f850-48e2-b805-d1cf1bf34a6c/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 11:00:17,671 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 11:00:17,672 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 11:00:17,672 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 11:00:17,672 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 11:00:17,672 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 11:00:17,672 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 11:00:17,672 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 11:00:17,672 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 11:00:17,673 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 11:00:17,673 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 11:00:17,673 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 11:00:17,673 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 11:00:17,673 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 11:00:17,673 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 11:00:17,673 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 11:00:17,673 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 11:00:17,674 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 11:00:17,674 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 11:00:17,674 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 11:00:17,674 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 11:00:17,674 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 11:00:17,674 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 11:00:17,674 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 11:00:17,674 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 11:00:17,674 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 11:00:17,674 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 11:00:17,675 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 11:00:17,675 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 11:00:17,675 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 11:00:17,675 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 11:00:17,675 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 11:00:17,675 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 11:00:17,675 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 11:00:17,675 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 11:00:17,675 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 11:00:17,675 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 11:00:17,675 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_b9821446-f850-48e2-b805-d1cf1bf34a6c/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 -> 4405509d043dde59d941f33192dd2cdce1daabca [2018-12-09 11:00:17,694 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 11:00:17,703 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 11:00:17,706 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 11:00:17,707 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 11:00:17,707 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 11:00:17,708 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b9821446-f850-48e2-b805-d1cf1bf34a6c/bin-2019/utaipan/../../sv-benchmarks/c/reducercommutativity/rangesum60_false-unreach-call.i [2018-12-09 11:00:17,750 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b9821446-f850-48e2-b805-d1cf1bf34a6c/bin-2019/utaipan/data/1cb9a7dab/9c0a3ffd4fa84590997575b4c8c8abb4/FLAG487ba5dda [2018-12-09 11:00:18,173 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 11:00:18,173 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b9821446-f850-48e2-b805-d1cf1bf34a6c/sv-benchmarks/c/reducercommutativity/rangesum60_false-unreach-call.i [2018-12-09 11:00:18,177 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b9821446-f850-48e2-b805-d1cf1bf34a6c/bin-2019/utaipan/data/1cb9a7dab/9c0a3ffd4fa84590997575b4c8c8abb4/FLAG487ba5dda [2018-12-09 11:00:18,184 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b9821446-f850-48e2-b805-d1cf1bf34a6c/bin-2019/utaipan/data/1cb9a7dab/9c0a3ffd4fa84590997575b4c8c8abb4 [2018-12-09 11:00:18,186 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 11:00:18,187 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 11:00:18,187 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 11:00:18,187 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 11:00:18,189 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 11:00:18,190 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 11:00:18" (1/1) ... [2018-12-09 11:00:18,191 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c2778c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:00:18, skipping insertion in model container [2018-12-09 11:00:18,191 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 11:00:18" (1/1) ... [2018-12-09 11:00:18,197 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 11:00:18,206 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 11:00:18,296 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 11:00:18,301 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 11:00:18,314 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 11:00:18,322 INFO L195 MainTranslator]: Completed translation [2018-12-09 11:00:18,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:00:18 WrapperNode [2018-12-09 11:00:18,323 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 11:00:18,323 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 11:00:18,323 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 11:00:18,323 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 11:00:18,328 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:00:18" (1/1) ... [2018-12-09 11:00:18,334 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:00:18" (1/1) ... [2018-12-09 11:00:18,345 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 11:00:18,345 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 11:00:18,345 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 11:00:18,345 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 11:00:18,351 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:00:18" (1/1) ... [2018-12-09 11:00:18,352 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:00:18" (1/1) ... [2018-12-09 11:00:18,353 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:00:18" (1/1) ... [2018-12-09 11:00:18,353 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:00:18" (1/1) ... [2018-12-09 11:00:18,357 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:00:18" (1/1) ... [2018-12-09 11:00:18,360 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:00:18" (1/1) ... [2018-12-09 11:00:18,361 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:00:18" (1/1) ... [2018-12-09 11:00:18,385 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 11:00:18,385 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 11:00:18,385 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 11:00:18,385 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 11:00:18,386 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:00:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b9821446-f850-48e2-b805-d1cf1bf34a6c/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-12-09 11:00:18,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 11:00:18,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 11:00:18,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 11:00:18,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 11:00:18,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 11:00:18,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 11:00:18,418 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 11:00:18,418 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 11:00:18,418 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 11:00:18,418 INFO L130 BoogieDeclarations]: Found specification of procedure rangesum [2018-12-09 11:00:18,418 INFO L138 BoogieDeclarations]: Found implementation of procedure rangesum [2018-12-09 11:00:18,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 11:00:18,418 INFO L130 BoogieDeclarations]: Found specification of procedure init_nondet [2018-12-09 11:00:18,418 INFO L138 BoogieDeclarations]: Found implementation of procedure init_nondet [2018-12-09 11:00:18,542 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 11:00:18,542 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-12-09 11:00:18,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 11:00:18 BoogieIcfgContainer [2018-12-09 11:00:18,542 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 11:00:18,543 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 11:00:18,543 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 11:00:18,545 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 11:00:18,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 11:00:18" (1/3) ... [2018-12-09 11:00:18,545 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ebb62cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 11:00:18, skipping insertion in model container [2018-12-09 11:00:18,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:00:18" (2/3) ... [2018-12-09 11:00:18,546 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ebb62cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 11:00:18, skipping insertion in model container [2018-12-09 11:00:18,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 11:00:18" (3/3) ... [2018-12-09 11:00:18,547 INFO L112 eAbstractionObserver]: Analyzing ICFG rangesum60_false-unreach-call.i [2018-12-09 11:00:18,553 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 11:00:18,557 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 11:00:18,567 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 11:00:18,586 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 11:00:18,586 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 11:00:18,586 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 11:00:18,586 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 11:00:18,586 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 11:00:18,586 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 11:00:18,586 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 11:00:18,586 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 11:00:18,596 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-12-09 11:00:18,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-09 11:00:18,600 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:00:18,601 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:00:18,602 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:00:18,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:00:18,606 INFO L82 PathProgramCache]: Analyzing trace with hash -332770493, now seen corresponding path program 1 times [2018-12-09 11:00:18,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:00:18,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:00:18,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:00:18,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:00:18,637 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:00:18,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:00:18,684 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2018-12-09 11:00:18,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:00:18,684 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 11:00:18,685 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2018-12-09 11:00:18,686 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [7], [9], [11], [17], [25], [27], [30], [31], [38], [55], [59], [61], [62], [68], [76], [77], [78], [79], [81], [82], [83], [84], [85], [86], [87], [88] [2018-12-09 11:00:18,709 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 11:00:18,709 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 11:00:18,777 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 11:00:18,777 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 57 root evaluator evaluations with a maximum evaluation depth of 3. Performed 57 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 23 variables. [2018-12-09 11:00:18,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:00:18,783 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 11:00:18,815 INFO L227 lantSequenceWeakener]: Weakened 7 states. On average, predicates are now at 88.89% of their original sizes. [2018-12-09 11:00:18,815 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 11:00:18,834 INFO L418 sIntCurrentIteration]: We unified 36 AI predicates to 36 [2018-12-09 11:00:18,835 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 11:00:18,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:00:18,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 11:00:18,836 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:00:18,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 11:00:18,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 11:00:18,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 11:00:18,843 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 5 states. [2018-12-09 11:00:18,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:00:18,949 INFO L93 Difference]: Finished difference Result 66 states and 89 transitions. [2018-12-09 11:00:18,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 11:00:18,950 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-12-09 11:00:18,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:00:18,955 INFO L225 Difference]: With dead ends: 66 [2018-12-09 11:00:18,955 INFO L226 Difference]: Without dead ends: 34 [2018-12-09 11:00:18,957 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 11:00:18,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-09 11:00:18,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-12-09 11:00:18,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-09 11:00:18,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2018-12-09 11:00:18,980 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 37 [2018-12-09 11:00:18,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:00:18,981 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-12-09 11:00:18,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 11:00:18,981 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-12-09 11:00:18,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-09 11:00:18,982 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:00:18,982 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:00:18,982 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:00:18,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:00:18,983 INFO L82 PathProgramCache]: Analyzing trace with hash 479004822, now seen corresponding path program 1 times [2018-12-09 11:00:18,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:00:18,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:00:18,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:00:18,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:00:18,983 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:00:18,994 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-09 11:00:18,994 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-09 11:00:18,994 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b9821446-f850-48e2-b805-d1cf1bf34a6c/bin-2019/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 [2018-12-09 11:00:19,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:00:19,003 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-09 11:00:19,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:00:19,041 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2018-12-09 11:00:19,041 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [7], [9], [11], [17], [25], [27], [30], [31], [38], [44], [59], [61], [62], [68], [70], [72], [76], [77], [78], [79], [81], [82], [83], [84], [85], [86], [87], [88] [2018-12-09 11:00:19,043 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 11:00:19,043 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 11:00:19,074 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 11:00:19,075 INFO L272 AbstractInterpreter]: Visited 17 different actions 26 times. Merged at 2 different actions 6 times. Never widened. Performed 151 root evaluator evaluations with a maximum evaluation depth of 3. Performed 151 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 23 variables. [2018-12-09 11:00:19,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:00:19,077 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 11:00:19,101 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 85.4% of their original sizes. [2018-12-09 11:00:19,101 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 11:00:19,129 INFO L418 sIntCurrentIteration]: We unified 38 AI predicates to 38 [2018-12-09 11:00:19,129 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 11:00:19,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:00:19,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 11:00:19,129 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:00:19,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 11:00:19,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 11:00:19,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 11:00:19,131 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 7 states. [2018-12-09 11:00:19,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:00:19,307 INFO L93 Difference]: Finished difference Result 54 states and 69 transitions. [2018-12-09 11:00:19,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 11:00:19,307 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-12-09 11:00:19,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:00:19,308 INFO L225 Difference]: With dead ends: 54 [2018-12-09 11:00:19,308 INFO L226 Difference]: Without dead ends: 36 [2018-12-09 11:00:19,309 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-09 11:00:19,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-09 11:00:19,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-12-09 11:00:19,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-09 11:00:19,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2018-12-09 11:00:19,316 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 39 [2018-12-09 11:00:19,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:00:19,316 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2018-12-09 11:00:19,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 11:00:19,316 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2018-12-09 11:00:19,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-09 11:00:19,317 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:00:19,317 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:00:19,318 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:00:19,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:00:19,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1719401286, now seen corresponding path program 1 times [2018-12-09 11:00:19,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:00:19,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:00:19,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:00:19,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:00:19,319 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:00:19,326 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-09 11:00:19,326 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-09 11:00:19,326 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b9821446-f850-48e2-b805-d1cf1bf34a6c/bin-2019/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 [2018-12-09 11:00:19,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:00:19,335 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-09 11:00:19,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:00:19,359 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 49 with the following transitions: [2018-12-09 11:00:19,359 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [7], [9], [11], [17], [25], [27], [30], [31], [38], [44], [46], [51], [53], [59], [61], [62], [68], [70], [72], [76], [77], [78], [79], [81], [82], [83], [84], [85], [86], [87], [88] [2018-12-09 11:00:19,361 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 11:00:19,361 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 11:00:19,466 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 11:00:19,466 INFO L272 AbstractInterpreter]: Visited 21 different actions 38 times. Merged at 5 different actions 12 times. Never widened. Performed 185 root evaluator evaluations with a maximum evaluation depth of 10. Performed 185 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Found 3 fixpoints after 3 different actions. Largest state had 23 variables. [2018-12-09 11:00:19,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:00:19,468 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 11:00:19,547 INFO L227 lantSequenceWeakener]: Weakened 19 states. On average, predicates are now at 84.74% of their original sizes. [2018-12-09 11:00:19,548 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 11:00:19,569 INFO L418 sIntCurrentIteration]: We unified 47 AI predicates to 47 [2018-12-09 11:00:19,569 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 11:00:19,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:00:19,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 11:00:19,570 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:00:19,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 11:00:19,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 11:00:19,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 11:00:19,570 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand 7 states. [2018-12-09 11:00:19,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:00:19,743 INFO L93 Difference]: Finished difference Result 61 states and 79 transitions. [2018-12-09 11:00:19,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 11:00:19,743 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-12-09 11:00:19,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:00:19,745 INFO L225 Difference]: With dead ends: 61 [2018-12-09 11:00:19,745 INFO L226 Difference]: Without dead ends: 41 [2018-12-09 11:00:19,746 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-09 11:00:19,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-09 11:00:19,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2018-12-09 11:00:19,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-09 11:00:19,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2018-12-09 11:00:19,753 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 48 [2018-12-09 11:00:19,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:00:19,753 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2018-12-09 11:00:19,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 11:00:19,753 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2018-12-09 11:00:19,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-09 11:00:19,754 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:00:19,754 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:00:19,754 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:00:19,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:00:19,755 INFO L82 PathProgramCache]: Analyzing trace with hash 496221539, now seen corresponding path program 1 times [2018-12-09 11:00:19,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:00:19,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:00:19,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:00:19,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:00:19,756 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:00:19,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:00:19,807 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-09 11:00:19,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:00:19,807 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 11:00:19,808 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 49 with the following transitions: [2018-12-09 11:00:19,808 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [7], [9], [11], [17], [25], [27], [30], [31], [38], [44], [46], [51], [53], [60], [61], [62], [68], [70], [72], [76], [77], [78], [79], [81], [82], [83], [84], [85], [86], [87], [88] [2018-12-09 11:00:19,809 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 11:00:19,809 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 11:00:19,853 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 11:00:19,854 INFO L272 AbstractInterpreter]: Visited 28 different actions 75 times. Merged at 8 different actions 30 times. Widened at 1 different actions 1 times. Performed 323 root evaluator evaluations with a maximum evaluation depth of 3. Performed 323 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 7 fixpoints after 5 different actions. Largest state had 23 variables. [2018-12-09 11:00:19,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:00:19,856 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 11:00:19,889 INFO L227 lantSequenceWeakener]: Weakened 33 states. On average, predicates are now at 83.4% of their original sizes. [2018-12-09 11:00:19,889 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 11:00:19,962 INFO L418 sIntCurrentIteration]: We unified 47 AI predicates to 47 [2018-12-09 11:00:19,962 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 11:00:19,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 11:00:19,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [4] total 14 [2018-12-09 11:00:19,962 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:00:19,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 11:00:19,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 11:00:19,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-12-09 11:00:19,963 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand 12 states. [2018-12-09 11:00:20,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:00:20,837 INFO L93 Difference]: Finished difference Result 74 states and 93 transitions. [2018-12-09 11:00:20,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 11:00:20,837 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2018-12-09 11:00:20,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:00:20,838 INFO L225 Difference]: With dead ends: 74 [2018-12-09 11:00:20,838 INFO L226 Difference]: Without dead ends: 55 [2018-12-09 11:00:20,838 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-12-09 11:00:20,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-09 11:00:20,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 45. [2018-12-09 11:00:20,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-09 11:00:20,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2018-12-09 11:00:20,846 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 48 [2018-12-09 11:00:20,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:00:20,846 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2018-12-09 11:00:20,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 11:00:20,847 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2018-12-09 11:00:20,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 11:00:20,848 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:00:20,848 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:00:20,848 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:00:20,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:00:20,849 INFO L82 PathProgramCache]: Analyzing trace with hash 125205893, now seen corresponding path program 1 times [2018-12-09 11:00:20,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:00:20,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:00:20,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:00:20,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:00:20,850 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:00:20,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:00:20,885 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-09 11:00:20,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:00:20,886 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 11:00:20,886 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 51 with the following transitions: [2018-12-09 11:00:20,886 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [7], [9], [11], [17], [19], [21], [25], [27], [30], [31], [38], [44], [46], [51], [53], [60], [61], [62], [68], [70], [72], [76], [77], [78], [79], [81], [82], [83], [84], [85], [86], [87], [88] [2018-12-09 11:00:20,888 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 11:00:20,888 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 11:00:20,943 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 11:00:20,943 INFO L272 AbstractInterpreter]: Visited 35 different actions 129 times. Merged at 14 different actions 54 times. Widened at 2 different actions 2 times. Performed 550 root evaluator evaluations with a maximum evaluation depth of 3. Performed 550 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 11 fixpoints after 7 different actions. Largest state had 25 variables. [2018-12-09 11:00:20,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:00:20,947 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 11:00:20,984 INFO L227 lantSequenceWeakener]: Weakened 47 states. On average, predicates are now at 81.06% of their original sizes. [2018-12-09 11:00:20,984 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 11:00:21,066 INFO L418 sIntCurrentIteration]: We unified 49 AI predicates to 49 [2018-12-09 11:00:21,066 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 11:00:21,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 11:00:21,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [4] total 16 [2018-12-09 11:00:21,067 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:00:21,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 11:00:21,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 11:00:21,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-12-09 11:00:21,068 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. Second operand 14 states. [2018-12-09 11:00:21,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:00:21,460 INFO L93 Difference]: Finished difference Result 66 states and 81 transitions. [2018-12-09 11:00:21,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 11:00:21,460 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 50 [2018-12-09 11:00:21,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:00:21,461 INFO L225 Difference]: With dead ends: 66 [2018-12-09 11:00:21,461 INFO L226 Difference]: Without dead ends: 62 [2018-12-09 11:00:21,461 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 55 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2018-12-09 11:00:21,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-09 11:00:21,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 49. [2018-12-09 11:00:21,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-09 11:00:21,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2018-12-09 11:00:21,466 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 63 transitions. Word has length 50 [2018-12-09 11:00:21,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:00:21,466 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 63 transitions. [2018-12-09 11:00:21,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 11:00:21,466 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 63 transitions. [2018-12-09 11:00:21,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-09 11:00:21,467 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:00:21,467 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:00:21,467 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:00:21,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:00:21,467 INFO L82 PathProgramCache]: Analyzing trace with hash 395797120, now seen corresponding path program 1 times [2018-12-09 11:00:21,467 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:00:21,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:00:21,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:00:21,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:00:21,468 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:00:21,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:00:21,481 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2018-12-09 11:00:21,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:00:21,481 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 11:00:21,481 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 52 with the following transitions: [2018-12-09 11:00:21,481 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [7], [9], [11], [17], [25], [27], [30], [31], [38], [44], [46], [49], [51], [53], [59], [60], [61], [62], [68], [70], [72], [76], [77], [78], [79], [81], [82], [83], [84], [85], [86], [87], [88] [2018-12-09 11:00:21,482 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 11:00:21,482 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 11:00:21,651 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 11:00:21,652 INFO L272 AbstractInterpreter]: Visited 30 different actions 155 times. Merged at 14 different actions 73 times. Widened at 1 different actions 3 times. Performed 690 root evaluator evaluations with a maximum evaluation depth of 10. Performed 690 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Found 23 fixpoints after 8 different actions. Largest state had 23 variables. [2018-12-09 11:00:21,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:00:21,655 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 11:00:21,672 INFO L227 lantSequenceWeakener]: Weakened 36 states. On average, predicates are now at 86.31% of their original sizes. [2018-12-09 11:00:21,672 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 11:00:21,704 INFO L418 sIntCurrentIteration]: We unified 50 AI predicates to 50 [2018-12-09 11:00:21,704 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 11:00:21,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:00:21,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 11:00:21,704 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:00:21,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 11:00:21,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 11:00:21,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 11:00:21,705 INFO L87 Difference]: Start difference. First operand 49 states and 63 transitions. Second operand 8 states. [2018-12-09 11:00:21,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:00:21,813 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2018-12-09 11:00:21,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 11:00:21,814 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2018-12-09 11:00:21,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:00:21,814 INFO L225 Difference]: With dead ends: 73 [2018-12-09 11:00:21,814 INFO L226 Difference]: Without dead ends: 52 [2018-12-09 11:00:21,815 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 53 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-12-09 11:00:21,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-09 11:00:21,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2018-12-09 11:00:21,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-09 11:00:21,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2018-12-09 11:00:21,819 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 51 [2018-12-09 11:00:21,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:00:21,819 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2018-12-09 11:00:21,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 11:00:21,819 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2018-12-09 11:00:21,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 11:00:21,820 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:00:21,820 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:00:21,820 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:00:21,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:00:21,820 INFO L82 PathProgramCache]: Analyzing trace with hash -515269076, now seen corresponding path program 1 times [2018-12-09 11:00:21,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:00:21,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:00:21,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:00:21,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:00:21,821 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:00:21,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:00:21,830 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2018-12-09 11:00:21,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:00:21,831 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 11:00:21,831 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 54 with the following transitions: [2018-12-09 11:00:21,831 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [7], [9], [11], [17], [19], [21], [25], [27], [30], [31], [38], [44], [46], [49], [51], [53], [59], [60], [61], [62], [68], [70], [72], [76], [77], [78], [79], [81], [82], [83], [84], [85], [86], [87], [88] [2018-12-09 11:00:21,832 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 11:00:21,832 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 11:00:22,068 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 11:00:22,068 INFO L272 AbstractInterpreter]: Visited 38 different actions 241 times. Merged at 22 different actions 118 times. Widened at 2 different actions 4 times. Performed 1053 root evaluator evaluations with a maximum evaluation depth of 10. Performed 1053 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Found 34 fixpoints after 12 different actions. Largest state had 25 variables. [2018-12-09 11:00:22,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:00:22,070 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 11:00:22,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:00:22,070 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b9821446-f850-48e2-b805-d1cf1bf34a6c/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 11:00:22,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:00:22,079 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 11:00:22,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:00:22,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:00:22,121 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-09 11:00:22,121 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 11:00:22,156 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-09 11:00:22,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 11:00:22,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-12-09 11:00:22,176 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 11:00:22,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 11:00:22,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 11:00:22,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-09 11:00:22,179 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. Second operand 6 states. [2018-12-09 11:00:22,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:00:22,199 INFO L93 Difference]: Finished difference Result 95 states and 125 transitions. [2018-12-09 11:00:22,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 11:00:22,199 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-09 11:00:22,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:00:22,200 INFO L225 Difference]: With dead ends: 95 [2018-12-09 11:00:22,200 INFO L226 Difference]: Without dead ends: 56 [2018-12-09 11:00:22,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-09 11:00:22,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-09 11:00:22,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-12-09 11:00:22,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-09 11:00:22,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2018-12-09 11:00:22,208 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 53 [2018-12-09 11:00:22,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:00:22,208 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2018-12-09 11:00:22,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 11:00:22,209 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2018-12-09 11:00:22,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-09 11:00:22,209 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:00:22,210 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:00:22,210 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:00:22,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:00:22,210 INFO L82 PathProgramCache]: Analyzing trace with hash -871058906, now seen corresponding path program 2 times [2018-12-09 11:00:22,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:00:22,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:00:22,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:00:22,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:00:22,211 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:00:22,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:00:22,233 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2018-12-09 11:00:22,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:00:22,233 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 11:00:22,233 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 11:00:22,233 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 11:00:22,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:00:22,233 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b9821446-f850-48e2-b805-d1cf1bf34a6c/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 11:00:22,242 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 11:00:22,243 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 11:00:22,262 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-09 11:00:22,263 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 11:00:22,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:00:22,280 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 23 proven. 2 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-12-09 11:00:22,280 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 11:00:22,320 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 23 proven. 2 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-12-09 11:00:22,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 11:00:22,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-12-09 11:00:22,338 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 11:00:22,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 11:00:22,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 11:00:22,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-09 11:00:22,339 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand 8 states. [2018-12-09 11:00:22,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:00:22,370 INFO L93 Difference]: Finished difference Result 104 states and 147 transitions. [2018-12-09 11:00:22,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 11:00:22,370 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2018-12-09 11:00:22,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:00:22,372 INFO L225 Difference]: With dead ends: 104 [2018-12-09 11:00:22,372 INFO L226 Difference]: Without dead ends: 69 [2018-12-09 11:00:22,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-09 11:00:22,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-09 11:00:22,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2018-12-09 11:00:22,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-09 11:00:22,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 82 transitions. [2018-12-09 11:00:22,378 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 82 transitions. Word has length 59 [2018-12-09 11:00:22,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:00:22,378 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 82 transitions. [2018-12-09 11:00:22,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 11:00:22,378 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 82 transitions. [2018-12-09 11:00:22,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-09 11:00:22,379 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:00:22,379 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 15, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:00:22,379 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:00:22,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:00:22,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1442887404, now seen corresponding path program 1 times [2018-12-09 11:00:22,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:00:22,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:00:22,380 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:00:22,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:00:22,380 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:00:22,386 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-09 11:00:22,386 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-09 11:00:22,386 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b9821446-f850-48e2-b805-d1cf1bf34a6c/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-09 11:00:22,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:00:22,393 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-09 11:00:22,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:00:22,422 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 102 with the following transitions: [2018-12-09 11:00:22,422 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [7], [9], [11], [17], [19], [21], [25], [27], [30], [31], [38], [44], [46], [49], [51], [53], [59], [61], [62], [68], [70], [72], [76], [77], [78], [79], [81], [82], [83], [84], [85], [86], [87], [88] [2018-12-09 11:00:22,423 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 11:00:22,423 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 11:00:22,587 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 11:00:22,587 INFO L272 AbstractInterpreter]: Visited 37 different actions 167 times. Merged at 17 different actions 71 times. Widened at 2 different actions 3 times. Performed 707 root evaluator evaluations with a maximum evaluation depth of 10. Performed 707 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Found 20 fixpoints after 9 different actions. Largest state had 25 variables. [2018-12-09 11:00:22,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:00:22,588 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 11:00:22,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:00:22,589 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b9821446-f850-48e2-b805-d1cf1bf34a6c/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 11:00:22,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:00:22,595 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 11:00:22,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:00:22,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:00:22,661 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2018-12-09 11:00:22,661 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 11:00:22,716 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2018-12-09 11:00:22,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 11:00:22,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-12-09 11:00:22,731 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 11:00:22,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 11:00:22,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 11:00:22,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-09 11:00:22,732 INFO L87 Difference]: Start difference. First operand 66 states and 82 transitions. Second operand 12 states. [2018-12-09 11:00:22,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:00:22,760 INFO L93 Difference]: Finished difference Result 127 states and 164 transitions. [2018-12-09 11:00:22,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 11:00:22,761 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 101 [2018-12-09 11:00:22,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:00:22,761 INFO L225 Difference]: With dead ends: 127 [2018-12-09 11:00:22,762 INFO L226 Difference]: Without dead ends: 78 [2018-12-09 11:00:22,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-09 11:00:22,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-09 11:00:22,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-12-09 11:00:22,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-09 11:00:22,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 94 transitions. [2018-12-09 11:00:22,768 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 94 transitions. Word has length 101 [2018-12-09 11:00:22,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:00:22,768 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 94 transitions. [2018-12-09 11:00:22,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 11:00:22,768 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 94 transitions. [2018-12-09 11:00:22,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 11:00:22,769 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:00:22,769 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 15, 10, 10, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:00:22,770 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:00:22,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:00:22,770 INFO L82 PathProgramCache]: Analyzing trace with hash -992722080, now seen corresponding path program 2 times [2018-12-09 11:00:22,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:00:22,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:00:22,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:00:22,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:00:22,771 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:00:22,780 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-09 11:00:22,780 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-09 11:00:22,780 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b9821446-f850-48e2-b805-d1cf1bf34a6c/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-09 11:00:22,787 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:00:22,787 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-09 11:00:22,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:00:22,818 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 11:00:22,818 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 11:00:22,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:00:22,818 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b9821446-f850-48e2-b805-d1cf1bf34a6c/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 11:00:22,824 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 11:00:22,825 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 11:00:22,846 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-09 11:00:22,846 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 11:00:22,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:00:22,861 INFO L134 CoverageAnalysis]: Checked inductivity of 629 backedges. 250 proven. 1 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-12-09 11:00:22,861 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 11:00:22,890 INFO L134 CoverageAnalysis]: Checked inductivity of 629 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 628 trivial. 0 not checked. [2018-12-09 11:00:22,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 11:00:22,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-12-09 11:00:22,909 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 11:00:22,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 11:00:22,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 11:00:22,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-09 11:00:22,909 INFO L87 Difference]: Start difference. First operand 78 states and 94 transitions. Second operand 6 states. [2018-12-09 11:00:22,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:00:22,924 INFO L93 Difference]: Finished difference Result 123 states and 152 transitions. [2018-12-09 11:00:22,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 11:00:22,924 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2018-12-09 11:00:22,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:00:22,925 INFO L225 Difference]: With dead ends: 123 [2018-12-09 11:00:22,925 INFO L226 Difference]: Without dead ends: 90 [2018-12-09 11:00:22,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-09 11:00:22,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-09 11:00:22,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-12-09 11:00:22,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-09 11:00:22,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 106 transitions. [2018-12-09 11:00:22,934 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 106 transitions. Word has length 113 [2018-12-09 11:00:22,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:00:22,934 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 106 transitions. [2018-12-09 11:00:22,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 11:00:22,934 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 106 transitions. [2018-12-09 11:00:22,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-09 11:00:22,935 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:00:22,935 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 15, 10, 10, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:00:22,935 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:00:22,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:00:22,935 INFO L82 PathProgramCache]: Analyzing trace with hash -748407238, now seen corresponding path program 3 times [2018-12-09 11:00:22,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:00:22,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:00:22,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:00:22,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:00:22,936 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:00:22,947 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-09 11:00:22,947 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-09 11:00:22,947 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b9821446-f850-48e2-b805-d1cf1bf34a6c/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-09 11:00:22,953 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:00:22,954 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-09 11:00:22,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:00:22,983 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 11:00:22,983 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 11:00:22,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:00:22,983 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b9821446-f850-48e2-b805-d1cf1bf34a6c/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 11:00:22,989 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 11:00:22,989 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-09 11:00:23,016 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 11:00:23,016 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 11:00:23,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:00:23,092 INFO L134 CoverageAnalysis]: Checked inductivity of 644 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-12-09 11:00:23,092 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 11:00:23,207 INFO L134 CoverageAnalysis]: Checked inductivity of 644 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-12-09 11:00:23,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 11:00:23,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-12-09 11:00:23,222 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 11:00:23,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-09 11:00:23,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-09 11:00:23,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-09 11:00:23,223 INFO L87 Difference]: Start difference. First operand 90 states and 106 transitions. Second operand 24 states. [2018-12-09 11:00:23,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:00:23,267 INFO L93 Difference]: Finished difference Result 175 states and 218 transitions. [2018-12-09 11:00:23,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-09 11:00:23,267 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 119 [2018-12-09 11:00:23,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:00:23,268 INFO L225 Difference]: With dead ends: 175 [2018-12-09 11:00:23,268 INFO L226 Difference]: Without dead ends: 114 [2018-12-09 11:00:23,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-09 11:00:23,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-09 11:00:23,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-12-09 11:00:23,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-09 11:00:23,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 130 transitions. [2018-12-09 11:00:23,274 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 130 transitions. Word has length 119 [2018-12-09 11:00:23,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:00:23,274 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 130 transitions. [2018-12-09 11:00:23,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-09 11:00:23,274 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 130 transitions. [2018-12-09 11:00:23,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-09 11:00:23,275 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:00:23,275 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 18, 18, 15, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:00:23,275 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:00:23,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:00:23,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1957844770, now seen corresponding path program 4 times [2018-12-09 11:00:23,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:00:23,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:00:23,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:00:23,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:00:23,276 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:00:23,286 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-09 11:00:23,287 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-09 11:00:23,287 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b9821446-f850-48e2-b805-d1cf1bf34a6c/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-09 11:00:23,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:00:23,293 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-09 11:00:23,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:00:23,327 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 11:00:23,327 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 11:00:23,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:00:23,328 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b9821446-f850-48e2-b805-d1cf1bf34a6c/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 11:00:23,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:00:23,337 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 11:00:23,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:00:23,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:00:23,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1028 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-12-09 11:00:23,529 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 11:00:23,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1028 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-12-09 11:00:23,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 11:00:23,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-12-09 11:00:23,957 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 11:00:23,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-09 11:00:23,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-09 11:00:23,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-09 11:00:23,959 INFO L87 Difference]: Start difference. First operand 114 states and 130 transitions. Second operand 48 states. [2018-12-09 11:00:24,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:00:24,050 INFO L93 Difference]: Finished difference Result 223 states and 278 transitions. [2018-12-09 11:00:24,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-09 11:00:24,050 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 143 [2018-12-09 11:00:24,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:00:24,052 INFO L225 Difference]: With dead ends: 223 [2018-12-09 11:00:24,052 INFO L226 Difference]: Without dead ends: 162 [2018-12-09 11:00:24,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-09 11:00:24,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-12-09 11:00:24,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-12-09 11:00:24,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-12-09 11:00:24,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 178 transitions. [2018-12-09 11:00:24,060 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 178 transitions. Word has length 143 [2018-12-09 11:00:24,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:00:24,060 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 178 transitions. [2018-12-09 11:00:24,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-09 11:00:24,060 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 178 transitions. [2018-12-09 11:00:24,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-12-09 11:00:24,062 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:00:24,062 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 18, 18, 15, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:00:24,062 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:00:24,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:00:24,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1230507790, now seen corresponding path program 5 times [2018-12-09 11:00:24,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:00:24,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:00:24,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:00:24,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:00:24,063 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:00:24,086 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-09 11:00:24,086 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-09 11:00:24,086 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b9821446-f850-48e2-b805-d1cf1bf34a6c/bin-2019/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-09 11:00:24,094 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:00:24,094 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-09 11:00:24,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:00:24,151 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 11:00:24,151 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 11:00:24,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:00:24,151 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b9821446-f850-48e2-b805-d1cf1bf34a6c/bin-2019/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 11:00:24,159 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 11:00:24,159 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 11:00:24,210 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-09 11:00:24,211 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 11:00:24,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:00:24,239 INFO L134 CoverageAnalysis]: Checked inductivity of 2660 backedges. 271 proven. 2 refuted. 0 times theorem prover too weak. 2387 trivial. 0 not checked. [2018-12-09 11:00:24,240 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 11:00:24,279 INFO L134 CoverageAnalysis]: Checked inductivity of 2660 backedges. 271 proven. 2 refuted. 0 times theorem prover too weak. 2387 trivial. 0 not checked. [2018-12-09 11:00:24,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 11:00:24,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-12-09 11:00:24,294 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 11:00:24,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 11:00:24,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 11:00:24,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-09 11:00:24,295 INFO L87 Difference]: Start difference. First operand 162 states and 178 transitions. Second operand 6 states. [2018-12-09 11:00:24,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:00:24,313 INFO L93 Difference]: Finished difference Result 228 states and 269 transitions. [2018-12-09 11:00:24,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 11:00:24,314 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 191 [2018-12-09 11:00:24,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:00:24,314 INFO L225 Difference]: With dead ends: 228 [2018-12-09 11:00:24,314 INFO L226 Difference]: Without dead ends: 171 [2018-12-09 11:00:24,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-09 11:00:24,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-12-09 11:00:24,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-12-09 11:00:24,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-12-09 11:00:24,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 187 transitions. [2018-12-09 11:00:24,322 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 187 transitions. Word has length 191 [2018-12-09 11:00:24,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:00:24,323 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 187 transitions. [2018-12-09 11:00:24,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 11:00:24,323 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 187 transitions. [2018-12-09 11:00:24,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-12-09 11:00:24,324 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:00:24,324 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 27, 27, 15, 12, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:00:24,324 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:00:24,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:00:24,325 INFO L82 PathProgramCache]: Analyzing trace with hash -244392990, now seen corresponding path program 6 times [2018-12-09 11:00:24,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:00:24,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:00:24,325 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:00:24,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:00:24,325 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:00:24,340 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-09 11:00:24,340 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-09 11:00:24,341 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b9821446-f850-48e2-b805-d1cf1bf34a6c/bin-2019/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-09 11:00:24,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:00:24,348 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-09 11:00:24,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:00:24,390 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 11:00:24,390 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 11:00:24,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:00:24,391 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b9821446-f850-48e2-b805-d1cf1bf34a6c/bin-2019/utaipan/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 11:00:24,396 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 11:00:24,397 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-09 11:00:24,447 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 11:00:24,447 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 11:00:24,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:00:25,030 INFO L134 CoverageAnalysis]: Checked inductivity of 3281 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 1165 trivial. 0 not checked. [2018-12-09 11:00:25,031 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 11:00:25,867 INFO L134 CoverageAnalysis]: Checked inductivity of 3281 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 1165 trivial. 0 not checked. [2018-12-09 11:00:25,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 11:00:25,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 62 [2018-12-09 11:00:25,882 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 11:00:25,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-09 11:00:25,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-09 11:00:25,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-09 11:00:25,883 INFO L87 Difference]: Start difference. First operand 171 states and 187 transitions. Second operand 62 states. [2018-12-09 11:00:25,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:00:25,980 INFO L93 Difference]: Finished difference Result 269 states and 314 transitions. [2018-12-09 11:00:25,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-09 11:00:25,980 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 218 [2018-12-09 11:00:25,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:00:25,982 INFO L225 Difference]: With dead ends: 269 [2018-12-09 11:00:25,982 INFO L226 Difference]: Without dead ends: 199 [2018-12-09 11:00:25,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 341 SyntacticMatches, 34 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1003 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-09 11:00:25,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-12-09 11:00:25,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2018-12-09 11:00:25,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-12-09 11:00:25,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 215 transitions. [2018-12-09 11:00:25,990 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 215 transitions. Word has length 218 [2018-12-09 11:00:25,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:00:25,990 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 215 transitions. [2018-12-09 11:00:25,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-09 11:00:25,990 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 215 transitions. [2018-12-09 11:00:25,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-12-09 11:00:25,992 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:00:25,992 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 27, 27, 15, 12, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:00:25,992 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:00:25,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:00:25,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1334240254, now seen corresponding path program 7 times [2018-12-09 11:00:25,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:00:25,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:00:25,993 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:00:25,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:00:25,993 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:00:26,009 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-09 11:00:26,009 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-09 11:00:26,010 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b9821446-f850-48e2-b805-d1cf1bf34a6c/bin-2019/utaipan/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-09 11:00:26,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:00:26,018 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-09 11:00:26,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:00:26,065 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 11:00:26,065 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 11:00:26,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:00:26,065 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b9821446-f850-48e2-b805-d1cf1bf34a6c/bin-2019/utaipan/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 11:00:26,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:00:26,073 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 11:00:26,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:00:26,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:00:26,163 INFO L134 CoverageAnalysis]: Checked inductivity of 4765 backedges. 329 proven. 26 refuted. 0 times theorem prover too weak. 4410 trivial. 0 not checked. [2018-12-09 11:00:26,163 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 11:00:26,232 INFO L134 CoverageAnalysis]: Checked inductivity of 4765 backedges. 65 proven. 556 refuted. 0 times theorem prover too weak. 4144 trivial. 0 not checked. [2018-12-09 11:00:26,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 11:00:26,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-12-09 11:00:26,247 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 11:00:26,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 11:00:26,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 11:00:26,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-09 11:00:26,248 INFO L87 Difference]: Start difference. First operand 199 states and 215 transitions. Second operand 12 states. [2018-12-09 11:00:26,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:00:26,277 INFO L93 Difference]: Finished difference Result 283 states and 327 transitions. [2018-12-09 11:00:26,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 11:00:26,277 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 246 [2018-12-09 11:00:26,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:00:26,278 INFO L225 Difference]: With dead ends: 283 [2018-12-09 11:00:26,278 INFO L226 Difference]: Without dead ends: 217 [2018-12-09 11:00:26,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 481 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-09 11:00:26,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-12-09 11:00:26,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2018-12-09 11:00:26,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-12-09 11:00:26,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 233 transitions. [2018-12-09 11:00:26,284 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 233 transitions. Word has length 246 [2018-12-09 11:00:26,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:00:26,285 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 233 transitions. [2018-12-09 11:00:26,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 11:00:26,285 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 233 transitions. [2018-12-09 11:00:26,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-12-09 11:00:26,286 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:00:26,286 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 45, 45, 30, 15, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:00:26,286 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:00:26,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:00:26,286 INFO L82 PathProgramCache]: Analyzing trace with hash 224869374, now seen corresponding path program 8 times [2018-12-09 11:00:26,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:00:26,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:00:26,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:00:26,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:00:26,287 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:00:26,300 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-09 11:00:26,300 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-09 11:00:26,300 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b9821446-f850-48e2-b805-d1cf1bf34a6c/bin-2019/utaipan/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-09 11:00:26,308 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:00:26,308 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-09 11:00:26,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:00:26,365 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 11:00:26,365 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 11:00:26,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:00:26,365 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b9821446-f850-48e2-b805-d1cf1bf34a6c/bin-2019/utaipan/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 11:00:26,373 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 11:00:26,373 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 11:00:26,415 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-09 11:00:26,415 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 11:00:26,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:00:26,459 INFO L134 CoverageAnalysis]: Checked inductivity of 6736 backedges. 1420 proven. 16 refuted. 0 times theorem prover too weak. 5300 trivial. 0 not checked. [2018-12-09 11:00:26,459 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 11:00:26,519 INFO L134 CoverageAnalysis]: Checked inductivity of 6736 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 6720 trivial. 0 not checked. [2018-12-09 11:00:26,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 11:00:26,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-12-09 11:00:26,533 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 11:00:26,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 11:00:26,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 11:00:26,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-09 11:00:26,534 INFO L87 Difference]: Start difference. First operand 217 states and 233 transitions. Second operand 12 states. [2018-12-09 11:00:26,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:00:26,558 INFO L93 Difference]: Finished difference Result 301 states and 336 transitions. [2018-12-09 11:00:26,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 11:00:26,558 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 300 [2018-12-09 11:00:26,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:00:26,560 INFO L225 Difference]: With dead ends: 301 [2018-12-09 11:00:26,560 INFO L226 Difference]: Without dead ends: 241 [2018-12-09 11:00:26,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 599 GetRequests, 589 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-09 11:00:26,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-12-09 11:00:26,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2018-12-09 11:00:26,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-12-09 11:00:26,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 257 transitions. [2018-12-09 11:00:26,568 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 257 transitions. Word has length 300 [2018-12-09 11:00:26,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:00:26,568 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 257 transitions. [2018-12-09 11:00:26,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 11:00:26,568 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 257 transitions. [2018-12-09 11:00:26,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-12-09 11:00:26,569 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:00:26,570 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 45, 45, 30, 15, 10, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:00:26,570 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:00:26,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:00:26,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1007494070, now seen corresponding path program 9 times [2018-12-09 11:00:26,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:00:26,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:00:26,571 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:00:26,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:00:26,571 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:00:26,584 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-09 11:00:26,584 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-09 11:00:26,584 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b9821446-f850-48e2-b805-d1cf1bf34a6c/bin-2019/utaipan/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-09 11:00:26,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:00:26,594 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-09 11:00:26,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:00:26,645 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 11:00:26,645 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 11:00:26,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:00:26,645 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b9821446-f850-48e2-b805-d1cf1bf34a6c/bin-2019/utaipan/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 11:00:26,650 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 11:00:26,650 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-09 11:00:26,709 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 11:00:26,709 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 11:00:26,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:00:26,782 INFO L134 CoverageAnalysis]: Checked inductivity of 6820 backedges. 1567 proven. 155 refuted. 0 times theorem prover too weak. 5098 trivial. 0 not checked. [2018-12-09 11:00:26,782 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 11:00:26,942 INFO L134 CoverageAnalysis]: Checked inductivity of 6820 backedges. 1567 proven. 155 refuted. 0 times theorem prover too weak. 5098 trivial. 0 not checked. [2018-12-09 11:00:26,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 11:00:26,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-12-09 11:00:26,957 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 11:00:26,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-09 11:00:26,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-09 11:00:26,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-09 11:00:26,958 INFO L87 Difference]: Start difference. First operand 241 states and 257 transitions. Second operand 24 states. [2018-12-09 11:00:27,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:00:27,015 INFO L93 Difference]: Finished difference Result 385 states and 435 transitions. [2018-12-09 11:00:27,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-09 11:00:27,015 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 312 [2018-12-09 11:00:27,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:00:27,016 INFO L225 Difference]: With dead ends: 385 [2018-12-09 11:00:27,016 INFO L226 Difference]: Without dead ends: 277 [2018-12-09 11:00:27,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 623 GetRequests, 601 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-09 11:00:27,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-12-09 11:00:27,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2018-12-09 11:00:27,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-12-09 11:00:27,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 293 transitions. [2018-12-09 11:00:27,025 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 293 transitions. Word has length 312 [2018-12-09 11:00:27,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:00:27,025 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 293 transitions. [2018-12-09 11:00:27,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-09 11:00:27,025 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 293 transitions. [2018-12-09 11:00:27,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2018-12-09 11:00:27,027 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:00:27,027 INFO L402 BasicCegarLoop]: trace histogram [81, 81, 66, 60, 60, 15, 10, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:00:27,027 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:00:27,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:00:27,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1832053174, now seen corresponding path program 10 times [2018-12-09 11:00:27,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:00:27,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:00:27,028 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:00:27,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:00:27,028 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:00:27,041 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-09 11:00:27,041 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-09 11:00:27,041 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b9821446-f850-48e2-b805-d1cf1bf34a6c/bin-2019/utaipan/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-09 11:00:27,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:00:27,048 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-09 11:00:27,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:00:27,120 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 11:00:27,120 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 11:00:27,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:00:27,120 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b9821446-f850-48e2-b805-d1cf1bf34a6c/bin-2019/utaipan/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 11:00:27,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:00:27,127 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 11:00:27,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:00:27,208 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:00:27,461 INFO L134 CoverageAnalysis]: Checked inductivity of 13678 backedges. 4037 proven. 737 refuted. 0 times theorem prover too weak. 8904 trivial. 0 not checked. [2018-12-09 11:00:27,461 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 11:00:27,772 INFO L134 CoverageAnalysis]: Checked inductivity of 13678 backedges. 317 proven. 5227 refuted. 0 times theorem prover too weak. 8134 trivial. 0 not checked. [2018-12-09 11:00:27,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 11:00:27,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 33 [2018-12-09 11:00:27,787 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 11:00:27,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-09 11:00:27,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-09 11:00:27,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-12-09 11:00:27,788 INFO L87 Difference]: Start difference. First operand 277 states and 293 transitions. Second operand 33 states. [2018-12-09 11:00:27,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:00:27,848 INFO L93 Difference]: Finished difference Result 448 states and 495 transitions. [2018-12-09 11:00:27,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-09 11:00:27,849 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 420 [2018-12-09 11:00:27,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:00:27,851 INFO L225 Difference]: With dead ends: 448 [2018-12-09 11:00:27,851 INFO L226 Difference]: Without dead ends: 304 [2018-12-09 11:00:27,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 839 GetRequests, 793 SyntacticMatches, 15 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-12-09 11:00:27,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-12-09 11:00:27,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2018-12-09 11:00:27,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-12-09 11:00:27,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 320 transitions. [2018-12-09 11:00:27,863 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 320 transitions. Word has length 420 [2018-12-09 11:00:27,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:00:27,863 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 320 transitions. [2018-12-09 11:00:27,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-09 11:00:27,863 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 320 transitions. [2018-12-09 11:00:27,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2018-12-09 11:00:27,865 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:00:27,865 INFO L402 BasicCegarLoop]: trace histogram [108, 108, 93, 60, 60, 15, 10, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:00:27,865 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:00:27,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:00:27,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1098274954, now seen corresponding path program 11 times [2018-12-09 11:00:27,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:00:27,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:00:27,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:00:27,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:00:27,866 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:00:27,881 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-09 11:00:27,881 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-09 11:00:27,881 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b9821446-f850-48e2-b805-d1cf1bf34a6c/bin-2019/utaipan/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-09 11:00:27,890 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:00:27,890 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-09 11:00:27,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:00:27,965 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 11:00:27,965 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 11:00:27,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:00:27,965 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b9821446-f850-48e2-b805-d1cf1bf34a6c/bin-2019/utaipan/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 11:00:27,971 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 11:00:27,971 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 11:00:28,306 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-09 11:00:28,306 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 11:00:28,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:00:28,401 INFO L134 CoverageAnalysis]: Checked inductivity of 21373 backedges. 1763 proven. 40 refuted. 0 times theorem prover too weak. 19570 trivial. 0 not checked. [2018-12-09 11:00:28,401 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 11:00:28,537 INFO L134 CoverageAnalysis]: Checked inductivity of 21373 backedges. 1763 proven. 40 refuted. 0 times theorem prover too weak. 19570 trivial. 0 not checked. [2018-12-09 11:00:28,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 11:00:28,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-12-09 11:00:28,552 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 11:00:28,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-09 11:00:28,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-09 11:00:28,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-09 11:00:28,553 INFO L87 Difference]: Start difference. First operand 304 states and 320 transitions. Second operand 16 states. [2018-12-09 11:00:28,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:00:28,616 INFO L93 Difference]: Finished difference Result 499 states and 553 transitions. [2018-12-09 11:00:28,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 11:00:28,616 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 501 [2018-12-09 11:00:28,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:00:28,618 INFO L225 Difference]: With dead ends: 499 [2018-12-09 11:00:28,618 INFO L226 Difference]: Without dead ends: 328 [2018-12-09 11:00:28,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1001 GetRequests, 987 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-09 11:00:28,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-12-09 11:00:28,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2018-12-09 11:00:28,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-12-09 11:00:28,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 352 transitions. [2018-12-09 11:00:28,629 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 352 transitions. Word has length 501 [2018-12-09 11:00:28,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:00:28,629 INFO L480 AbstractCegarLoop]: Abstraction has 328 states and 352 transitions. [2018-12-09 11:00:28,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-09 11:00:28,629 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 352 transitions. [2018-12-09 11:00:28,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 574 [2018-12-09 11:00:28,632 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:00:28,632 INFO L402 BasicCegarLoop]: trace histogram [132, 132, 93, 60, 60, 39, 10, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:00:28,632 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:00:28,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:00:28,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1655785354, now seen corresponding path program 12 times [2018-12-09 11:00:28,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:00:28,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:00:28,633 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:00:28,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:00:28,633 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:00:28,649 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-09 11:00:28,649 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-09 11:00:28,649 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b9821446-f850-48e2-b805-d1cf1bf34a6c/bin-2019/utaipan/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-09 11:00:28,658 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:00:28,658 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-09 11:00:28,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:00:28,744 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 11:00:28,744 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 11:00:28,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:00:28,745 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b9821446-f850-48e2-b805-d1cf1bf34a6c/bin-2019/utaipan/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 11:00:28,750 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 11:00:28,751 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-09 11:00:28,848 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 11:00:28,848 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 11:00:28,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:00:29,425 INFO L134 CoverageAnalysis]: Checked inductivity of 30049 backedges. 11800 proven. 2882 refuted. 0 times theorem prover too weak. 15367 trivial. 0 not checked. [2018-12-09 11:00:29,425 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 11:00:30,385 INFO L134 CoverageAnalysis]: Checked inductivity of 30049 backedges. 11800 proven. 2882 refuted. 0 times theorem prover too weak. 15367 trivial. 0 not checked. [2018-12-09 11:00:30,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 11:00:30,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 62 [2018-12-09 11:00:30,401 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 11:00:30,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-09 11:00:30,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-09 11:00:30,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-09 11:00:30,402 INFO L87 Difference]: Start difference. First operand 328 states and 352 transitions. Second operand 62 states. [2018-12-09 11:00:30,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:00:30,591 INFO L93 Difference]: Finished difference Result 571 states and 657 transitions. [2018-12-09 11:00:30,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-09 11:00:30,592 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 573 [2018-12-09 11:00:30,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:00:30,593 INFO L225 Difference]: With dead ends: 571 [2018-12-09 11:00:30,593 INFO L226 Difference]: Without dead ends: 376 [2018-12-09 11:00:30,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1145 GetRequests, 1055 SyntacticMatches, 30 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 885 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-09 11:00:30,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2018-12-09 11:00:30,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 376. [2018-12-09 11:00:30,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-12-09 11:00:30,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 416 transitions. [2018-12-09 11:00:30,604 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 416 transitions. Word has length 573 [2018-12-09 11:00:30,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:00:30,605 INFO L480 AbstractCegarLoop]: Abstraction has 376 states and 416 transitions. [2018-12-09 11:00:30,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-09 11:00:30,605 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 416 transitions. [2018-12-09 11:00:30,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 718 [2018-12-09 11:00:30,608 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:00:30,608 INFO L402 BasicCegarLoop]: trace histogram [180, 180, 93, 87, 60, 60, 10, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:00:30,608 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:00:30,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:00:30,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1948375670, now seen corresponding path program 13 times [2018-12-09 11:00:30,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:00:30,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:00:30,609 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:00:30,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:00:30,609 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:00:30,626 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-09 11:00:30,626 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-09 11:00:30,626 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b9821446-f850-48e2-b805-d1cf1bf34a6c/bin-2019/utaipan/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-09 11:00:30,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:00:30,632 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-09 11:00:30,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:00:30,719 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 11:00:30,720 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 11:00:30,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:00:30,720 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b9821446-f850-48e2-b805-d1cf1bf34a6c/bin-2019/utaipan/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 11:00:30,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:00:30,726 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 11:00:30,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:00:30,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:00:30,999 INFO L134 CoverageAnalysis]: Checked inductivity of 52585 backedges. 21850 proven. 100 refuted. 0 times theorem prover too weak. 30635 trivial. 0 not checked. [2018-12-09 11:00:31,000 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 11:00:31,236 INFO L134 CoverageAnalysis]: Checked inductivity of 52585 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 52485 trivial. 0 not checked. [2018-12-09 11:00:31,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 11:00:31,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-12-09 11:00:31,252 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 11:00:31,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-09 11:00:31,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-09 11:00:31,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-09 11:00:31,252 INFO L87 Difference]: Start difference. First operand 376 states and 416 transitions. Second operand 24 states. [2018-12-09 11:00:31,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:00:31,311 INFO L93 Difference]: Finished difference Result 619 states and 714 transitions. [2018-12-09 11:00:31,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-09 11:00:31,311 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 717 [2018-12-09 11:00:31,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:00:31,313 INFO L225 Difference]: With dead ends: 619 [2018-12-09 11:00:31,313 INFO L226 Difference]: Without dead ends: 424 [2018-12-09 11:00:31,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1433 GetRequests, 1411 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-09 11:00:31,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2018-12-09 11:00:31,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 424. [2018-12-09 11:00:31,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-12-09 11:00:31,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 464 transitions. [2018-12-09 11:00:31,326 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 464 transitions. Word has length 717 [2018-12-09 11:00:31,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:00:31,327 INFO L480 AbstractCegarLoop]: Abstraction has 424 states and 464 transitions. [2018-12-09 11:00:31,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-09 11:00:31,327 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 464 transitions. [2018-12-09 11:00:31,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 742 [2018-12-09 11:00:31,330 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:00:31,331 INFO L402 BasicCegarLoop]: trace histogram [180, 180, 93, 87, 60, 60, 22, 22, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:00:31,331 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:00:31,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:00:31,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1996731378, now seen corresponding path program 14 times [2018-12-09 11:00:31,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:00:31,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:00:31,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:00:31,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:00:31,332 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:00:31,350 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-09 11:00:31,350 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-09 11:00:31,350 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b9821446-f850-48e2-b805-d1cf1bf34a6c/bin-2019/utaipan/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-09 11:00:31,356 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:00:31,356 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-09 11:00:31,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:00:31,452 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 11:00:31,452 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 11:00:31,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:00:31,452 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b9821446-f850-48e2-b805-d1cf1bf34a6c/bin-2019/utaipan/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 11:00:31,458 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 11:00:31,458 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 11:00:39,829 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-12-09 11:00:39,829 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 11:00:39,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:00:40,103 INFO L134 CoverageAnalysis]: Checked inductivity of 52969 backedges. 21850 proven. 484 refuted. 0 times theorem prover too weak. 30635 trivial. 0 not checked. [2018-12-09 11:00:40,103 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 11:00:40,689 INFO L134 CoverageAnalysis]: Checked inductivity of 52969 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 52485 trivial. 0 not checked. [2018-12-09 11:00:40,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 11:00:40,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-12-09 11:00:40,707 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 11:00:40,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-09 11:00:40,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-09 11:00:40,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-09 11:00:40,708 INFO L87 Difference]: Start difference. First operand 424 states and 464 transitions. Second operand 48 states. [2018-12-09 11:00:40,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:00:40,797 INFO L93 Difference]: Finished difference Result 715 states and 834 transitions. [2018-12-09 11:00:40,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-09 11:00:40,798 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 741 [2018-12-09 11:00:40,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:00:40,800 INFO L225 Difference]: With dead ends: 715 [2018-12-09 11:00:40,800 INFO L226 Difference]: Without dead ends: 520 [2018-12-09 11:00:40,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1481 GetRequests, 1435 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-09 11:00:40,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2018-12-09 11:00:40,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 520. [2018-12-09 11:00:40,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-12-09 11:00:40,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 560 transitions. [2018-12-09 11:00:40,828 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 560 transitions. Word has length 741 [2018-12-09 11:00:40,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:00:40,829 INFO L480 AbstractCegarLoop]: Abstraction has 520 states and 560 transitions. [2018-12-09 11:00:40,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-09 11:00:40,829 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 560 transitions. [2018-12-09 11:00:40,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 790 [2018-12-09 11:00:40,833 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:00:40,833 INFO L402 BasicCegarLoop]: trace histogram [180, 180, 93, 87, 60, 60, 46, 46, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:00:40,833 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:00:40,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:00:40,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1375119554, now seen corresponding path program 15 times [2018-12-09 11:00:40,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:00:40,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:00:40,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:00:40,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:00:40,834 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:00:40,852 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-09 11:00:40,852 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-09 11:00:40,852 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b9821446-f850-48e2-b805-d1cf1bf34a6c/bin-2019/utaipan/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-09 11:00:40,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:00:40,858 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-09 11:00:40,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:00:40,966 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 11:00:40,966 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 11:00:40,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:00:40,966 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b9821446-f850-48e2-b805-d1cf1bf34a6c/bin-2019/utaipan/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 11:00:40,974 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 11:00:40,974 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-09 11:00:41,148 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 11:00:41,148 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 11:00:41,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:00:41,881 INFO L134 CoverageAnalysis]: Checked inductivity of 54601 backedges. 21850 proven. 2116 refuted. 0 times theorem prover too weak. 30635 trivial. 0 not checked. [2018-12-09 11:00:41,882 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 11:00:42,801 INFO L134 CoverageAnalysis]: Checked inductivity of 54601 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 52485 trivial. 0 not checked. [2018-12-09 11:00:42,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 11:00:42,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 61 [2018-12-09 11:00:42,816 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 11:00:42,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-12-09 11:00:42,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-12-09 11:00:42,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-12-09 11:00:42,817 INFO L87 Difference]: Start difference. First operand 520 states and 560 transitions. Second operand 61 states. [2018-12-09 11:00:42,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:00:42,917 INFO L93 Difference]: Finished difference Result 767 states and 864 transitions. [2018-12-09 11:00:42,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-09 11:00:42,917 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 789 [2018-12-09 11:00:42,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:00:42,920 INFO L225 Difference]: With dead ends: 767 [2018-12-09 11:00:42,920 INFO L226 Difference]: Without dead ends: 572 [2018-12-09 11:00:42,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1577 GetRequests, 1483 SyntacticMatches, 35 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1015 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-12-09 11:00:42,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2018-12-09 11:00:42,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2018-12-09 11:00:42,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572 states. [2018-12-09 11:00:42,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 612 transitions. [2018-12-09 11:00:42,945 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 612 transitions. Word has length 789 [2018-12-09 11:00:42,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:00:42,946 INFO L480 AbstractCegarLoop]: Abstraction has 572 states and 612 transitions. [2018-12-09 11:00:42,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-12-09 11:00:42,946 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 612 transitions. [2018-12-09 11:00:42,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 816 [2018-12-09 11:00:42,949 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:00:42,949 INFO L402 BasicCegarLoop]: trace histogram [180, 180, 93, 87, 60, 60, 59, 59, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:00:42,949 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:00:42,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:00:42,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1414170696, now seen corresponding path program 16 times [2018-12-09 11:00:42,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:00:42,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:00:42,950 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:00:42,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:00:42,950 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:00:42,968 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-09 11:00:42,969 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-09 11:00:42,969 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b9821446-f850-48e2-b805-d1cf1bf34a6c/bin-2019/utaipan/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-09 11:00:42,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:00:42,978 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-09 11:00:45,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2018-12-09 11:00:45,110 INFO L285 seRefinementStrategy]: Strategy TaipanRefinementStrategy was unsuccessful and could not determine trace feasibility. [2018-12-09 11:00:45,110 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 11:00:45,172 WARN L228 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-12-09 11:00:45,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 11:00:45 BoogieIcfgContainer [2018-12-09 11:00:45,172 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 11:00:45,173 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 11:00:45,173 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 11:00:45,173 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 11:00:45,173 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 11:00:18" (3/4) ... [2018-12-09 11:00:45,175 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 11:00:45,175 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 11:00:45,176 INFO L168 Benchmark]: Toolchain (without parser) took 26989.71 ms. Allocated memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: 1.3 GB). Free memory was 958.8 MB in the beginning and 885.9 MB in the end (delta: 73.0 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2018-12-09 11:00:45,177 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 11:00:45,177 INFO L168 Benchmark]: CACSL2BoogieTranslator took 135.66 ms. Allocated memory is still 1.0 GB. Free memory was 958.8 MB in the beginning and 948.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-09 11:00:45,177 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.76 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 38.3 MB). Free memory was 948.1 MB in the beginning and 1.0 GB in the end (delta: -71.8 MB). Peak memory consumption was 11.6 MB. Max. memory is 11.5 GB. [2018-12-09 11:00:45,177 INFO L168 Benchmark]: Boogie Preprocessor took 39.96 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 197.1 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -206.7 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. [2018-12-09 11:00:45,177 INFO L168 Benchmark]: RCFGBuilder took 157.17 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2018-12-09 11:00:45,178 INFO L168 Benchmark]: TraceAbstraction took 26629.67 ms. Allocated memory was 1.3 GB in the beginning and 2.4 GB in the end (delta: 1.1 GB). Free memory was 1.2 GB in the beginning and 885.9 MB in the end (delta: 322.6 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2018-12-09 11:00:45,178 INFO L168 Benchmark]: Witness Printer took 2.72 ms. Allocated memory is still 2.4 GB. Free memory is still 885.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 11:00:45,179 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 135.66 ms. Allocated memory is still 1.0 GB. Free memory was 958.8 MB in the beginning and 948.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 21.76 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 38.3 MB). Free memory was 948.1 MB in the beginning and 1.0 GB in the end (delta: -71.8 MB). Peak memory consumption was 11.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.96 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 197.1 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -206.7 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 157.17 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 26629.67 ms. Allocated memory was 1.3 GB in the beginning and 2.4 GB in the end (delta: 1.1 GB). Free memory was 1.2 GB in the beginning and 885.9 MB in the end (delta: 322.6 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * Witness Printer took 2.72 ms. Allocated memory is still 2.4 GB. Free memory is still 885.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 50]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L31] int x[60]; [L32] CALL init_nondet(x) [L5] int i; [L6] i = 0 [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND FALSE !(i < 60) [L32] RET init_nondet(x) [L33] int temp; [L34] int ret; [L35] int ret2; [L36] int ret5; [L38] CALL, EXPR rangesum(x) [L13] int i; [L14] long long ret; [L15] ret = 0 [L16] int cnt = 0; [L17] i = 0 [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND FALSE !(i < 60) [L23] COND TRUE cnt !=0 [L24] return ret / cnt; [L38] RET, EXPR rangesum(x) [L38] ret = rangesum(x) [L40] EXPR x[0] [L40] temp=x[0] [L40] EXPR x[1] [L40] x[0] = x[1] [L40] x[1] = temp [L41] CALL, EXPR rangesum(x) [L13] int i; [L14] long long ret; [L15] ret = 0 [L16] int cnt = 0; [L17] i = 0 [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND FALSE !(i < 60) [L23] COND TRUE cnt !=0 [L24] return ret / cnt; [L41] RET, EXPR rangesum(x) [L41] ret2 = rangesum(x) [L42] EXPR x[0] [L42] temp=x[0] [L43] int i =0 ; [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND FALSE !(i<60 -1) [L46] x[60 -1] = temp [L47] CALL, EXPR rangesum(x) [L13] int i; [L14] long long ret; [L15] ret = 0 [L16] int cnt = 0; [L17] i = 0 [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND FALSE !(i < 60) [L23] COND TRUE cnt !=0 [L24] return ret / cnt; [L47] RET, EXPR rangesum(x) [L47] ret5 = rangesum(x) [L49] COND TRUE ret != ret2 || ret !=ret5 [L50] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 37 locations, 1 error locations. UNKNOWN Result, 26.5s OverallTime, 24 OverallIterations, 180 TraceHistogramMax, 2.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 766 SDtfs, 1083 SDslu, 2339 SDs, 0 SdLazy, 1108 SolverSat, 297 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 12 DeclaredPredicates, 11462 GetRequests, 10862 SyntacticMatches, 114 SemanticMatches, 486 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3176 ImplicationChecksByTransitivity, 6.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=572occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.9s AbstIntTime, 8 AbstIntIterations, 6 AbstIntStrong, 0.8930923737103509 AbsIntWeakeningRatio, 1.1797752808988764 AbsIntAvgWeakeningVarsNumRemoved, 3.3895131086142323 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 32 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 11.7s SatisfiabilityAnalysisTime, 8.2s InterpolantComputationTime, 12280 NumberOfCodeBlocks, 10985 NumberOfCodeBlocksAsserted, 92 NumberOfCheckSat, 11254 ConstructedInterpolants, 0 QuantifiedInterpolants, 6786724 SizeOfPredicates, 21 NumberOfNonLiveVariables, 10511 ConjunctsInSsa, 302 ConjunctsInUnsatCore, 36 InterpolantComputations, 0 PerfectInterpolantSequences, 481413/505013 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...