./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-crafted/RecursiveNonterminating-1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eba33bfd-5364-4691-8939-0dbc1b6fc282/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eba33bfd-5364-4691-8939-0dbc1b6fc282/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eba33bfd-5364-4691-8939-0dbc1b6fc282/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eba33bfd-5364-4691-8939-0dbc1b6fc282/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/termination-crafted/RecursiveNonterminating-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eba33bfd-5364-4691-8939-0dbc1b6fc282/bin/utaipan-ByfvJB40ur/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eba33bfd-5364-4691-8939-0dbc1b6fc282/bin/utaipan-ByfvJB40ur --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 fc6cfc9bc139db752e72885619d5342f9725bf67cec8b7ca9da9022c75c17b44 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-26 00:11:23,163 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-26 00:11:23,165 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-26 00:11:23,188 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-26 00:11:23,189 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-26 00:11:23,190 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-26 00:11:23,199 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-26 00:11:23,202 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-26 00:11:23,204 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-26 00:11:23,210 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-26 00:11:23,211 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-26 00:11:23,211 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-26 00:11:23,212 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-26 00:11:23,213 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-26 00:11:23,214 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-26 00:11:23,215 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-26 00:11:23,216 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-26 00:11:23,217 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-26 00:11:23,218 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-26 00:11:23,227 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-26 00:11:23,231 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-26 00:11:23,234 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-26 00:11:23,237 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-26 00:11:23,237 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-26 00:11:23,247 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-26 00:11:23,248 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-26 00:11:23,248 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-26 00:11:23,250 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-26 00:11:23,250 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-26 00:11:23,251 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-26 00:11:23,252 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-26 00:11:23,253 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-26 00:11:23,254 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-26 00:11:23,257 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-26 00:11:23,258 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-26 00:11:23,258 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-26 00:11:23,259 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-26 00:11:23,259 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-26 00:11:23,259 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-26 00:11:23,260 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-26 00:11:23,261 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-26 00:11:23,263 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eba33bfd-5364-4691-8939-0dbc1b6fc282/bin/utaipan-ByfvJB40ur/config/svcomp-Overflow-64bit-Taipan_Default.epf [2022-11-26 00:11:23,300 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-26 00:11:23,301 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-26 00:11:23,301 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-26 00:11:23,301 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-26 00:11:23,302 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-26 00:11:23,302 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-26 00:11:23,305 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-26 00:11:23,305 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-26 00:11:23,305 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-26 00:11:23,306 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-26 00:11:23,307 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-26 00:11:23,307 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-26 00:11:23,307 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-26 00:11:23,307 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-26 00:11:23,308 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-26 00:11:23,308 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-26 00:11:23,308 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-26 00:11:23,308 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-26 00:11:23,309 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-26 00:11:23,309 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-26 00:11:23,309 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-26 00:11:23,310 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-26 00:11:23,310 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-26 00:11:23,310 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-26 00:11:23,311 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-26 00:11:23,311 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-26 00:11:23,311 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-26 00:11:23,311 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-26 00:11:23,312 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-26 00:11:23,312 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-26 00:11:23,312 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-26 00:11:23,312 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:11:23,313 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-26 00:11:23,313 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-26 00:11:23,313 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-26 00:11:23,313 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-26 00:11:23,313 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-26 00:11:23,314 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-26 00:11:23,314 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-26 00:11:23,314 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-26 00:11:23,314 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_eba33bfd-5364-4691-8939-0dbc1b6fc282/bin/utaipan-ByfvJB40ur/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_eba33bfd-5364-4691-8939-0dbc1b6fc282/bin/utaipan-ByfvJB40ur 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 -> fc6cfc9bc139db752e72885619d5342f9725bf67cec8b7ca9da9022c75c17b44 [2022-11-26 00:11:23,622 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-26 00:11:23,652 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-26 00:11:23,655 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-26 00:11:23,656 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-26 00:11:23,657 INFO L275 PluginConnector]: CDTParser initialized [2022-11-26 00:11:23,658 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eba33bfd-5364-4691-8939-0dbc1b6fc282/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/termination-crafted/RecursiveNonterminating-1.c [2022-11-26 00:11:26,716 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-26 00:11:26,948 INFO L351 CDTParser]: Found 1 translation units. [2022-11-26 00:11:26,949 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eba33bfd-5364-4691-8939-0dbc1b6fc282/sv-benchmarks/c/termination-crafted/RecursiveNonterminating-1.c [2022-11-26 00:11:26,957 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eba33bfd-5364-4691-8939-0dbc1b6fc282/bin/utaipan-ByfvJB40ur/data/8d2b2edc6/5a6d23ee135e4c27b268f7f3517cf1e6/FLAGac22e1fa3 [2022-11-26 00:11:26,973 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eba33bfd-5364-4691-8939-0dbc1b6fc282/bin/utaipan-ByfvJB40ur/data/8d2b2edc6/5a6d23ee135e4c27b268f7f3517cf1e6 [2022-11-26 00:11:26,979 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-26 00:11:26,980 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-26 00:11:26,981 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-26 00:11:26,982 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-26 00:11:26,989 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-26 00:11:26,990 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:11:26" (1/1) ... [2022-11-26 00:11:26,991 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10713ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:11:26, skipping insertion in model container [2022-11-26 00:11:26,992 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:11:26" (1/1) ... [2022-11-26 00:11:27,000 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-26 00:11:27,012 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-26 00:11:27,133 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:11:27,138 INFO L203 MainTranslator]: Completed pre-run [2022-11-26 00:11:27,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:11:27,164 INFO L208 MainTranslator]: Completed translation [2022-11-26 00:11:27,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:11:27 WrapperNode [2022-11-26 00:11:27,165 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-26 00:11:27,166 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-26 00:11:27,166 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-26 00:11:27,166 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-26 00:11:27,174 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:11:27" (1/1) ... [2022-11-26 00:11:27,178 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:11:27" (1/1) ... [2022-11-26 00:11:27,196 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 13 [2022-11-26 00:11:27,197 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-26 00:11:27,197 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-26 00:11:27,198 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-26 00:11:27,198 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-26 00:11:27,207 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:11:27" (1/1) ... [2022-11-26 00:11:27,208 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:11:27" (1/1) ... [2022-11-26 00:11:27,210 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:11:27" (1/1) ... [2022-11-26 00:11:27,210 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:11:27" (1/1) ... [2022-11-26 00:11:27,212 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:11:27" (1/1) ... [2022-11-26 00:11:27,215 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:11:27" (1/1) ... [2022-11-26 00:11:27,221 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:11:27" (1/1) ... [2022-11-26 00:11:27,222 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:11:27" (1/1) ... [2022-11-26 00:11:27,223 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-26 00:11:27,226 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-26 00:11:27,227 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-26 00:11:27,227 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-26 00:11:27,228 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:11:27" (1/1) ... [2022-11-26 00:11:27,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:11:27,248 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eba33bfd-5364-4691-8939-0dbc1b6fc282/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:11:27,267 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eba33bfd-5364-4691-8939-0dbc1b6fc282/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-26 00:11:27,310 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2022-11-26 00:11:27,311 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2022-11-26 00:11:27,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-26 00:11:27,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-26 00:11:27,299 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eba33bfd-5364-4691-8939-0dbc1b6fc282/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-26 00:11:27,378 INFO L235 CfgBuilder]: Building ICFG [2022-11-26 00:11:27,381 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-26 00:11:27,538 INFO L276 CfgBuilder]: Performing block encoding [2022-11-26 00:11:27,549 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-26 00:11:27,549 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-26 00:11:27,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:11:27 BoogieIcfgContainer [2022-11-26 00:11:27,552 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-26 00:11:27,555 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-26 00:11:27,555 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-26 00:11:27,558 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-26 00:11:27,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:11:26" (1/3) ... [2022-11-26 00:11:27,559 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3be7c8f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:11:27, skipping insertion in model container [2022-11-26 00:11:27,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:11:27" (2/3) ... [2022-11-26 00:11:27,560 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3be7c8f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:11:27, skipping insertion in model container [2022-11-26 00:11:27,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:11:27" (3/3) ... [2022-11-26 00:11:27,561 INFO L112 eAbstractionObserver]: Analyzing ICFG RecursiveNonterminating-1.c [2022-11-26 00:11:27,582 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-26 00:11:27,582 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-11-26 00:11:27,633 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-26 00:11:27,640 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@867e0bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-26 00:11:27,641 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-11-26 00:11:27,645 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 24 states have internal predecessors, (25), 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) [2022-11-26 00:11:27,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-26 00:11:27,652 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:11:27,653 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-26 00:11:27,653 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-26 00:11:27,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:11:27,671 INFO L85 PathProgramCache]: Analyzing trace with hash 71050, now seen corresponding path program 1 times [2022-11-26 00:11:27,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:11:27,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766927518] [2022-11-26 00:11:27,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:11:27,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:11:27,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:11:27,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:11:27,924 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:11:27,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766927518] [2022-11-26 00:11:27,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766927518] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:11:27,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:11:27,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-26 00:11:27,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329850884] [2022-11-26 00:11:27,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:11:27,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:11:27,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:11:27,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:11:27,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:11:27,975 INFO L87 Difference]: Start difference. First operand has 27 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 24 states have internal predecessors, (25), 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 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:11:28,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:11:28,042 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-11-26 00:11:28,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:11:28,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-26 00:11:28,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:11:28,055 INFO L225 Difference]: With dead ends: 27 [2022-11-26 00:11:28,056 INFO L226 Difference]: Without dead ends: 21 [2022-11-26 00:11:28,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:11:28,062 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 6 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:11:28,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 39 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:11:28,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-11-26 00:11:28,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-11-26 00:11:28,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 19 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:11:28,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2022-11-26 00:11:28,106 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 3 [2022-11-26 00:11:28,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:11:28,107 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2022-11-26 00:11:28,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:11:28,109 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-11-26 00:11:28,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-26 00:11:28,110 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:11:28,110 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-26 00:11:28,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-26 00:11:28,112 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-26 00:11:28,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:11:28,115 INFO L85 PathProgramCache]: Analyzing trace with hash 2202612, now seen corresponding path program 1 times [2022-11-26 00:11:28,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:11:28,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332082207] [2022-11-26 00:11:28,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:11:28,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:11:28,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:11:28,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:11:28,162 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:11:28,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332082207] [2022-11-26 00:11:28,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332082207] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:11:28,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:11:28,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:11:28,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640311209] [2022-11-26 00:11:28,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:11:28,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:11:28,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:11:28,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:11:28,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:11:28,166 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:11:28,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:11:28,197 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-11-26 00:11:28,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:11:28,198 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-26 00:11:28,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:11:28,199 INFO L225 Difference]: With dead ends: 21 [2022-11-26 00:11:28,199 INFO L226 Difference]: Without dead ends: 20 [2022-11-26 00:11:28,199 INFO L412 NwaCegarLoop]: 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 [2022-11-26 00:11:28,201 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 1 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:11:28,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 32 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:11:28,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-11-26 00:11:28,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-11-26 00:11:28,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 12 states have (on average 1.5) internal successors, (18), 18 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:11:28,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2022-11-26 00:11:28,206 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 4 [2022-11-26 00:11:28,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:11:28,206 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2022-11-26 00:11:28,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:11:28,207 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-11-26 00:11:28,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-26 00:11:28,207 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:11:28,207 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:11:28,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-26 00:11:28,208 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-26 00:11:28,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:11:28,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1653946194, now seen corresponding path program 1 times [2022-11-26 00:11:28,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:11:28,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022894215] [2022-11-26 00:11:28,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:11:28,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:11:28,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:11:28,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:11:28,410 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:11:28,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022894215] [2022-11-26 00:11:28,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022894215] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:11:28,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:11:28,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:11:28,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092560511] [2022-11-26 00:11:28,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:11:28,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 00:11:28,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:11:28,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 00:11:28,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:11:28,413 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:11:28,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:11:28,517 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-11-26 00:11:28,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-26 00:11:28,519 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-26 00:11:28,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:11:28,520 INFO L225 Difference]: With dead ends: 35 [2022-11-26 00:11:28,520 INFO L226 Difference]: Without dead ends: 33 [2022-11-26 00:11:28,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-26 00:11:28,521 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 33 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:11:28,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 36 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:11:28,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-11-26 00:11:28,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2022-11-26 00:11:28,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 22 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:11:28,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2022-11-26 00:11:28,532 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 8 [2022-11-26 00:11:28,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:11:28,533 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2022-11-26 00:11:28,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:11:28,533 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-11-26 00:11:28,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-26 00:11:28,533 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:11:28,534 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:11:28,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-26 00:11:28,534 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-26 00:11:28,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:11:28,535 INFO L85 PathProgramCache]: Analyzing trace with hash 267275575, now seen corresponding path program 1 times [2022-11-26 00:11:28,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:11:28,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294822207] [2022-11-26 00:11:28,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:11:28,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:11:28,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:11:28,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:11:28,616 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:11:28,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294822207] [2022-11-26 00:11:28,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294822207] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:11:28,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:11:28,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:11:28,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596192642] [2022-11-26 00:11:28,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:11:28,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 00:11:28,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:11:28,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 00:11:28,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:11:28,619 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:11:28,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:11:28,682 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-11-26 00:11:28,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-26 00:11:28,683 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-26 00:11:28,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:11:28,684 INFO L225 Difference]: With dead ends: 33 [2022-11-26 00:11:28,684 INFO L226 Difference]: Without dead ends: 31 [2022-11-26 00:11:28,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-26 00:11:28,686 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 26 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:11:28,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 38 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:11:28,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-26 00:11:28,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2022-11-26 00:11:28,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 23 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:11:28,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2022-11-26 00:11:28,691 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 9 [2022-11-26 00:11:28,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:11:28,692 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2022-11-26 00:11:28,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:11:28,692 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-11-26 00:11:28,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-26 00:11:28,693 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:11:28,693 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:11:28,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-26 00:11:28,693 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting recErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-26 00:11:28,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:11:28,694 INFO L85 PathProgramCache]: Analyzing trace with hash -462673166, now seen corresponding path program 1 times [2022-11-26 00:11:28,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:11:28,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002209946] [2022-11-26 00:11:28,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:11:28,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:11:28,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:11:28,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:11:28,726 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:11:28,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002209946] [2022-11-26 00:11:28,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002209946] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:11:28,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:11:28,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:11:28,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100123347] [2022-11-26 00:11:28,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:11:28,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:11:28,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:11:28,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:11:28,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:11:28,729 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:11:28,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:11:28,740 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-11-26 00:11:28,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:11:28,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-26 00:11:28,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:11:28,741 INFO L225 Difference]: With dead ends: 26 [2022-11-26 00:11:28,741 INFO L226 Difference]: Without dead ends: 25 [2022-11-26 00:11:28,742 INFO L412 NwaCegarLoop]: 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 [2022-11-26 00:11:28,743 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 7 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:11:28,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 19 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:11:28,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-11-26 00:11:28,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-11-26 00:11:28,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 22 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:11:28,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2022-11-26 00:11:28,748 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 12 [2022-11-26 00:11:28,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:11:28,749 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2022-11-26 00:11:28,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:11:28,749 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-11-26 00:11:28,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-26 00:11:28,750 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:11:28,750 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:11:28,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-26 00:11:28,750 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting recErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-26 00:11:28,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:11:28,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1457966213, now seen corresponding path program 1 times [2022-11-26 00:11:28,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:11:28,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585698273] [2022-11-26 00:11:28,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:11:28,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:11:28,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:11:28,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:11:28,812 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:11:28,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585698273] [2022-11-26 00:11:28,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585698273] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:11:28,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:11:28,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:11:28,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067516518] [2022-11-26 00:11:28,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:11:28,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:11:28,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:11:28,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:11:28,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:11:28,815 INFO L87 Difference]: Start difference. First operand 25 states and 25 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, (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) [2022-11-26 00:11:28,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:11:28,838 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-11-26 00:11:28,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:11:28,839 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, (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 13 [2022-11-26 00:11:28,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:11:28,840 INFO L225 Difference]: With dead ends: 25 [2022-11-26 00:11:28,840 INFO L226 Difference]: Without dead ends: 24 [2022-11-26 00:11:28,840 INFO L412 NwaCegarLoop]: 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 [2022-11-26 00:11:28,841 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 5 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:11:28,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 19 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:11:28,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-11-26 00:11:28,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-11-26 00:11:28,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 21 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:11:28,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2022-11-26 00:11:28,846 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 13 [2022-11-26 00:11:28,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:11:28,847 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2022-11-26 00:11:28,847 INFO L496 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, (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) [2022-11-26 00:11:28,847 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-11-26 00:11:28,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-26 00:11:28,848 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:11:28,848 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:11:28,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-26 00:11:28,848 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-26 00:11:28,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:11:28,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1244421111, now seen corresponding path program 1 times [2022-11-26 00:11:28,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:11:28,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359687367] [2022-11-26 00:11:28,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:11:28,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:11:28,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:11:28,996 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:11:28,996 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:11:28,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359687367] [2022-11-26 00:11:28,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359687367] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:11:28,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189490748] [2022-11-26 00:11:28,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:11:28,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:11:28,997 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eba33bfd-5364-4691-8939-0dbc1b6fc282/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:11:29,001 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eba33bfd-5364-4691-8939-0dbc1b6fc282/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:11:29,026 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eba33bfd-5364-4691-8939-0dbc1b6fc282/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-26 00:11:29,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:11:29,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-26 00:11:29,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:11:29,172 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:11:29,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:11:29,251 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:11:29,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189490748] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:11:29,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [350821544] [2022-11-26 00:11:29,277 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-26 00:11:29,277 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:11:29,282 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-26 00:11:29,288 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:11:29,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2022-11-26 00:11:29,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231806160] [2022-11-26 00:11:29,289 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:11:29,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-26 00:11:29,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:11:29,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-26 00:11:29,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-11-26 00:11:29,295 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 13 states, 12 states have (on average 3.0) internal successors, (36), 9 states have internal predecessors, (36), 4 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:11:29,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:11:29,573 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2022-11-26 00:11:29,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-26 00:11:29,573 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 9 states have internal predecessors, (36), 4 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-26 00:11:29,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:11:29,574 INFO L225 Difference]: With dead ends: 38 [2022-11-26 00:11:29,574 INFO L226 Difference]: Without dead ends: 36 [2022-11-26 00:11:29,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2022-11-26 00:11:29,576 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 98 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:11:29,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 40 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:11:29,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-11-26 00:11:29,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 22. [2022-11-26 00:11:29,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:11:29,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2022-11-26 00:11:29,582 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 17 [2022-11-26 00:11:29,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:11:29,583 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2022-11-26 00:11:29,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 9 states have internal predecessors, (36), 4 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:11:29,598 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-11-26 00:11:29,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-26 00:11:29,600 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:11:29,600 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:11:29,612 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eba33bfd-5364-4691-8939-0dbc1b6fc282/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-26 00:11:29,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eba33bfd-5364-4691-8939-0dbc1b6fc282/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-26 00:11:29,805 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-26 00:11:29,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:11:29,805 INFO L85 PathProgramCache]: Analyzing trace with hash -77651186, now seen corresponding path program 1 times [2022-11-26 00:11:29,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:11:29,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367254343] [2022-11-26 00:11:29,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:11:29,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:11:29,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:11:29,894 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:11:29,894 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:11:29,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367254343] [2022-11-26 00:11:29,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367254343] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:11:29,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991646610] [2022-11-26 00:11:29,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:11:29,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:11:29,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eba33bfd-5364-4691-8939-0dbc1b6fc282/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:11:29,897 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eba33bfd-5364-4691-8939-0dbc1b6fc282/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:11:29,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eba33bfd-5364-4691-8939-0dbc1b6fc282/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-26 00:11:29,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:11:29,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-26 00:11:29,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:11:29,999 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:11:29,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:11:30,074 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:11:30,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991646610] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:11:30,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1608731916] [2022-11-26 00:11:30,084 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-26 00:11:30,084 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:11:30,085 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-26 00:11:30,085 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:11:30,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2022-11-26 00:11:30,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285619707] [2022-11-26 00:11:30,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:11:30,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-26 00:11:30,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:11:30,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-26 00:11:30,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-11-26 00:11:30,088 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand has 13 states, 12 states have (on average 3.25) internal successors, (39), 9 states have internal predecessors, (39), 4 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:11:30,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:11:30,312 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-11-26 00:11:30,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-26 00:11:30,312 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.25) internal successors, (39), 9 states have internal predecessors, (39), 4 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-26 00:11:30,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:11:30,313 INFO L225 Difference]: With dead ends: 34 [2022-11-26 00:11:30,313 INFO L226 Difference]: Without dead ends: 0 [2022-11-26 00:11:30,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2022-11-26 00:11:30,314 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 69 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:11:30,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 36 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:11:30,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-26 00:11:30,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-26 00:11:30,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:11:30,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-26 00:11:30,316 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2022-11-26 00:11:30,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:11:30,316 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-26 00:11:30,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.25) internal successors, (39), 9 states have internal predecessors, (39), 4 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:11:30,317 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-26 00:11:30,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-26 00:11:30,319 INFO L805 garLoopResultBuilder]: Registering result SAFE for location recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-11-26 00:11:30,320 INFO L805 garLoopResultBuilder]: Registering result SAFE for location recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-11-26 00:11:30,320 INFO L805 garLoopResultBuilder]: Registering result SAFE for location recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-11-26 00:11:30,320 INFO L805 garLoopResultBuilder]: Registering result SAFE for location recErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-11-26 00:11:30,320 INFO L805 garLoopResultBuilder]: Registering result SAFE for location recErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-11-26 00:11:30,321 INFO L805 garLoopResultBuilder]: Registering result SAFE for location recErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-11-26 00:11:30,321 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-11-26 00:11:30,321 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-11-26 00:11:30,330 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eba33bfd-5364-4691-8939-0dbc1b6fc282/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-26 00:11:30,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eba33bfd-5364-4691-8939-0dbc1b6fc282/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:11:30,524 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-26 00:11:30,790 INFO L902 garLoopResultBuilder]: At program point recENTRY(lines 10 14) the Hoare annotation is: true [2022-11-26 00:11:30,790 INFO L899 garLoopResultBuilder]: For program point recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 12) no Hoare annotation was computed. [2022-11-26 00:11:30,791 INFO L899 garLoopResultBuilder]: For program point recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 12) no Hoare annotation was computed. [2022-11-26 00:11:30,791 INFO L899 garLoopResultBuilder]: For program point recErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 12) no Hoare annotation was computed. [2022-11-26 00:11:30,791 INFO L899 garLoopResultBuilder]: For program point recErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 12) no Hoare annotation was computed. [2022-11-26 00:11:30,791 INFO L899 garLoopResultBuilder]: For program point recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 12) no Hoare annotation was computed. [2022-11-26 00:11:30,791 INFO L899 garLoopResultBuilder]: For program point recErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 12) no Hoare annotation was computed. [2022-11-26 00:11:30,791 INFO L899 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2022-11-26 00:11:30,792 INFO L899 garLoopResultBuilder]: For program point L11(lines 11 13) no Hoare annotation was computed. [2022-11-26 00:11:30,792 INFO L899 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-11-26 00:11:30,792 INFO L899 garLoopResultBuilder]: For program point L12-2(line 12) no Hoare annotation was computed. [2022-11-26 00:11:30,792 INFO L899 garLoopResultBuilder]: For program point L11-1(lines 10 14) no Hoare annotation was computed. [2022-11-26 00:11:30,792 INFO L899 garLoopResultBuilder]: For program point L12-3(line 12) no Hoare annotation was computed. [2022-11-26 00:11:30,792 INFO L899 garLoopResultBuilder]: For program point L12-4(line 12) no Hoare annotation was computed. [2022-11-26 00:11:30,792 INFO L899 garLoopResultBuilder]: For program point recEXIT(lines 10 14) no Hoare annotation was computed. [2022-11-26 00:11:30,792 INFO L899 garLoopResultBuilder]: For program point L12-5(line 12) no Hoare annotation was computed. [2022-11-26 00:11:30,793 INFO L895 garLoopResultBuilder]: At program point L12-6(line 12) the Hoare annotation is: (let ((.cse17 (+ |rec_#in~x| 1))) (let ((.cse15 (<= |rec_#in~y| .cse17)) (.cse8 (+ 2 |rec_#in~x|)) (.cse7 (* 2 |rec_#in~y|))) (let ((.cse9 (+ rec_~x 2)) (.cse3 (* rec_~y 2)) (.cse13 (<= .cse8 .cse7)) (.cse0 (not .cse15)) (.cse10 (<= 0 (+ 41 |rec_#in~y|))) (.cse14 (+ rec_~x 1))) (let ((.cse2 (<= .cse14 rec_~y)) (.cse4 (not (<= .cse17 |rec_#in~y|))) (.cse5 (let ((.cse16 (not .cse10))) (and (or (not .cse13) .cse16) (or .cse0 .cse16)))) (.cse1 (let ((.cse11 (<= 0 (+ rec_~x 42))) (.cse12 (<= rec_~x 23))) (or (and .cse10 .cse11 (<= .cse9 .cse3) .cse12 .cse13) (and .cse11 (<= rec_~y .cse14) .cse15 (<= 0 (+ .cse3 2147483648)) .cse12)))) (.cse6 (not (<= |rec_#in~y| 24)))) (and (or .cse0 (and .cse1 .cse2 (<= .cse3 2147483647)) .cse4) (or .cse5 (and .cse1 .cse2 (<= rec_~y 24)) .cse6 .cse4) (or (not (<= .cse7 .cse8)) .cse5 (and .cse1 (<= .cse3 .cse9)) .cse6)))))) [2022-11-26 00:11:30,793 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 19) no Hoare annotation was computed. [2022-11-26 00:11:30,793 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-26 00:11:30,794 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 19) no Hoare annotation was computed. [2022-11-26 00:11:30,794 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-26 00:11:30,794 INFO L895 garLoopResultBuilder]: At program point L20(lines 16 21) the Hoare annotation is: (<= 0 (+ |ULTIMATE.start_main_~n~0#1| 2147483648)) [2022-11-26 00:11:30,794 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-11-26 00:11:30,794 INFO L899 garLoopResultBuilder]: For program point L18(line 18) no Hoare annotation was computed. [2022-11-26 00:11:30,794 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2022-11-26 00:11:30,794 INFO L895 garLoopResultBuilder]: At program point L19-2(line 19) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~n~0#1| 2147483646) (<= 0 (+ |ULTIMATE.start_main_~n~0#1| 2147483648))) [2022-11-26 00:11:30,795 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2022-11-26 00:11:30,798 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:11:30,803 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-26 00:11:30,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 12:11:30 BoogieIcfgContainer [2022-11-26 00:11:30,821 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-26 00:11:30,823 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-26 00:11:30,823 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-26 00:11:30,823 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-26 00:11:30,823 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:11:27" (3/4) ... [2022-11-26 00:11:30,826 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-26 00:11:30,840 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure rec [2022-11-26 00:11:30,847 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-11-26 00:11:30,847 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-26 00:11:30,847 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-26 00:11:30,887 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eba33bfd-5364-4691-8939-0dbc1b6fc282/bin/utaipan-ByfvJB40ur/witness.graphml [2022-11-26 00:11:30,887 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-26 00:11:30,888 INFO L158 Benchmark]: Toolchain (without parser) took 3907.73ms. Allocated memory is still 172.0MB. Free memory was 141.9MB in the beginning and 86.4MB in the end (delta: 55.4MB). Peak memory consumption was 57.5MB. Max. memory is 16.1GB. [2022-11-26 00:11:30,888 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 134.2MB. Free memory is still 78.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-26 00:11:30,889 INFO L158 Benchmark]: CACSL2BoogieTranslator took 183.57ms. Allocated memory is still 172.0MB. Free memory was 141.9MB in the beginning and 132.5MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-26 00:11:30,889 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.14ms. Allocated memory is still 172.0MB. Free memory was 132.5MB in the beginning and 131.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-26 00:11:30,890 INFO L158 Benchmark]: Boogie Preprocessor took 28.05ms. Allocated memory is still 172.0MB. Free memory was 131.3MB in the beginning and 130.3MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-26 00:11:30,890 INFO L158 Benchmark]: RCFGBuilder took 325.60ms. Allocated memory is still 172.0MB. Free memory was 130.3MB in the beginning and 120.4MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-26 00:11:30,890 INFO L158 Benchmark]: TraceAbstraction took 3266.39ms. Allocated memory is still 172.0MB. Free memory was 119.9MB in the beginning and 89.6MB in the end (delta: 30.3MB). Peak memory consumption was 32.3MB. Max. memory is 16.1GB. [2022-11-26 00:11:30,891 INFO L158 Benchmark]: Witness Printer took 64.92ms. Allocated memory is still 172.0MB. Free memory was 89.6MB in the beginning and 86.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-26 00:11:30,893 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 134.2MB. Free memory is still 78.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 183.57ms. Allocated memory is still 172.0MB. Free memory was 141.9MB in the beginning and 132.5MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.14ms. Allocated memory is still 172.0MB. Free memory was 132.5MB in the beginning and 131.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.05ms. Allocated memory is still 172.0MB. Free memory was 131.3MB in the beginning and 130.3MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 325.60ms. Allocated memory is still 172.0MB. Free memory was 130.3MB in the beginning and 120.4MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 3266.39ms. Allocated memory is still 172.0MB. Free memory was 119.9MB in the beginning and 89.6MB in the end (delta: 30.3MB). Peak memory consumption was 32.3MB. Max. memory is 16.1GB. * Witness Printer took 64.92ms. Allocated memory is still 172.0MB. Free memory was 89.6MB in the beginning and 86.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 12]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 12]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 12]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 12]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 12]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 12]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 27 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 246 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 245 mSDsluCounter, 259 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 161 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 396 IncrementalHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 98 mSDtfsCounter, 396 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=0, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 27 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 10 PreInvPairs, 10 NumberOfFragments, 304 HoareAnnotationTreeSize, 10 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 116 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 119 NumberOfCodeBlocks, 119 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 142 ConstructedInterpolants, 0 QuantifiedInterpolants, 448 SizeOfPredicates, 2 NumberOfNonLiveVariables, 77 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 8/21 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 0 <= n + 2147483648 RESULT: Ultimate proved your program to be correct! [2022-11-26 00:11:30,927 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eba33bfd-5364-4691-8939-0dbc1b6fc282/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE