./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/reducercommutativity/rangesum40_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_e9d8e9e9-c4c7-45fe-b4aa-b95689aef5fd/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e9d8e9e9-c4c7-45fe-b4aa-b95689aef5fd/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e9d8e9e9-c4c7-45fe-b4aa-b95689aef5fd/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e9d8e9e9-c4c7-45fe-b4aa-b95689aef5fd/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/reducercommutativity/rangesum40_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_e9d8e9e9-c4c7-45fe-b4aa-b95689aef5fd/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e9d8e9e9-c4c7-45fe-b4aa-b95689aef5fd/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 3bc22eacddab290eba000ecad4885815ce9878ac ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 16:21:44,841 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 16:21:44,842 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 16:21:44,848 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 16:21:44,849 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 16:21:44,849 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 16:21:44,850 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 16:21:44,851 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 16:21:44,851 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 16:21:44,852 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 16:21:44,852 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 16:21:44,852 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 16:21:44,853 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 16:21:44,854 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 16:21:44,854 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 16:21:44,854 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 16:21:44,855 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 16:21:44,856 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 16:21:44,857 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 16:21:44,858 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 16:21:44,858 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 16:21:44,859 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 16:21:44,860 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 16:21:44,860 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 16:21:44,860 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 16:21:44,861 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 16:21:44,861 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 16:21:44,862 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 16:21:44,862 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 16:21:44,863 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 16:21:44,863 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 16:21:44,863 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 16:21:44,864 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 16:21:44,864 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 16:21:44,864 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 16:21:44,865 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 16:21:44,865 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e9d8e9e9-c4c7-45fe-b4aa-b95689aef5fd/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 16:21:44,872 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 16:21:44,873 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 16:21:44,873 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 16:21:44,873 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 16:21:44,873 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 16:21:44,873 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 16:21:44,874 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 16:21:44,874 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 16:21:44,874 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 16:21:44,874 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 16:21:44,874 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 16:21:44,874 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 16:21:44,874 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 16:21:44,875 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 16:21:44,875 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 16:21:44,875 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 16:21:44,875 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 16:21:44,875 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 16:21:44,875 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 16:21:44,875 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 16:21:44,875 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 16:21:44,876 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 16:21:44,876 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 16:21:44,876 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 16:21:44,876 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 16:21:44,876 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 16:21:44,876 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 16:21:44,876 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 16:21:44,876 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 16:21:44,876 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 16:21:44,877 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 16:21:44,877 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 16:21:44,877 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 16:21:44,877 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 16:21:44,877 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 16:21:44,877 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 16:21:44,877 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_e9d8e9e9-c4c7-45fe-b4aa-b95689aef5fd/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 -> 3bc22eacddab290eba000ecad4885815ce9878ac [2018-12-09 16:21:44,895 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 16:21:44,902 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 16:21:44,904 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 16:21:44,905 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 16:21:44,905 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 16:21:44,906 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e9d8e9e9-c4c7-45fe-b4aa-b95689aef5fd/bin-2019/utaipan/../../sv-benchmarks/c/reducercommutativity/rangesum40_false-unreach-call.i [2018-12-09 16:21:44,941 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e9d8e9e9-c4c7-45fe-b4aa-b95689aef5fd/bin-2019/utaipan/data/af1b5e742/75baddae9ff54482a8c13c6ec1e4f244/FLAG2c06389e8 [2018-12-09 16:21:45,388 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 16:21:45,388 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e9d8e9e9-c4c7-45fe-b4aa-b95689aef5fd/sv-benchmarks/c/reducercommutativity/rangesum40_false-unreach-call.i [2018-12-09 16:21:45,392 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e9d8e9e9-c4c7-45fe-b4aa-b95689aef5fd/bin-2019/utaipan/data/af1b5e742/75baddae9ff54482a8c13c6ec1e4f244/FLAG2c06389e8 [2018-12-09 16:21:45,400 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e9d8e9e9-c4c7-45fe-b4aa-b95689aef5fd/bin-2019/utaipan/data/af1b5e742/75baddae9ff54482a8c13c6ec1e4f244 [2018-12-09 16:21:45,402 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 16:21:45,403 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 16:21:45,403 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 16:21:45,403 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 16:21:45,406 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 16:21:45,407 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:21:45" (1/1) ... [2018-12-09 16:21:45,409 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d58bc2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:21:45, skipping insertion in model container [2018-12-09 16:21:45,409 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:21:45" (1/1) ... [2018-12-09 16:21:45,415 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 16:21:45,427 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 16:21:45,520 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 16:21:45,525 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 16:21:45,538 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 16:21:45,547 INFO L195 MainTranslator]: Completed translation [2018-12-09 16:21:45,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:21:45 WrapperNode [2018-12-09 16:21:45,547 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 16:21:45,548 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 16:21:45,548 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 16:21:45,548 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 16:21:45,553 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:21:45" (1/1) ... [2018-12-09 16:21:45,558 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:21:45" (1/1) ... [2018-12-09 16:21:45,562 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 16:21:45,562 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 16:21:45,562 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 16:21:45,562 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 16:21:45,599 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:21:45" (1/1) ... [2018-12-09 16:21:45,599 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:21:45" (1/1) ... [2018-12-09 16:21:45,601 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:21:45" (1/1) ... [2018-12-09 16:21:45,602 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:21:45" (1/1) ... [2018-12-09 16:21:45,609 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:21:45" (1/1) ... [2018-12-09 16:21:45,613 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:21:45" (1/1) ... [2018-12-09 16:21:45,614 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:21:45" (1/1) ... [2018-12-09 16:21:45,616 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 16:21:45,616 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 16:21:45,616 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 16:21:45,616 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 16:21:45,617 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:21:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e9d8e9e9-c4c7-45fe-b4aa-b95689aef5fd/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 16:21:45,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 16:21:45,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 16:21:45,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 16:21:45,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 16:21:45,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 16:21:45,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 16:21:45,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 16:21:45,650 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 16:21:45,650 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 16:21:45,650 INFO L130 BoogieDeclarations]: Found specification of procedure rangesum [2018-12-09 16:21:45,650 INFO L138 BoogieDeclarations]: Found implementation of procedure rangesum [2018-12-09 16:21:45,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 16:21:45,651 INFO L130 BoogieDeclarations]: Found specification of procedure init_nondet [2018-12-09 16:21:45,651 INFO L138 BoogieDeclarations]: Found implementation of procedure init_nondet [2018-12-09 16:21:45,777 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 16:21:45,777 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-12-09 16:21:45,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:21:45 BoogieIcfgContainer [2018-12-09 16:21:45,777 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 16:21:45,778 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 16:21:45,778 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 16:21:45,780 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 16:21:45,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 04:21:45" (1/3) ... [2018-12-09 16:21:45,780 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2747bae9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:21:45, skipping insertion in model container [2018-12-09 16:21:45,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:21:45" (2/3) ... [2018-12-09 16:21:45,781 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2747bae9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:21:45, skipping insertion in model container [2018-12-09 16:21:45,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:21:45" (3/3) ... [2018-12-09 16:21:45,782 INFO L112 eAbstractionObserver]: Analyzing ICFG rangesum40_false-unreach-call.i [2018-12-09 16:21:45,788 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 16:21:45,792 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 16:21:45,801 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 16:21:45,818 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 16:21:45,818 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 16:21:45,818 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 16:21:45,818 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 16:21:45,818 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 16:21:45,818 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 16:21:45,818 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 16:21:45,818 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 16:21:45,829 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-12-09 16:21:45,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-09 16:21:45,833 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:21:45,833 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 16:21:45,835 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:21:45,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:21:45,838 INFO L82 PathProgramCache]: Analyzing trace with hash -332770493, now seen corresponding path program 1 times [2018-12-09 16:21:45,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:21:45,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:21:45,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:21:45,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:21:45,867 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:21:45,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:21:45,912 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2018-12-09 16:21:45,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:21:45,912 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:21:45,913 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2018-12-09 16:21:45,914 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 16:21:45,935 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 16:21:45,935 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 16:21:46,002 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 16:21:46,003 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 16:21:46,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:21:46,008 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 16:21:46,040 INFO L227 lantSequenceWeakener]: Weakened 7 states. On average, predicates are now at 88.89% of their original sizes. [2018-12-09 16:21:46,040 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 16:21:46,052 INFO L418 sIntCurrentIteration]: We unified 36 AI predicates to 36 [2018-12-09 16:21:46,052 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 16:21:46,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:21:46,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 16:21:46,054 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:21:46,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 16:21:46,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 16:21:46,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 16:21:46,060 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 5 states. [2018-12-09 16:21:46,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:21:46,162 INFO L93 Difference]: Finished difference Result 66 states and 89 transitions. [2018-12-09 16:21:46,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 16:21:46,163 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-12-09 16:21:46,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:21:46,168 INFO L225 Difference]: With dead ends: 66 [2018-12-09 16:21:46,168 INFO L226 Difference]: Without dead ends: 34 [2018-12-09 16:21:46,170 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 16:21:46,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-09 16:21:46,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-12-09 16:21:46,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-09 16:21:46,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2018-12-09 16:21:46,194 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 37 [2018-12-09 16:21:46,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:21:46,195 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-12-09 16:21:46,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 16:21:46,195 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-12-09 16:21:46,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-09 16:21:46,196 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:21:46,196 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 16:21:46,196 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:21:46,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:21:46,196 INFO L82 PathProgramCache]: Analyzing trace with hash 479004822, now seen corresponding path program 1 times [2018-12-09 16:21:46,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:21:46,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:21:46,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:21:46,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:21:46,197 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:21:46,206 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-09 16:21:46,206 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-09 16:21:46,207 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e9d8e9e9-c4c7-45fe-b4aa-b95689aef5fd/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 16:21:46,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:21:46,213 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-09 16:21:46,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:21:46,242 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2018-12-09 16:21:46,242 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 16:21:46,244 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 16:21:46,244 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 16:21:46,272 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 16:21:46,272 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 16:21:46,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:21:46,276 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 16:21:46,294 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 85.4% of their original sizes. [2018-12-09 16:21:46,295 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 16:21:46,325 INFO L418 sIntCurrentIteration]: We unified 38 AI predicates to 38 [2018-12-09 16:21:46,325 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 16:21:46,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:21:46,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 16:21:46,325 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:21:46,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 16:21:46,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 16:21:46,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 16:21:46,327 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 7 states. [2018-12-09 16:21:46,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:21:46,502 INFO L93 Difference]: Finished difference Result 54 states and 69 transitions. [2018-12-09 16:21:46,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 16:21:46,502 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-12-09 16:21:46,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:21:46,503 INFO L225 Difference]: With dead ends: 54 [2018-12-09 16:21:46,503 INFO L226 Difference]: Without dead ends: 36 [2018-12-09 16:21:46,504 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 16:21:46,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-09 16:21:46,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-12-09 16:21:46,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-09 16:21:46,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2018-12-09 16:21:46,510 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 39 [2018-12-09 16:21:46,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:21:46,510 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2018-12-09 16:21:46,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 16:21:46,510 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2018-12-09 16:21:46,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-09 16:21:46,511 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:21:46,511 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 16:21:46,511 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:21:46,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:21:46,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1719401286, now seen corresponding path program 1 times [2018-12-09 16:21:46,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:21:46,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:21:46,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:21:46,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:21:46,513 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:21:46,523 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-09 16:21:46,523 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-09 16:21:46,523 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e9d8e9e9-c4c7-45fe-b4aa-b95689aef5fd/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 16:21:46,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:21:46,530 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-09 16:21:46,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:21:46,556 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 49 with the following transitions: [2018-12-09 16:21:46,556 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 16:21:46,558 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 16:21:46,558 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 16:21:46,747 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 16:21:46,747 INFO L272 AbstractInterpreter]: Visited 21 different actions 47 times. Merged at 6 different actions 19 times. Widened at 1 different actions 1 times. Performed 219 root evaluator evaluations with a maximum evaluation depth of 10. Performed 219 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Found 4 fixpoints after 4 different actions. Largest state had 23 variables. [2018-12-09 16:21:46,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:21:46,751 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 16:21:46,806 INFO L227 lantSequenceWeakener]: Weakened 19 states. On average, predicates are now at 84.74% of their original sizes. [2018-12-09 16:21:46,806 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 16:21:46,838 INFO L418 sIntCurrentIteration]: We unified 47 AI predicates to 47 [2018-12-09 16:21:46,839 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 16:21:46,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:21:46,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 16:21:46,839 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:21:46,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 16:21:46,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 16:21:46,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 16:21:46,840 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand 7 states. [2018-12-09 16:21:46,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:21:47,000 INFO L93 Difference]: Finished difference Result 61 states and 79 transitions. [2018-12-09 16:21:47,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 16:21:47,000 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-12-09 16:21:47,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:21:47,002 INFO L225 Difference]: With dead ends: 61 [2018-12-09 16:21:47,002 INFO L226 Difference]: Without dead ends: 41 [2018-12-09 16:21:47,003 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 16:21:47,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-09 16:21:47,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2018-12-09 16:21:47,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-09 16:21:47,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2018-12-09 16:21:47,009 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 48 [2018-12-09 16:21:47,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:21:47,010 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2018-12-09 16:21:47,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 16:21:47,010 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2018-12-09 16:21:47,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-09 16:21:47,011 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:21:47,011 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 16:21:47,011 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:21:47,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:21:47,011 INFO L82 PathProgramCache]: Analyzing trace with hash 496221539, now seen corresponding path program 1 times [2018-12-09 16:21:47,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:21:47,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:21:47,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:21:47,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:21:47,012 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:21:47,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:21:47,066 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 16:21:47,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:21:47,066 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:21:47,066 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 49 with the following transitions: [2018-12-09 16:21:47,067 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 16:21:47,068 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 16:21:47,069 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 16:21:47,107 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 16:21:47,107 INFO L272 AbstractInterpreter]: Visited 28 different actions 68 times. Merged at 5 different actions 24 times. Never widened. Performed 295 root evaluator evaluations with a maximum evaluation depth of 3. Performed 295 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 6 fixpoints after 4 different actions. Largest state had 23 variables. [2018-12-09 16:21:47,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:21:47,109 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 16:21:47,136 INFO L227 lantSequenceWeakener]: Weakened 33 states. On average, predicates are now at 83.4% of their original sizes. [2018-12-09 16:21:47,136 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 16:21:47,197 INFO L418 sIntCurrentIteration]: We unified 47 AI predicates to 47 [2018-12-09 16:21:47,197 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 16:21:47,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 16:21:47,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [4] total 14 [2018-12-09 16:21:47,198 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:21:47,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 16:21:47,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 16:21:47,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-12-09 16:21:47,199 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand 12 states. [2018-12-09 16:21:47,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:21:47,558 INFO L93 Difference]: Finished difference Result 74 states and 93 transitions. [2018-12-09 16:21:47,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 16:21:47,558 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2018-12-09 16:21:47,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:21:47,559 INFO L225 Difference]: With dead ends: 74 [2018-12-09 16:21:47,559 INFO L226 Difference]: Without dead ends: 55 [2018-12-09 16:21:47,560 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 16:21:47,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-09 16:21:47,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 45. [2018-12-09 16:21:47,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-09 16:21:47,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2018-12-09 16:21:47,566 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 48 [2018-12-09 16:21:47,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:21:47,566 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2018-12-09 16:21:47,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 16:21:47,567 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2018-12-09 16:21:47,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 16:21:47,567 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:21:47,568 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 16:21:47,568 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:21:47,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:21:47,568 INFO L82 PathProgramCache]: Analyzing trace with hash 125205893, now seen corresponding path program 1 times [2018-12-09 16:21:47,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:21:47,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:21:47,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:21:47,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:21:47,569 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:21:47,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:21:47,595 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 16:21:47,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:21:47,595 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:21:47,595 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 51 with the following transitions: [2018-12-09 16:21:47,595 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 16:21:47,597 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 16:21:47,597 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 16:21:47,637 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 16:21:47,637 INFO L272 AbstractInterpreter]: Visited 35 different actions 91 times. Merged at 7 different actions 30 times. Never widened. Performed 386 root evaluator evaluations with a maximum evaluation depth of 3. Performed 386 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 7 fixpoints after 5 different actions. Largest state had 25 variables. [2018-12-09 16:21:47,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:21:47,638 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 16:21:47,660 INFO L227 lantSequenceWeakener]: Weakened 47 states. On average, predicates are now at 81.06% of their original sizes. [2018-12-09 16:21:47,661 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 16:21:47,734 INFO L418 sIntCurrentIteration]: We unified 49 AI predicates to 49 [2018-12-09 16:21:47,734 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 16:21:47,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 16:21:47,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [4] total 16 [2018-12-09 16:21:47,735 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:21:47,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 16:21:47,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 16:21:47,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-12-09 16:21:47,735 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. Second operand 14 states. [2018-12-09 16:21:48,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:21:48,134 INFO L93 Difference]: Finished difference Result 66 states and 81 transitions. [2018-12-09 16:21:48,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 16:21:48,134 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 50 [2018-12-09 16:21:48,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:21:48,135 INFO L225 Difference]: With dead ends: 66 [2018-12-09 16:21:48,135 INFO L226 Difference]: Without dead ends: 62 [2018-12-09 16:21:48,135 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 16:21:48,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-09 16:21:48,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 49. [2018-12-09 16:21:48,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-09 16:21:48,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2018-12-09 16:21:48,140 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 63 transitions. Word has length 50 [2018-12-09 16:21:48,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:21:48,141 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 63 transitions. [2018-12-09 16:21:48,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 16:21:48,141 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 63 transitions. [2018-12-09 16:21:48,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-09 16:21:48,141 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:21:48,141 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 16:21:48,141 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:21:48,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:21:48,142 INFO L82 PathProgramCache]: Analyzing trace with hash 395797120, now seen corresponding path program 1 times [2018-12-09 16:21:48,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:21:48,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:21:48,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:21:48,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:21:48,142 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:21:48,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:21:48,154 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2018-12-09 16:21:48,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:21:48,154 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:21:48,154 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 52 with the following transitions: [2018-12-09 16:21:48,154 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 16:21:48,155 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 16:21:48,155 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 16:21:48,289 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 16:21:48,290 INFO L272 AbstractInterpreter]: Visited 30 different actions 145 times. Merged at 14 different actions 67 times. Widened at 1 different actions 2 times. Performed 701 root evaluator evaluations with a maximum evaluation depth of 10. Performed 701 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Found 19 fixpoints after 7 different actions. Largest state had 23 variables. [2018-12-09 16:21:48,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:21:48,293 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 16:21:48,311 INFO L227 lantSequenceWeakener]: Weakened 36 states. On average, predicates are now at 86.31% of their original sizes. [2018-12-09 16:21:48,311 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 16:21:48,341 INFO L418 sIntCurrentIteration]: We unified 50 AI predicates to 50 [2018-12-09 16:21:48,342 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 16:21:48,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:21:48,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 16:21:48,342 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:21:48,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 16:21:48,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 16:21:48,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 16:21:48,343 INFO L87 Difference]: Start difference. First operand 49 states and 63 transitions. Second operand 8 states. [2018-12-09 16:21:48,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:21:48,457 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2018-12-09 16:21:48,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 16:21:48,457 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2018-12-09 16:21:48,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:21:48,458 INFO L225 Difference]: With dead ends: 73 [2018-12-09 16:21:48,458 INFO L226 Difference]: Without dead ends: 52 [2018-12-09 16:21:48,458 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 16:21:48,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-09 16:21:48,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2018-12-09 16:21:48,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-09 16:21:48,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2018-12-09 16:21:48,465 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 51 [2018-12-09 16:21:48,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:21:48,465 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2018-12-09 16:21:48,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 16:21:48,465 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2018-12-09 16:21:48,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 16:21:48,466 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:21:48,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, 1, 1] [2018-12-09 16:21:48,467 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:21:48,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:21:48,467 INFO L82 PathProgramCache]: Analyzing trace with hash -515269076, now seen corresponding path program 1 times [2018-12-09 16:21:48,467 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:21:48,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:21:48,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:21:48,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:21:48,468 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:21:48,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:21:48,483 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2018-12-09 16:21:48,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:21:48,483 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:21:48,483 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 54 with the following transitions: [2018-12-09 16:21:48,484 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 16:21:48,485 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 16:21:48,485 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 16:21:48,778 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 16:21:48,779 INFO L272 AbstractInterpreter]: Visited 38 different actions 251 times. Merged at 22 different actions 125 times. Widened at 2 different actions 5 times. Performed 1169 root evaluator evaluations with a maximum evaluation depth of 10. Performed 1169 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Found 36 fixpoints after 11 different actions. Largest state had 25 variables. [2018-12-09 16:21:48,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:21:48,780 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 16:21:48,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:21:48,780 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e9d8e9e9-c4c7-45fe-b4aa-b95689aef5fd/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 16:21:48,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:21:48,787 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 16:21:48,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:21:48,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:21:48,835 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 16:21:48,836 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:21:48,865 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 16:21:48,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 16:21:48,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-12-09 16:21:48,890 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 16:21:48,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 16:21:48,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 16:21:48,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-09 16:21:48,893 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. Second operand 6 states. [2018-12-09 16:21:48,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:21:48,907 INFO L93 Difference]: Finished difference Result 95 states and 125 transitions. [2018-12-09 16:21:48,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 16:21:48,908 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-09 16:21:48,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:21:48,909 INFO L225 Difference]: With dead ends: 95 [2018-12-09 16:21:48,909 INFO L226 Difference]: Without dead ends: 56 [2018-12-09 16:21:48,909 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 16:21:48,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-09 16:21:48,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-12-09 16:21:48,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-09 16:21:48,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2018-12-09 16:21:48,917 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 53 [2018-12-09 16:21:48,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:21:48,917 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2018-12-09 16:21:48,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 16:21:48,917 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2018-12-09 16:21:48,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-09 16:21:48,918 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:21:48,918 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 16:21:48,918 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:21:48,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:21:48,919 INFO L82 PathProgramCache]: Analyzing trace with hash -871058906, now seen corresponding path program 2 times [2018-12-09 16:21:48,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:21:48,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:21:48,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:21:48,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:21:48,920 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:21:48,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:21:48,942 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2018-12-09 16:21:48,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:21:48,942 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:21:48,942 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 16:21:48,942 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 16:21:48,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:21:48,943 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e9d8e9e9-c4c7-45fe-b4aa-b95689aef5fd/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 16:21:48,948 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 16:21:48,949 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 16:21:48,967 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-09 16:21:48,968 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 16:21:48,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:21:48,983 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 16:21:48,983 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:21:49,019 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 16:21:49,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 16:21:49,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-12-09 16:21:49,043 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 16:21:49,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 16:21:49,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 16:21:49,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-09 16:21:49,049 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand 8 states. [2018-12-09 16:21:49,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:21:49,076 INFO L93 Difference]: Finished difference Result 104 states and 147 transitions. [2018-12-09 16:21:49,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 16:21:49,076 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2018-12-09 16:21:49,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:21:49,077 INFO L225 Difference]: With dead ends: 104 [2018-12-09 16:21:49,077 INFO L226 Difference]: Without dead ends: 69 [2018-12-09 16:21:49,078 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 16:21:49,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-09 16:21:49,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2018-12-09 16:21:49,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-09 16:21:49,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 82 transitions. [2018-12-09 16:21:49,086 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 82 transitions. Word has length 59 [2018-12-09 16:21:49,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:21:49,086 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 82 transitions. [2018-12-09 16:21:49,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 16:21:49,087 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 82 transitions. [2018-12-09 16:21:49,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-09 16:21:49,088 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:21:49,088 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 16:21:49,088 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:21:49,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:21:49,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1442887404, now seen corresponding path program 1 times [2018-12-09 16:21:49,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:21:49,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:21:49,089 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 16:21:49,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:21:49,090 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:21:49,100 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-09 16:21:49,100 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-09 16:21:49,100 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e9d8e9e9-c4c7-45fe-b4aa-b95689aef5fd/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 16:21:49,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:21:49,109 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-09 16:21:49,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:21:49,140 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 102 with the following transitions: [2018-12-09 16:21:49,141 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 16:21:49,142 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 16:21:49,142 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 16:21:49,283 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 16:21:49,283 INFO L272 AbstractInterpreter]: Visited 37 different actions 114 times. Merged at 9 different actions 38 times. Never widened. Performed 524 root evaluator evaluations with a maximum evaluation depth of 10. Performed 524 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Found 12 fixpoints after 6 different actions. Largest state had 25 variables. [2018-12-09 16:21:49,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:21:49,287 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 16:21:49,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:21:49,287 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e9d8e9e9-c4c7-45fe-b4aa-b95689aef5fd/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 16:21:49,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:21:49,294 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 16:21:49,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:21:49,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:21:49,351 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 16:21:49,351 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:21:49,396 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 16:21:49,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 16:21:49,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-12-09 16:21:49,411 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 16:21:49,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 16:21:49,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 16:21:49,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-09 16:21:49,411 INFO L87 Difference]: Start difference. First operand 66 states and 82 transitions. Second operand 12 states. [2018-12-09 16:21:49,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:21:49,434 INFO L93 Difference]: Finished difference Result 127 states and 164 transitions. [2018-12-09 16:21:49,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 16:21:49,434 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 101 [2018-12-09 16:21:49,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:21:49,434 INFO L225 Difference]: With dead ends: 127 [2018-12-09 16:21:49,435 INFO L226 Difference]: Without dead ends: 78 [2018-12-09 16:21:49,435 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 16:21:49,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-09 16:21:49,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-12-09 16:21:49,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-09 16:21:49,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 94 transitions. [2018-12-09 16:21:49,440 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 94 transitions. Word has length 101 [2018-12-09 16:21:49,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:21:49,440 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 94 transitions. [2018-12-09 16:21:49,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 16:21:49,440 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 94 transitions. [2018-12-09 16:21:49,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 16:21:49,441 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:21:49,441 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 16:21:49,441 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:21:49,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:21:49,441 INFO L82 PathProgramCache]: Analyzing trace with hash -992722080, now seen corresponding path program 2 times [2018-12-09 16:21:49,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:21:49,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:21:49,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:21:49,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:21:49,442 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:21:49,450 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-09 16:21:49,450 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-09 16:21:49,450 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e9d8e9e9-c4c7-45fe-b4aa-b95689aef5fd/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 16:21:49,458 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 16:21:49,458 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-09 16:21:49,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:21:49,493 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 16:21:49,493 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 16:21:49,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:21:49,494 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e9d8e9e9-c4c7-45fe-b4aa-b95689aef5fd/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 16:21:49,499 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 16:21:49,499 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 16:21:49,520 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-09 16:21:49,520 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 16:21:49,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:21:49,535 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 16:21:49,535 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:21:49,562 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 16:21:49,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 16:21:49,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-12-09 16:21:49,578 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 16:21:49,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 16:21:49,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 16:21:49,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-09 16:21:49,579 INFO L87 Difference]: Start difference. First operand 78 states and 94 transitions. Second operand 6 states. [2018-12-09 16:21:49,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:21:49,594 INFO L93 Difference]: Finished difference Result 123 states and 152 transitions. [2018-12-09 16:21:49,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 16:21:49,595 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2018-12-09 16:21:49,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:21:49,595 INFO L225 Difference]: With dead ends: 123 [2018-12-09 16:21:49,596 INFO L226 Difference]: Without dead ends: 90 [2018-12-09 16:21:49,596 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 16:21:49,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-09 16:21:49,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-12-09 16:21:49,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-09 16:21:49,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 106 transitions. [2018-12-09 16:21:49,602 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 106 transitions. Word has length 113 [2018-12-09 16:21:49,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:21:49,602 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 106 transitions. [2018-12-09 16:21:49,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 16:21:49,602 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 106 transitions. [2018-12-09 16:21:49,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-09 16:21:49,603 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:21:49,603 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 16:21:49,603 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:21:49,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:21:49,603 INFO L82 PathProgramCache]: Analyzing trace with hash -748407238, now seen corresponding path program 3 times [2018-12-09 16:21:49,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:21:49,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:21:49,604 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 16:21:49,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:21:49,604 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:21:49,612 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-09 16:21:49,612 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-09 16:21:49,612 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e9d8e9e9-c4c7-45fe-b4aa-b95689aef5fd/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 16:21:49,620 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 16:21:49,620 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-09 16:21:49,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:21:49,650 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 16:21:49,651 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 16:21:49,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:21:49,651 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e9d8e9e9-c4c7-45fe-b4aa-b95689aef5fd/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 16:21:49,657 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 16:21:49,657 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-09 16:21:49,686 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 16:21:49,687 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 16:21:49,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:21:49,771 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 16:21:49,771 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:21:49,909 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 16:21:49,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 16:21:49,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-12-09 16:21:49,924 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 16:21:49,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-09 16:21:49,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-09 16:21:49,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-09 16:21:49,925 INFO L87 Difference]: Start difference. First operand 90 states and 106 transitions. Second operand 24 states. [2018-12-09 16:21:49,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:21:49,965 INFO L93 Difference]: Finished difference Result 175 states and 218 transitions. [2018-12-09 16:21:49,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-09 16:21:49,965 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 119 [2018-12-09 16:21:49,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:21:49,966 INFO L225 Difference]: With dead ends: 175 [2018-12-09 16:21:49,966 INFO L226 Difference]: Without dead ends: 114 [2018-12-09 16:21:49,967 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 16:21:49,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-09 16:21:49,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-12-09 16:21:49,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-09 16:21:49,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 130 transitions. [2018-12-09 16:21:49,973 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 130 transitions. Word has length 119 [2018-12-09 16:21:49,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:21:49,973 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 130 transitions. [2018-12-09 16:21:49,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-09 16:21:49,973 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 130 transitions. [2018-12-09 16:21:49,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-09 16:21:49,974 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:21:49,974 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 16:21:49,974 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:21:49,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:21:49,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1957844770, now seen corresponding path program 4 times [2018-12-09 16:21:49,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:21:49,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:21:49,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 16:21:49,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:21:49,975 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:21:49,986 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-09 16:21:49,986 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-09 16:21:49,986 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e9d8e9e9-c4c7-45fe-b4aa-b95689aef5fd/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 16:21:49,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:21:49,993 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-09 16:21:50,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:21:50,027 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 16:21:50,027 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 16:21:50,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:21:50,027 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e9d8e9e9-c4c7-45fe-b4aa-b95689aef5fd/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 16:21:50,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:21:50,033 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 16:21:50,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:21:50,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:21:50,239 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 16:21:50,240 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:21:50,573 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 16:21:50,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 16:21:50,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 42 [2018-12-09 16:21:50,588 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 16:21:50,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-09 16:21:50,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-09 16:21:50,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-09 16:21:50,589 INFO L87 Difference]: Start difference. First operand 114 states and 130 transitions. Second operand 42 states. [2018-12-09 16:21:50,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:21:50,669 INFO L93 Difference]: Finished difference Result 211 states and 260 transitions. [2018-12-09 16:21:50,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-09 16:21:50,669 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 143 [2018-12-09 16:21:50,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:21:50,670 INFO L225 Difference]: With dead ends: 211 [2018-12-09 16:21:50,670 INFO L226 Difference]: Without dead ends: 150 [2018-12-09 16:21:50,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 239 SyntacticMatches, 6 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-09 16:21:50,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-12-09 16:21:50,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-12-09 16:21:50,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-12-09 16:21:50,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 166 transitions. [2018-12-09 16:21:50,681 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 166 transitions. Word has length 143 [2018-12-09 16:21:50,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:21:50,681 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 166 transitions. [2018-12-09 16:21:50,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-09 16:21:50,681 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 166 transitions. [2018-12-09 16:21:50,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-09 16:21:50,683 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:21:50,683 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 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 16:21:50,683 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:21:50,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:21:50,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1294803074, now seen corresponding path program 5 times [2018-12-09 16:21:50,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:21:50,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:21:50,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:21:50,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:21:50,685 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:21:50,704 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-09 16:21:50,705 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-09 16:21:50,705 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e9d8e9e9-c4c7-45fe-b4aa-b95689aef5fd/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 16:21:50,711 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 16:21:50,711 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-09 16:21:50,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:21:50,759 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 16:21:50,759 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 16:21:50,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:21:50,759 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e9d8e9e9-c4c7-45fe-b4aa-b95689aef5fd/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 16:21:50,764 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 16:21:50,765 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 16:21:53,319 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-09 16:21:53,319 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 16:21:53,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:21:53,339 INFO L134 CoverageAnalysis]: Checked inductivity of 2144 backedges. 271 proven. 2 refuted. 0 times theorem prover too weak. 1871 trivial. 0 not checked. [2018-12-09 16:21:53,339 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:21:53,367 INFO L134 CoverageAnalysis]: Checked inductivity of 2144 backedges. 271 proven. 2 refuted. 0 times theorem prover too weak. 1871 trivial. 0 not checked. [2018-12-09 16:21:53,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 16:21:53,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-12-09 16:21:53,383 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 16:21:53,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 16:21:53,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 16:21:53,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-09 16:21:53,383 INFO L87 Difference]: Start difference. First operand 150 states and 166 transitions. Second operand 6 states. [2018-12-09 16:21:53,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:21:53,411 INFO L93 Difference]: Finished difference Result 216 states and 257 transitions. [2018-12-09 16:21:53,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 16:21:53,412 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 179 [2018-12-09 16:21:53,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:21:53,413 INFO L225 Difference]: With dead ends: 216 [2018-12-09 16:21:53,413 INFO L226 Difference]: Without dead ends: 159 [2018-12-09 16:21:53,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 353 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 16:21:53,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-12-09 16:21:53,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-12-09 16:21:53,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-12-09 16:21:53,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 175 transitions. [2018-12-09 16:21:53,421 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 175 transitions. Word has length 179 [2018-12-09 16:21:53,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:21:53,422 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 175 transitions. [2018-12-09 16:21:53,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 16:21:53,422 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 175 transitions. [2018-12-09 16:21:53,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-12-09 16:21:53,423 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:21:53,423 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 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 16:21:53,423 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:21:53,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:21:53,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1305528874, now seen corresponding path program 6 times [2018-12-09 16:21:53,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:21:53,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:21:53,424 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 16:21:53,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:21:53,424 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:21:53,440 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-09 16:21:53,441 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-09 16:21:53,441 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e9d8e9e9-c4c7-45fe-b4aa-b95689aef5fd/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 16:21:53,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 16:21:53,450 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-09 16:21:53,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:21:53,492 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 16:21:53,493 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 16:21:53,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:21:53,493 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e9d8e9e9-c4c7-45fe-b4aa-b95689aef5fd/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 16:21:53,500 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 16:21:53,500 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-09 16:21:53,544 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 16:21:53,544 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 16:21:53,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:21:53,573 INFO L134 CoverageAnalysis]: Checked inductivity of 2765 backedges. 728 proven. 26 refuted. 0 times theorem prover too weak. 2011 trivial. 0 not checked. [2018-12-09 16:21:53,573 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:21:53,634 INFO L134 CoverageAnalysis]: Checked inductivity of 2765 backedges. 330 proven. 291 refuted. 0 times theorem prover too weak. 2144 trivial. 0 not checked. [2018-12-09 16:21:53,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 16:21:53,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-12-09 16:21:53,649 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 16:21:53,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 16:21:53,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 16:21:53,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-09 16:21:53,650 INFO L87 Difference]: Start difference. First operand 159 states and 175 transitions. Second operand 12 states. [2018-12-09 16:21:53,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:21:53,680 INFO L93 Difference]: Finished difference Result 243 states and 287 transitions. [2018-12-09 16:21:53,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 16:21:53,680 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 206 [2018-12-09 16:21:53,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:21:53,681 INFO L225 Difference]: With dead ends: 243 [2018-12-09 16:21:53,681 INFO L226 Difference]: Without dead ends: 177 [2018-12-09 16:21:53,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 401 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 16:21:53,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-12-09 16:21:53,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-12-09 16:21:53,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-12-09 16:21:53,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 193 transitions. [2018-12-09 16:21:53,688 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 193 transitions. Word has length 206 [2018-12-09 16:21:53,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:21:53,688 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 193 transitions. [2018-12-09 16:21:53,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 16:21:53,688 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 193 transitions. [2018-12-09 16:21:53,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-12-09 16:21:53,690 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:21:53,690 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 40, 40, 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 16:21:53,690 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:21:53,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:21:53,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1882242006, now seen corresponding path program 7 times [2018-12-09 16:21:53,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:21:53,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:21:53,691 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 16:21:53,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:21:53,691 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:21:53,703 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-09 16:21:53,703 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-09 16:21:53,703 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e9d8e9e9-c4c7-45fe-b4aa-b95689aef5fd/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 16:21:53,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:21:53,712 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-09 16:21:53,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:21:53,756 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 16:21:53,756 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 16:21:53,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:21:53,756 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e9d8e9e9-c4c7-45fe-b4aa-b95689aef5fd/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 16:21:53,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:21:53,762 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 16:21:53,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:21:53,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:21:53,903 INFO L134 CoverageAnalysis]: Checked inductivity of 4736 backedges. 1133 proven. 155 refuted. 0 times theorem prover too weak. 3448 trivial. 0 not checked. [2018-12-09 16:21:53,904 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:21:54,051 INFO L134 CoverageAnalysis]: Checked inductivity of 4736 backedges. 149 proven. 1573 refuted. 0 times theorem prover too weak. 3014 trivial. 0 not checked. [2018-12-09 16:21:54,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 16:21:54,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2018-12-09 16:21:54,075 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 16:21:54,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-09 16:21:54,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-09 16:21:54,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-12-09 16:21:54,076 INFO L87 Difference]: Start difference. First operand 177 states and 193 transitions. Second operand 23 states. [2018-12-09 16:21:54,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:21:54,122 INFO L93 Difference]: Finished difference Result 294 states and 343 transitions. [2018-12-09 16:21:54,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-09 16:21:54,122 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 260 [2018-12-09 16:21:54,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:21:54,124 INFO L225 Difference]: With dead ends: 294 [2018-12-09 16:21:54,124 INFO L226 Difference]: Without dead ends: 210 [2018-12-09 16:21:54,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 519 GetRequests, 497 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-12-09 16:21:54,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-12-09 16:21:54,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2018-12-09 16:21:54,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-12-09 16:21:54,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 226 transitions. [2018-12-09 16:21:54,132 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 226 transitions. Word has length 260 [2018-12-09 16:21:54,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:21:54,132 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 226 transitions. [2018-12-09 16:21:54,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-09 16:21:54,132 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 226 transitions. [2018-12-09 16:21:54,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2018-12-09 16:21:54,134 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:21:54,134 INFO L402 BasicCegarLoop]: trace histogram [78, 78, 63, 40, 40, 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 16:21:54,134 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:21:54,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:21:54,134 INFO L82 PathProgramCache]: Analyzing trace with hash -216821890, now seen corresponding path program 8 times [2018-12-09 16:21:54,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:21:54,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:21:54,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:21:54,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:21:54,135 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:21:54,147 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-09 16:21:54,147 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-09 16:21:54,147 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e9d8e9e9-c4c7-45fe-b4aa-b95689aef5fd/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 16:21:54,155 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 16:21:54,155 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-09 16:21:54,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:21:54,214 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 16:21:54,214 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 16:21:54,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:21:54,215 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e9d8e9e9-c4c7-45fe-b4aa-b95689aef5fd/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 16:21:54,220 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 16:21:54,220 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 16:21:54,267 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-09 16:21:54,268 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 16:21:54,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:21:54,321 INFO L134 CoverageAnalysis]: Checked inductivity of 10874 backedges. 4170 proven. 16 refuted. 0 times theorem prover too weak. 6688 trivial. 0 not checked. [2018-12-09 16:21:54,321 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:21:54,388 INFO L134 CoverageAnalysis]: Checked inductivity of 10874 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 10858 trivial. 0 not checked. [2018-12-09 16:21:54,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 16:21:54,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-12-09 16:21:54,403 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 16:21:54,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 16:21:54,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 16:21:54,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-09 16:21:54,404 INFO L87 Difference]: Start difference. First operand 210 states and 226 transitions. Second operand 12 states. [2018-12-09 16:21:54,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:21:54,430 INFO L93 Difference]: Finished difference Result 327 states and 362 transitions. [2018-12-09 16:21:54,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 16:21:54,430 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 359 [2018-12-09 16:21:54,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:21:54,431 INFO L225 Difference]: With dead ends: 327 [2018-12-09 16:21:54,431 INFO L226 Difference]: Without dead ends: 234 [2018-12-09 16:21:54,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 717 GetRequests, 707 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 16:21:54,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-12-09 16:21:54,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2018-12-09 16:21:54,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-12-09 16:21:54,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 250 transitions. [2018-12-09 16:21:54,439 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 250 transitions. Word has length 359 [2018-12-09 16:21:54,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:21:54,440 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 250 transitions. [2018-12-09 16:21:54,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 16:21:54,440 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 250 transitions. [2018-12-09 16:21:54,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2018-12-09 16:21:54,441 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:21:54,442 INFO L402 BasicCegarLoop]: trace histogram [78, 78, 63, 40, 40, 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 16:21:54,442 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:21:54,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:21:54,442 INFO L82 PathProgramCache]: Analyzing trace with hash -437205326, now seen corresponding path program 9 times [2018-12-09 16:21:54,442 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:21:54,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:21:54,443 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 16:21:54,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:21:54,443 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:21:54,454 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-09 16:21:54,454 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-09 16:21:54,454 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e9d8e9e9-c4c7-45fe-b4aa-b95689aef5fd/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 16:21:54,460 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 16:21:54,460 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-09 16:21:54,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:21:54,511 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 16:21:54,511 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 16:21:54,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:21:54,511 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e9d8e9e9-c4c7-45fe-b4aa-b95689aef5fd/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 16:21:54,518 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 16:21:54,518 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-09 16:21:54,577 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 16:21:54,577 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 16:21:54,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:21:54,824 INFO L134 CoverageAnalysis]: Checked inductivity of 10958 backedges. 6251 proven. 1001 refuted. 0 times theorem prover too weak. 3706 trivial. 0 not checked. [2018-12-09 16:21:54,824 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:21:55,229 INFO L134 CoverageAnalysis]: Checked inductivity of 10958 backedges. 2084 proven. 3085 refuted. 0 times theorem prover too weak. 5789 trivial. 0 not checked. [2018-12-09 16:21:55,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 16:21:55,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 42 [2018-12-09 16:21:55,244 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 16:21:55,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-09 16:21:55,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-09 16:21:55,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-09 16:21:55,245 INFO L87 Difference]: Start difference. First operand 234 states and 250 transitions. Second operand 42 states. [2018-12-09 16:21:55,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:21:55,356 INFO L93 Difference]: Finished difference Result 417 states and 483 transitions. [2018-12-09 16:21:55,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-09 16:21:55,356 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 371 [2018-12-09 16:21:55,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:21:55,358 INFO L225 Difference]: With dead ends: 417 [2018-12-09 16:21:55,358 INFO L226 Difference]: Without dead ends: 276 [2018-12-09 16:21:55,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 741 GetRequests, 687 SyntacticMatches, 14 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-09 16:21:55,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-12-09 16:21:55,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2018-12-09 16:21:55,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-12-09 16:21:55,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 306 transitions. [2018-12-09 16:21:55,372 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 306 transitions. Word has length 371 [2018-12-09 16:21:55,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:21:55,373 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 306 transitions. [2018-12-09 16:21:55,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-09 16:21:55,373 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 306 transitions. [2018-12-09 16:21:55,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2018-12-09 16:21:55,376 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:21:55,376 INFO L402 BasicCegarLoop]: trace histogram [120, 120, 63, 57, 40, 40, 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 16:21:55,376 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:21:55,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:21:55,376 INFO L82 PathProgramCache]: Analyzing trace with hash -2041066766, now seen corresponding path program 10 times [2018-12-09 16:21:55,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:21:55,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:21:55,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 16:21:55,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:21:55,377 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:21:55,398 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-09 16:21:55,398 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-09 16:21:55,398 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e9d8e9e9-c4c7-45fe-b4aa-b95689aef5fd/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 16:21:55,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:21:55,407 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-09 16:21:55,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:21:55,469 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 16:21:55,469 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 16:21:55,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:21:55,469 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e9d8e9e9-c4c7-45fe-b4aa-b95689aef5fd/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 16:21:55,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:21:55,476 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 16:21:55,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:21:55,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:21:55,666 INFO L134 CoverageAnalysis]: Checked inductivity of 23495 backedges. 9770 proven. 100 refuted. 0 times theorem prover too weak. 13625 trivial. 0 not checked. [2018-12-09 16:21:55,666 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:21:55,837 INFO L134 CoverageAnalysis]: Checked inductivity of 23495 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 23395 trivial. 0 not checked. [2018-12-09 16:21:55,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 16:21:55,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-12-09 16:21:55,853 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 16:21:55,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-09 16:21:55,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-09 16:21:55,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-09 16:21:55,854 INFO L87 Difference]: Start difference. First operand 276 states and 306 transitions. Second operand 24 states. [2018-12-09 16:21:55,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:21:55,902 INFO L93 Difference]: Finished difference Result 459 states and 534 transitions. [2018-12-09 16:21:55,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-09 16:21:55,902 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 497 [2018-12-09 16:21:55,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:21:55,903 INFO L225 Difference]: With dead ends: 459 [2018-12-09 16:21:55,903 INFO L226 Difference]: Without dead ends: 324 [2018-12-09 16:21:55,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 993 GetRequests, 971 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 16:21:55,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-12-09 16:21:55,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2018-12-09 16:21:55,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2018-12-09 16:21:55,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 354 transitions. [2018-12-09 16:21:55,913 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 354 transitions. Word has length 497 [2018-12-09 16:21:55,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:21:55,914 INFO L480 AbstractCegarLoop]: Abstraction has 324 states and 354 transitions. [2018-12-09 16:21:55,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-09 16:21:55,914 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 354 transitions. [2018-12-09 16:21:55,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 522 [2018-12-09 16:21:55,915 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:21:55,916 INFO L402 BasicCegarLoop]: trace histogram [120, 120, 63, 57, 40, 40, 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 16:21:55,916 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:21:55,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:21:55,916 INFO L82 PathProgramCache]: Analyzing trace with hash -347787942, now seen corresponding path program 11 times [2018-12-09 16:21:55,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:21:55,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:21:55,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:21:55,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:21:55,916 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:21:55,929 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-09 16:21:55,929 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-09 16:21:55,929 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e9d8e9e9-c4c7-45fe-b4aa-b95689aef5fd/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 16:21:55,935 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 16:21:55,935 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-09 16:21:55,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:21:56,013 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 16:21:56,013 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 16:21:56,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:21:56,013 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e9d8e9e9-c4c7-45fe-b4aa-b95689aef5fd/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 16:21:56,019 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 16:21:56,019 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 16:22:19,371 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-12-09 16:22:19,371 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 16:22:19,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:22:19,614 INFO L134 CoverageAnalysis]: Checked inductivity of 23879 backedges. 9770 proven. 484 refuted. 0 times theorem prover too weak. 13625 trivial. 0 not checked. [2018-12-09 16:22:19,614 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:22:20,032 INFO L134 CoverageAnalysis]: Checked inductivity of 23879 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 23395 trivial. 0 not checked. [2018-12-09 16:22:20,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 16:22:20,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 41 [2018-12-09 16:22:20,050 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 16:22:20,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-09 16:22:20,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-09 16:22:20,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-12-09 16:22:20,051 INFO L87 Difference]: Start difference. First operand 324 states and 354 transitions. Second operand 41 states. [2018-12-09 16:22:20,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:22:20,150 INFO L93 Difference]: Finished difference Result 527 states and 612 transitions. [2018-12-09 16:22:20,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-09 16:22:20,150 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 521 [2018-12-09 16:22:20,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:22:20,151 INFO L225 Difference]: With dead ends: 527 [2018-12-09 16:22:20,152 INFO L226 Difference]: Without dead ends: 392 [2018-12-09 16:22:20,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1041 GetRequests, 995 SyntacticMatches, 7 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-12-09 16:22:20,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2018-12-09 16:22:20,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2018-12-09 16:22:20,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-12-09 16:22:20,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 422 transitions. [2018-12-09 16:22:20,167 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 422 transitions. Word has length 521 [2018-12-09 16:22:20,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:22:20,167 INFO L480 AbstractCegarLoop]: Abstraction has 392 states and 422 transitions. [2018-12-09 16:22:20,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-09 16:22:20,167 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 422 transitions. [2018-12-09 16:22:20,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 556 [2018-12-09 16:22:20,170 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:22:20,170 INFO L402 BasicCegarLoop]: trace histogram [120, 120, 63, 57, 40, 40, 39, 39, 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 16:22:20,170 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:22:20,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:22:20,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1510047400, now seen corresponding path program 12 times [2018-12-09 16:22:20,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:22:20,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:22:20,171 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 16:22:20,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:22:20,171 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:22:20,184 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-09 16:22:20,184 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-09 16:22:20,184 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e9d8e9e9-c4c7-45fe-b4aa-b95689aef5fd/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 16:22:20,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 16:22:20,190 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-09 16:22:22,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2018-12-09 16:22:22,275 INFO L285 seRefinementStrategy]: Strategy TaipanRefinementStrategy was unsuccessful and could not determine trace feasibility. [2018-12-09 16:22:22,275 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 16:22:22,314 WARN L228 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-12-09 16:22:22,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 04:22:22 BoogieIcfgContainer [2018-12-09 16:22:22,314 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 16:22:22,314 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 16:22:22,314 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 16:22:22,314 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 16:22:22,315 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:21:45" (3/4) ... [2018-12-09 16:22:22,317 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 16:22:22,317 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 16:22:22,317 INFO L168 Benchmark]: Toolchain (without parser) took 36915.36 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 475.5 MB). Free memory was 954.4 MB in the beginning and 1.3 GB in the end (delta: -316.1 MB). Peak memory consumption was 159.4 MB. Max. memory is 11.5 GB. [2018-12-09 16:22:22,318 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 16:22:22,318 INFO L168 Benchmark]: CACSL2BoogieTranslator took 144.09 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 942.6 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-12-09 16:22:22,319 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.50 ms. Allocated memory is still 1.0 GB. Free memory was 942.6 MB in the beginning and 939.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 16:22:22,319 INFO L168 Benchmark]: Boogie Preprocessor took 53.51 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -166.0 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2018-12-09 16:22:22,319 INFO L168 Benchmark]: RCFGBuilder took 161.30 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2018-12-09 16:22:22,319 INFO L168 Benchmark]: TraceAbstraction took 36536.23 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 367.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -181.6 MB). Peak memory consumption was 185.9 MB. Max. memory is 11.5 GB. [2018-12-09 16:22:22,320 INFO L168 Benchmark]: Witness Printer took 2.81 ms. Allocated memory is still 1.5 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 16:22:22,321 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 144.09 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 942.6 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 14.50 ms. Allocated memory is still 1.0 GB. Free memory was 942.6 MB in the beginning and 939.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.51 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -166.0 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 161.30 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 36536.23 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 367.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -181.6 MB). Peak memory consumption was 185.9 MB. Max. memory is 11.5 GB. * Witness Printer took 2.81 ms. Allocated memory is still 1.5 GB. Free memory is still 1.3 GB. 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[40]; [L32] CALL init_nondet(x) [L5] int i; [L6] i = 0 [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 40 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND FALSE !(i < 40) [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 < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND FALSE !(i < 40) [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 < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND FALSE !(i < 40) [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<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<40 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND FALSE !(i<40 -1) [L46] x[40 -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 < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND FALSE !(i > 40/2) [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 40 [L18] COND TRUE i > 40/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND FALSE !(i < 40) [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, 36.5s OverallTime, 20 OverallIterations, 120 TraceHistogramMax, 1.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 625 SDtfs, 601 SDslu, 1781 SDs, 0 SdLazy, 620 SolverSat, 186 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 12 DeclaredPredicates, 6236 GetRequests, 5920 SyntacticMatches, 28 SemanticMatches, 288 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 581 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=392occurred in iteration=19, 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.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 32 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 28.4s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 6790 NumberOfCodeBlocks, 6054 NumberOfCodeBlocksAsserted, 73 NumberOfCheckSat, 6032 ConstructedInterpolants, 0 QuantifiedInterpolants, 2330398 SizeOfPredicates, 15 NumberOfNonLiveVariables, 5747 ConjunctsInSsa, 152 ConjunctsInUnsatCore, 28 InterpolantComputations, 0 PerfectInterpolantSequences, 155114/163681 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...