./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-numeric/rec_counter3.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 9ad7fb26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/config/TaipanReach.xml -i ../../sv-benchmarks/c/termination-numeric/rec_counter3.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH --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 64bit --witnessprinter.graph.data.programhash d7b4f33979632a981e739ff06b52fe01aa9fb175d5e5193b145052887f22f8a3 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-9ad7fb2 [2021-11-03 05:11:22,769 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-03 05:11:22,771 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-03 05:11:22,819 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-03 05:11:22,820 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-03 05:11:22,824 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-03 05:11:22,826 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-03 05:11:22,830 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-03 05:11:22,832 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-03 05:11:22,837 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-03 05:11:22,839 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-03 05:11:22,840 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-03 05:11:22,841 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-03 05:11:22,843 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-03 05:11:22,845 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-03 05:11:22,851 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-03 05:11:22,852 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-03 05:11:22,853 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-03 05:11:22,856 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-03 05:11:22,865 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-03 05:11:22,867 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-03 05:11:22,868 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-03 05:11:22,871 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-03 05:11:22,872 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-03 05:11:22,880 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-03 05:11:22,881 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-03 05:11:22,881 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-03 05:11:22,883 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-03 05:11:22,883 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-03 05:11:22,885 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-03 05:11:22,886 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-03 05:11:22,886 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-03 05:11:22,888 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-03 05:11:22,889 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-03 05:11:22,891 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-03 05:11:22,891 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-03 05:11:22,891 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-03 05:11:22,892 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-03 05:11:22,892 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-03 05:11:22,893 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-03 05:11:22,893 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-03 05:11:22,894 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/config/svcomp-Overflow-64bit-Taipan_Default.epf [2021-11-03 05:11:22,943 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-03 05:11:22,943 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-03 05:11:22,944 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-03 05:11:22,944 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-03 05:11:22,945 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-03 05:11:22,945 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-03 05:11:22,945 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-03 05:11:22,945 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-03 05:11:22,951 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-03 05:11:22,951 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-03 05:11:22,952 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-03 05:11:22,952 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-03 05:11:22,952 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-03 05:11:22,952 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-03 05:11:22,952 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-03 05:11:22,953 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-03 05:11:22,953 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-03 05:11:22,953 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-03 05:11:22,954 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-03 05:11:22,954 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-03 05:11:22,954 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-03 05:11:22,954 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-03 05:11:22,954 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2021-11-03 05:11:22,954 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-03 05:11:22,955 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-03 05:11:22,955 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-03 05:11:22,955 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-03 05:11:22,955 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-03 05:11:22,955 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 05:11:22,956 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-03 05:11:22,956 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-03 05:11:22,956 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-03 05:11:22,956 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-03 05:11:22,956 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-03 05:11:22,957 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-03 05:11:22,957 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-03 05:11:22,957 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-03 05:11:22,957 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_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/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_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d7b4f33979632a981e739ff06b52fe01aa9fb175d5e5193b145052887f22f8a3 [2021-11-03 05:11:23,221 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-03 05:11:23,249 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-03 05:11:23,253 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-03 05:11:23,254 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-03 05:11:23,255 INFO L275 PluginConnector]: CDTParser initialized [2021-11-03 05:11:23,256 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/../../sv-benchmarks/c/termination-numeric/rec_counter3.c [2021-11-03 05:11:23,324 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/data/650ee2db0/3771b71c26e6480b882aed8801688353/FLAG6f03689fb [2021-11-03 05:11:23,834 INFO L306 CDTParser]: Found 1 translation units. [2021-11-03 05:11:23,835 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/sv-benchmarks/c/termination-numeric/rec_counter3.c [2021-11-03 05:11:23,846 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/data/650ee2db0/3771b71c26e6480b882aed8801688353/FLAG6f03689fb [2021-11-03 05:11:24,216 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/data/650ee2db0/3771b71c26e6480b882aed8801688353 [2021-11-03 05:11:24,218 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-03 05:11:24,219 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-03 05:11:24,223 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-03 05:11:24,223 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-03 05:11:24,226 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-03 05:11:24,228 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 05:11:24" (1/1) ... [2021-11-03 05:11:24,230 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38f9b0fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:11:24, skipping insertion in model container [2021-11-03 05:11:24,230 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 05:11:24" (1/1) ... [2021-11-03 05:11:24,238 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-03 05:11:24,251 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-03 05:11:24,421 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 05:11:24,424 INFO L203 MainTranslator]: Completed pre-run [2021-11-03 05:11:24,437 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 05:11:24,448 INFO L208 MainTranslator]: Completed translation [2021-11-03 05:11:24,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:11:24 WrapperNode [2021-11-03 05:11:24,449 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-03 05:11:24,450 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-03 05:11:24,450 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-03 05:11:24,450 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-03 05:11:24,457 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:11:24" (1/1) ... [2021-11-03 05:11:24,461 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:11:24" (1/1) ... [2021-11-03 05:11:24,476 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-03 05:11:24,477 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-03 05:11:24,477 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-03 05:11:24,477 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-03 05:11:24,485 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:11:24" (1/1) ... [2021-11-03 05:11:24,485 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:11:24" (1/1) ... [2021-11-03 05:11:24,486 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:11:24" (1/1) ... [2021-11-03 05:11:24,486 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:11:24" (1/1) ... [2021-11-03 05:11:24,488 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:11:24" (1/1) ... [2021-11-03 05:11:24,492 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:11:24" (1/1) ... [2021-11-03 05:11:24,492 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:11:24" (1/1) ... [2021-11-03 05:11:24,494 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-03 05:11:24,494 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-03 05:11:24,494 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-03 05:11:24,495 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-03 05:11:24,500 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:11:24" (1/1) ... [2021-11-03 05:11:24,507 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 05:11:24,519 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 05:11:24,530 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-03 05:11:24,540 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-03 05:11:24,573 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2021-11-03 05:11:24,573 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2021-11-03 05:11:24,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-03 05:11:24,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-03 05:11:24,809 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-03 05:11:24,809 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2021-11-03 05:11:24,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 05:11:24 BoogieIcfgContainer [2021-11-03 05:11:24,812 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-03 05:11:24,814 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-03 05:11:24,814 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-03 05:11:24,817 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-03 05:11:24,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 05:11:24" (1/3) ... [2021-11-03 05:11:24,818 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@276c1c6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 05:11:24, skipping insertion in model container [2021-11-03 05:11:24,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:11:24" (2/3) ... [2021-11-03 05:11:24,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@276c1c6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 05:11:24, skipping insertion in model container [2021-11-03 05:11:24,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 05:11:24" (3/3) ... [2021-11-03 05:11:24,820 INFO L111 eAbstractionObserver]: Analyzing ICFG rec_counter3.c [2021-11-03 05:11:24,826 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-03 05:11:24,826 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2021-11-03 05:11:24,884 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-03 05:11:24,893 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-03 05:11:24,894 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-11-03 05:11:24,912 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 16 states have (on average 1.625) internal successors, (26), 22 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-03 05:11:24,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-03 05:11:24,917 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:11:24,918 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-03 05:11:24,918 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-03 05:11:24,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:11:24,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1869057678, now seen corresponding path program 1 times [2021-11-03 05:11:24,933 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:11:24,934 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96510582] [2021-11-03 05:11:24,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:11:24,935 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:11:25,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:11:25,134 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-03 05:11:25,135 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:11:25,135 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96510582] [2021-11-03 05:11:25,136 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96510582] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:11:25,136 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:11:25,136 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 05:11:25,138 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232745589] [2021-11-03 05:11:25,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 05:11:25,142 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:11:25,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 05:11:25,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-03 05:11:25,174 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.625) internal successors, (26), 22 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 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-03 05:11:25,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:11:25,280 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2021-11-03 05:11:25,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 05:11:25,282 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2021-11-03 05:11:25,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:11:25,289 INFO L225 Difference]: With dead ends: 26 [2021-11-03 05:11:25,291 INFO L226 Difference]: Without dead ends: 21 [2021-11-03 05:11:25,293 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 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-03 05:11:25,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2021-11-03 05:11:25,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2021-11-03 05:11:25,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 18 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-03 05:11:25,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2021-11-03 05:11:25,328 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 6 [2021-11-03 05:11:25,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:11:25,329 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2021-11-03 05:11:25,329 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 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-03 05:11:25,329 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2021-11-03 05:11:25,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-03 05:11:25,330 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:11:25,330 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:11:25,331 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-03 05:11:25,331 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-03 05:11:25,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:11:25,332 INFO L85 PathProgramCache]: Analyzing trace with hash 2106213208, now seen corresponding path program 1 times [2021-11-03 05:11:25,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:11:25,333 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889414909] [2021-11-03 05:11:25,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:11:25,333 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:11:25,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:11:25,370 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-03 05:11:25,370 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:11:25,371 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889414909] [2021-11-03 05:11:25,371 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889414909] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:11:25,371 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:11:25,372 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 05:11:25,376 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366875644] [2021-11-03 05:11:25,377 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 05:11:25,377 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:11:25,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 05:11:25,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-03 05:11:25,379 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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-03 05:11:25,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:11:25,447 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2021-11-03 05:11:25,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 05:11:25,448 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 7 [2021-11-03 05:11:25,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:11:25,449 INFO L225 Difference]: With dead ends: 41 [2021-11-03 05:11:25,449 INFO L226 Difference]: Without dead ends: 36 [2021-11-03 05:11:25,450 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-03 05:11:25,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2021-11-03 05:11:25,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2021-11-03 05:11:25,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 27 states have internal predecessors, (34), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-03 05:11:25,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2021-11-03 05:11:25,458 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 7 [2021-11-03 05:11:25,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:11:25,458 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2021-11-03 05:11:25,459 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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-03 05:11:25,459 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2021-11-03 05:11:25,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-03 05:11:25,462 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:11:25,462 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-11-03 05:11:25,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-03 05:11:25,463 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-03 05:11:25,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:11:25,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1481509059, now seen corresponding path program 1 times [2021-11-03 05:11:25,473 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:11:25,473 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527478421] [2021-11-03 05:11:25,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:11:25,475 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:11:25,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:11:25,588 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-03 05:11:25,588 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:11:25,589 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527478421] [2021-11-03 05:11:25,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527478421] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 05:11:25,589 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808774894] [2021-11-03 05:11:25,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:11:25,590 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:11:25,590 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 05:11:25,601 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 05:11:25,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-03 05:11:25,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:11:25,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-03 05:11:25,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 05:11:25,779 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-03 05:11:25,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 05:11:25,889 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-03 05:11:25,889 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808774894] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 05:11:25,890 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1088363540] [2021-11-03 05:11:25,911 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2021-11-03 05:11:25,912 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 05:11:25,917 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-03 05:11:25,919 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 05:11:25,919 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2021-11-03 05:11:25,919 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405871018] [2021-11-03 05:11:25,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-03 05:11:25,920 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:11:25,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-03 05:11:25,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-11-03 05:11:25,922 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 12 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 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-03 05:11:26,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:11:26,004 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2021-11-03 05:11:26,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-03 05:11:26,005 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 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 12 [2021-11-03 05:11:26,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:11:26,008 INFO L225 Difference]: With dead ends: 38 [2021-11-03 05:11:26,008 INFO L226 Difference]: Without dead ends: 37 [2021-11-03 05:11:26,009 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2021-11-03 05:11:26,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-11-03 05:11:26,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2021-11-03 05:11:26,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.434782608695652) internal successors, (33), 26 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-03 05:11:26,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2021-11-03 05:11:26,024 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 12 [2021-11-03 05:11:26,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:11:26,025 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2021-11-03 05:11:26,025 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 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-03 05:11:26,026 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2021-11-03 05:11:26,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-03 05:11:26,027 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:11:26,027 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:11:26,048 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-03 05:11:26,236 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:11:26,236 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-03 05:11:26,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:11:26,237 INFO L85 PathProgramCache]: Analyzing trace with hash 548371825, now seen corresponding path program 1 times [2021-11-03 05:11:26,237 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:11:26,238 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580386892] [2021-11-03 05:11:26,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:11:26,238 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:11:26,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:11:26,301 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-03 05:11:26,301 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:11:26,301 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580386892] [2021-11-03 05:11:26,302 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580386892] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:11:26,302 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:11:26,302 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-03 05:11:26,302 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695098567] [2021-11-03 05:11:26,303 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 05:11:26,303 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:11:26,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 05:11:26,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-03 05:11:26,304 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-03 05:11:26,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:11:26,340 INFO L93 Difference]: Finished difference Result 55 states and 71 transitions. [2021-11-03 05:11:26,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 05:11:26,341 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-11-03 05:11:26,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:11:26,343 INFO L225 Difference]: With dead ends: 55 [2021-11-03 05:11:26,344 INFO L226 Difference]: Without dead ends: 37 [2021-11-03 05:11:26,345 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-03 05:11:26,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-11-03 05:11:26,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2021-11-03 05:11:26,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 30 states have internal predecessors, (38), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-03 05:11:26,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2021-11-03 05:11:26,354 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 15 [2021-11-03 05:11:26,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:11:26,355 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2021-11-03 05:11:26,355 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-03 05:11:26,355 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2021-11-03 05:11:26,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-03 05:11:26,356 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:11:26,356 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:11:26,356 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-03 05:11:26,357 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting recErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-03 05:11:26,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:11:26,357 INFO L85 PathProgramCache]: Analyzing trace with hash 548373103, now seen corresponding path program 1 times [2021-11-03 05:11:26,357 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:11:26,358 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103354942] [2021-11-03 05:11:26,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:11:26,358 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:11:26,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:11:26,394 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-03 05:11:26,395 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:11:26,395 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103354942] [2021-11-03 05:11:26,395 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103354942] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:11:26,395 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:11:26,396 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 05:11:26,396 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372831489] [2021-11-03 05:11:26,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 05:11:26,397 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:11:26,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 05:11:26,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 05:11:26,398 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-03 05:11:26,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:11:26,452 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2021-11-03 05:11:26,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 05:11:26,453 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-11-03 05:11:26,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:11:26,454 INFO L225 Difference]: With dead ends: 53 [2021-11-03 05:11:26,455 INFO L226 Difference]: Without dead ends: 52 [2021-11-03 05:11:26,455 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-03 05:11:26,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-11-03 05:11:26,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 41. [2021-11-03 05:11:26,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 32 states have (on average 1.375) internal successors, (44), 34 states have internal predecessors, (44), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-03 05:11:26,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions. [2021-11-03 05:11:26,472 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 51 transitions. Word has length 15 [2021-11-03 05:11:26,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:11:26,472 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 51 transitions. [2021-11-03 05:11:26,473 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-03 05:11:26,473 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2021-11-03 05:11:26,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-03 05:11:26,474 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:11:26,474 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:11:26,474 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-03 05:11:26,474 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting recErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-03 05:11:26,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:11:26,475 INFO L85 PathProgramCache]: Analyzing trace with hash -180302931, now seen corresponding path program 1 times [2021-11-03 05:11:26,475 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:11:26,475 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564650838] [2021-11-03 05:11:26,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:11:26,475 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:11:26,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:11:26,501 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-03 05:11:26,501 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:11:26,501 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564650838] [2021-11-03 05:11:26,502 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564650838] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:11:26,502 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:11:26,502 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-03 05:11:26,502 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150708485] [2021-11-03 05:11:26,503 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 05:11:26,503 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:11:26,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 05:11:26,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 05:11:26,504 INFO L87 Difference]: Start difference. First operand 41 states and 51 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-03 05:11:26,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:11:26,513 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2021-11-03 05:11:26,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 05:11:26,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2021-11-03 05:11:26,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:11:26,515 INFO L225 Difference]: With dead ends: 41 [2021-11-03 05:11:26,515 INFO L226 Difference]: Without dead ends: 36 [2021-11-03 05:11:26,516 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-03 05:11:26,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2021-11-03 05:11:26,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2021-11-03 05:11:26,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 30 states have internal predecessors, (37), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-03 05:11:26,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2021-11-03 05:11:26,523 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 16 [2021-11-03 05:11:26,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:11:26,524 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2021-11-03 05:11:26,524 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-03 05:11:26,524 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2021-11-03 05:11:26,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-03 05:11:26,525 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:11:26,526 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:11:26,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-03 05:11:26,526 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-03 05:11:26,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:11:26,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1774439281, now seen corresponding path program 1 times [2021-11-03 05:11:26,527 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:11:26,527 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749546734] [2021-11-03 05:11:26,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:11:26,528 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:11:26,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:11:26,662 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-03 05:11:26,663 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:11:26,663 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749546734] [2021-11-03 05:11:26,663 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749546734] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 05:11:26,663 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014875690] [2021-11-03 05:11:26,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:11:26,664 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:11:26,664 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 05:11:26,672 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 05:11:26,680 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-03 05:11:26,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:11:26,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-03 05:11:26,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 05:11:26,868 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-03 05:11:26,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 05:11:27,013 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-03 05:11:27,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1014875690] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-03 05:11:27,013 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-11-03 05:11:27,013 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [8] total 18 [2021-11-03 05:11:27,014 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329591310] [2021-11-03 05:11:27,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-03 05:11:27,014 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:11:27,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-03 05:11:27,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2021-11-03 05:11:27,016 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 12 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-03 05:11:27,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:11:27,128 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2021-11-03 05:11:27,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-03 05:11:27,128 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2021-11-03 05:11:27,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:11:27,131 INFO L225 Difference]: With dead ends: 36 [2021-11-03 05:11:27,131 INFO L226 Difference]: Without dead ends: 35 [2021-11-03 05:11:27,132 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2021-11-03 05:11:27,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-11-03 05:11:27,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2021-11-03 05:11:27,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-03 05:11:27,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2021-11-03 05:11:27,154 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 26 [2021-11-03 05:11:27,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:11:27,154 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2021-11-03 05:11:27,154 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-03 05:11:27,155 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2021-11-03 05:11:27,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-03 05:11:27,156 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:11:27,156 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:11:27,193 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-03 05:11:27,356 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-11-03 05:11:27,357 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting recErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-03 05:11:27,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:11:27,357 INFO L85 PathProgramCache]: Analyzing trace with hash 826957190, now seen corresponding path program 1 times [2021-11-03 05:11:27,357 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:11:27,358 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591929885] [2021-11-03 05:11:27,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:11:27,358 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:11:27,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:11:27,411 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-03 05:11:27,412 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:11:27,412 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591929885] [2021-11-03 05:11:27,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591929885] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:11:27,412 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:11:27,413 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-03 05:11:27,413 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837778409] [2021-11-03 05:11:27,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 05:11:27,414 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:11:27,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 05:11:27,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 05:11:27,416 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-03 05:11:27,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:11:27,428 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2021-11-03 05:11:27,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 05:11:27,428 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2021-11-03 05:11:27,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:11:27,431 INFO L225 Difference]: With dead ends: 35 [2021-11-03 05:11:27,431 INFO L226 Difference]: Without dead ends: 34 [2021-11-03 05:11:27,436 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-03 05:11:27,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-11-03 05:11:27,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2021-11-03 05:11:27,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-03 05:11:27,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2021-11-03 05:11:27,447 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 27 [2021-11-03 05:11:27,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:11:27,448 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2021-11-03 05:11:27,450 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-03 05:11:27,456 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2021-11-03 05:11:27,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-03 05:11:27,457 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:11:27,458 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:11:27,458 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-03 05:11:27,458 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting recErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-03 05:11:27,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:11:27,459 INFO L85 PathProgramCache]: Analyzing trace with hash 136912678, now seen corresponding path program 1 times [2021-11-03 05:11:27,459 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:11:27,459 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545920838] [2021-11-03 05:11:27,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:11:27,460 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:11:27,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:11:27,553 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-03 05:11:27,553 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:11:27,553 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545920838] [2021-11-03 05:11:27,554 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545920838] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 05:11:27,554 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742896120] [2021-11-03 05:11:27,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:11:27,554 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:11:27,555 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 05:11:27,555 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 05:11:27,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-03 05:11:27,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:11:27,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-03 05:11:27,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 05:11:27,722 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-03 05:11:27,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 05:11:27,879 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-03 05:11:27,879 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742896120] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 05:11:27,884 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1193585920] [2021-11-03 05:11:27,887 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-03 05:11:27,888 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 05:11:27,888 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-03 05:11:27,888 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 05:11:27,888 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2021-11-03 05:11:27,889 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736125018] [2021-11-03 05:11:27,890 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-03 05:11:27,890 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:11:27,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-03 05:11:27,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2021-11-03 05:11:27,891 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-03 05:11:28,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:11:28,017 INFO L93 Difference]: Finished difference Result 73 states and 87 transitions. [2021-11-03 05:11:28,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-03 05:11:28,018 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2021-11-03 05:11:28,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:11:28,022 INFO L225 Difference]: With dead ends: 73 [2021-11-03 05:11:28,022 INFO L226 Difference]: Without dead ends: 58 [2021-11-03 05:11:28,023 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2021-11-03 05:11:28,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-11-03 05:11:28,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2021-11-03 05:11:28,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 44 states have (on average 1.2045454545454546) internal successors, (53), 44 states have internal predecessors, (53), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (5), 5 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-03 05:11:28,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2021-11-03 05:11:28,041 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 29 [2021-11-03 05:11:28,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:11:28,042 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2021-11-03 05:11:28,042 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-03 05:11:28,042 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2021-11-03 05:11:28,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-03 05:11:28,044 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:11:28,044 INFO L513 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2021-11-03 05:11:28,082 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-03 05:11:28,245 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-11-03 05:11:28,245 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting recErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-03 05:11:28,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:11:28,246 INFO L85 PathProgramCache]: Analyzing trace with hash -112147322, now seen corresponding path program 2 times [2021-11-03 05:11:28,246 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:11:28,246 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655279131] [2021-11-03 05:11:28,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:11:28,246 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:11:28,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:11:28,369 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 42 proven. 9 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2021-11-03 05:11:28,369 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:11:28,369 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655279131] [2021-11-03 05:11:28,370 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655279131] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 05:11:28,370 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187383117] [2021-11-03 05:11:28,370 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-03 05:11:28,370 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:11:28,370 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 05:11:28,371 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 05:11:28,390 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-03 05:11:28,453 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-03 05:11:28,453 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-03 05:11:28,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-03 05:11:28,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 05:11:28,624 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2021-11-03 05:11:28,624 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 05:11:28,878 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2021-11-03 05:11:28,878 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187383117] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 05:11:28,884 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1335467762] [2021-11-03 05:11:28,887 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-03 05:11:28,887 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 05:11:28,888 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-03 05:11:28,889 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 05:11:28,889 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5, 5] total 21 [2021-11-03 05:11:28,890 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990281719] [2021-11-03 05:11:28,891 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-03 05:11:28,891 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:11:28,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-03 05:11:28,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2021-11-03 05:11:28,892 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 18 states have internal predecessors, (56), 1 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) [2021-11-03 05:11:29,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:11:29,206 INFO L93 Difference]: Finished difference Result 119 states and 145 transitions. [2021-11-03 05:11:29,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-03 05:11:29,206 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 18 states have internal predecessors, (56), 1 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) Word has length 57 [2021-11-03 05:11:29,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:11:29,207 INFO L225 Difference]: With dead ends: 119 [2021-11-03 05:11:29,207 INFO L226 Difference]: Without dead ends: 83 [2021-11-03 05:11:29,209 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=1068, Unknown=0, NotChecked=0, Total=1332 [2021-11-03 05:11:29,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-11-03 05:11:29,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 67. [2021-11-03 05:11:29,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 59 states have (on average 1.11864406779661) internal successors, (66), 59 states have internal predecessors, (66), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (5), 5 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-03 05:11:29,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2021-11-03 05:11:29,223 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 57 [2021-11-03 05:11:29,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:11:29,223 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2021-11-03 05:11:29,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 18 states have internal predecessors, (56), 1 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) [2021-11-03 05:11:29,223 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2021-11-03 05:11:29,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-11-03 05:11:29,225 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:11:29,226 INFO L513 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1] [2021-11-03 05:11:29,251 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-03 05:11:29,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-11-03 05:11:29,451 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting recErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-03 05:11:29,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:11:29,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1063329113, now seen corresponding path program 3 times [2021-11-03 05:11:29,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:11:29,452 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654780336] [2021-11-03 05:11:29,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:11:29,452 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:11:29,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:11:29,597 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-11-03 05:11:29,597 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:11:29,597 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654780336] [2021-11-03 05:11:29,598 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654780336] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 05:11:29,598 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095916760] [2021-11-03 05:11:29,598 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-03 05:11:29,598 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:11:29,598 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 05:11:29,604 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 05:11:29,609 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-03 05:11:29,715 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-03 05:11:29,715 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-03 05:11:29,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-03 05:11:29,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 05:11:29,891 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 9 proven. 75 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-11-03 05:11:29,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 05:11:30,476 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 9 proven. 75 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-11-03 05:11:30,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095916760] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 05:11:30,476 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [600021096] [2021-11-03 05:11:30,478 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-03 05:11:30,478 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 05:11:30,479 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-03 05:11:30,480 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 05:11:30,481 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 25 [2021-11-03 05:11:30,481 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963455713] [2021-11-03 05:11:30,482 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-11-03 05:11:30,482 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:11:30,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-11-03 05:11:30,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2021-11-03 05:11:30,483 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand has 26 states, 25 states have (on average 2.64) internal successors, (66), 19 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (8), 8 states have call predecessors, (8), 1 states have call successors, (8) [2021-11-03 05:11:30,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:11:30,781 INFO L93 Difference]: Finished difference Result 181 states and 207 transitions. [2021-11-03 05:11:30,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-11-03 05:11:30,782 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.64) internal successors, (66), 19 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (8), 8 states have call predecessors, (8), 1 states have call successors, (8) Word has length 66 [2021-11-03 05:11:30,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:11:30,787 INFO L225 Difference]: With dead ends: 181 [2021-11-03 05:11:30,788 INFO L226 Difference]: Without dead ends: 132 [2021-11-03 05:11:30,790 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=360, Invalid=1362, Unknown=0, NotChecked=0, Total=1722 [2021-11-03 05:11:30,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2021-11-03 05:11:30,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 115. [2021-11-03 05:11:30,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 103 states have (on average 1.1067961165048543) internal successors, (114), 103 states have internal predecessors, (114), 3 states have call successors, (3), 2 states have call predecessors, (3), 8 states have return successors, (9), 9 states have call predecessors, (9), 2 states have call successors, (9) [2021-11-03 05:11:30,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 126 transitions. [2021-11-03 05:11:30,806 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 126 transitions. Word has length 66 [2021-11-03 05:11:30,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:11:30,807 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 126 transitions. [2021-11-03 05:11:30,807 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.64) internal successors, (66), 19 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (8), 8 states have call predecessors, (8), 1 states have call successors, (8) [2021-11-03 05:11:30,807 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 126 transitions. [2021-11-03 05:11:30,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-11-03 05:11:30,820 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:11:30,820 INFO L513 BasicCegarLoop]: trace histogram [14, 14, 14, 11, 10, 10, 10, 10, 8, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1] [2021-11-03 05:11:30,846 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-03 05:11:31,036 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:11:31,036 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting recErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-03 05:11:31,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:11:31,037 INFO L85 PathProgramCache]: Analyzing trace with hash -788213445, now seen corresponding path program 4 times [2021-11-03 05:11:31,037 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:11:31,037 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483819587] [2021-11-03 05:11:31,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:11:31,037 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:11:31,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:11:31,249 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 334 proven. 26 refuted. 0 times theorem prover too weak. 431 trivial. 0 not checked. [2021-11-03 05:11:31,249 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:11:31,249 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483819587] [2021-11-03 05:11:31,249 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483819587] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 05:11:31,250 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521617975] [2021-11-03 05:11:31,250 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-03 05:11:31,250 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:11:31,250 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 05:11:31,251 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 05:11:31,275 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-03 05:11:31,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:11:31,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-03 05:11:31,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 05:11:31,815 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 318 proven. 36 refuted. 0 times theorem prover too weak. 437 trivial. 0 not checked. [2021-11-03 05:11:31,815 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 05:11:32,616 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 322 proven. 32 refuted. 0 times theorem prover too weak. 437 trivial. 0 not checked. [2021-11-03 05:11:32,616 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521617975] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 05:11:32,617 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1532504419] [2021-11-03 05:11:32,619 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-03 05:11:32,619 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 05:11:32,619 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-03 05:11:32,621 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 05:11:32,621 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 17 [2021-11-03 05:11:32,622 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356254137] [2021-11-03 05:11:32,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-03 05:11:32,623 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:11:32,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-03 05:11:32,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2021-11-03 05:11:32,624 INFO L87 Difference]: Start difference. First operand 115 states and 126 transitions. Second operand has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 15 states have internal predecessors, (54), 1 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-03 05:11:32,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:11:32,930 INFO L93 Difference]: Finished difference Result 219 states and 244 transitions. [2021-11-03 05:11:32,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-03 05:11:32,931 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 15 states have internal predecessors, (54), 1 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) Word has length 144 [2021-11-03 05:11:32,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:11:32,933 INFO L225 Difference]: With dead ends: 219 [2021-11-03 05:11:32,933 INFO L226 Difference]: Without dead ends: 142 [2021-11-03 05:11:32,935 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 282 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=185, Invalid=685, Unknown=0, NotChecked=0, Total=870 [2021-11-03 05:11:32,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-11-03 05:11:32,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 138. [2021-11-03 05:11:32,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 125 states have (on average 1.088) internal successors, (136), 125 states have internal predecessors, (136), 3 states have call successors, (3), 2 states have call predecessors, (3), 9 states have return successors, (10), 10 states have call predecessors, (10), 2 states have call successors, (10) [2021-11-03 05:11:32,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 149 transitions. [2021-11-03 05:11:32,948 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 149 transitions. Word has length 144 [2021-11-03 05:11:32,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:11:32,948 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 149 transitions. [2021-11-03 05:11:32,949 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 15 states have internal predecessors, (54), 1 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-03 05:11:32,949 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 149 transitions. [2021-11-03 05:11:32,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2021-11-03 05:11:32,951 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:11:32,951 INFO L513 BasicCegarLoop]: trace histogram [18, 18, 18, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1] [2021-11-03 05:11:32,986 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-03 05:11:33,176 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:11:33,176 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting recErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-03 05:11:33,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:11:33,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1213786215, now seen corresponding path program 5 times [2021-11-03 05:11:33,177 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:11:33,177 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948993835] [2021-11-03 05:11:33,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:11:33,177 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:11:33,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:11:33,356 INFO L134 CoverageAnalysis]: Checked inductivity of 920 backedges. 470 proven. 53 refuted. 0 times theorem prover too weak. 397 trivial. 0 not checked. [2021-11-03 05:11:33,356 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:11:33,356 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948993835] [2021-11-03 05:11:33,356 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948993835] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 05:11:33,356 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614785366] [2021-11-03 05:11:33,357 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-03 05:11:33,357 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:11:33,357 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 05:11:33,358 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 05:11:33,374 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-03 05:11:33,630 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-11-03 05:11:33,630 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-03 05:11:33,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-03 05:11:33,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 05:11:34,031 INFO L134 CoverageAnalysis]: Checked inductivity of 920 backedges. 185 proven. 12 refuted. 0 times theorem prover too weak. 723 trivial. 0 not checked. [2021-11-03 05:11:34,032 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 05:11:34,595 INFO L134 CoverageAnalysis]: Checked inductivity of 920 backedges. 185 proven. 12 refuted. 0 times theorem prover too weak. 723 trivial. 0 not checked. [2021-11-03 05:11:34,595 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [614785366] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 05:11:34,595 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [629054403] [2021-11-03 05:11:34,602 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-03 05:11:34,602 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 05:11:34,603 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-03 05:11:34,604 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 05:11:34,604 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 9, 9] total 33 [2021-11-03 05:11:34,604 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450472330] [2021-11-03 05:11:34,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-11-03 05:11:34,605 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:11:34,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-11-03 05:11:34,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=906, Unknown=0, NotChecked=0, Total=1056 [2021-11-03 05:11:34,607 INFO L87 Difference]: Start difference. First operand 138 states and 149 transitions. Second operand has 33 states, 33 states have (on average 2.212121212121212) internal successors, (73), 32 states have internal predecessors, (73), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-03 05:11:35,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:11:35,472 INFO L93 Difference]: Finished difference Result 383 states and 438 transitions. [2021-11-03 05:11:35,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-11-03 05:11:35,472 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.212121212121212) internal successors, (73), 32 states have internal predecessors, (73), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 146 [2021-11-03 05:11:35,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:11:35,476 INFO L225 Difference]: With dead ends: 383 [2021-11-03 05:11:35,476 INFO L226 Difference]: Without dead ends: 293 [2021-11-03 05:11:35,478 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=675, Invalid=3107, Unknown=0, NotChecked=0, Total=3782 [2021-11-03 05:11:35,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2021-11-03 05:11:35,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 197. [2021-11-03 05:11:35,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 182 states have (on average 1.0879120879120878) internal successors, (198), 182 states have internal predecessors, (198), 3 states have call successors, (3), 2 states have call predecessors, (3), 11 states have return successors, (12), 12 states have call predecessors, (12), 2 states have call successors, (12) [2021-11-03 05:11:35,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 213 transitions. [2021-11-03 05:11:35,502 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 213 transitions. Word has length 146 [2021-11-03 05:11:35,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:11:35,502 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 213 transitions. [2021-11-03 05:11:35,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.212121212121212) internal successors, (73), 32 states have internal predecessors, (73), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-03 05:11:35,503 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 213 transitions. [2021-11-03 05:11:35,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2021-11-03 05:11:35,505 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:11:35,506 INFO L513 BasicCegarLoop]: trace histogram [25, 25, 25, 11, 10, 10, 10, 10, 8, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1] [2021-11-03 05:11:35,546 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-03 05:11:35,712 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-11-03 05:11:35,712 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting recErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-03 05:11:35,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:11:35,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1926977472, now seen corresponding path program 6 times [2021-11-03 05:11:35,713 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:11:35,713 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635988484] [2021-11-03 05:11:35,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:11:35,713 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:11:35,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:11:36,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1506 backedges. 841 proven. 89 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2021-11-03 05:11:36,004 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:11:36,004 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635988484] [2021-11-03 05:11:36,004 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635988484] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 05:11:36,005 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543472326] [2021-11-03 05:11:36,005 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-03 05:11:36,005 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:11:36,005 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 05:11:36,012 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 05:11:36,033 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-03 05:11:36,419 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-03 05:11:36,419 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-03 05:11:36,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-03 05:11:36,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 05:11:37,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1506 backedges. 607 proven. 119 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2021-11-03 05:11:37,040 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 05:11:37,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1506 backedges. 607 proven. 119 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2021-11-03 05:11:37,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1543472326] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 05:11:37,939 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1872673788] [2021-11-03 05:11:37,941 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-03 05:11:37,941 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 05:11:37,941 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-03 05:11:37,943 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 05:11:37,943 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 14, 14] total 47 [2021-11-03 05:11:37,943 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156310882] [2021-11-03 05:11:37,944 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2021-11-03 05:11:37,944 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:11:37,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-11-03 05:11:37,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=1913, Unknown=0, NotChecked=0, Total=2162 [2021-11-03 05:11:37,946 INFO L87 Difference]: Start difference. First operand 197 states and 213 transitions. Second operand has 47 states, 47 states have (on average 2.148936170212766) internal successors, (101), 44 states have internal predecessors, (101), 1 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) [2021-11-03 05:11:40,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:11:40,414 INFO L93 Difference]: Finished difference Result 791 states and 897 transitions. [2021-11-03 05:11:40,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2021-11-03 05:11:40,415 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.148936170212766) internal successors, (101), 44 states have internal predecessors, (101), 1 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) Word has length 177 [2021-11-03 05:11:40,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:11:40,419 INFO L225 Difference]: With dead ends: 791 [2021-11-03 05:11:40,419 INFO L226 Difference]: Without dead ends: 635 [2021-11-03 05:11:40,426 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3658 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2185, Invalid=12335, Unknown=0, NotChecked=0, Total=14520 [2021-11-03 05:11:40,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2021-11-03 05:11:40,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 274. [2021-11-03 05:11:40,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 256 states have (on average 1.09375) internal successors, (280), 256 states have internal predecessors, (280), 3 states have call successors, (3), 2 states have call predecessors, (3), 14 states have return successors, (15), 15 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-03 05:11:40,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 298 transitions. [2021-11-03 05:11:40,458 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 298 transitions. Word has length 177 [2021-11-03 05:11:40,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:11:40,459 INFO L470 AbstractCegarLoop]: Abstraction has 274 states and 298 transitions. [2021-11-03 05:11:40,461 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.148936170212766) internal successors, (101), 44 states have internal predecessors, (101), 1 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) [2021-11-03 05:11:40,461 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 298 transitions. [2021-11-03 05:11:40,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2021-11-03 05:11:40,464 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:11:40,465 INFO L513 BasicCegarLoop]: trace histogram [33, 33, 33, 11, 10, 10, 10, 10, 8, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1] [2021-11-03 05:11:40,497 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-03 05:11:40,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-11-03 05:11:40,680 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting recErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-03 05:11:40,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:11:40,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1984223110, now seen corresponding path program 7 times [2021-11-03 05:11:40,681 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:11:40,681 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892744943] [2021-11-03 05:11:40,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:11:40,681 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:11:40,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:11:41,107 INFO L134 CoverageAnalysis]: Checked inductivity of 2254 backedges. 958 proven. 765 refuted. 0 times theorem prover too weak. 531 trivial. 0 not checked. [2021-11-03 05:11:41,107 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:11:41,107 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892744943] [2021-11-03 05:11:41,108 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892744943] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 05:11:41,108 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483040818] [2021-11-03 05:11:41,108 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-03 05:11:41,108 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:11:41,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 05:11:41,109 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 05:11:41,110 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-03 05:11:41,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:11:41,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 34 conjunts are in the unsatisfiable core [2021-11-03 05:11:41,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 05:11:42,056 INFO L134 CoverageAnalysis]: Checked inductivity of 2254 backedges. 976 proven. 747 refuted. 0 times theorem prover too weak. 531 trivial. 0 not checked. [2021-11-03 05:11:42,057 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 05:11:44,045 INFO L134 CoverageAnalysis]: Checked inductivity of 2254 backedges. 976 proven. 747 refuted. 0 times theorem prover too weak. 531 trivial. 0 not checked. [2021-11-03 05:11:44,045 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1483040818] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 05:11:44,045 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1523211150] [2021-11-03 05:11:44,047 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-03 05:11:44,047 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 05:11:44,048 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-03 05:11:44,049 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 05:11:44,049 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 34] total 37 [2021-11-03 05:11:44,049 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147501038] [2021-11-03 05:11:44,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-11-03 05:11:44,050 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:11:44,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-11-03 05:11:44,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1166, Unknown=0, NotChecked=0, Total=1332 [2021-11-03 05:11:44,052 INFO L87 Difference]: Start difference. First operand 274 states and 298 transitions. Second operand has 37 states, 37 states have (on average 2.3783783783783785) internal successors, (88), 30 states have internal predecessors, (88), 1 states have call successors, (2), 1 states have call predecessors, (2), 9 states have return successors, (9), 9 states have call predecessors, (9), 1 states have call successors, (9) [2021-11-03 05:11:45,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:11:45,098 INFO L93 Difference]: Finished difference Result 430 states and 470 transitions. [2021-11-03 05:11:45,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2021-11-03 05:11:45,099 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.3783783783783785) internal successors, (88), 30 states have internal predecessors, (88), 1 states have call successors, (2), 1 states have call predecessors, (2), 9 states have return successors, (9), 9 states have call predecessors, (9), 1 states have call successors, (9) Word has length 201 [2021-11-03 05:11:45,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:11:45,101 INFO L225 Difference]: With dead ends: 430 [2021-11-03 05:11:45,101 INFO L226 Difference]: Without dead ends: 214 [2021-11-03 05:11:45,107 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 406 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1902 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1246, Invalid=6064, Unknown=0, NotChecked=0, Total=7310 [2021-11-03 05:11:45,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2021-11-03 05:11:45,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2021-11-03 05:11:45,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 201 states have (on average 1.0696517412935322) internal successors, (215), 201 states have internal predecessors, (215), 3 states have call successors, (3), 2 states have call predecessors, (3), 9 states have return successors, (10), 10 states have call predecessors, (10), 2 states have call successors, (10) [2021-11-03 05:11:45,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 228 transitions. [2021-11-03 05:11:45,124 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 228 transitions. Word has length 201 [2021-11-03 05:11:45,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:11:45,125 INFO L470 AbstractCegarLoop]: Abstraction has 214 states and 228 transitions. [2021-11-03 05:11:45,125 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.3783783783783785) internal successors, (88), 30 states have internal predecessors, (88), 1 states have call successors, (2), 1 states have call predecessors, (2), 9 states have return successors, (9), 9 states have call predecessors, (9), 1 states have call successors, (9) [2021-11-03 05:11:45,125 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 228 transitions. [2021-11-03 05:11:45,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2021-11-03 05:11:45,129 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:11:45,129 INFO L513 BasicCegarLoop]: trace histogram [38, 38, 38, 12, 11, 11, 11, 11, 9, 9, 9, 9, 8, 8, 1, 1, 1, 1, 1] [2021-11-03 05:11:45,165 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-03 05:11:45,352 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-11-03 05:11:45,352 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting recErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-03 05:11:45,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:11:45,353 INFO L85 PathProgramCache]: Analyzing trace with hash -593971345, now seen corresponding path program 8 times [2021-11-03 05:11:45,353 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:11:45,353 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005989990] [2021-11-03 05:11:45,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:11:45,353 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:11:45,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:11:45,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2956 backedges. 1770 proven. 311 refuted. 0 times theorem prover too weak. 875 trivial. 0 not checked. [2021-11-03 05:11:45,764 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:11:45,764 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005989990] [2021-11-03 05:11:45,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005989990] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 05:11:45,764 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429179670] [2021-11-03 05:11:45,765 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-03 05:11:45,765 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:11:45,765 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 05:11:45,767 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 05:11:45,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-03 05:11:46,332 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2021-11-03 05:11:46,333 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-03 05:11:46,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 19 conjunts are in the unsatisfiable core [2021-11-03 05:11:46,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 05:11:47,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2956 backedges. 1308 proven. 604 refuted. 0 times theorem prover too weak. 1044 trivial. 0 not checked. [2021-11-03 05:11:47,149 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 05:11:48,550 INFO L134 CoverageAnalysis]: Checked inductivity of 2956 backedges. 1308 proven. 604 refuted. 0 times theorem prover too weak. 1044 trivial. 0 not checked. [2021-11-03 05:11:48,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429179670] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 05:11:48,550 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1840164334] [2021-11-03 05:11:48,553 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-03 05:11:48,553 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 05:11:48,553 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-03 05:11:48,554 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 05:11:48,555 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 19, 19] total 69 [2021-11-03 05:11:48,555 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165001284] [2021-11-03 05:11:48,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2021-11-03 05:11:48,556 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:11:48,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2021-11-03 05:11:48,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=4257, Unknown=0, NotChecked=0, Total=4692 [2021-11-03 05:11:48,559 INFO L87 Difference]: Start difference. First operand 214 states and 228 transitions. Second operand has 69 states, 69 states have (on average 2.260869565217391) internal successors, (156), 58 states have internal predecessors, (156), 1 states have call successors, (2), 1 states have call predecessors, (2), 13 states have return successors, (13), 13 states have call predecessors, (13), 1 states have call successors, (13) [2021-11-03 05:11:53,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:11:53,060 INFO L93 Difference]: Finished difference Result 524 states and 587 transitions. [2021-11-03 05:11:53,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2021-11-03 05:11:53,066 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 2.260869565217391) internal successors, (156), 58 states have internal predecessors, (156), 1 states have call successors, (2), 1 states have call predecessors, (2), 13 states have return successors, (13), 13 states have call predecessors, (13), 1 states have call successors, (13) Word has length 227 [2021-11-03 05:11:53,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:11:53,073 INFO L225 Difference]: With dead ends: 524 [2021-11-03 05:11:53,073 INFO L226 Difference]: Without dead ends: 353 [2021-11-03 05:11:53,083 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 643 GetRequests, 418 SyntacticMatches, 0 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18175 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=8228, Invalid=43074, Unknown=0, NotChecked=0, Total=51302 [2021-11-03 05:11:53,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2021-11-03 05:11:53,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 295. [2021-11-03 05:11:53,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 280 states have (on average 1.0785714285714285) internal successors, (302), 280 states have internal predecessors, (302), 3 states have call successors, (3), 2 states have call predecessors, (3), 11 states have return successors, (12), 12 states have call predecessors, (12), 2 states have call successors, (12) [2021-11-03 05:11:53,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 317 transitions. [2021-11-03 05:11:53,115 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 317 transitions. Word has length 227 [2021-11-03 05:11:53,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:11:53,115 INFO L470 AbstractCegarLoop]: Abstraction has 295 states and 317 transitions. [2021-11-03 05:11:53,116 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 2.260869565217391) internal successors, (156), 58 states have internal predecessors, (156), 1 states have call successors, (2), 1 states have call predecessors, (2), 13 states have return successors, (13), 13 states have call predecessors, (13), 1 states have call successors, (13) [2021-11-03 05:11:53,116 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 317 transitions. [2021-11-03 05:11:53,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2021-11-03 05:11:53,122 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:11:53,122 INFO L513 BasicCegarLoop]: trace histogram [60, 60, 60, 14, 13, 13, 13, 13, 11, 11, 11, 11, 10, 10, 1, 1, 1, 1, 1] [2021-11-03 05:11:53,159 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-03 05:11:53,344 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:11:53,344 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting recErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-03 05:11:53,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:11:53,344 INFO L85 PathProgramCache]: Analyzing trace with hash 2137260169, now seen corresponding path program 9 times [2021-11-03 05:11:53,345 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:11:53,345 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223626518] [2021-11-03 05:11:53,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:11:53,345 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:11:53,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:11:53,951 INFO L134 CoverageAnalysis]: Checked inductivity of 6706 backedges. 3961 proven. 499 refuted. 0 times theorem prover too weak. 2246 trivial. 0 not checked. [2021-11-03 05:11:53,951 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:11:53,952 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223626518] [2021-11-03 05:11:53,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223626518] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 05:11:53,952 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613097522] [2021-11-03 05:11:53,952 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-03 05:11:53,952 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:11:53,953 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 05:11:53,953 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 05:11:53,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-03 05:11:54,865 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-03 05:11:54,866 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-03 05:11:54,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 705 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-03 05:11:54,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 05:11:55,996 INFO L134 CoverageAnalysis]: Checked inductivity of 6706 backedges. 1796 proven. 176 refuted. 0 times theorem prover too weak. 4734 trivial. 0 not checked. [2021-11-03 05:11:55,996 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 05:11:57,630 INFO L134 CoverageAnalysis]: Checked inductivity of 6706 backedges. 1796 proven. 176 refuted. 0 times theorem prover too weak. 4734 trivial. 0 not checked. [2021-11-03 05:11:57,631 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613097522] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 05:11:57,631 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1323363811] [2021-11-03 05:11:57,633 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-03 05:11:57,633 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 05:11:57,634 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-03 05:11:57,635 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 05:11:57,635 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 25, 25] total 86 [2021-11-03 05:11:57,635 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859869852] [2021-11-03 05:11:57,636 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2021-11-03 05:11:57,636 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:11:57,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2021-11-03 05:11:57,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=885, Invalid=6425, Unknown=0, NotChecked=0, Total=7310 [2021-11-03 05:11:57,638 INFO L87 Difference]: Start difference. First operand 295 states and 317 transitions. Second operand has 86 states, 86 states have (on average 1.9883720930232558) internal successors, (171), 78 states have internal predecessors, (171), 1 states have call successors, (2), 1 states have call predecessors, (2), 10 states have return successors, (10), 10 states have call predecessors, (10), 1 states have call successors, (10) [2021-11-03 05:12:00,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:12:00,845 INFO L93 Difference]: Finished difference Result 680 states and 790 transitions. [2021-11-03 05:12:00,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2021-11-03 05:12:00,845 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 86 states have (on average 1.9883720930232558) internal successors, (171), 78 states have internal predecessors, (171), 1 states have call successors, (2), 1 states have call predecessors, (2), 10 states have return successors, (10), 10 states have call predecessors, (10), 1 states have call successors, (10) Word has length 315 [2021-11-03 05:12:00,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:12:00,849 INFO L225 Difference]: With dead ends: 680 [2021-11-03 05:12:00,849 INFO L226 Difference]: Without dead ends: 523 [2021-11-03 05:12:00,855 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 787 GetRequests, 582 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12817 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=7469, Invalid=35173, Unknown=0, NotChecked=0, Total=42642 [2021-11-03 05:12:00,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2021-11-03 05:12:00,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 370. [2021-11-03 05:12:00,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 355 states have (on average 1.087323943661972) internal successors, (386), 355 states have internal predecessors, (386), 3 states have call successors, (3), 2 states have call predecessors, (3), 11 states have return successors, (12), 12 states have call predecessors, (12), 2 states have call successors, (12) [2021-11-03 05:12:00,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 401 transitions. [2021-11-03 05:12:00,887 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 401 transitions. Word has length 315 [2021-11-03 05:12:00,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:12:00,888 INFO L470 AbstractCegarLoop]: Abstraction has 370 states and 401 transitions. [2021-11-03 05:12:00,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 86 states have (on average 1.9883720930232558) internal successors, (171), 78 states have internal predecessors, (171), 1 states have call successors, (2), 1 states have call predecessors, (2), 10 states have return successors, (10), 10 states have call predecessors, (10), 1 states have call successors, (10) [2021-11-03 05:12:00,888 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 401 transitions. [2021-11-03 05:12:00,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2021-11-03 05:12:00,896 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:12:00,896 INFO L513 BasicCegarLoop]: trace histogram [73, 73, 73, 14, 13, 13, 13, 13, 11, 11, 11, 11, 10, 10, 1, 1, 1, 1, 1] [2021-11-03 05:12:00,937 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-11-03 05:12:01,110 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-11-03 05:12:01,110 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting recErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-03 05:12:01,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:12:01,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1564334492, now seen corresponding path program 10 times [2021-11-03 05:12:01,111 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:12:01,111 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389111772] [2021-11-03 05:12:01,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:12:01,111 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:12:01,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:12:01,894 INFO L134 CoverageAnalysis]: Checked inductivity of 9423 backedges. 4605 proven. 2126 refuted. 0 times theorem prover too weak. 2692 trivial. 0 not checked. [2021-11-03 05:12:01,894 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:12:01,894 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389111772] [2021-11-03 05:12:01,895 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389111772] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 05:12:01,895 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455809601] [2021-11-03 05:12:01,895 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-03 05:12:01,895 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:12:01,895 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 05:12:01,900 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 05:12:01,916 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-03 05:12:02,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:12:02,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 796 conjuncts, 44 conjunts are in the unsatisfiable core [2021-11-03 05:12:02,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 05:12:03,603 INFO L134 CoverageAnalysis]: Checked inductivity of 9423 backedges. 4629 proven. 2102 refuted. 0 times theorem prover too weak. 2692 trivial. 0 not checked. [2021-11-03 05:12:03,604 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 05:12:08,012 INFO L134 CoverageAnalysis]: Checked inductivity of 9423 backedges. 4629 proven. 2102 refuted. 0 times theorem prover too weak. 2692 trivial. 0 not checked. [2021-11-03 05:12:08,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455809601] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 05:12:08,013 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [561970843] [2021-11-03 05:12:08,014 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-03 05:12:08,015 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 05:12:08,015 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-03 05:12:08,016 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 05:12:08,016 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 44, 44] total 47 [2021-11-03 05:12:08,016 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335893568] [2021-11-03 05:12:08,017 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2021-11-03 05:12:08,017 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:12:08,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-11-03 05:12:08,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=1905, Unknown=0, NotChecked=0, Total=2162 [2021-11-03 05:12:08,018 INFO L87 Difference]: Start difference. First operand 370 states and 401 transitions. Second operand has 47 states, 47 states have (on average 2.3404255319148937) internal successors, (110), 38 states have internal predecessors, (110), 1 states have call successors, (2), 1 states have call predecessors, (2), 11 states have return successors, (11), 11 states have call predecessors, (11), 1 states have call successors, (11) [2021-11-03 05:12:09,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:12:09,588 INFO L93 Difference]: Finished difference Result 630 states and 693 transitions. [2021-11-03 05:12:09,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2021-11-03 05:12:09,588 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.3404255319148937) internal successors, (110), 38 states have internal predecessors, (110), 1 states have call successors, (2), 1 states have call predecessors, (2), 11 states have return successors, (11), 11 states have call predecessors, (11), 1 states have call successors, (11) Word has length 354 [2021-11-03 05:12:09,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:12:09,591 INFO L225 Difference]: With dead ends: 630 [2021-11-03 05:12:09,592 INFO L226 Difference]: Without dead ends: 400 [2021-11-03 05:12:09,595 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 840 GetRequests, 714 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4903 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2821, Invalid=13435, Unknown=0, NotChecked=0, Total=16256 [2021-11-03 05:12:09,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2021-11-03 05:12:09,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 400. [2021-11-03 05:12:09,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 384 states have (on average 1.0807291666666667) internal successors, (415), 384 states have internal predecessors, (415), 3 states have call successors, (3), 2 states have call predecessors, (3), 12 states have return successors, (13), 13 states have call predecessors, (13), 2 states have call successors, (13) [2021-11-03 05:12:09,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 431 transitions. [2021-11-03 05:12:09,626 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 431 transitions. Word has length 354 [2021-11-03 05:12:09,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:12:09,626 INFO L470 AbstractCegarLoop]: Abstraction has 400 states and 431 transitions. [2021-11-03 05:12:09,627 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.3404255319148937) internal successors, (110), 38 states have internal predecessors, (110), 1 states have call successors, (2), 1 states have call predecessors, (2), 11 states have return successors, (11), 11 states have call predecessors, (11), 1 states have call successors, (11) [2021-11-03 05:12:09,627 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 431 transitions. [2021-11-03 05:12:09,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2021-11-03 05:12:09,630 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:12:09,631 INFO L513 BasicCegarLoop]: trace histogram [80, 80, 80, 15, 14, 14, 14, 14, 12, 12, 12, 12, 11, 11, 1, 1, 1, 1, 1] [2021-11-03 05:12:09,657 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-11-03 05:12:09,840 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-11-03 05:12:09,840 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting recErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-03 05:12:09,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:12:09,851 INFO L85 PathProgramCache]: Analyzing trace with hash 855944295, now seen corresponding path program 11 times [2021-11-03 05:12:09,851 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:12:09,851 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822615694] [2021-11-03 05:12:09,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:12:09,851 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:12:09,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:12:10,545 INFO L134 CoverageAnalysis]: Checked inductivity of 11308 backedges. 6753 proven. 750 refuted. 0 times theorem prover too weak. 3805 trivial. 0 not checked. [2021-11-03 05:12:10,546 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:12:10,546 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822615694] [2021-11-03 05:12:10,546 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822615694] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 05:12:10,546 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478863864] [2021-11-03 05:12:10,546 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-03 05:12:10,546 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:12:10,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 05:12:10,547 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 05:12:10,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-03 05:12:11,674 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2021-11-03 05:12:11,674 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-03 05:12:11,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 26 conjunts are in the unsatisfiable core [2021-11-03 05:12:11,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 05:12:13,026 INFO L134 CoverageAnalysis]: Checked inductivity of 11308 backedges. 5065 proven. 3076 refuted. 0 times theorem prover too weak. 3167 trivial. 0 not checked. [2021-11-03 05:12:13,026 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 05:12:15,752 INFO L134 CoverageAnalysis]: Checked inductivity of 11308 backedges. 5065 proven. 3076 refuted. 0 times theorem prover too weak. 3167 trivial. 0 not checked. [2021-11-03 05:12:15,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478863864] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 05:12:15,752 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1918311721] [2021-11-03 05:12:15,755 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-03 05:12:15,755 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 05:12:15,756 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-03 05:12:15,757 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 05:12:15,757 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 26, 26] total 93 [2021-11-03 05:12:15,757 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419860149] [2021-11-03 05:12:15,760 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 93 states [2021-11-03 05:12:15,760 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:12:15,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2021-11-03 05:12:15,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=740, Invalid=7816, Unknown=0, NotChecked=0, Total=8556 [2021-11-03 05:12:15,763 INFO L87 Difference]: Start difference. First operand 400 states and 431 transitions. Second operand has 93 states, 93 states have (on average 2.21505376344086) internal successors, (206), 78 states have internal predecessors, (206), 1 states have call successors, (2), 1 states have call predecessors, (2), 17 states have return successors, (17), 17 states have call predecessors, (17), 1 states have call successors, (17) [2021-11-03 05:12:25,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:12:25,316 INFO L93 Difference]: Finished difference Result 1276 states and 1429 transitions. [2021-11-03 05:12:25,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 280 states. [2021-11-03 05:12:25,317 INFO L78 Accepts]: Start accepts. Automaton has has 93 states, 93 states have (on average 2.21505376344086) internal successors, (206), 78 states have internal predecessors, (206), 1 states have call successors, (2), 1 states have call predecessors, (2), 17 states have return successors, (17), 17 states have call predecessors, (17), 1 states have call successors, (17) Word has length 386 [2021-11-03 05:12:25,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:12:25,324 INFO L225 Difference]: With dead ends: 1276 [2021-11-03 05:12:25,324 INFO L226 Difference]: Without dead ends: 833 [2021-11-03 05:12:25,336 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 1089 GetRequests, 722 SyntacticMatches, 0 SemanticMatches, 367 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52546 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=21678, Invalid=114114, Unknown=0, NotChecked=0, Total=135792 [2021-11-03 05:12:25,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2021-11-03 05:12:25,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 535. [2021-11-03 05:12:25,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 516 states have (on average 1.0872093023255813) internal successors, (561), 516 states have internal predecessors, (561), 3 states have call successors, (3), 2 states have call predecessors, (3), 15 states have return successors, (16), 16 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-03 05:12:25,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 580 transitions. [2021-11-03 05:12:25,391 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 580 transitions. Word has length 386 [2021-11-03 05:12:25,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:12:25,392 INFO L470 AbstractCegarLoop]: Abstraction has 535 states and 580 transitions. [2021-11-03 05:12:25,392 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 93 states, 93 states have (on average 2.21505376344086) internal successors, (206), 78 states have internal predecessors, (206), 1 states have call successors, (2), 1 states have call predecessors, (2), 17 states have return successors, (17), 17 states have call predecessors, (17), 1 states have call successors, (17) [2021-11-03 05:12:25,393 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 580 transitions. [2021-11-03 05:12:25,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2021-11-03 05:12:25,398 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:12:25,398 INFO L513 BasicCegarLoop]: trace histogram [120, 120, 120, 16, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 1, 1, 1, 1, 1] [2021-11-03 05:12:25,432 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2021-11-03 05:12:25,624 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:12:25,624 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting recErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-03 05:12:25,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:12:25,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1524749963, now seen corresponding path program 12 times [2021-11-03 05:12:25,625 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:12:25,625 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963825633] [2021-11-03 05:12:25,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:12:25,626 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:12:25,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:12:26,430 INFO L134 CoverageAnalysis]: Checked inductivity of 24391 backedges. 13910 proven. 323 refuted. 0 times theorem prover too weak. 10158 trivial. 0 not checked. [2021-11-03 05:12:26,430 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:12:26,430 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963825633] [2021-11-03 05:12:26,431 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963825633] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 05:12:26,431 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397102833] [2021-11-03 05:12:26,431 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-03 05:12:26,431 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:12:26,431 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 05:12:26,432 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 05:12:26,448 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-11-03 05:12:27,839 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-03 05:12:27,840 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-03 05:12:27,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 1199 conjuncts, 44 conjunts are in the unsatisfiable core [2021-11-03 05:12:27,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 05:12:29,282 INFO L134 CoverageAnalysis]: Checked inductivity of 24391 backedges. 13444 proven. 1107 refuted. 0 times theorem prover too weak. 9840 trivial. 0 not checked. [2021-11-03 05:12:29,282 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 05:12:36,053 INFO L134 CoverageAnalysis]: Checked inductivity of 24391 backedges. 13487 proven. 1064 refuted. 0 times theorem prover too weak. 9840 trivial. 0 not checked. [2021-11-03 05:12:36,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397102833] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 05:12:36,054 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1915336309] [2021-11-03 05:12:36,058 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-03 05:12:36,058 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 05:12:36,058 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-03 05:12:36,060 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 05:12:36,060 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 44, 44] total 59 [2021-11-03 05:12:36,060 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396131264] [2021-11-03 05:12:36,062 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2021-11-03 05:12:36,063 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:12:36,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2021-11-03 05:12:36,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=3094, Unknown=0, NotChecked=0, Total=3422 [2021-11-03 05:12:36,064 INFO L87 Difference]: Start difference. First operand 535 states and 580 transitions. Second operand has 59 states, 59 states have (on average 2.3389830508474576) internal successors, (138), 51 states have internal predecessors, (138), 1 states have call successors, (2), 1 states have call predecessors, (2), 10 states have return successors, (10), 10 states have call predecessors, (10), 1 states have call successors, (10) [2021-11-03 05:12:39,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:12:39,144 INFO L93 Difference]: Finished difference Result 873 states and 963 transitions. [2021-11-03 05:12:39,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2021-11-03 05:12:39,145 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 2.3389830508474576) internal successors, (138), 51 states have internal predecessors, (138), 1 states have call successors, (2), 1 states have call predecessors, (2), 10 states have return successors, (10), 10 states have call predecessors, (10), 1 states have call successors, (10) Word has length 529 [2021-11-03 05:12:39,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:12:39,149 INFO L225 Difference]: With dead ends: 873 [2021-11-03 05:12:39,149 INFO L226 Difference]: Without dead ends: 541 [2021-11-03 05:12:39,153 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 1197 GetRequests, 1034 SyntacticMatches, 3 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7143 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3881, Invalid=22201, Unknown=0, NotChecked=0, Total=26082 [2021-11-03 05:12:39,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2021-11-03 05:12:39,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 541. [2021-11-03 05:12:39,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 522 states have (on average 1.078544061302682) internal successors, (563), 522 states have internal predecessors, (563), 3 states have call successors, (3), 2 states have call predecessors, (3), 15 states have return successors, (16), 16 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-03 05:12:39,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 582 transitions. [2021-11-03 05:12:39,202 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 582 transitions. Word has length 529 [2021-11-03 05:12:39,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:12:39,203 INFO L470 AbstractCegarLoop]: Abstraction has 541 states and 582 transitions. [2021-11-03 05:12:39,204 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 2.3389830508474576) internal successors, (138), 51 states have internal predecessors, (138), 1 states have call successors, (2), 1 states have call predecessors, (2), 10 states have return successors, (10), 10 states have call predecessors, (10), 1 states have call successors, (10) [2021-11-03 05:12:39,204 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 582 transitions. [2021-11-03 05:12:39,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2021-11-03 05:12:39,209 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:12:39,210 INFO L513 BasicCegarLoop]: trace histogram [122, 122, 122, 16, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 1, 1, 1, 1, 1] [2021-11-03 05:12:39,253 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-11-03 05:12:39,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:12:39,436 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting recErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-03 05:12:39,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:12:39,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1523414769, now seen corresponding path program 13 times [2021-11-03 05:12:39,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:12:39,437 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13714607] [2021-11-03 05:12:39,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:12:39,437 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:12:39,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:12:40,508 INFO L134 CoverageAnalysis]: Checked inductivity of 25144 backedges. 15561 proven. 1477 refuted. 0 times theorem prover too weak. 8106 trivial. 0 not checked. [2021-11-03 05:12:40,508 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:12:40,509 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13714607] [2021-11-03 05:12:40,509 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13714607] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 05:12:40,509 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365292833] [2021-11-03 05:12:40,509 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-03 05:12:40,509 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:12:40,509 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 05:12:40,510 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 05:12:40,511 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-11-03 05:12:42,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:12:42,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 1213 conjuncts, 49 conjunts are in the unsatisfiable core [2021-11-03 05:12:42,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 05:12:43,417 INFO L134 CoverageAnalysis]: Checked inductivity of 25144 backedges. 15516 proven. 1520 refuted. 0 times theorem prover too weak. 8108 trivial. 0 not checked. [2021-11-03 05:12:43,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 05:12:51,267 INFO L134 CoverageAnalysis]: Checked inductivity of 25144 backedges. 15569 proven. 1467 refuted. 0 times theorem prover too weak. 8108 trivial. 0 not checked. [2021-11-03 05:12:51,267 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365292833] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 05:12:51,267 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [469505031] [2021-11-03 05:12:51,269 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-03 05:12:51,269 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 05:12:51,269 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-03 05:12:51,270 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 05:12:51,271 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 49, 49] total 55 [2021-11-03 05:12:51,271 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114452832] [2021-11-03 05:12:51,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2021-11-03 05:12:51,273 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:12:51,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2021-11-03 05:12:51,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=2617, Unknown=0, NotChecked=0, Total=2970 [2021-11-03 05:12:51,274 INFO L87 Difference]: Start difference. First operand 541 states and 582 transitions. Second operand has 55 states, 55 states have (on average 2.418181818181818) internal successors, (133), 44 states have internal predecessors, (133), 1 states have call successors, (2), 1 states have call predecessors, (2), 13 states have return successors, (13), 13 states have call predecessors, (13), 1 states have call successors, (13) [2021-11-03 05:12:53,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:12:53,169 INFO L93 Difference]: Finished difference Result 846 states and 926 transitions. [2021-11-03 05:12:53,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2021-11-03 05:12:53,170 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 2.418181818181818) internal successors, (133), 44 states have internal predecessors, (133), 1 states have call successors, (2), 1 states have call predecessors, (2), 13 states have return successors, (13), 13 states have call predecessors, (13), 1 states have call successors, (13) Word has length 535 [2021-11-03 05:12:53,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:12:53,174 INFO L225 Difference]: With dead ends: 846 [2021-11-03 05:12:53,174 INFO L226 Difference]: Without dead ends: 544 [2021-11-03 05:12:53,179 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 1228 GetRequests, 1068 SyntacticMatches, 2 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8137 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=4277, Invalid=21163, Unknown=0, NotChecked=0, Total=25440 [2021-11-03 05:12:53,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2021-11-03 05:12:53,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 544. [2021-11-03 05:12:53,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 525 states have (on average 1.0704761904761906) internal successors, (562), 525 states have internal predecessors, (562), 3 states have call successors, (3), 2 states have call predecessors, (3), 15 states have return successors, (16), 16 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-03 05:12:53,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 581 transitions. [2021-11-03 05:12:53,228 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 581 transitions. Word has length 535 [2021-11-03 05:12:53,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:12:53,229 INFO L470 AbstractCegarLoop]: Abstraction has 544 states and 581 transitions. [2021-11-03 05:12:53,229 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 2.418181818181818) internal successors, (133), 44 states have internal predecessors, (133), 1 states have call successors, (2), 1 states have call predecessors, (2), 13 states have return successors, (13), 13 states have call predecessors, (13), 1 states have call successors, (13) [2021-11-03 05:12:53,230 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 581 transitions. [2021-11-03 05:12:53,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 549 [2021-11-03 05:12:53,235 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:12:53,235 INFO L513 BasicCegarLoop]: trace histogram [123, 123, 123, 18, 17, 17, 17, 17, 15, 15, 15, 15, 14, 14, 1, 1, 1, 1, 1] [2021-11-03 05:12:53,276 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-11-03 05:12:53,452 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:12:53,452 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting recErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-03 05:12:53,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:12:53,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1824836348, now seen corresponding path program 14 times [2021-11-03 05:12:53,453 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:12:53,453 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358877950] [2021-11-03 05:12:53,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:12:53,453 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:12:53,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:12:54,732 INFO L134 CoverageAnalysis]: Checked inductivity of 25684 backedges. 12565 proven. 6875 refuted. 0 times theorem prover too weak. 6244 trivial. 0 not checked. [2021-11-03 05:12:54,732 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:12:54,732 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358877950] [2021-11-03 05:12:54,732 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358877950] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 05:12:54,732 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928392633] [2021-11-03 05:12:54,732 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-03 05:12:54,733 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:12:54,733 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 05:12:54,733 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 05:12:54,734 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-11-03 05:12:56,898 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2021-11-03 05:12:56,898 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-03 05:12:56,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 996 conjuncts, 36 conjunts are in the unsatisfiable core [2021-11-03 05:12:56,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 05:12:58,893 INFO L134 CoverageAnalysis]: Checked inductivity of 25684 backedges. 10698 proven. 9898 refuted. 0 times theorem prover too weak. 5088 trivial. 0 not checked. [2021-11-03 05:12:58,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 05:13:04,396 INFO L134 CoverageAnalysis]: Checked inductivity of 25684 backedges. 10698 proven. 9898 refuted. 0 times theorem prover too weak. 5088 trivial. 0 not checked. [2021-11-03 05:13:04,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928392633] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 05:13:04,397 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [904780852] [2021-11-03 05:13:04,398 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-03 05:13:04,398 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 05:13:04,398 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-03 05:13:04,398 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 05:13:04,399 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 36, 36] total 124 [2021-11-03 05:13:04,399 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171364365] [2021-11-03 05:13:04,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 124 states [2021-11-03 05:13:04,400 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:13:04,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2021-11-03 05:13:04,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1603, Invalid=13649, Unknown=0, NotChecked=0, Total=15252 [2021-11-03 05:13:04,403 INFO L87 Difference]: Start difference. First operand 544 states and 581 transitions. Second operand has 124 states, 124 states have (on average 2.217741935483871) internal successors, (275), 104 states have internal predecessors, (275), 1 states have call successors, (2), 1 states have call predecessors, (2), 22 states have return successors, (22), 22 states have call predecessors, (22), 1 states have call successors, (22) [2021-11-03 05:13:25,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:13:25,711 INFO L93 Difference]: Finished difference Result 2212 states and 2451 transitions. [2021-11-03 05:13:25,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 484 states. [2021-11-03 05:13:25,712 INFO L78 Accepts]: Start accepts. Automaton has has 124 states, 124 states have (on average 2.217741935483871) internal successors, (275), 104 states have internal predecessors, (275), 1 states have call successors, (2), 1 states have call predecessors, (2), 22 states have return successors, (22), 22 states have call predecessors, (22), 1 states have call successors, (22) Word has length 548 [2021-11-03 05:13:25,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:13:25,719 INFO L225 Difference]: With dead ends: 2212 [2021-11-03 05:13:25,719 INFO L226 Difference]: Without dead ends: 1511 [2021-11-03 05:13:25,744 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 1587 GetRequests, 1032 SyntacticMatches, 0 SemanticMatches, 555 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141932 ImplicationChecksByTransitivity, 23.0s TimeCoverageRelationStatistics Valid=68190, Invalid=241502, Unknown=0, NotChecked=0, Total=309692 [2021-11-03 05:13:25,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states. [2021-11-03 05:13:25,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 853. [2021-11-03 05:13:25,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 853 states, 828 states have (on average 1.0857487922705313) internal successors, (899), 828 states have internal predecessors, (899), 3 states have call successors, (3), 2 states have call predecessors, (3), 21 states have return successors, (22), 22 states have call predecessors, (22), 2 states have call successors, (22) [2021-11-03 05:13:25,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 924 transitions. [2021-11-03 05:13:25,842 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 924 transitions. Word has length 548 [2021-11-03 05:13:25,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:13:25,843 INFO L470 AbstractCegarLoop]: Abstraction has 853 states and 924 transitions. [2021-11-03 05:13:25,844 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 124 states, 124 states have (on average 2.217741935483871) internal successors, (275), 104 states have internal predecessors, (275), 1 states have call successors, (2), 1 states have call predecessors, (2), 22 states have return successors, (22), 22 states have call predecessors, (22), 1 states have call successors, (22) [2021-11-03 05:13:25,844 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 924 transitions. [2021-11-03 05:13:25,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 885 [2021-11-03 05:13:25,855 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:13:25,855 INFO L513 BasicCegarLoop]: trace histogram [213, 213, 213, 24, 23, 23, 23, 23, 21, 21, 21, 21, 20, 20, 1, 1, 1, 1, 1] [2021-11-03 05:13:25,908 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-11-03 05:13:26,084 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:13:26,084 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting recErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-03 05:13:26,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:13:26,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1348407952, now seen corresponding path program 15 times [2021-11-03 05:13:26,085 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:13:26,085 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359468418] [2021-11-03 05:13:26,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:13:26,085 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:13:26,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:13:27,261 INFO L134 CoverageAnalysis]: Checked inductivity of 74758 backedges. 41633 proven. 494 refuted. 0 times theorem prover too weak. 32631 trivial. 0 not checked. [2021-11-03 05:13:27,261 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:13:27,261 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359468418] [2021-11-03 05:13:27,261 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359468418] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 05:13:27,261 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988193603] [2021-11-03 05:13:27,261 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-03 05:13:27,261 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:13:27,262 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 05:13:27,262 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 05:13:27,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-11-03 05:13:29,789 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-03 05:13:29,789 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-03 05:13:29,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 2006 conjuncts, 54 conjunts are in the unsatisfiable core [2021-11-03 05:13:29,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 05:13:32,027 INFO L134 CoverageAnalysis]: Checked inductivity of 74758 backedges. 36680 proven. 2024 refuted. 0 times theorem prover too weak. 36054 trivial. 0 not checked. [2021-11-03 05:13:32,027 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 05:13:48,081 INFO L134 CoverageAnalysis]: Checked inductivity of 74758 backedges. 36744 proven. 1960 refuted. 0 times theorem prover too weak. 36054 trivial. 0 not checked. [2021-11-03 05:13:48,082 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [988193603] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 05:13:48,082 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [647992163] [2021-11-03 05:13:48,084 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-03 05:13:48,084 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 05:13:48,084 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-03 05:13:48,085 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 05:13:48,086 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 54, 54] total 73 [2021-11-03 05:13:48,086 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868472262] [2021-11-03 05:13:48,089 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2021-11-03 05:13:48,089 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:13:48,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2021-11-03 05:13:48,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=479, Invalid=4777, Unknown=0, NotChecked=0, Total=5256 [2021-11-03 05:13:48,091 INFO L87 Difference]: Start difference. First operand 853 states and 924 transitions. Second operand has 73 states, 73 states have (on average 2.2739726027397262) internal successors, (166), 63 states have internal predecessors, (166), 1 states have call successors, (2), 1 states have call predecessors, (2), 12 states have return successors, (12), 12 states have call predecessors, (12), 1 states have call successors, (12) [2021-11-03 05:13:53,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:13:53,184 INFO L93 Difference]: Finished difference Result 1434 states and 1577 transitions. [2021-11-03 05:13:53,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2021-11-03 05:13:53,185 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 2.2739726027397262) internal successors, (166), 63 states have internal predecessors, (166), 1 states have call successors, (2), 1 states have call predecessors, (2), 12 states have return successors, (12), 12 states have call predecessors, (12), 1 states have call successors, (12) Word has length 884 [2021-11-03 05:13:53,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:13:53,191 INFO L225 Difference]: With dead ends: 1434 [2021-11-03 05:13:53,192 INFO L226 Difference]: Without dead ends: 862 [2021-11-03 05:13:53,198 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 1961 GetRequests, 1738 SyntacticMatches, 3 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14117 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=7079, Invalid=41983, Unknown=0, NotChecked=0, Total=49062 [2021-11-03 05:13:53,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2021-11-03 05:13:53,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 862. [2021-11-03 05:13:53,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 862 states, 837 states have (on average 1.076463560334528) internal successors, (901), 837 states have internal predecessors, (901), 3 states have call successors, (3), 2 states have call predecessors, (3), 21 states have return successors, (22), 22 states have call predecessors, (22), 2 states have call successors, (22) [2021-11-03 05:13:53,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 926 transitions. [2021-11-03 05:13:53,297 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 926 transitions. Word has length 884 [2021-11-03 05:13:53,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:13:53,298 INFO L470 AbstractCegarLoop]: Abstraction has 862 states and 926 transitions. [2021-11-03 05:13:53,298 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 2.2739726027397262) internal successors, (166), 63 states have internal predecessors, (166), 1 states have call successors, (2), 1 states have call predecessors, (2), 12 states have return successors, (12), 12 states have call predecessors, (12), 1 states have call successors, (12) [2021-11-03 05:13:53,298 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 926 transitions. [2021-11-03 05:13:53,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 887 [2021-11-03 05:13:53,309 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:13:53,309 INFO L513 BasicCegarLoop]: trace histogram [217, 217, 217, 22, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 1, 1, 1, 1, 1] [2021-11-03 05:13:53,359 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-11-03 05:13:53,524 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-11-03 05:13:53,524 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting recErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-03 05:13:53,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:13:53,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1412116988, now seen corresponding path program 16 times [2021-11-03 05:13:53,525 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:13:53,525 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143713587] [2021-11-03 05:13:53,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:13:53,525 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:13:53,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:13:54,822 INFO L134 CoverageAnalysis]: Checked inductivity of 77197 backedges. 43713 proven. 593 refuted. 0 times theorem prover too weak. 32891 trivial. 0 not checked. [2021-11-03 05:13:54,822 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:13:54,822 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143713587] [2021-11-03 05:13:54,822 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143713587] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 05:13:54,822 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550089675] [2021-11-03 05:13:54,823 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-03 05:13:54,823 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:13:54,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 05:13:54,824 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 05:13:54,850 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-11-03 05:13:58,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:13:58,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 2016 conjuncts, 59 conjunts are in the unsatisfiable core [2021-11-03 05:13:58,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 05:14:00,564 INFO L134 CoverageAnalysis]: Checked inductivity of 77197 backedges. 42263 proven. 2628 refuted. 0 times theorem prover too weak. 32306 trivial. 0 not checked. [2021-11-03 05:14:00,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 05:14:19,055 INFO L134 CoverageAnalysis]: Checked inductivity of 77197 backedges. 42339 proven. 2552 refuted. 0 times theorem prover too weak. 32306 trivial. 0 not checked. [2021-11-03 05:14:19,055 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550089675] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 05:14:19,055 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1117592251] [2021-11-03 05:14:19,057 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-03 05:14:19,057 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 05:14:19,057 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-03 05:14:19,058 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 05:14:19,059 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 59, 59] total 80 [2021-11-03 05:14:19,060 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132987495] [2021-11-03 05:14:19,062 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2021-11-03 05:14:19,062 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:14:19,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2021-11-03 05:14:19,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=565, Invalid=5755, Unknown=0, NotChecked=0, Total=6320 [2021-11-03 05:14:19,063 INFO L87 Difference]: Start difference. First operand 862 states and 926 transitions. Second operand has 80 states, 80 states have (on average 2.25) internal successors, (180), 69 states have internal predecessors, (180), 1 states have call successors, (2), 1 states have call predecessors, (2), 13 states have return successors, (13), 13 states have call predecessors, (13), 1 states have call successors, (13) [2021-11-03 05:14:25,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:14:25,504 INFO L93 Difference]: Finished difference Result 1413 states and 1542 transitions. [2021-11-03 05:14:25,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 189 states. [2021-11-03 05:14:25,504 INFO L78 Accepts]: Start accepts. Automaton has has 80 states, 80 states have (on average 2.25) internal successors, (180), 69 states have internal predecessors, (180), 1 states have call successors, (2), 1 states have call predecessors, (2), 13 states have return successors, (13), 13 states have call predecessors, (13), 1 states have call successors, (13) Word has length 886 [2021-11-03 05:14:25,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:14:25,509 INFO L225 Difference]: With dead ends: 1413 [2021-11-03 05:14:25,509 INFO L226 Difference]: Without dead ends: 871 [2021-11-03 05:14:25,518 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 1995 GetRequests, 1739 SyntacticMatches, 3 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18981 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=9239, Invalid=55531, Unknown=0, NotChecked=0, Total=64770 [2021-11-03 05:14:25,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2021-11-03 05:14:25,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 871. [2021-11-03 05:14:25,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 846 states have (on average 1.0685579196217494) internal successors, (904), 846 states have internal predecessors, (904), 3 states have call successors, (3), 2 states have call predecessors, (3), 21 states have return successors, (22), 22 states have call predecessors, (22), 2 states have call successors, (22) [2021-11-03 05:14:25,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 929 transitions. [2021-11-03 05:14:25,618 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 929 transitions. Word has length 886 [2021-11-03 05:14:25,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:14:25,619 INFO L470 AbstractCegarLoop]: Abstraction has 871 states and 929 transitions. [2021-11-03 05:14:25,619 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 80 states have (on average 2.25) internal successors, (180), 69 states have internal predecessors, (180), 1 states have call successors, (2), 1 states have call predecessors, (2), 13 states have return successors, (13), 13 states have call predecessors, (13), 1 states have call successors, (13) [2021-11-03 05:14:25,619 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 929 transitions. [2021-11-03 05:14:25,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 906 [2021-11-03 05:14:25,662 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:14:25,662 INFO L513 BasicCegarLoop]: trace histogram [220, 220, 220, 24, 23, 23, 23, 23, 21, 21, 21, 21, 20, 20, 1, 1, 1, 1, 1] [2021-11-03 05:14:25,719 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-11-03 05:14:25,888 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-11-03 05:14:25,888 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting recErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-03 05:14:25,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:14:25,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1021247851, now seen corresponding path program 17 times [2021-11-03 05:14:25,889 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:14:25,889 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429271273] [2021-11-03 05:14:25,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:14:25,889 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:14:26,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:14:27,273 INFO L134 CoverageAnalysis]: Checked inductivity of 79441 backedges. 45386 proven. 701 refuted. 0 times theorem prover too weak. 33354 trivial. 0 not checked. [2021-11-03 05:14:27,274 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:14:27,274 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429271273] [2021-11-03 05:14:27,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429271273] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 05:14:27,274 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471572771] [2021-11-03 05:14:27,275 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-03 05:14:27,275 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:14:27,275 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 05:14:27,280 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 05:14:27,289 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-11-03 05:14:31,224 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2021-11-03 05:14:31,224 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-03 05:14:31,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 1424 conjuncts, 45 conjunts are in the unsatisfiable core [2021-11-03 05:14:31,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 05:14:34,346 INFO L134 CoverageAnalysis]: Checked inductivity of 79441 backedges. 38100 proven. 22725 refuted. 0 times theorem prover too weak. 18616 trivial. 0 not checked. [2021-11-03 05:14:34,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 05:14:43,927 INFO L134 CoverageAnalysis]: Checked inductivity of 79441 backedges. 38100 proven. 22725 refuted. 0 times theorem prover too weak. 18616 trivial. 0 not checked. [2021-11-03 05:14:43,927 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471572771] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 05:14:43,927 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [273209214] [2021-11-03 05:14:43,929 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-03 05:14:43,929 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 05:14:43,929 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-03 05:14:43,930 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 05:14:43,931 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 45, 45] total 141 [2021-11-03 05:14:43,931 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102720287] [2021-11-03 05:14:43,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 141 states [2021-11-03 05:14:43,933 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:14:43,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2021-11-03 05:14:43,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1737, Invalid=18003, Unknown=0, NotChecked=0, Total=19740 [2021-11-03 05:14:43,936 INFO L87 Difference]: Start difference. First operand 871 states and 929 transitions. Second operand has 141 states, 141 states have (on average 1.9645390070921986) internal successors, (277), 128 states have internal predecessors, (277), 1 states have call successors, (2), 1 states have call predecessors, (2), 15 states have return successors, (15), 15 states have call predecessors, (15), 1 states have call successors, (15) [2021-11-03 05:15:15,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:15:15,853 INFO L93 Difference]: Finished difference Result 4005 states and 4494 transitions. [2021-11-03 05:15:15,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 606 states. [2021-11-03 05:15:15,854 INFO L78 Accepts]: Start accepts. Automaton has has 141 states, 141 states have (on average 1.9645390070921986) internal successors, (277), 128 states have internal predecessors, (277), 1 states have call successors, (2), 1 states have call predecessors, (2), 15 states have return successors, (15), 15 states have call predecessors, (15), 1 states have call successors, (15) Word has length 905 [2021-11-03 05:15:15,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:15:15,867 INFO L225 Difference]: With dead ends: 4005 [2021-11-03 05:15:15,867 INFO L226 Difference]: Without dead ends: 3030 [2021-11-03 05:15:16,030 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2463 GetRequests, 1723 SyntacticMatches, 0 SemanticMatches, 740 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211380 ImplicationChecksByTransitivity, 32.9s TimeCoverageRelationStatistics Valid=51714, Invalid=498108, Unknown=0, NotChecked=0, Total=549822 [2021-11-03 05:15:16,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3030 states. [2021-11-03 05:15:16,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3030 to 1240. [2021-11-03 05:15:16,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1240 states, 1210 states have (on average 1.0834710743801652) internal successors, (1311), 1210 states have internal predecessors, (1311), 3 states have call successors, (3), 2 states have call predecessors, (3), 26 states have return successors, (27), 27 states have call predecessors, (27), 2 states have call successors, (27) [2021-11-03 05:15:16,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 1240 states and 1341 transitions. [2021-11-03 05:15:16,297 INFO L78 Accepts]: Start accepts. Automaton has 1240 states and 1341 transitions. Word has length 905 [2021-11-03 05:15:16,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:15:16,298 INFO L470 AbstractCegarLoop]: Abstraction has 1240 states and 1341 transitions. [2021-11-03 05:15:16,299 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 141 states, 141 states have (on average 1.9645390070921986) internal successors, (277), 128 states have internal predecessors, (277), 1 states have call successors, (2), 1 states have call predecessors, (2), 15 states have return successors, (15), 15 states have call predecessors, (15), 1 states have call successors, (15) [2021-11-03 05:15:16,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states and 1341 transitions. [2021-11-03 05:15:16,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1247 [2021-11-03 05:15:16,325 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:15:16,325 INFO L513 BasicCegarLoop]: trace histogram [319, 319, 319, 28, 27, 27, 27, 27, 25, 25, 25, 25, 24, 24, 1, 1, 1, 1, 1] [2021-11-03 05:15:16,384 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-11-03 05:15:16,540 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-11-03 05:15:16,540 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting recErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-03 05:15:16,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:15:16,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1105468412, now seen corresponding path program 18 times [2021-11-03 05:15:16,541 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:15:16,541 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602288861] [2021-11-03 05:15:16,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:15:16,541 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:15:17,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:15:18,599 INFO L134 CoverageAnalysis]: Checked inductivity of 163723 backedges. 61597 proven. 9531 refuted. 0 times theorem prover too weak. 92595 trivial. 0 not checked. [2021-11-03 05:15:18,600 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:15:18,600 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602288861] [2021-11-03 05:15:18,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602288861] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 05:15:18,600 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109492710] [2021-11-03 05:15:18,600 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-03 05:15:18,600 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:15:18,601 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 05:15:18,601 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 05:15:18,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-11-03 05:15:23,202 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-03 05:15:23,202 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-03 05:15:23,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 2840 conjuncts, 56 conjunts are in the unsatisfiable core [2021-11-03 05:15:23,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 05:15:27,610 INFO L134 CoverageAnalysis]: Checked inductivity of 163723 backedges. 42225 proven. 2852 refuted. 0 times theorem prover too weak. 118646 trivial. 0 not checked. [2021-11-03 05:15:27,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 05:15:34,523 INFO L134 CoverageAnalysis]: Checked inductivity of 163723 backedges. 42225 proven. 2852 refuted. 0 times theorem prover too weak. 118646 trivial. 0 not checked. [2021-11-03 05:15:34,523 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109492710] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 05:15:34,524 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1861984202] [2021-11-03 05:15:34,525 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-03 05:15:34,525 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 05:15:34,526 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-03 05:15:34,526 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 05:15:34,527 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 56, 56] total 175 [2021-11-03 05:15:34,527 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240421258] [2021-11-03 05:15:34,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 175 states [2021-11-03 05:15:34,529 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:15:34,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 175 interpolants. [2021-11-03 05:15:34,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4137, Invalid=26313, Unknown=0, NotChecked=0, Total=30450 [2021-11-03 05:15:34,532 INFO L87 Difference]: Start difference. First operand 1240 states and 1341 transitions. Second operand has 175 states, 175 states have (on average 1.88) internal successors, (329), 160 states have internal predecessors, (329), 1 states have call successors, (2), 1 states have call predecessors, (2), 17 states have return successors, (17), 17 states have call predecessors, (17), 1 states have call successors, (17) [2021-11-03 05:16:00,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:16:00,682 INFO L93 Difference]: Finished difference Result 6690 states and 7934 transitions. [2021-11-03 05:16:00,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 487 states. [2021-11-03 05:16:00,683 INFO L78 Accepts]: Start accepts. Automaton has has 175 states, 175 states have (on average 1.88) internal successors, (329), 160 states have internal predecessors, (329), 1 states have call successors, (2), 1 states have call predecessors, (2), 17 states have return successors, (17), 17 states have call predecessors, (17), 1 states have call successors, (17) Word has length 1246 [2021-11-03 05:16:00,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:16:00,698 INFO L225 Difference]: With dead ends: 6690 [2021-11-03 05:16:00,699 INFO L226 Difference]: Without dead ends: 5576 [2021-11-03 05:16:00,730 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2970 GetRequests, 2382 SyntacticMatches, 0 SemanticMatches, 588 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134066 ImplicationChecksByTransitivity, 28.7s TimeCoverageRelationStatistics Valid=85220, Invalid=262290, Unknown=0, NotChecked=0, Total=347510 [2021-11-03 05:16:00,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5576 states. [2021-11-03 05:16:00,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5576 to 1477. [2021-11-03 05:16:00,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1477 states, 1447 states have (on average 1.10573600552868) internal successors, (1600), 1447 states have internal predecessors, (1600), 3 states have call successors, (3), 2 states have call predecessors, (3), 26 states have return successors, (27), 27 states have call predecessors, (27), 2 states have call successors, (27) [2021-11-03 05:16:00,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1477 states to 1477 states and 1630 transitions. [2021-11-03 05:16:00,967 INFO L78 Accepts]: Start accepts. Automaton has 1477 states and 1630 transitions. Word has length 1246 [2021-11-03 05:16:00,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:16:00,968 INFO L470 AbstractCegarLoop]: Abstraction has 1477 states and 1630 transitions. [2021-11-03 05:16:00,968 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 175 states, 175 states have (on average 1.88) internal successors, (329), 160 states have internal predecessors, (329), 1 states have call successors, (2), 1 states have call predecessors, (2), 17 states have return successors, (17), 17 states have call predecessors, (17), 1 states have call successors, (17) [2021-11-03 05:16:00,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1477 states and 1630 transitions. [2021-11-03 05:16:00,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1453 [2021-11-03 05:16:00,991 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:16:00,992 INFO L513 BasicCegarLoop]: trace histogram [384, 384, 384, 29, 28, 28, 28, 28, 26, 26, 26, 26, 25, 25, 1, 1, 1, 1, 1] [2021-11-03 05:16:01,054 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2021-11-03 05:16:01,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-11-03 05:16:01,216 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting recErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-03 05:16:01,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:16:01,216 INFO L85 PathProgramCache]: Analyzing trace with hash 728094317, now seen corresponding path program 19 times [2021-11-03 05:16:01,217 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:16:01,217 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054131034] [2021-11-03 05:16:01,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:16:01,217 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:16:02,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:16:03,758 INFO L134 CoverageAnalysis]: Checked inductivity of 234463 backedges. 124104 proven. 818 refuted. 0 times theorem prover too weak. 109541 trivial. 0 not checked. [2021-11-03 05:16:03,758 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:16:03,759 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054131034] [2021-11-03 05:16:03,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054131034] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 05:16:03,759 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126104312] [2021-11-03 05:16:03,759 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-03 05:16:03,759 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:16:03,760 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 05:16:03,760 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 05:16:03,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-11-03 05:16:09,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:16:09,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 3318 conjuncts, 69 conjunts are in the unsatisfiable core [2021-11-03 05:16:09,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 05:16:12,541 INFO L134 CoverageAnalysis]: Checked inductivity of 234463 backedges. 106559 proven. 4172 refuted. 0 times theorem prover too weak. 123732 trivial. 0 not checked. [2021-11-03 05:16:12,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 05:16:48,114 INFO L134 CoverageAnalysis]: Checked inductivity of 234463 backedges. 106662 proven. 4069 refuted. 0 times theorem prover too weak. 123732 trivial. 0 not checked. [2021-11-03 05:16:48,115 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126104312] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 05:16:48,115 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1785789393] [2021-11-03 05:16:48,118 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-03 05:16:48,118 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 05:16:48,119 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-03 05:16:48,120 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 05:16:48,121 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 69, 69] total 94 [2021-11-03 05:16:48,121 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560696909] [2021-11-03 05:16:48,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 94 states [2021-11-03 05:16:48,124 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:16:48,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2021-11-03 05:16:48,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=758, Invalid=7984, Unknown=0, NotChecked=0, Total=8742 [2021-11-03 05:16:48,125 INFO L87 Difference]: Start difference. First operand 1477 states and 1630 transitions. Second operand has 94 states, 94 states have (on average 2.2127659574468086) internal successors, (208), 81 states have internal predecessors, (208), 1 states have call successors, (2), 1 states have call predecessors, (2), 15 states have return successors, (15), 15 states have call predecessors, (15), 1 states have call successors, (15) [2021-11-03 05:16:58,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:16:58,144 INFO L93 Difference]: Finished difference Result 2556 states and 2864 transitions. [2021-11-03 05:16:58,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 249 states. [2021-11-03 05:16:58,144 INFO L78 Accepts]: Start accepts. Automaton has has 94 states, 94 states have (on average 2.2127659574468086) internal successors, (208), 81 states have internal predecessors, (208), 1 states have call successors, (2), 1 states have call predecessors, (2), 15 states have return successors, (15), 15 states have call predecessors, (15), 1 states have call successors, (15) Word has length 1452 [2021-11-03 05:16:58,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:16:58,149 INFO L225 Difference]: With dead ends: 2556 [2021-11-03 05:16:58,149 INFO L226 Difference]: Without dead ends: 1492 [2021-11-03 05:16:58,162 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3193 GetRequests, 2865 SyntacticMatches, 3 SemanticMatches, 325 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32153 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=14936, Invalid=91666, Unknown=0, NotChecked=0, Total=106602 [2021-11-03 05:16:58,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1492 states. [2021-11-03 05:16:58,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1492 to 1492. [2021-11-03 05:16:58,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1492 states, 1462 states have (on average 1.0998632010943912) internal successors, (1608), 1462 states have internal predecessors, (1608), 3 states have call successors, (3), 2 states have call predecessors, (3), 26 states have return successors, (27), 27 states have call predecessors, (27), 2 states have call successors, (27) [2021-11-03 05:16:58,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1492 states to 1492 states and 1638 transitions. [2021-11-03 05:16:58,460 INFO L78 Accepts]: Start accepts. Automaton has 1492 states and 1638 transitions. Word has length 1452 [2021-11-03 05:16:58,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:16:58,461 INFO L470 AbstractCegarLoop]: Abstraction has 1492 states and 1638 transitions. [2021-11-03 05:16:58,461 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 94 states, 94 states have (on average 2.2127659574468086) internal successors, (208), 81 states have internal predecessors, (208), 1 states have call successors, (2), 1 states have call predecessors, (2), 15 states have return successors, (15), 15 states have call predecessors, (15), 1 states have call successors, (15) [2021-11-03 05:16:58,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1492 states and 1638 transitions. [2021-11-03 05:16:58,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1468 [2021-11-03 05:16:58,483 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:16:58,484 INFO L513 BasicCegarLoop]: trace histogram [389, 389, 389, 29, 28, 28, 28, 28, 26, 26, 26, 26, 25, 25, 1, 1, 1, 1, 1] [2021-11-03 05:16:58,548 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2021-11-03 05:16:58,700 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:16:58,700 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting recErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-03 05:16:58,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:16:58,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1177289000, now seen corresponding path program 20 times [2021-11-03 05:16:58,701 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:16:58,701 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194142768] [2021-11-03 05:16:58,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:16:58,701 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:16:59,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:17:01,002 INFO L134 CoverageAnalysis]: Checked inductivity of 240383 backedges. 128668 proven. 944 refuted. 0 times theorem prover too weak. 110771 trivial. 0 not checked. [2021-11-03 05:17:01,002 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:17:01,002 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194142768] [2021-11-03 05:17:01,002 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194142768] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 05:17:01,002 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893865567] [2021-11-03 05:17:01,003 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-03 05:17:01,003 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:17:01,003 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 05:17:01,003 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 05:17:01,034 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-11-03 05:17:07,540 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2021-11-03 05:17:07,541 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-03 05:17:07,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 1745 conjuncts, 52 conjunts are in the unsatisfiable core [2021-11-03 05:17:07,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 05:17:12,246 INFO L134 CoverageAnalysis]: Checked inductivity of 240383 backedges. 113067 proven. 77106 refuted. 0 times theorem prover too weak. 50210 trivial. 0 not checked. [2021-11-03 05:17:12,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 05:17:27,664 INFO L134 CoverageAnalysis]: Checked inductivity of 240383 backedges. 113067 proven. 77106 refuted. 0 times theorem prover too weak. 50210 trivial. 0 not checked. [2021-11-03 05:17:27,664 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893865567] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 05:17:27,664 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [226030274] [2021-11-03 05:17:27,666 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-03 05:17:27,667 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 05:17:27,667 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-03 05:17:27,668 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 05:17:27,669 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 52, 52] total 163 [2021-11-03 05:17:27,670 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260973750] [2021-11-03 05:17:27,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 163 states [2021-11-03 05:17:27,672 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:17:27,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 163 interpolants. [2021-11-03 05:17:27,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2289, Invalid=24117, Unknown=0, NotChecked=0, Total=26406 [2021-11-03 05:17:27,674 INFO L87 Difference]: Start difference. First operand 1492 states and 1638 transitions. Second operand has 163 states, 163 states have (on average 1.9447852760736197) internal successors, (317), 148 states have internal predecessors, (317), 1 states have call successors, (2), 1 states have call predecessors, (2), 17 states have return successors, (17), 17 states have call predecessors, (17), 1 states have call successors, (17) [2021-11-03 05:18:14,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:18:14,930 INFO L93 Difference]: Finished difference Result 7620 states and 8698 transitions. [2021-11-03 05:18:14,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 789 states. [2021-11-03 05:18:14,931 INFO L78 Accepts]: Start accepts. Automaton has has 163 states, 163 states have (on average 1.9447852760736197) internal successors, (317), 148 states have internal predecessors, (317), 1 states have call successors, (2), 1 states have call predecessors, (2), 17 states have return successors, (17), 17 states have call predecessors, (17), 1 states have call successors, (17) Word has length 1467 [2021-11-03 05:18:14,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:18:14,952 INFO L225 Difference]: With dead ends: 7620 [2021-11-03 05:18:14,952 INFO L226 Difference]: Without dead ends: 5608 [2021-11-03 05:18:15,001 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3778 GetRequests, 2833 SyntacticMatches, 0 SemanticMatches, 945 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354170 ImplicationChecksByTransitivity, 48.4s TimeCoverageRelationStatistics Valid=78837, Invalid=817025, Unknown=0, NotChecked=0, Total=895862 [2021-11-03 05:18:15,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5608 states. [2021-11-03 05:18:15,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5608 to 1807. [2021-11-03 05:18:15,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1807 states, 1773 states have (on average 1.0992667794698252) internal successors, (1949), 1773 states have internal predecessors, (1949), 3 states have call successors, (3), 2 states have call predecessors, (3), 30 states have return successors, (31), 31 states have call predecessors, (31), 2 states have call successors, (31) [2021-11-03 05:18:15,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1807 states to 1807 states and 1983 transitions. [2021-11-03 05:18:15,603 INFO L78 Accepts]: Start accepts. Automaton has 1807 states and 1983 transitions. Word has length 1467 [2021-11-03 05:18:15,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:18:15,604 INFO L470 AbstractCegarLoop]: Abstraction has 1807 states and 1983 transitions. [2021-11-03 05:18:15,604 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 163 states, 163 states have (on average 1.9447852760736197) internal successors, (317), 148 states have internal predecessors, (317), 1 states have call successors, (2), 1 states have call predecessors, (2), 17 states have return successors, (17), 17 states have call predecessors, (17), 1 states have call successors, (17) [2021-11-03 05:18:15,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1807 states and 1983 transitions. [2021-11-03 05:18:15,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1700 [2021-11-03 05:18:15,631 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:18:15,632 INFO L513 BasicCegarLoop]: trace histogram [459, 459, 459, 31, 30, 30, 30, 30, 28, 28, 28, 28, 27, 27, 1, 1, 1, 1, 1] [2021-11-03 05:18:15,703 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2021-11-03 05:18:15,850 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-11-03 05:18:15,850 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting recErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-03 05:18:15,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:18:15,850 INFO L85 PathProgramCache]: Analyzing trace with hash 14302118, now seen corresponding path program 21 times [2021-11-03 05:18:15,851 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:18:15,851 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662091534] [2021-11-03 05:18:15,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:18:15,851 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:18:17,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:18:18,665 INFO L134 CoverageAnalysis]: Checked inductivity of 332661 backedges. 108298 proven. 12896 refuted. 0 times theorem prover too weak. 211467 trivial. 0 not checked. [2021-11-03 05:18:18,665 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:18:18,665 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662091534] [2021-11-03 05:18:18,665 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662091534] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 05:18:18,666 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478827318] [2021-11-03 05:18:18,666 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-03 05:18:18,666 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:18:18,666 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 05:18:18,667 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 05:18:18,668 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2021-11-03 05:18:26,098 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-03 05:18:26,098 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-03 05:18:26,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 3889 conjuncts, 69 conjunts are in the unsatisfiable core [2021-11-03 05:18:26,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 05:18:29,271 INFO L134 CoverageAnalysis]: Checked inductivity of 332661 backedges. 108337 proven. 12857 refuted. 0 times theorem prover too weak. 211467 trivial. 0 not checked. [2021-11-03 05:18:29,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 05:19:10,376 INFO L134 CoverageAnalysis]: Checked inductivity of 332661 backedges. 108337 proven. 12857 refuted. 0 times theorem prover too weak. 211467 trivial. 0 not checked. [2021-11-03 05:19:10,376 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478827318] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 05:19:10,376 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1060999492] [2021-11-03 05:19:10,378 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-03 05:19:10,379 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 05:19:10,379 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-03 05:19:10,379 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 05:19:10,381 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 69, 69] total 72 [2021-11-03 05:19:10,381 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342032471] [2021-11-03 05:19:10,383 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2021-11-03 05:19:10,383 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:19:10,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2021-11-03 05:19:10,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=572, Invalid=4540, Unknown=0, NotChecked=0, Total=5112 [2021-11-03 05:19:10,383 INFO L87 Difference]: Start difference. First operand 1807 states and 1983 transitions. Second operand has 72 states, 72 states have (on average 2.2916666666666665) internal successors, (165), 58 states have internal predecessors, (165), 1 states have call successors, (2), 1 states have call predecessors, (2), 16 states have return successors, (16), 16 states have call predecessors, (16), 1 states have call successors, (16) [2021-11-03 05:19:15,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:19:15,854 INFO L93 Difference]: Finished difference Result 3201 states and 3551 transitions. [2021-11-03 05:19:15,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 228 states. [2021-11-03 05:19:15,854 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 2.2916666666666665) internal successors, (165), 58 states have internal predecessors, (165), 1 states have call successors, (2), 1 states have call predecessors, (2), 16 states have return successors, (16), 16 states have call predecessors, (16), 1 states have call successors, (16) Word has length 1699 [2021-11-03 05:19:15,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:19:15,863 INFO L225 Difference]: With dead ends: 3201 [2021-11-03 05:19:15,863 INFO L226 Difference]: Without dead ends: 1807 [2021-11-03 05:19:15,874 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3675 GetRequests, 3409 SyntacticMatches, 0 SemanticMatches, 266 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27473 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=13216, Invalid=58340, Unknown=0, NotChecked=0, Total=71556 [2021-11-03 05:19:15,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1807 states. [2021-11-03 05:19:16,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1807 to 1807. [2021-11-03 05:19:16,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1807 states, 1773 states have (on average 1.098702763677383) internal successors, (1948), 1773 states have internal predecessors, (1948), 3 states have call successors, (3), 2 states have call predecessors, (3), 30 states have return successors, (31), 31 states have call predecessors, (31), 2 states have call successors, (31) [2021-11-03 05:19:16,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1807 states to 1807 states and 1982 transitions. [2021-11-03 05:19:16,350 INFO L78 Accepts]: Start accepts. Automaton has 1807 states and 1982 transitions. Word has length 1699 [2021-11-03 05:19:16,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:19:16,351 INFO L470 AbstractCegarLoop]: Abstraction has 1807 states and 1982 transitions. [2021-11-03 05:19:16,351 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 2.2916666666666665) internal successors, (165), 58 states have internal predecessors, (165), 1 states have call successors, (2), 1 states have call predecessors, (2), 16 states have return successors, (16), 16 states have call predecessors, (16), 1 states have call successors, (16) [2021-11-03 05:19:16,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1807 states and 1982 transitions. [2021-11-03 05:19:16,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1740 [2021-11-03 05:19:16,379 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:19:16,380 INFO L513 BasicCegarLoop]: trace histogram [472, 472, 472, 30, 29, 29, 29, 29, 29, 29, 29, 29, 28, 28, 1, 1, 1, 1, 1] [2021-11-03 05:19:16,452 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2021-11-03 05:19:16,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-11-03 05:19:16,596 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting recErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-03 05:19:16,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:19:16,597 INFO L85 PathProgramCache]: Analyzing trace with hash -2098545169, now seen corresponding path program 22 times [2021-11-03 05:19:16,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:19:16,597 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572387674] [2021-11-03 05:19:16,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:19:16,597 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:19:17,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:19:19,376 INFO L134 CoverageAnalysis]: Checked inductivity of 351652 backedges. 124113 proven. 17087 refuted. 0 times theorem prover too weak. 210452 trivial. 0 not checked. [2021-11-03 05:19:19,376 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:19:19,376 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572387674] [2021-11-03 05:19:19,376 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572387674] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 05:19:19,377 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041239758] [2021-11-03 05:19:19,377 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-03 05:19:19,377 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:19:19,377 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 05:19:19,377 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 05:19:19,378 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2021-11-03 05:19:28,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:19:28,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 3985 conjuncts, 74 conjunts are in the unsatisfiable core [2021-11-03 05:19:28,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 05:19:31,435 INFO L134 CoverageAnalysis]: Checked inductivity of 351652 backedges. 124155 proven. 17045 refuted. 0 times theorem prover too weak. 210452 trivial. 0 not checked. [2021-11-03 05:19:31,435 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 05:20:20,979 INFO L134 CoverageAnalysis]: Checked inductivity of 351652 backedges. 124155 proven. 17045 refuted. 0 times theorem prover too weak. 210452 trivial. 0 not checked. [2021-11-03 05:20:20,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041239758] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 05:20:20,979 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1229352006] [2021-11-03 05:20:20,981 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-03 05:20:20,981 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 05:20:20,981 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-03 05:20:20,981 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 05:20:20,983 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 74, 74] total 77 [2021-11-03 05:20:20,983 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407232309] [2021-11-03 05:20:20,986 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2021-11-03 05:20:20,986 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:20:20,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2021-11-03 05:20:20,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=650, Invalid=5202, Unknown=0, NotChecked=0, Total=5852 [2021-11-03 05:20:20,987 INFO L87 Difference]: Start difference. First operand 1807 states and 1982 transitions. Second operand has 77 states, 77 states have (on average 2.2857142857142856) internal successors, (176), 62 states have internal predecessors, (176), 1 states have call successors, (2), 1 states have call predecessors, (2), 17 states have return successors, (17), 17 states have call predecessors, (17), 1 states have call successors, (17) [2021-11-03 05:20:27,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:20:27,634 INFO L93 Difference]: Finished difference Result 3150 states and 3498 transitions. [2021-11-03 05:20:27,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 259 states. [2021-11-03 05:20:27,634 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 77 states have (on average 2.2857142857142856) internal successors, (176), 62 states have internal predecessors, (176), 1 states have call successors, (2), 1 states have call predecessors, (2), 17 states have return successors, (17), 17 states have call predecessors, (17), 1 states have call successors, (17) Word has length 1739 [2021-11-03 05:20:27,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:20:27,668 INFO L225 Difference]: With dead ends: 3150 [2021-11-03 05:20:27,668 INFO L226 Difference]: Without dead ends: 1807 [2021-11-03 05:20:27,675 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3790 GetRequests, 3490 SyntacticMatches, 0 SemanticMatches, 300 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36118 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=16982, Invalid=73920, Unknown=0, NotChecked=0, Total=90902 [2021-11-03 05:20:27,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1807 states. [2021-11-03 05:20:27,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1807 to 1807. [2021-11-03 05:20:27,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1807 states, 1773 states have (on average 1.0981387478849407) internal successors, (1947), 1773 states have internal predecessors, (1947), 3 states have call successors, (3), 2 states have call predecessors, (3), 30 states have return successors, (31), 31 states have call predecessors, (31), 2 states have call successors, (31) [2021-11-03 05:20:28,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1807 states to 1807 states and 1981 transitions. [2021-11-03 05:20:28,000 INFO L78 Accepts]: Start accepts. Automaton has 1807 states and 1981 transitions. Word has length 1739 [2021-11-03 05:20:28,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:20:28,001 INFO L470 AbstractCegarLoop]: Abstraction has 1807 states and 1981 transitions. [2021-11-03 05:20:28,001 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 77 states have (on average 2.2857142857142856) internal successors, (176), 62 states have internal predecessors, (176), 1 states have call successors, (2), 1 states have call predecessors, (2), 17 states have return successors, (17), 17 states have call predecessors, (17), 1 states have call successors, (17) [2021-11-03 05:20:28,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1807 states and 1981 transitions. [2021-11-03 05:20:28,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1803 [2021-11-03 05:20:28,032 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:20:28,033 INFO L513 BasicCegarLoop]: trace histogram [486, 486, 486, 33, 32, 32, 32, 32, 30, 30, 30, 30, 29, 29, 1, 1, 1, 1, 1] [2021-11-03 05:20:28,120 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2021-11-03 05:20:28,248 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:20:28,248 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting recErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-03 05:20:28,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:20:28,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1488280839, now seen corresponding path program 23 times [2021-11-03 05:20:28,249 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:20:28,249 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353652274] [2021-11-03 05:20:28,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:20:28,249 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:20:30,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:20:32,146 INFO L134 CoverageAnalysis]: Checked inductivity of 373270 backedges. 200283 proven. 1079 refuted. 0 times theorem prover too weak. 171908 trivial. 0 not checked. [2021-11-03 05:20:32,146 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:20:32,146 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353652274] [2021-11-03 05:20:32,146 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353652274] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 05:20:32,146 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876900594] [2021-11-03 05:20:32,146 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-03 05:20:32,146 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:20:32,147 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 05:20:32,147 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 05:20:32,170 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35c69c39-437b-4939-b83a-21a95f9aeb39/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2021-11-03 05:20:42,574 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2021-11-03 05:20:42,574 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-03 05:20:42,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 2080 conjuncts, 57 conjunts are in the unsatisfiable core [2021-11-03 05:20:42,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 05:20:48,249 INFO L134 CoverageAnalysis]: Checked inductivity of 373270 backedges. 179175 proven. 114154 refuted. 0 times theorem prover too weak. 79941 trivial. 0 not checked. [2021-11-03 05:20:48,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 05:21:09,607 INFO L134 CoverageAnalysis]: Checked inductivity of 373270 backedges. 179175 proven. 114154 refuted. 0 times theorem prover too weak. 79941 trivial. 0 not checked. [2021-11-03 05:21:09,607 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876900594] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 05:21:09,607 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2053036328] [2021-11-03 05:21:09,609 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-03 05:21:09,610 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 05:21:09,610 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-03 05:21:09,611 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 05:21:09,612 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 57, 57] total 177 [2021-11-03 05:21:09,613 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904880743] [2021-11-03 05:21:09,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 177 states [2021-11-03 05:21:09,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:21:09,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 177 interpolants. [2021-11-03 05:21:09,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2662, Invalid=28490, Unknown=0, NotChecked=0, Total=31152 [2021-11-03 05:21:09,620 INFO L87 Difference]: Start difference. First operand 1807 states and 1981 transitions. Second operand has 177 states, 177 states have (on average 1.9491525423728813) internal successors, (345), 160 states have internal predecessors, (345), 1 states have call successors, (2), 1 states have call predecessors, (2), 19 states have return successors, (19), 19 states have call predecessors, (19), 1 states have call successors, (19)