./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/recursive/Addition02.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 47ea0209 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c147cd-0044-4b00-996a-0d21a156008e/bin/utaipan-UUZaoUuFF8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c147cd-0044-4b00-996a-0d21a156008e/bin/utaipan-UUZaoUuFF8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c147cd-0044-4b00-996a-0d21a156008e/bin/utaipan-UUZaoUuFF8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c147cd-0044-4b00-996a-0d21a156008e/bin/utaipan-UUZaoUuFF8/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive/Addition02.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c147cd-0044-4b00-996a-0d21a156008e/bin/utaipan-UUZaoUuFF8/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c147cd-0044-4b00-996a-0d21a156008e/bin/utaipan-UUZaoUuFF8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 12b38fa2e3d5fdbfa2e75fd7db8c6635c3a88ba468adc8c100051dd60d30a551 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 02:05:21,970 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 02:05:21,972 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 02:05:22,009 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 02:05:22,009 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 02:05:22,011 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 02:05:22,013 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 02:05:22,016 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 02:05:22,019 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 02:05:22,020 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 02:05:22,022 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 02:05:22,023 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 02:05:22,024 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 02:05:22,026 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 02:05:22,028 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 02:05:22,030 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 02:05:22,031 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 02:05:22,033 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 02:05:22,035 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 02:05:22,038 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 02:05:22,041 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 02:05:22,050 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 02:05:22,053 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 02:05:22,055 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 02:05:22,059 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 02:05:22,064 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 02:05:22,064 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 02:05:22,066 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 02:05:22,071 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 02:05:22,072 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 02:05:22,074 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 02:05:22,075 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 02:05:22,077 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 02:05:22,078 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 02:05:22,080 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 02:05:22,081 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 02:05:22,083 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 02:05:22,083 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 02:05:22,083 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 02:05:22,084 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 02:05:22,085 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 02:05:22,086 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c147cd-0044-4b00-996a-0d21a156008e/bin/utaipan-UUZaoUuFF8/config/svcomp-Overflow-32bit-Taipan_Default.epf [2021-11-07 02:05:22,129 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 02:05:22,130 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 02:05:22,131 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-07 02:05:22,131 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-07 02:05:22,131 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-07 02:05:22,132 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-07 02:05:22,132 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-07 02:05:22,132 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-07 02:05:22,132 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-07 02:05:22,133 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-07 02:05:22,133 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-07 02:05:22,133 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-07 02:05:22,133 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-07 02:05:22,134 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-07 02:05:22,134 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-07 02:05:22,135 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 02:05:22,135 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 02:05:22,135 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-07 02:05:22,135 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 02:05:22,136 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 02:05:22,136 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 02:05:22,136 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 02:05:22,136 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 02:05:22,137 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 02:05:22,137 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2021-11-07 02:05:22,137 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 02:05:22,137 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 02:05:22,138 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 02:05:22,138 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 02:05:22,138 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 02:05:22,138 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 02:05:22,139 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 02:05:22,139 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 02:05:22,139 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 02:05:22,140 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 02:05:22,140 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-07 02:05:22,140 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-07 02:05:22,140 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 02:05:22,141 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 02:05:22,141 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-07 02:05:22,141 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c147cd-0044-4b00-996a-0d21a156008e/bin/utaipan-UUZaoUuFF8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_worker_vcloud-master_on_vcloud-master/run_dir_e4c147cd-0044-4b00-996a-0d21a156008e/bin/utaipan-UUZaoUuFF8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 12b38fa2e3d5fdbfa2e75fd7db8c6635c3a88ba468adc8c100051dd60d30a551 [2021-11-07 02:05:22,415 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 02:05:22,442 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 02:05:22,445 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 02:05:22,447 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 02:05:22,448 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 02:05:22,449 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c147cd-0044-4b00-996a-0d21a156008e/bin/utaipan-UUZaoUuFF8/../../sv-benchmarks/c/recursive/Addition02.c [2021-11-07 02:05:22,537 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c147cd-0044-4b00-996a-0d21a156008e/bin/utaipan-UUZaoUuFF8/data/1518a8931/df1dca26ea6d47c68dc701d0f726415c/FLAG1fa5b04cc [2021-11-07 02:05:23,057 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 02:05:23,058 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c147cd-0044-4b00-996a-0d21a156008e/sv-benchmarks/c/recursive/Addition02.c [2021-11-07 02:05:23,065 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c147cd-0044-4b00-996a-0d21a156008e/bin/utaipan-UUZaoUuFF8/data/1518a8931/df1dca26ea6d47c68dc701d0f726415c/FLAG1fa5b04cc [2021-11-07 02:05:23,398 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c147cd-0044-4b00-996a-0d21a156008e/bin/utaipan-UUZaoUuFF8/data/1518a8931/df1dca26ea6d47c68dc701d0f726415c [2021-11-07 02:05:23,402 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 02:05:23,404 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 02:05:23,406 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 02:05:23,406 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 02:05:23,410 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 02:05:23,411 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:05:23" (1/1) ... [2021-11-07 02:05:23,413 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@430a5a8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:05:23, skipping insertion in model container [2021-11-07 02:05:23,413 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:05:23" (1/1) ... [2021-11-07 02:05:23,423 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 02:05:23,441 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 02:05:23,676 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c147cd-0044-4b00-996a-0d21a156008e/sv-benchmarks/c/recursive/Addition02.c[1124,1137] [2021-11-07 02:05:23,677 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 02:05:23,687 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 02:05:23,704 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c147cd-0044-4b00-996a-0d21a156008e/sv-benchmarks/c/recursive/Addition02.c[1124,1137] [2021-11-07 02:05:23,705 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 02:05:23,722 INFO L208 MainTranslator]: Completed translation [2021-11-07 02:05:23,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:05:23 WrapperNode [2021-11-07 02:05:23,723 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 02:05:23,725 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 02:05:23,725 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 02:05:23,725 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 02:05:23,736 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:05:23" (1/1) ... [2021-11-07 02:05:23,744 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:05:23" (1/1) ... [2021-11-07 02:05:23,767 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 02:05:23,768 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 02:05:23,768 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 02:05:23,769 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 02:05:23,779 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:05:23" (1/1) ... [2021-11-07 02:05:23,780 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:05:23" (1/1) ... [2021-11-07 02:05:23,781 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:05:23" (1/1) ... [2021-11-07 02:05:23,782 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:05:23" (1/1) ... [2021-11-07 02:05:23,786 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:05:23" (1/1) ... [2021-11-07 02:05:23,789 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:05:23" (1/1) ... [2021-11-07 02:05:23,791 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:05:23" (1/1) ... [2021-11-07 02:05:23,793 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 02:05:23,794 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 02:05:23,795 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 02:05:23,795 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 02:05:23,796 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:05:23" (1/1) ... [2021-11-07 02:05:23,806 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 02:05:23,819 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c147cd-0044-4b00-996a-0d21a156008e/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 02:05:23,838 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c147cd-0044-4b00-996a-0d21a156008e/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 02:05:23,859 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c147cd-0044-4b00-996a-0d21a156008e/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 02:05:23,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 02:05:23,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 02:05:23,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-07 02:05:23,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 02:05:23,904 INFO L130 BoogieDeclarations]: Found specification of procedure addition [2021-11-07 02:05:23,905 INFO L138 BoogieDeclarations]: Found implementation of procedure addition [2021-11-07 02:05:24,321 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 02:05:24,328 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-07 02:05:24,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:05:24 BoogieIcfgContainer [2021-11-07 02:05:24,357 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 02:05:24,359 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 02:05:24,360 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 02:05:24,364 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 02:05:24,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 02:05:23" (1/3) ... [2021-11-07 02:05:24,365 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23f501b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:05:24, skipping insertion in model container [2021-11-07 02:05:24,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:05:23" (2/3) ... [2021-11-07 02:05:24,366 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23f501b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:05:24, skipping insertion in model container [2021-11-07 02:05:24,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:05:24" (3/3) ... [2021-11-07 02:05:24,368 INFO L111 eAbstractionObserver]: Analyzing ICFG Addition02.c [2021-11-07 02:05:24,374 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 02:05:24,388 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2021-11-07 02:05:24,477 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 02:05:24,486 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-07 02:05:24,487 INFO L340 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2021-11-07 02:05:24,508 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 32 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-07 02:05:24,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-07 02:05:24,515 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:05:24,515 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:05:24,516 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2021-11-07 02:05:24,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:05:24,524 INFO L85 PathProgramCache]: Analyzing trace with hash -2044595686, now seen corresponding path program 1 times [2021-11-07 02:05:24,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:05:24,536 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832427821] [2021-11-07 02:05:24,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:05:24,538 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:05:24,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:05:24,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:05:24,857 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:05:24,857 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832427821] [2021-11-07 02:05:24,858 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832427821] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:05:24,859 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:05:24,859 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 02:05:24,861 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100125887] [2021-11-07 02:05:24,867 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 02:05:24,868 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:05:24,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 02:05:24,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:05:24,907 INFO L87 Difference]: Start difference. First operand has 37 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 32 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:05:25,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:05:25,071 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2021-11-07 02:05:25,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 02:05:25,074 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-11-07 02:05:25,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:05:25,086 INFO L225 Difference]: With dead ends: 65 [2021-11-07 02:05:25,086 INFO L226 Difference]: Without dead ends: 59 [2021-11-07 02:05:25,090 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-07 02:05:25,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-11-07 02:05:25,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2021-11-07 02:05:25,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 45 states have internal predecessors, (57), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-07 02:05:25,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2021-11-07 02:05:25,147 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 67 transitions. Word has length 8 [2021-11-07 02:05:25,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:05:25,148 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 67 transitions. [2021-11-07 02:05:25,149 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:05:25,149 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2021-11-07 02:05:25,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-07 02:05:25,150 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:05:25,151 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:05:25,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-07 02:05:25,152 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting additionErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2021-11-07 02:05:25,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:05:25,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1042043244, now seen corresponding path program 1 times [2021-11-07 02:05:25,154 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:05:25,154 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591445220] [2021-11-07 02:05:25,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:05:25,155 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:05:25,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:05:25,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:05:25,237 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:05:25,237 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591445220] [2021-11-07 02:05:25,238 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591445220] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:05:25,238 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:05:25,238 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 02:05:25,239 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390858376] [2021-11-07 02:05:25,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 02:05:25,241 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:05:25,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 02:05:25,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:05:25,243 INFO L87 Difference]: Start difference. First operand 53 states and 67 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:05:25,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:05:25,385 INFO L93 Difference]: Finished difference Result 97 states and 125 transitions. [2021-11-07 02:05:25,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 02:05:25,386 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-11-07 02:05:25,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:05:25,388 INFO L225 Difference]: With dead ends: 97 [2021-11-07 02:05:25,389 INFO L226 Difference]: Without dead ends: 95 [2021-11-07 02:05:25,390 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-07 02:05:25,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-11-07 02:05:25,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 89. [2021-11-07 02:05:25,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 66 states have (on average 1.5606060606060606) internal successors, (103), 75 states have internal predecessors, (103), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2021-11-07 02:05:25,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 121 transitions. [2021-11-07 02:05:25,461 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 121 transitions. Word has length 9 [2021-11-07 02:05:25,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:05:25,462 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 121 transitions. [2021-11-07 02:05:25,462 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:05:25,462 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 121 transitions. [2021-11-07 02:05:25,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-07 02:05:25,463 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:05:25,463 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:05:25,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-07 02:05:25,464 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2021-11-07 02:05:25,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:05:25,465 INFO L85 PathProgramCache]: Analyzing trace with hash -2056522533, now seen corresponding path program 1 times [2021-11-07 02:05:25,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:05:25,466 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550760346] [2021-11-07 02:05:25,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:05:25,466 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:05:25,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:05:25,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:05:25,597 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:05:25,604 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550760346] [2021-11-07 02:05:25,605 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550760346] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:05:25,606 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:05:25,606 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:05:25,607 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615408383] [2021-11-07 02:05:25,607 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:05:25,608 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:05:25,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:05:25,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:05:25,615 INFO L87 Difference]: Start difference. First operand 89 states and 121 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 02:05:25,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:05:25,661 INFO L93 Difference]: Finished difference Result 89 states and 121 transitions. [2021-11-07 02:05:25,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:05:25,667 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2021-11-07 02:05:25,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:05:25,675 INFO L225 Difference]: With dead ends: 89 [2021-11-07 02:05:25,675 INFO L226 Difference]: Without dead ends: 88 [2021-11-07 02:05:25,676 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:05:25,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-11-07 02:05:25,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2021-11-07 02:05:25,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 66 states have (on average 1.5454545454545454) internal successors, (102), 74 states have internal predecessors, (102), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2021-11-07 02:05:25,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 120 transitions. [2021-11-07 02:05:25,709 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 120 transitions. Word has length 10 [2021-11-07 02:05:25,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:05:25,710 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 120 transitions. [2021-11-07 02:05:25,710 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 02:05:25,710 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 120 transitions. [2021-11-07 02:05:25,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-07 02:05:25,711 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:05:25,711 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:05:25,712 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-07 02:05:25,712 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting additionErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2021-11-07 02:05:25,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:05:25,713 INFO L85 PathProgramCache]: Analyzing trace with hash -2056397732, now seen corresponding path program 1 times [2021-11-07 02:05:25,713 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:05:25,714 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128514621] [2021-11-07 02:05:25,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:05:25,714 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:05:25,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:05:25,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:05:25,785 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:05:25,785 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128514621] [2021-11-07 02:05:25,786 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128514621] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:05:25,786 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:05:25,786 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 02:05:25,786 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094809354] [2021-11-07 02:05:25,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 02:05:25,787 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:05:25,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 02:05:25,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:05:25,789 INFO L87 Difference]: Start difference. First operand 88 states and 120 transitions. Second operand has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:05:25,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:05:25,891 INFO L93 Difference]: Finished difference Result 97 states and 128 transitions. [2021-11-07 02:05:25,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 02:05:25,892 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-11-07 02:05:25,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:05:25,895 INFO L225 Difference]: With dead ends: 97 [2021-11-07 02:05:25,896 INFO L226 Difference]: Without dead ends: 95 [2021-11-07 02:05:25,897 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-07 02:05:25,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-11-07 02:05:25,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 87. [2021-11-07 02:05:25,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 66 states have (on average 1.4545454545454546) internal successors, (96), 73 states have internal predecessors, (96), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2021-11-07 02:05:25,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 114 transitions. [2021-11-07 02:05:25,916 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 114 transitions. Word has length 10 [2021-11-07 02:05:25,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:05:25,916 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 114 transitions. [2021-11-07 02:05:25,917 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:05:25,917 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 114 transitions. [2021-11-07 02:05:25,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-07 02:05:25,918 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:05:25,918 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:05:25,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-07 02:05:25,919 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2021-11-07 02:05:25,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:05:25,920 INFO L85 PathProgramCache]: Analyzing trace with hash 672310965, now seen corresponding path program 1 times [2021-11-07 02:05:25,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:05:25,920 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137024151] [2021-11-07 02:05:25,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:05:25,921 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:05:25,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:05:25,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:05:25,967 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:05:25,967 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137024151] [2021-11-07 02:05:25,968 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137024151] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:05:25,968 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:05:25,968 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:05:25,968 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931674263] [2021-11-07 02:05:25,969 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:05:25,969 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:05:25,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:05:25,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:05:25,971 INFO L87 Difference]: Start difference. First operand 87 states and 114 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 02:05:25,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:05:25,995 INFO L93 Difference]: Finished difference Result 87 states and 114 transitions. [2021-11-07 02:05:25,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:05:25,996 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2021-11-07 02:05:25,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:05:25,997 INFO L225 Difference]: With dead ends: 87 [2021-11-07 02:05:25,998 INFO L226 Difference]: Without dead ends: 67 [2021-11-07 02:05:25,998 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:05:25,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-11-07 02:05:26,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 53. [2021-11-07 02:05:26,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 48 states have internal predecessors, (57), 5 states have call successors, (5), 4 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:05:26,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2021-11-07 02:05:26,008 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 11 [2021-11-07 02:05:26,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:05:26,008 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2021-11-07 02:05:26,009 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 02:05:26,009 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2021-11-07 02:05:26,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-07 02:05:26,010 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:05:26,010 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:05:26,010 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-07 02:05:26,011 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting additionErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2021-11-07 02:05:26,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:05:26,011 INFO L85 PathProgramCache]: Analyzing trace with hash 676179822, now seen corresponding path program 1 times [2021-11-07 02:05:26,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:05:26,012 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981035793] [2021-11-07 02:05:26,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:05:26,013 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:05:26,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:05:26,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:05:26,051 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:05:26,051 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981035793] [2021-11-07 02:05:26,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981035793] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:05:26,052 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:05:26,052 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-07 02:05:26,052 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550988511] [2021-11-07 02:05:26,053 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:05:26,053 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:05:26,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:05:26,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:05:26,054 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:05:26,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:05:26,071 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2021-11-07 02:05:26,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:05:26,072 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-07 02:05:26,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:05:26,072 INFO L225 Difference]: With dead ends: 53 [2021-11-07 02:05:26,073 INFO L226 Difference]: Without dead ends: 52 [2021-11-07 02:05:26,073 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:05:26,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-11-07 02:05:26,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2021-11-07 02:05:26,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 47 states have internal predecessors, (55), 5 states have call successors, (5), 4 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:05:26,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2021-11-07 02:05:26,093 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 11 [2021-11-07 02:05:26,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:05:26,094 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2021-11-07 02:05:26,095 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:05:26,095 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2021-11-07 02:05:26,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-07 02:05:26,096 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:05:26,096 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:05:26,096 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-07 02:05:26,097 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting additionErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2021-11-07 02:05:26,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:05:26,099 INFO L85 PathProgramCache]: Analyzing trace with hash -186889601, now seen corresponding path program 1 times [2021-11-07 02:05:26,099 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:05:26,100 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102341289] [2021-11-07 02:05:26,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:05:26,102 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:05:26,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:05:26,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:05:26,206 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:05:26,206 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102341289] [2021-11-07 02:05:26,206 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102341289] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:05:26,207 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:05:26,207 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 02:05:26,207 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338341532] [2021-11-07 02:05:26,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 02:05:26,208 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:05:26,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 02:05:26,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:05:26,209 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand has 5 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:05:26,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:05:26,260 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2021-11-07 02:05:26,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 02:05:26,260 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-11-07 02:05:26,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:05:26,261 INFO L225 Difference]: With dead ends: 76 [2021-11-07 02:05:26,261 INFO L226 Difference]: Without dead ends: 43 [2021-11-07 02:05:26,262 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-07 02:05:26,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2021-11-07 02:05:26,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2021-11-07 02:05:26,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 35 states have internal predecessors, (39), 4 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:05:26,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2021-11-07 02:05:26,269 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 12 [2021-11-07 02:05:26,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:05:26,269 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2021-11-07 02:05:26,270 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:05:26,270 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2021-11-07 02:05:26,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-07 02:05:26,271 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:05:26,271 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:05:26,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-07 02:05:26,272 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2021-11-07 02:05:26,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:05:26,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1626555607, now seen corresponding path program 1 times [2021-11-07 02:05:26,273 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:05:26,273 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200336588] [2021-11-07 02:05:26,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:05:26,274 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:05:26,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:05:26,366 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:05:26,367 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:05:26,367 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200336588] [2021-11-07 02:05:26,367 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200336588] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 02:05:26,368 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162375937] [2021-11-07 02:05:26,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:05:26,368 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:05:26,369 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c147cd-0044-4b00-996a-0d21a156008e/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 02:05:26,374 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c147cd-0044-4b00-996a-0d21a156008e/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 02:05:26,406 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c147cd-0044-4b00-996a-0d21a156008e/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-07 02:05:26,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:05:26,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-07 02:05:26,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:05:26,590 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:05:26,591 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:05:26,705 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:05:26,706 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162375937] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 02:05:26,706 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1005944209] [2021-11-07 02:05:26,732 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2021-11-07 02:05:26,732 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 02:05:26,739 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-07 02:05:26,745 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 02:05:26,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2021-11-07 02:05:26,746 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282555024] [2021-11-07 02:05:26,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 02:05:26,747 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:05:26,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 02:05:26,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-11-07 02:05:26,748 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:05:27,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:05:27,015 INFO L93 Difference]: Finished difference Result 150 states and 173 transitions. [2021-11-07 02:05:27,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-07 02:05:27,016 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-11-07 02:05:27,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:05:27,018 INFO L225 Difference]: With dead ends: 150 [2021-11-07 02:05:27,018 INFO L226 Difference]: Without dead ends: 148 [2021-11-07 02:05:27,019 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2021-11-07 02:05:27,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-11-07 02:05:27,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 109. [2021-11-07 02:05:27,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 91 states have (on average 1.2967032967032968) internal successors, (118), 98 states have internal predecessors, (118), 12 states have call successors, (12), 10 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:05:27,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 130 transitions. [2021-11-07 02:05:27,035 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 130 transitions. Word has length 16 [2021-11-07 02:05:27,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:05:27,036 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 130 transitions. [2021-11-07 02:05:27,036 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:05:27,036 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 130 transitions. [2021-11-07 02:05:27,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-07 02:05:27,037 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:05:27,037 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:05:27,083 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c147cd-0044-4b00-996a-0d21a156008e/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-07 02:05:27,264 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c147cd-0044-4b00-996a-0d21a156008e/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:05:27,265 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting additionErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2021-11-07 02:05:27,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:05:27,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1927547204, now seen corresponding path program 1 times [2021-11-07 02:05:27,266 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:05:27,266 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868952282] [2021-11-07 02:05:27,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:05:27,267 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:05:27,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:05:27,352 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:05:27,353 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:05:27,354 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868952282] [2021-11-07 02:05:27,354 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868952282] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:05:27,356 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:05:27,356 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 02:05:27,356 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540552848] [2021-11-07 02:05:27,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 02:05:27,357 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:05:27,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 02:05:27,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:05:27,358 INFO L87 Difference]: Start difference. First operand 109 states and 130 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:05:27,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:05:27,398 INFO L93 Difference]: Finished difference Result 110 states and 130 transitions. [2021-11-07 02:05:27,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 02:05:27,399 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-11-07 02:05:27,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:05:27,400 INFO L225 Difference]: With dead ends: 110 [2021-11-07 02:05:27,400 INFO L226 Difference]: Without dead ends: 41 [2021-11-07 02:05:27,405 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-07 02:05:27,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-11-07 02:05:27,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2021-11-07 02:05:27,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 5 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:05:27,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2021-11-07 02:05:27,413 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 20 [2021-11-07 02:05:27,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:05:27,413 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2021-11-07 02:05:27,413 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:05:27,414 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2021-11-07 02:05:27,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-07 02:05:27,415 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:05:27,416 INFO L513 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2021-11-07 02:05:27,416 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-07 02:05:27,416 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2021-11-07 02:05:27,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:05:27,417 INFO L85 PathProgramCache]: Analyzing trace with hash 340979470, now seen corresponding path program 2 times [2021-11-07 02:05:27,417 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:05:27,417 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603772943] [2021-11-07 02:05:27,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:05:27,418 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:05:27,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:05:27,684 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:05:27,684 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:05:27,684 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603772943] [2021-11-07 02:05:27,684 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603772943] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 02:05:27,685 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040355358] [2021-11-07 02:05:27,685 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-07 02:05:27,685 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:05:27,685 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c147cd-0044-4b00-996a-0d21a156008e/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 02:05:27,693 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c147cd-0044-4b00-996a-0d21a156008e/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 02:05:27,716 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c147cd-0044-4b00-996a-0d21a156008e/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-07 02:05:27,781 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-11-07 02:05:27,781 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 02:05:27,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-07 02:05:27,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:05:27,976 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:05:27,976 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:05:28,249 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:05:28,250 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2040355358] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 02:05:28,251 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1920820751] [2021-11-07 02:05:28,255 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2021-11-07 02:05:28,256 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 02:05:28,256 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-07 02:05:28,256 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 02:05:28,257 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2021-11-07 02:05:28,257 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277050312] [2021-11-07 02:05:28,259 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-11-07 02:05:28,260 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:05:28,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-07 02:05:28,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2021-11-07 02:05:28,261 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand has 24 states, 23 states have (on average 3.0) internal successors, (69), 14 states have internal predecessors, (69), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:05:28,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:05:28,486 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2021-11-07 02:05:28,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-07 02:05:28,487 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.0) internal successors, (69), 14 states have internal predecessors, (69), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-11-07 02:05:28,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:05:28,489 INFO L225 Difference]: With dead ends: 94 [2021-11-07 02:05:28,490 INFO L226 Difference]: Without dead ends: 93 [2021-11-07 02:05:28,491 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=311, Invalid=811, Unknown=0, NotChecked=0, Total=1122 [2021-11-07 02:05:28,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-11-07 02:05:28,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2021-11-07 02:05:28,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 77 states have (on average 1.0129870129870129) internal successors, (78), 77 states have internal predecessors, (78), 11 states have call successors, (11), 11 states have call predecessors, (11), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:05:28,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2021-11-07 02:05:28,518 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 40 [2021-11-07 02:05:28,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:05:28,521 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2021-11-07 02:05:28,521 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.0) internal successors, (69), 14 states have internal predecessors, (69), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:05:28,521 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2021-11-07 02:05:28,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-11-07 02:05:28,527 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:05:28,528 INFO L513 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1] [2021-11-07 02:05:28,576 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c147cd-0044-4b00-996a-0d21a156008e/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-11-07 02:05:28,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c147cd-0044-4b00-996a-0d21a156008e/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-11-07 02:05:28,748 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2021-11-07 02:05:28,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:05:28,748 INFO L85 PathProgramCache]: Analyzing trace with hash -194452356, now seen corresponding path program 3 times [2021-11-07 02:05:28,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:05:28,749 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197820399] [2021-11-07 02:05:28,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:05:28,749 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:05:28,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:05:29,165 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:05:29,165 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:05:29,165 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197820399] [2021-11-07 02:05:29,166 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197820399] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 02:05:29,166 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2313125] [2021-11-07 02:05:29,166 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-07 02:05:29,166 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:05:29,166 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c147cd-0044-4b00-996a-0d21a156008e/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 02:05:29,173 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c147cd-0044-4b00-996a-0d21a156008e/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 02:05:29,216 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c147cd-0044-4b00-996a-0d21a156008e/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-07 02:05:29,322 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-07 02:05:29,323 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 02:05:29,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-07 02:05:29,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:05:29,727 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:05:29,727 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:05:30,687 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:05:30,687 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2313125] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 02:05:30,687 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1997438755] [2021-11-07 02:05:30,690 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2021-11-07 02:05:30,690 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 02:05:30,691 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-07 02:05:30,691 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 02:05:30,692 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2021-11-07 02:05:30,692 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645534145] [2021-11-07 02:05:30,694 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2021-11-07 02:05:30,694 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:05:30,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-11-07 02:05:30,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=556, Invalid=1700, Unknown=0, NotChecked=0, Total=2256 [2021-11-07 02:05:30,697 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand has 48 states, 47 states have (on average 3.25531914893617) internal successors, (153), 26 states have internal predecessors, (153), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:05:31,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:05:31,514 INFO L93 Difference]: Finished difference Result 190 states and 201 transitions. [2021-11-07 02:05:31,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-11-07 02:05:31,515 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 3.25531914893617) internal successors, (153), 26 states have internal predecessors, (153), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-11-07 02:05:31,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:05:31,518 INFO L225 Difference]: With dead ends: 190 [2021-11-07 02:05:31,518 INFO L226 Difference]: Without dead ends: 189 [2021-11-07 02:05:31,521 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1337, Invalid=3493, Unknown=0, NotChecked=0, Total=4830 [2021-11-07 02:05:31,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-11-07 02:05:31,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 185. [2021-11-07 02:05:31,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 161 states have (on average 1.0062111801242235) internal successors, (162), 161 states have internal predecessors, (162), 23 states have call successors, (23), 23 states have call predecessors, (23), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:05:31,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2021-11-07 02:05:31,544 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 88 [2021-11-07 02:05:31,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:05:31,547 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2021-11-07 02:05:31,547 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 3.25531914893617) internal successors, (153), 26 states have internal predecessors, (153), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:05:31,548 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2021-11-07 02:05:31,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-11-07 02:05:31,560 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:05:31,560 INFO L513 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1] [2021-11-07 02:05:31,586 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c147cd-0044-4b00-996a-0d21a156008e/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-07 02:05:31,761 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c147cd-0044-4b00-996a-0d21a156008e/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:05:31,764 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2021-11-07 02:05:31,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:05:31,765 INFO L85 PathProgramCache]: Analyzing trace with hash -309111976, now seen corresponding path program 4 times [2021-11-07 02:05:31,765 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:05:31,765 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275804333] [2021-11-07 02:05:31,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:05:31,766 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:05:31,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:05:33,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:05:33,043 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:05:33,043 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275804333] [2021-11-07 02:05:33,043 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275804333] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 02:05:33,044 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224392415] [2021-11-07 02:05:33,044 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-07 02:05:33,044 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:05:33,044 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c147cd-0044-4b00-996a-0d21a156008e/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 02:05:33,045 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c147cd-0044-4b00-996a-0d21a156008e/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 02:05:33,074 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c147cd-0044-4b00-996a-0d21a156008e/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-07 02:05:33,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:05:33,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 48 conjunts are in the unsatisfiable core [2021-11-07 02:05:33,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:05:34,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:05:34,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:05:36,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:05:36,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224392415] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 02:05:36,765 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [820987278] [2021-11-07 02:05:36,767 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2021-11-07 02:05:36,767 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 02:05:36,768 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-07 02:05:36,768 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 02:05:36,769 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2021-11-07 02:05:36,769 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657744146] [2021-11-07 02:05:36,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2021-11-07 02:05:36,770 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:05:36,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2021-11-07 02:05:36,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2260, Invalid=6860, Unknown=0, NotChecked=0, Total=9120 [2021-11-07 02:05:36,778 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand has 96 states, 95 states have (on average 3.3789473684210525) internal successors, (321), 50 states have internal predecessors, (321), 46 states have call successors, (46), 46 states have call predecessors, (46), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:05:39,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:05:39,116 INFO L93 Difference]: Finished difference Result 382 states and 405 transitions. [2021-11-07 02:05:39,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2021-11-07 02:05:39,117 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 95 states have (on average 3.3789473684210525) internal successors, (321), 50 states have internal predecessors, (321), 46 states have call successors, (46), 46 states have call predecessors, (46), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-11-07 02:05:39,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:05:39,121 INFO L225 Difference]: With dead ends: 382 [2021-11-07 02:05:39,121 INFO L226 Difference]: Without dead ends: 381 [2021-11-07 02:05:39,133 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4140 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5549, Invalid=14473, Unknown=0, NotChecked=0, Total=20022 [2021-11-07 02:05:39,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2021-11-07 02:05:39,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 377. [2021-11-07 02:05:39,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 329 states have (on average 1.0030395136778116) internal successors, (330), 329 states have internal predecessors, (330), 47 states have call successors, (47), 47 states have call predecessors, (47), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:05:39,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 377 transitions. [2021-11-07 02:05:39,156 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 377 transitions. Word has length 184 [2021-11-07 02:05:39,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:05:39,157 INFO L470 AbstractCegarLoop]: Abstraction has 377 states and 377 transitions. [2021-11-07 02:05:39,157 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 95 states have (on average 3.3789473684210525) internal successors, (321), 50 states have internal predecessors, (321), 46 states have call successors, (46), 46 states have call predecessors, (46), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:05:39,157 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 377 transitions. [2021-11-07 02:05:39,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2021-11-07 02:05:39,171 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:05:39,172 INFO L513 BasicCegarLoop]: trace histogram [47, 47, 47, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1] [2021-11-07 02:05:39,200 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c147cd-0044-4b00-996a-0d21a156008e/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-07 02:05:39,384 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c147cd-0044-4b00-996a-0d21a156008e/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-11-07 02:05:39,385 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2021-11-07 02:05:39,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:05:39,385 INFO L85 PathProgramCache]: Analyzing trace with hash 956449040, now seen corresponding path program 5 times [2021-11-07 02:05:39,385 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:05:39,385 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474622211] [2021-11-07 02:05:39,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:05:39,386 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:05:39,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:05:42,930 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 0 proven. 8464 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:05:42,931 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:05:42,931 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474622211] [2021-11-07 02:05:42,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474622211] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 02:05:42,932 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088090713] [2021-11-07 02:05:42,932 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-07 02:05:42,932 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:05:42,933 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c147cd-0044-4b00-996a-0d21a156008e/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 02:05:42,945 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c147cd-0044-4b00-996a-0d21a156008e/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 02:05:42,946 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c147cd-0044-4b00-996a-0d21a156008e/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-07 02:05:43,482 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2021-11-07 02:05:43,482 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 02:05:43,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 96 conjunts are in the unsatisfiable core [2021-11-07 02:05:43,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:05:44,943 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 0 proven. 8464 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:05:44,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:05:53,237 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 0 proven. 8464 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:05:53,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088090713] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 02:05:53,238 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [12452730] [2021-11-07 02:05:53,241 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2021-11-07 02:05:53,241 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 02:05:53,241 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-07 02:05:53,243 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 02:05:53,243 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2021-11-07 02:05:53,244 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281695185] [2021-11-07 02:05:53,246 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 192 states [2021-11-07 02:05:53,246 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:05:53,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2021-11-07 02:05:53,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9124, Invalid=27548, Unknown=0, NotChecked=0, Total=36672 [2021-11-07 02:05:53,264 INFO L87 Difference]: Start difference. First operand 377 states and 377 transitions. Second operand has 192 states, 191 states have (on average 3.43979057591623) internal successors, (657), 98 states have internal predecessors, (657), 94 states have call successors, (94), 94 states have call predecessors, (94), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:06:02,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:06:02,271 INFO L93 Difference]: Finished difference Result 766 states and 813 transitions. [2021-11-07 02:06:02,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2021-11-07 02:06:02,272 INFO L78 Accepts]: Start accepts. Automaton has has 192 states, 191 states have (on average 3.43979057591623) internal successors, (657), 98 states have internal predecessors, (657), 94 states have call successors, (94), 94 states have call predecessors, (94), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 376 [2021-11-07 02:06:02,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:06:02,279 INFO L225 Difference]: With dead ends: 766 [2021-11-07 02:06:02,279 INFO L226 Difference]: Without dead ends: 765 [2021-11-07 02:06:02,291 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 940 GetRequests, 656 SyntacticMatches, 0 SemanticMatches, 284 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17484 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=22613, Invalid=58897, Unknown=0, NotChecked=0, Total=81510 [2021-11-07 02:06:02,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2021-11-07 02:06:02,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 761. [2021-11-07 02:06:02,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 761 states, 665 states have (on average 1.0015037593984963) internal successors, (666), 665 states have internal predecessors, (666), 95 states have call successors, (95), 95 states have call predecessors, (95), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:06:02,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 761 transitions. [2021-11-07 02:06:02,331 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 761 transitions. Word has length 376 [2021-11-07 02:06:02,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:06:02,333 INFO L470 AbstractCegarLoop]: Abstraction has 761 states and 761 transitions. [2021-11-07 02:06:02,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 192 states, 191 states have (on average 3.43979057591623) internal successors, (657), 98 states have internal predecessors, (657), 94 states have call successors, (94), 94 states have call predecessors, (94), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:06:02,334 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 761 transitions. [2021-11-07 02:06:02,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 761 [2021-11-07 02:06:02,359 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:06:02,360 INFO L513 BasicCegarLoop]: trace histogram [95, 95, 95, 94, 94, 94, 94, 94, 1, 1, 1, 1, 1] [2021-11-07 02:06:02,400 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c147cd-0044-4b00-996a-0d21a156008e/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-07 02:06:02,576 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c147cd-0044-4b00-996a-0d21a156008e/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-11-07 02:06:02,577 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2021-11-07 02:06:02,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:06:02,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1565023360, now seen corresponding path program 6 times [2021-11-07 02:06:02,578 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:06:02,578 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78531188] [2021-11-07 02:06:02,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:06:02,578 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:06:03,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:06:14,846 INFO L134 CoverageAnalysis]: Checked inductivity of 35344 backedges. 0 proven. 35344 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:06:14,847 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:06:14,847 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78531188] [2021-11-07 02:06:14,847 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78531188] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 02:06:14,847 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089906282] [2021-11-07 02:06:14,848 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-07 02:06:14,848 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:06:14,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c147cd-0044-4b00-996a-0d21a156008e/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 02:06:14,849 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c147cd-0044-4b00-996a-0d21a156008e/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 02:06:14,850 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c147cd-0044-4b00-996a-0d21a156008e/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-07 02:06:15,651 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-07 02:06:15,652 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 02:06:15,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 1558 conjuncts, 192 conjunts are in the unsatisfiable core [2021-11-07 02:06:15,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:06:18,453 INFO L134 CoverageAnalysis]: Checked inductivity of 35344 backedges. 0 proven. 35344 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:06:18,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:06:49,742 INFO L134 CoverageAnalysis]: Checked inductivity of 35344 backedges. 0 proven. 35344 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:06:49,742 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089906282] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 02:06:49,742 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [28971715] [2021-11-07 02:06:49,746 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2021-11-07 02:06:49,746 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 02:06:49,747 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-07 02:06:49,748 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 02:06:49,749 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [192, 192, 192] total 383 [2021-11-07 02:06:49,749 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342461049] [2021-11-07 02:06:49,753 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 384 states [2021-11-07 02:06:49,754 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:06:49,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 384 interpolants. [2021-11-07 02:06:49,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36676, Invalid=110396, Unknown=0, NotChecked=0, Total=147072 [2021-11-07 02:06:49,784 INFO L87 Difference]: Start difference. First operand 761 states and 761 transitions. Second operand has 384 states, 383 states have (on average 3.4699738903394257) internal successors, (1329), 194 states have internal predecessors, (1329), 190 states have call successors, (190), 190 states have call predecessors, (190), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:07:40,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:07:40,548 INFO L93 Difference]: Finished difference Result 1534 states and 1629 transitions. [2021-11-07 02:07:40,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 384 states. [2021-11-07 02:07:40,550 INFO L78 Accepts]: Start accepts. Automaton has has 384 states, 383 states have (on average 3.4699738903394257) internal successors, (1329), 194 states have internal predecessors, (1329), 190 states have call successors, (190), 190 states have call predecessors, (190), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 760 [2021-11-07 02:07:40,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:07:40,562 INFO L225 Difference]: With dead ends: 1534 [2021-11-07 02:07:40,562 INFO L226 Difference]: Without dead ends: 1533 [2021-11-07 02:07:40,595 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 1900 GetRequests, 1328 SyntacticMatches, 0 SemanticMatches, 572 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71820 ImplicationChecksByTransitivity, 59.3s TimeCoverageRelationStatistics Valid=91301, Invalid=237601, Unknown=0, NotChecked=0, Total=328902 [2021-11-07 02:07:40,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2021-11-07 02:07:40,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1529. [2021-11-07 02:07:40,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1529 states, 1337 states have (on average 1.0007479431563202) internal successors, (1338), 1337 states have internal predecessors, (1338), 191 states have call successors, (191), 191 states have call predecessors, (191), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:07:40,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1529 states to 1529 states and 1529 transitions. [2021-11-07 02:07:40,684 INFO L78 Accepts]: Start accepts. Automaton has 1529 states and 1529 transitions. Word has length 760 [2021-11-07 02:07:40,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:07:40,686 INFO L470 AbstractCegarLoop]: Abstraction has 1529 states and 1529 transitions. [2021-11-07 02:07:40,688 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 384 states, 383 states have (on average 3.4699738903394257) internal successors, (1329), 194 states have internal predecessors, (1329), 190 states have call successors, (190), 190 states have call predecessors, (190), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:07:40,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1529 states and 1529 transitions. [2021-11-07 02:07:40,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1529 [2021-11-07 02:07:40,787 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:07:40,788 INFO L513 BasicCegarLoop]: trace histogram [191, 191, 191, 190, 190, 190, 190, 190, 1, 1, 1, 1, 1] [2021-11-07 02:07:40,835 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c147cd-0044-4b00-996a-0d21a156008e/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-11-07 02:07:41,004 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c147cd-0044-4b00-996a-0d21a156008e/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:07:41,005 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2021-11-07 02:07:41,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:07:41,006 INFO L85 PathProgramCache]: Analyzing trace with hash 594908000, now seen corresponding path program 7 times [2021-11-07 02:07:41,006 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:07:41,006 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292754979] [2021-11-07 02:07:41,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:07:41,006 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:07:43,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:08:29,915 INFO L134 CoverageAnalysis]: Checked inductivity of 144400 backedges. 0 proven. 144400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:08:29,916 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:08:29,916 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292754979] [2021-11-07 02:08:29,916 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292754979] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 02:08:29,916 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841227249] [2021-11-07 02:08:29,916 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-07 02:08:29,916 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:08:29,917 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c147cd-0044-4b00-996a-0d21a156008e/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 02:08:29,917 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c147cd-0044-4b00-996a-0d21a156008e/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 02:08:29,918 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c147cd-0044-4b00-996a-0d21a156008e/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-07 02:08:31,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:08:31,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 3094 conjuncts, 384 conjunts are in the unsatisfiable core [2021-11-07 02:08:31,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:08:36,892 INFO L134 CoverageAnalysis]: Checked inductivity of 144400 backedges. 0 proven. 144400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:08:36,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:10:32,433 INFO L134 CoverageAnalysis]: Checked inductivity of 144400 backedges. 0 proven. 144400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:10:32,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [841227249] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 02:10:32,434 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1523638891] [2021-11-07 02:10:32,437 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2021-11-07 02:10:32,438 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 02:10:32,438 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-07 02:10:32,438 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 02:10:32,440 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [384, 384, 384] total 767 [2021-11-07 02:10:32,440 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541083189] [2021-11-07 02:10:32,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 768 states [2021-11-07 02:10:32,447 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:10:32,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 768 interpolants. [2021-11-07 02:10:32,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147076, Invalid=441980, Unknown=0, NotChecked=0, Total=589056 [2021-11-07 02:10:32,553 INFO L87 Difference]: Start difference. First operand 1529 states and 1529 transitions. Second operand has 768 states, 767 states have (on average 3.485006518904824) internal successors, (2673), 386 states have internal predecessors, (2673), 382 states have call successors, (382), 382 states have call predecessors, (382), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)