./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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_3cc3bf65-f0f4-454e-bd6f-f62f31849c73/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc3bf65-f0f4-454e-bd6f-f62f31849c73/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_3cc3bf65-f0f4-454e-bd6f-f62f31849c73/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc3bf65-f0f4-454e-bd6f-f62f31849c73/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc3bf65-f0f4-454e-bd6f-f62f31849c73/bin/utaipan-ByfvJB40ur/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc3bf65-f0f4-454e-bd6f-f62f31849c73/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 32bit --witnessprinter.graph.data.programhash ba885d2ca843c278430bc3d4272c307ea7df8f1fbcd0da84e81382a8c1939a93 --- 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:44:25,996 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-26 00:44:25,999 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-26 00:44:26,027 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-26 00:44:26,027 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-26 00:44:26,028 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-26 00:44:26,030 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-26 00:44:26,032 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-26 00:44:26,033 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-26 00:44:26,034 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-26 00:44:26,036 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-26 00:44:26,037 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-26 00:44:26,038 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-26 00:44:26,039 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-26 00:44:26,040 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-26 00:44:26,041 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-26 00:44:26,042 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-26 00:44:26,044 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-26 00:44:26,045 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-26 00:44:26,048 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-26 00:44:26,049 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-26 00:44:26,051 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-26 00:44:26,052 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-26 00:44:26,054 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-26 00:44:26,058 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-26 00:44:26,058 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-26 00:44:26,059 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-26 00:44:26,060 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-26 00:44:26,060 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-26 00:44:26,062 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-26 00:44:26,062 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-26 00:44:26,063 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-26 00:44:26,064 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-26 00:44:26,065 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-26 00:44:26,066 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-26 00:44:26,067 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-26 00:44:26,068 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-26 00:44:26,068 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-26 00:44:26,068 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-26 00:44:26,069 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-26 00:44:26,070 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-26 00:44:26,073 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc3bf65-f0f4-454e-bd6f-f62f31849c73/bin/utaipan-ByfvJB40ur/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-26 00:44:26,113 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-26 00:44:26,113 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-26 00:44:26,114 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-26 00:44:26,114 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-26 00:44:26,115 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-26 00:44:26,120 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-26 00:44:26,121 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-26 00:44:26,121 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-26 00:44:26,121 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-26 00:44:26,121 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-26 00:44:26,122 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-26 00:44:26,122 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-26 00:44:26,123 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-26 00:44:26,123 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-26 00:44:26,123 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-26 00:44:26,123 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-26 00:44:26,123 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-26 00:44:26,124 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-26 00:44:26,124 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-26 00:44:26,125 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-26 00:44:26,125 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-26 00:44:26,125 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-26 00:44:26,125 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-26 00:44:26,126 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-26 00:44:26,126 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-26 00:44:26,126 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-26 00:44:26,126 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-26 00:44:26,127 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-26 00:44:26,127 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-26 00:44:26,127 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-26 00:44:26,128 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-26 00:44:26,128 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-26 00:44:26,128 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-26 00:44:26,128 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-26 00:44:26,129 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:44:26,129 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-26 00:44:26,129 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-26 00:44:26,129 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-26 00:44:26,129 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-26 00:44:26,130 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-26 00:44:26,130 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-26 00:44:26,130 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-26 00:44:26,130 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-26 00:44:26,130 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_3cc3bf65-f0f4-454e-bd6f-f62f31849c73/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_3cc3bf65-f0f4-454e-bd6f-f62f31849c73/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ba885d2ca843c278430bc3d4272c307ea7df8f1fbcd0da84e81382a8c1939a93 [2022-11-26 00:44:26,446 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-26 00:44:26,485 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-26 00:44:26,488 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-26 00:44:26,489 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-26 00:44:26,490 INFO L275 PluginConnector]: CDTParser initialized [2022-11-26 00:44:26,491 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc3bf65-f0f4-454e-bd6f-f62f31849c73/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.i [2022-11-26 00:44:29,707 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-26 00:44:29,947 INFO L351 CDTParser]: Found 1 translation units. [2022-11-26 00:44:29,947 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc3bf65-f0f4-454e-bd6f-f62f31849c73/sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.i [2022-11-26 00:44:29,960 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc3bf65-f0f4-454e-bd6f-f62f31849c73/bin/utaipan-ByfvJB40ur/data/85dcb1b4c/66a8e113f1bd4f0986c469bd143a5873/FLAGb127bb444 [2022-11-26 00:44:29,976 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc3bf65-f0f4-454e-bd6f-f62f31849c73/bin/utaipan-ByfvJB40ur/data/85dcb1b4c/66a8e113f1bd4f0986c469bd143a5873 [2022-11-26 00:44:29,986 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-26 00:44:29,989 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-26 00:44:29,995 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-26 00:44:29,995 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-26 00:44:29,999 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-26 00:44:30,000 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:44:29" (1/1) ... [2022-11-26 00:44:30,001 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e91b21d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:44:30, skipping insertion in model container [2022-11-26 00:44:30,002 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:44:29" (1/1) ... [2022-11-26 00:44:30,010 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-26 00:44:30,049 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-26 00:44:30,319 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:44:30,335 INFO L203 MainTranslator]: Completed pre-run [2022-11-26 00:44:30,412 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:44:30,436 INFO L208 MainTranslator]: Completed translation [2022-11-26 00:44:30,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:44:30 WrapperNode [2022-11-26 00:44:30,437 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-26 00:44:30,438 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-26 00:44:30,438 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-26 00:44:30,438 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-26 00:44:30,445 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:44:30" (1/1) ... [2022-11-26 00:44:30,478 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:44:30" (1/1) ... [2022-11-26 00:44:30,502 INFO L138 Inliner]: procedures = 116, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 78 [2022-11-26 00:44:30,504 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-26 00:44:30,505 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-26 00:44:30,506 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-26 00:44:30,506 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-26 00:44:30,516 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:44:30" (1/1) ... [2022-11-26 00:44:30,516 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:44:30" (1/1) ... [2022-11-26 00:44:30,527 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:44:30" (1/1) ... [2022-11-26 00:44:30,527 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:44:30" (1/1) ... [2022-11-26 00:44:30,534 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:44:30" (1/1) ... [2022-11-26 00:44:30,547 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:44:30" (1/1) ... [2022-11-26 00:44:30,549 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:44:30" (1/1) ... [2022-11-26 00:44:30,550 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:44:30" (1/1) ... [2022-11-26 00:44:30,552 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-26 00:44:30,553 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-26 00:44:30,553 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-26 00:44:30,553 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-26 00:44:30,554 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:44:30" (1/1) ... [2022-11-26 00:44:30,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:44:30,581 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc3bf65-f0f4-454e-bd6f-f62f31849c73/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:44:30,592 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc3bf65-f0f4-454e-bd6f-f62f31849c73/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-26 00:44:30,598 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc3bf65-f0f4-454e-bd6f-f62f31849c73/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-26 00:44:30,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-26 00:44:30,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-26 00:44:30,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-26 00:44:30,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-26 00:44:30,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-26 00:44:30,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-26 00:44:30,747 INFO L235 CfgBuilder]: Building ICFG [2022-11-26 00:44:30,750 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-26 00:44:30,941 INFO L276 CfgBuilder]: Performing block encoding [2022-11-26 00:44:31,011 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-26 00:44:31,011 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-26 00:44:31,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:44:31 BoogieIcfgContainer [2022-11-26 00:44:31,015 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-26 00:44:31,018 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-26 00:44:31,018 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-26 00:44:31,022 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-26 00:44:31,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:44:29" (1/3) ... [2022-11-26 00:44:31,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62f6e931 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:44:31, skipping insertion in model container [2022-11-26 00:44:31,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:44:30" (2/3) ... [2022-11-26 00:44:31,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62f6e931 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:44:31, skipping insertion in model container [2022-11-26 00:44:31,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:44:31" (3/3) ... [2022-11-26 00:44:31,025 INFO L112 eAbstractionObserver]: Analyzing ICFG java_BubbleSort-alloca-1.i [2022-11-26 00:44:31,046 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-26 00:44:31,046 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2022-11-26 00:44:31,108 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-26 00:44:31,117 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;@6177432a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-26 00:44:31,117 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2022-11-26 00:44:31,122 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 35 states have internal predecessors, (40), 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:44:31,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-26 00:44:31,130 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:44:31,131 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-26 00:44:31,131 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-26 00:44:31,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:44:31,139 INFO L85 PathProgramCache]: Analyzing trace with hash 120889, now seen corresponding path program 1 times [2022-11-26 00:44:31,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:44:31,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644012532] [2022-11-26 00:44:31,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:44:31,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:44:31,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:44:31,447 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:44:31,447 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:44:31,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644012532] [2022-11-26 00:44:31,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644012532] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:44:31,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:44:31,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:44:31,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955222147] [2022-11-26 00:44:31,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:44:31,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:44:31,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:44:31,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:44:31,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:44:31,544 INFO L87 Difference]: Start difference. First operand has 36 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 35 states have internal predecessors, (40), 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) Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 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:44:31,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:44:31,641 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2022-11-26 00:44:31,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:44:31,644 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 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:44:31,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:44:31,652 INFO L225 Difference]: With dead ends: 101 [2022-11-26 00:44:31,652 INFO L226 Difference]: Without dead ends: 67 [2022-11-26 00:44:31,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:44:31,658 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 36 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:44:31,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 98 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:44:31,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-26 00:44:31,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 38. [2022-11-26 00:44:31,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.75) internal successors, (42), 37 states have internal predecessors, (42), 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:44:31,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2022-11-26 00:44:31,703 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 3 [2022-11-26 00:44:31,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:44:31,704 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2022-11-26 00:44:31,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 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:44:31,704 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-11-26 00:44:31,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-26 00:44:31,705 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:44:31,705 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-26 00:44:31,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-26 00:44:31,707 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-26 00:44:31,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:44:31,708 INFO L85 PathProgramCache]: Analyzing trace with hash 3755751, now seen corresponding path program 1 times [2022-11-26 00:44:31,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:44:31,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980254115] [2022-11-26 00:44:31,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:44:31,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:44:31,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:44:31,766 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:44:31,766 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:44:31,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980254115] [2022-11-26 00:44:31,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980254115] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:44:31,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:44:31,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:44:31,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316435194] [2022-11-26 00:44:31,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:44:31,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:44:31,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:44:31,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:44:31,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:44:31,771 INFO L87 Difference]: Start difference. First operand 38 states and 42 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:44:31,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:44:31,807 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2022-11-26 00:44:31,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:44:31,808 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:44:31,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:44:31,808 INFO L225 Difference]: With dead ends: 38 [2022-11-26 00:44:31,809 INFO L226 Difference]: Without dead ends: 37 [2022-11-26 00:44:31,809 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:44:31,810 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 28 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:44:31,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 32 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:44:31,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-26 00:44:31,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-11-26 00:44:31,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 36 states have internal predecessors, (41), 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:44:31,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2022-11-26 00:44:31,817 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 4 [2022-11-26 00:44:31,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:44:31,817 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2022-11-26 00:44:31,818 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:44:31,818 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2022-11-26 00:44:31,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-26 00:44:31,819 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:44:31,819 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-26 00:44:31,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-26 00:44:31,819 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-26 00:44:31,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:44:31,820 INFO L85 PathProgramCache]: Analyzing trace with hash 116428353, now seen corresponding path program 1 times [2022-11-26 00:44:31,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:44:31,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822787602] [2022-11-26 00:44:31,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:44:31,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:44:31,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:44:32,010 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:44:32,011 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:44:32,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822787602] [2022-11-26 00:44:32,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822787602] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:44:32,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:44:32,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:44:32,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195057871] [2022-11-26 00:44:32,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:44:32,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:44:32,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:44:32,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:44:32,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:44:32,014 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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:44:32,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:44:32,056 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2022-11-26 00:44:32,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:44:32,057 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2022-11-26 00:44:32,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:44:32,058 INFO L225 Difference]: With dead ends: 66 [2022-11-26 00:44:32,058 INFO L226 Difference]: Without dead ends: 37 [2022-11-26 00:44:32,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:44:32,060 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 3 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:44:32,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 93 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:44:32,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-26 00:44:32,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-11-26 00:44:32,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 36 states have internal predecessors, (40), 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:44:32,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2022-11-26 00:44:32,071 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 5 [2022-11-26 00:44:32,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:44:32,072 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2022-11-26 00:44:32,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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:44:32,072 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2022-11-26 00:44:32,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-26 00:44:32,072 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:44:32,073 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2022-11-26 00:44:32,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-26 00:44:32,073 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-26 00:44:32,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:44:32,074 INFO L85 PathProgramCache]: Analyzing trace with hash -693508517, now seen corresponding path program 1 times [2022-11-26 00:44:32,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:44:32,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2242073] [2022-11-26 00:44:32,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:44:32,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:44:32,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:44:32,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:44:32,248 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:44:32,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2242073] [2022-11-26 00:44:32,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2242073] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:44:32,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458028979] [2022-11-26 00:44:32,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:44:32,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:44:32,250 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc3bf65-f0f4-454e-bd6f-f62f31849c73/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:44:32,254 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc3bf65-f0f4-454e-bd6f-f62f31849c73/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:44:32,271 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc3bf65-f0f4-454e-bd6f-f62f31849c73/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-26 00:44:32,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:44:32,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-26 00:44:32,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:44:32,426 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:44:32,426 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:44:32,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458028979] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:44:32,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-26 00:44:32,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-11-26 00:44:32,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043797941] [2022-11-26 00:44:32,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:44:32,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-26 00:44:32,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:44:32,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-26 00:44:32,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-26 00:44:32,437 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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:44:32,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:44:32,499 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2022-11-26 00:44:32,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-26 00:44:32,507 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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 6 [2022-11-26 00:44:32,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:44:32,508 INFO L225 Difference]: With dead ends: 37 [2022-11-26 00:44:32,509 INFO L226 Difference]: Without dead ends: 36 [2022-11-26 00:44:32,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-11-26 00:44:32,510 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 38 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:44:32,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 90 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:44:32,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-11-26 00:44:32,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-11-26 00:44:32,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.625) internal successors, (39), 35 states have internal predecessors, (39), 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:44:32,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2022-11-26 00:44:32,516 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 6 [2022-11-26 00:44:32,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:44:32,516 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2022-11-26 00:44:32,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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:44:32,517 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-11-26 00:44:32,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-26 00:44:32,517 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:44:32,518 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2022-11-26 00:44:32,531 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc3bf65-f0f4-454e-bd6f-f62f31849c73/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-26 00:44:32,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc3bf65-f0f4-454e-bd6f-f62f31849c73/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:44:32,724 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-26 00:44:32,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:44:32,725 INFO L85 PathProgramCache]: Analyzing trace with hash -23927494, now seen corresponding path program 1 times [2022-11-26 00:44:32,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:44:32,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830589270] [2022-11-26 00:44:32,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:44:32,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:44:32,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:44:32,832 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:44:32,833 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:44:32,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830589270] [2022-11-26 00:44:32,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830589270] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:44:32,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859373375] [2022-11-26 00:44:32,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:44:32,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:44:32,834 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc3bf65-f0f4-454e-bd6f-f62f31849c73/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:44:32,836 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc3bf65-f0f4-454e-bd6f-f62f31849c73/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:44:32,862 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc3bf65-f0f4-454e-bd6f-f62f31849c73/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-26 00:44:32,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:44:32,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-26 00:44:32,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:44:32,960 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:44:32,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:44:33,019 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:44:33,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [859373375] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:44:33,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [877628369] [2022-11-26 00:44:33,047 INFO L159 IcfgInterpreter]: Started Sifa with 5 locations of interest [2022-11-26 00:44:33,052 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:44:33,059 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:44:33,065 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:44:33,065 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:44:33,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-11-26 00:44:33,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-11-26 00:44:33,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 00:44:33,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 00:44:33,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 00:44:33,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 00:44:33,546 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:44:33,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [877628369] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:44:33,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:44:33,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4, 4, 4] total 12 [2022-11-26 00:44:33,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342911759] [2022-11-26 00:44:33,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:44:33,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:44:33,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:44:33,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:44:33,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2022-11-26 00:44:33,704 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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:44:33,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:44:33,737 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-11-26 00:44:33,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:44:33,738 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 7 [2022-11-26 00:44:33,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:44:33,738 INFO L225 Difference]: With dead ends: 36 [2022-11-26 00:44:33,738 INFO L226 Difference]: Without dead ends: 35 [2022-11-26 00:44:33,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2022-11-26 00:44:33,740 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 31 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:44:33,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 55 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:44:33,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-11-26 00:44:33,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2022-11-26 00:44:33,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 32 states have internal predecessors, (36), 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:44:33,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-11-26 00:44:33,745 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 7 [2022-11-26 00:44:33,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:44:33,745 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-11-26 00:44:33,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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:44:33,746 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-11-26 00:44:33,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-26 00:44:33,746 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:44:33,746 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:44:33,756 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc3bf65-f0f4-454e-bd6f-f62f31849c73/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-26 00:44:33,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc3bf65-f0f4-454e-bd6f-f62f31849c73/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:44:33,952 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-26 00:44:33,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:44:33,953 INFO L85 PathProgramCache]: Analyzing trace with hash -741499933, now seen corresponding path program 1 times [2022-11-26 00:44:33,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:44:33,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446402120] [2022-11-26 00:44:33,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:44:33,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:44:33,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:44:34,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:44:34,092 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:44:34,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446402120] [2022-11-26 00:44:34,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446402120] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:44:34,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986898165] [2022-11-26 00:44:34,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:44:34,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:44:34,093 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc3bf65-f0f4-454e-bd6f-f62f31849c73/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:44:34,096 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc3bf65-f0f4-454e-bd6f-f62f31849c73/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:44:34,104 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc3bf65-f0f4-454e-bd6f-f62f31849c73/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-26 00:44:34,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:44:34,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-26 00:44:34,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:44:34,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:44:34,214 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:44:34,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986898165] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:44:34,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-26 00:44:34,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 7 [2022-11-26 00:44:34,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015274974] [2022-11-26 00:44:34,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:44:34,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:44:34,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:44:34,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:44:34,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-26 00:44:34,217 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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:44:34,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:44:34,259 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2022-11-26 00:44:34,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:44:34,259 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2022-11-26 00:44:34,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:44:34,260 INFO L225 Difference]: With dead ends: 61 [2022-11-26 00:44:34,260 INFO L226 Difference]: Without dead ends: 60 [2022-11-26 00:44:34,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-26 00:44:34,262 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 88 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:44:34,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 50 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:44:34,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-11-26 00:44:34,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 47. [2022-11-26 00:44:34,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 46 states have internal predecessors, (60), 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:44:34,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 60 transitions. [2022-11-26 00:44:34,274 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 60 transitions. Word has length 8 [2022-11-26 00:44:34,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:44:34,274 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 60 transitions. [2022-11-26 00:44:34,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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:44:34,275 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 60 transitions. [2022-11-26 00:44:34,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-26 00:44:34,276 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:44:34,276 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:44:34,287 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc3bf65-f0f4-454e-bd6f-f62f31849c73/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-26 00:44:34,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc3bf65-f0f4-454e-bd6f-f62f31849c73/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:44:34,482 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-26 00:44:34,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:44:34,483 INFO L85 PathProgramCache]: Analyzing trace with hash 383137989, now seen corresponding path program 1 times [2022-11-26 00:44:34,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:44:34,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560219275] [2022-11-26 00:44:34,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:44:34,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:44:34,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:44:34,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-26 00:44:34,516 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:44:34,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560219275] [2022-11-26 00:44:34,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560219275] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:44:34,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:44:34,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:44:34,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412745722] [2022-11-26 00:44:34,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:44:34,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:44:34,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:44:34,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:44:34,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:44:34,519 INFO L87 Difference]: Start difference. First operand 47 states and 60 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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:44:34,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:44:34,589 INFO L93 Difference]: Finished difference Result 88 states and 113 transitions. [2022-11-26 00:44:34,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:44:34,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2022-11-26 00:44:34,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:44:34,592 INFO L225 Difference]: With dead ends: 88 [2022-11-26 00:44:34,594 INFO L226 Difference]: Without dead ends: 82 [2022-11-26 00:44:34,594 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:44:34,595 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 19 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:44:34,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 37 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:44:34,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-26 00:44:34,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 67. [2022-11-26 00:44:34,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 56 states have (on average 1.5178571428571428) internal successors, (85), 66 states have internal predecessors, (85), 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:44:34,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 85 transitions. [2022-11-26 00:44:34,614 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 85 transitions. Word has length 10 [2022-11-26 00:44:34,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:44:34,615 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 85 transitions. [2022-11-26 00:44:34,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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:44:34,615 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 85 transitions. [2022-11-26 00:44:34,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-26 00:44:34,616 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:44:34,616 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:44:34,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-26 00:44:34,616 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-26 00:44:34,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:44:34,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1007625270, now seen corresponding path program 1 times [2022-11-26 00:44:34,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:44:34,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16690496] [2022-11-26 00:44:34,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:44:34,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:44:34,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:44:34,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-26 00:44:34,685 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:44:34,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16690496] [2022-11-26 00:44:34,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16690496] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:44:34,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:44:34,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:44:34,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481328493] [2022-11-26 00:44:34,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:44:34,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:44:34,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:44:34,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:44:34,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:44:34,687 INFO L87 Difference]: Start difference. First operand 67 states and 85 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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:44:34,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:44:34,725 INFO L93 Difference]: Finished difference Result 67 states and 85 transitions. [2022-11-26 00:44:34,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:44:34,725 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2022-11-26 00:44:34,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:44:34,728 INFO L225 Difference]: With dead ends: 67 [2022-11-26 00:44:34,728 INFO L226 Difference]: Without dead ends: 66 [2022-11-26 00:44:34,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:44:34,730 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 26 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:44:34,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 44 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:44:34,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-26 00:44:34,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-11-26 00:44:34,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 56 states have (on average 1.5) internal successors, (84), 65 states have internal predecessors, (84), 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:44:34,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2022-11-26 00:44:34,754 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 11 [2022-11-26 00:44:34,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:44:34,755 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2022-11-26 00:44:34,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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:44:34,755 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2022-11-26 00:44:34,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-26 00:44:34,756 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:44:34,756 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:44:34,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-26 00:44:34,756 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-26 00:44:34,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:44:34,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1171612190, now seen corresponding path program 1 times [2022-11-26 00:44:34,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:44:34,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156389210] [2022-11-26 00:44:34,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:44:34,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:44:34,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:44:34,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-26 00:44:34,808 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:44:34,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156389210] [2022-11-26 00:44:34,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156389210] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:44:34,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:44:34,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:44:34,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652064168] [2022-11-26 00:44:34,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:44:34,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:44:34,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:44:34,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:44:34,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:44:34,811 INFO L87 Difference]: Start difference. First operand 66 states and 84 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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:44:34,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:44:34,857 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2022-11-26 00:44:34,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:44:34,859 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2022-11-26 00:44:34,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:44:34,860 INFO L225 Difference]: With dead ends: 78 [2022-11-26 00:44:34,860 INFO L226 Difference]: Without dead ends: 77 [2022-11-26 00:44:34,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:44:34,861 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 22 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:44:34,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 68 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:44:34,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-26 00:44:34,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 69. [2022-11-26 00:44:34,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 59 states have (on average 1.4745762711864407) internal successors, (87), 68 states have internal predecessors, (87), 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:44:34,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 87 transitions. [2022-11-26 00:44:34,870 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 87 transitions. Word has length 12 [2022-11-26 00:44:34,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:44:34,870 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 87 transitions. [2022-11-26 00:44:34,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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:44:34,870 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 87 transitions. [2022-11-26 00:44:34,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-26 00:44:34,871 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:44:34,871 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:44:34,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-26 00:44:34,872 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-26 00:44:34,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:44:34,872 INFO L85 PathProgramCache]: Analyzing trace with hash -604467916, now seen corresponding path program 1 times [2022-11-26 00:44:34,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:44:34,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334381053] [2022-11-26 00:44:34,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:44:34,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:44:34,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:44:34,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-26 00:44:34,914 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:44:34,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334381053] [2022-11-26 00:44:34,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334381053] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:44:34,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:44:34,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:44:34,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551149870] [2022-11-26 00:44:34,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:44:34,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:44:34,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:44:34,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:44:34,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:44:34,917 INFO L87 Difference]: Start difference. First operand 69 states and 87 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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:44:34,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:44:34,995 INFO L93 Difference]: Finished difference Result 86 states and 105 transitions. [2022-11-26 00:44:34,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:44:34,996 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2022-11-26 00:44:34,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:44:34,997 INFO L225 Difference]: With dead ends: 86 [2022-11-26 00:44:34,997 INFO L226 Difference]: Without dead ends: 84 [2022-11-26 00:44:34,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:44:34,998 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 14 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:44:34,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 51 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:44:34,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-11-26 00:44:35,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 75. [2022-11-26 00:44:35,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 65 states have (on average 1.4307692307692308) internal successors, (93), 74 states have internal predecessors, (93), 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:44:35,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 93 transitions. [2022-11-26 00:44:35,006 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 93 transitions. Word has length 14 [2022-11-26 00:44:35,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:44:35,006 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 93 transitions. [2022-11-26 00:44:35,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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:44:35,007 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 93 transitions. [2022-11-26 00:44:35,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-26 00:44:35,007 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:44:35,007 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:44:35,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-26 00:44:35,008 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-26 00:44:35,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:44:35,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1700527009, now seen corresponding path program 1 times [2022-11-26 00:44:35,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:44:35,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940789347] [2022-11-26 00:44:35,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:44:35,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:44:35,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:44:35,053 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-26 00:44:35,054 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:44:35,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940789347] [2022-11-26 00:44:35,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940789347] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:44:35,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:44:35,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:44:35,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318098804] [2022-11-26 00:44:35,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:44:35,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:44:35,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:44:35,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:44:35,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:44:35,056 INFO L87 Difference]: Start difference. First operand 75 states and 93 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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:44:35,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:44:35,116 INFO L93 Difference]: Finished difference Result 119 states and 141 transitions. [2022-11-26 00:44:35,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:44:35,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 15 [2022-11-26 00:44:35,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:44:35,117 INFO L225 Difference]: With dead ends: 119 [2022-11-26 00:44:35,117 INFO L226 Difference]: Without dead ends: 76 [2022-11-26 00:44:35,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:44:35,118 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 12 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:44:35,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 27 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:44:35,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-26 00:44:35,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2022-11-26 00:44:35,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 65 states have (on average 1.4) internal successors, (91), 74 states have internal predecessors, (91), 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:44:35,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 91 transitions. [2022-11-26 00:44:35,133 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 91 transitions. Word has length 15 [2022-11-26 00:44:35,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:44:35,134 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 91 transitions. [2022-11-26 00:44:35,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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:44:35,134 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 91 transitions. [2022-11-26 00:44:35,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-26 00:44:35,135 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:44:35,135 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:44:35,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-26 00:44:35,136 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-26 00:44:35,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:44:35,136 INFO L85 PathProgramCache]: Analyzing trace with hash -659182700, now seen corresponding path program 1 times [2022-11-26 00:44:35,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:44:35,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333823569] [2022-11-26 00:44:35,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:44:35,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:44:35,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:44:35,208 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-26 00:44:35,208 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:44:35,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333823569] [2022-11-26 00:44:35,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333823569] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:44:35,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755523365] [2022-11-26 00:44:35,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:44:35,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:44:35,209 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc3bf65-f0f4-454e-bd6f-f62f31849c73/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:44:35,212 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc3bf65-f0f4-454e-bd6f-f62f31849c73/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:44:35,235 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc3bf65-f0f4-454e-bd6f-f62f31849c73/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-26 00:44:35,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:44:35,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-26 00:44:35,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:44:35,330 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-26 00:44:35,330 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:44:35,370 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-26 00:44:35,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755523365] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:44:35,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1860441446] [2022-11-26 00:44:35,372 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-26 00:44:35,372 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:44:35,373 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:44:35,373 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:44:35,373 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:44:35,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-11-26 00:44:35,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-11-26 00:44:35,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 00:44:35,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 00:44:35,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 00:44:36,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 00:44:36,157 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:44:37,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1860441446] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:44:37,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:44:37,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [4, 5, 5] total 18 [2022-11-26 00:44:37,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978984698] [2022-11-26 00:44:37,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:44:37,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-26 00:44:37,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:44:37,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-26 00:44:37,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2022-11-26 00:44:37,387 INFO L87 Difference]: Start difference. First operand 75 states and 91 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 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:44:38,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:44:38,894 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2022-11-26 00:44:38,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-26 00:44:38,894 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 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 19 [2022-11-26 00:44:38,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:44:38,895 INFO L225 Difference]: With dead ends: 83 [2022-11-26 00:44:38,895 INFO L226 Difference]: Without dead ends: 75 [2022-11-26 00:44:38,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 35 SyntacticMatches, 8 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2022-11-26 00:44:38,896 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 75 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-26 00:44:38,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 59 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-26 00:44:38,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-11-26 00:44:38,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 65. [2022-11-26 00:44:38,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 55 states have (on average 1.309090909090909) internal successors, (72), 64 states have internal predecessors, (72), 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:44:38,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2022-11-26 00:44:38,902 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 19 [2022-11-26 00:44:38,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:44:38,902 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2022-11-26 00:44:38,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 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:44:38,902 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2022-11-26 00:44:38,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-26 00:44:38,903 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:44:38,903 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:44:38,909 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc3bf65-f0f4-454e-bd6f-f62f31849c73/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-26 00:44:39,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc3bf65-f0f4-454e-bd6f-f62f31849c73/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:44:39,104 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-26 00:44:39,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:44:39,104 INFO L85 PathProgramCache]: Analyzing trace with hash -527502798, now seen corresponding path program 1 times [2022-11-26 00:44:39,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:44:39,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055257652] [2022-11-26 00:44:39,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:44:39,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:44:39,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:44:39,203 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-26 00:44:39,203 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:44:39,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055257652] [2022-11-26 00:44:39,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055257652] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:44:39,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155374848] [2022-11-26 00:44:39,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:44:39,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:44:39,204 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc3bf65-f0f4-454e-bd6f-f62f31849c73/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:44:39,205 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc3bf65-f0f4-454e-bd6f-f62f31849c73/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:44:39,227 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc3bf65-f0f4-454e-bd6f-f62f31849c73/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-26 00:44:39,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:44:39,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-26 00:44:39,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:44:39,312 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-26 00:44:39,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:44:39,348 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-26 00:44:39,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155374848] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:44:39,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1337325484] [2022-11-26 00:44:39,351 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2022-11-26 00:44:39,351 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:44:39,352 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:44:39,352 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:44:39,352 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:44:39,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-11-26 00:44:39,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-11-26 00:44:39,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 00:44:39,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 00:44:40,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 00:44:40,421 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:44:42,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1337325484] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:44:42,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:44:42,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [5, 5, 5] total 21 [2022-11-26 00:44:42,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505573410] [2022-11-26 00:44:42,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:44:42,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-26 00:44:42,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:44:42,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-26 00:44:42,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2022-11-26 00:44:42,249 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 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:44:43,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:44:43,400 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2022-11-26 00:44:43,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-26 00:44:43,401 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 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 24 [2022-11-26 00:44:43,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:44:43,402 INFO L225 Difference]: With dead ends: 66 [2022-11-26 00:44:43,402 INFO L226 Difference]: Without dead ends: 58 [2022-11-26 00:44:43,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 48 SyntacticMatches, 8 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=156, Invalid=656, Unknown=0, NotChecked=0, Total=812 [2022-11-26 00:44:43,403 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 59 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:44:43,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 0 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 00:44:43,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-26 00:44:43,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 48. [2022-11-26 00:44:43,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 47 states have internal predecessors, (53), 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:44:43,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2022-11-26 00:44:43,410 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 24 [2022-11-26 00:44:43,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:44:43,412 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2022-11-26 00:44:43,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 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:44:43,413 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2022-11-26 00:44:43,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-26 00:44:43,415 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:44:43,415 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:44:43,427 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc3bf65-f0f4-454e-bd6f-f62f31849c73/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-26 00:44:43,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc3bf65-f0f4-454e-bd6f-f62f31849c73/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-26 00:44:43,616 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-26 00:44:43,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:44:43,617 INFO L85 PathProgramCache]: Analyzing trace with hash 112500197, now seen corresponding path program 1 times [2022-11-26 00:44:43,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:44:43,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106690712] [2022-11-26 00:44:43,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:44:43,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:44:43,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:44:43,726 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-26 00:44:43,726 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:44:43,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106690712] [2022-11-26 00:44:43,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106690712] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:44:43,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654129522] [2022-11-26 00:44:43,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:44:43,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:44:43,727 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc3bf65-f0f4-454e-bd6f-f62f31849c73/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:44:43,728 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc3bf65-f0f4-454e-bd6f-f62f31849c73/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:44:43,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc3bf65-f0f4-454e-bd6f-f62f31849c73/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-26 00:44:43,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:44:43,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-26 00:44:43,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:44:43,864 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-26 00:44:43,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:44:43,928 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-26 00:44:43,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654129522] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:44:43,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1633532835] [2022-11-26 00:44:43,932 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2022-11-26 00:44:43,932 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:44:43,932 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:44:43,933 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:44:43,933 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:44:43,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-11-26 00:44:43,982 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-11-26 00:44:44,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 00:44:44,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 00:44:44,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 00:44:44,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 00:44:44,907 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:44:46,984 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2503#(and (<= 1 |ULTIMATE.start_sort_~pass~0#1|) (<= |ULTIMATE.start_sort_#in~x#1.offset| 0) (<= 0 |ULTIMATE.start_sort_#in~x#1.offset|) (<= 0 |ULTIMATE.start_sort_~x#1.base|) (<= |ULTIMATE.start_sort_#in~n#1| 2147483647) (<= |ULTIMATE.start_main_~array_size~0#1| 2147483647) (<= 1 |ULTIMATE.start_sort_~n#1|) (<= 0 |ULTIMATE.start_sort_~x#1.offset|) (<= 0 |ULTIMATE.start_sort_#in~x#1.base|) (<= |ULTIMATE.start_sort_~x#1.offset| 0) (<= |ULTIMATE.start_main_~numbers~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~numbers~0#1.offset|) (<= |ULTIMATE.start_sort_~pass~0#1| 4294967295) (= |ULTIMATE.start_main_#t~malloc9#1.offset| 0) (<= 1 |ULTIMATE.start_sort_#in~n#1|) (<= 1 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~numbers~0#1.base|) (< (+ |ULTIMATE.start_sort_~i~0#1| 2147483649) 0) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_#t~malloc9#1.base|) (<= |ULTIMATE.start_sort_~n#1| 2147483647) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (<= 1 |ULTIMATE.start_main_~array_size~0#1|))' at error location [2022-11-26 00:44:46,984 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:44:46,984 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:44:46,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 10 [2022-11-26 00:44:46,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599361014] [2022-11-26 00:44:46,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:44:46,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-26 00:44:46,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:44:46,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-26 00:44:46,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2022-11-26 00:44:46,987 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 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:44:47,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:44:47,168 INFO L93 Difference]: Finished difference Result 149 states and 166 transitions. [2022-11-26 00:44:47,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-26 00:44:47,168 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 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 35 [2022-11-26 00:44:47,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:44:47,169 INFO L225 Difference]: With dead ends: 149 [2022-11-26 00:44:47,169 INFO L226 Difference]: Without dead ends: 106 [2022-11-26 00:44:47,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 77 SyntacticMatches, 9 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2022-11-26 00:44:47,170 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 27 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:44:47,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 104 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:44:47,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-11-26 00:44:47,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 64. [2022-11-26 00:44:47,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 63 states have internal predecessors, (71), 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:44:47,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2022-11-26 00:44:47,177 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 35 [2022-11-26 00:44:47,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:44:47,177 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2022-11-26 00:44:47,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 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:44:47,178 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2022-11-26 00:44:47,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-26 00:44:47,178 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:44:47,179 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2022-11-26 00:44:47,190 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc3bf65-f0f4-454e-bd6f-f62f31849c73/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-26 00:44:47,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc3bf65-f0f4-454e-bd6f-f62f31849c73/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:44:47,390 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-26 00:44:47,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:44:47,391 INFO L85 PathProgramCache]: Analyzing trace with hash -604880732, now seen corresponding path program 1 times [2022-11-26 00:44:47,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:44:47,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366881640] [2022-11-26 00:44:47,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:44:47,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:44:47,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:44:47,601 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-26 00:44:47,601 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:44:47,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366881640] [2022-11-26 00:44:47,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366881640] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:44:47,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803836280] [2022-11-26 00:44:47,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:44:47,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:44:47,602 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc3bf65-f0f4-454e-bd6f-f62f31849c73/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:44:47,604 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc3bf65-f0f4-454e-bd6f-f62f31849c73/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:44:47,613 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc3bf65-f0f4-454e-bd6f-f62f31849c73/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-26 00:44:47,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:44:47,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-26 00:44:47,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:44:47,821 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-26 00:44:47,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:44:47,943 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-26 00:44:47,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803836280] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:44:47,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1512978449] [2022-11-26 00:44:47,946 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2022-11-26 00:44:47,946 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:44:47,947 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:44:47,947 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:44:47,947 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:44:47,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-11-26 00:44:47,982 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-11-26 00:44:48,007 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 00:44:48,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 00:44:48,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 00:44:48,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 00:44:48,802 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:44:51,043 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3014#(and (<= |ULTIMATE.start_sort_~n#1| (+ |ULTIMATE.start_sort_~i~0#1| |ULTIMATE.start_sort_~pass~0#1|)) (<= |ULTIMATE.start_sort_#in~x#1.offset| 0) (<= 0 |ULTIMATE.start_sort_#in~x#1.offset|) (<= 0 |ULTIMATE.start_sort_~x#1.base|) (<= |ULTIMATE.start_sort_#in~n#1| 2147483647) (< 2147483646 |ULTIMATE.start_sort_#t~post2#1|) (<= |ULTIMATE.start_main_~array_size~0#1| 2147483647) (<= |ULTIMATE.start_sort_~i~0#1| 2147483647) (<= 1 |ULTIMATE.start_sort_~n#1|) (<= 0 |ULTIMATE.start_sort_~x#1.offset|) (<= 0 |ULTIMATE.start_sort_#in~x#1.base|) (<= |ULTIMATE.start_sort_~x#1.offset| 0) (<= |ULTIMATE.start_main_~numbers~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~numbers~0#1.offset|) (= |ULTIMATE.start_main_#t~malloc9#1.offset| 0) (= |ULTIMATE.start_sort_#t~post2#1| |ULTIMATE.start_sort_~pass~0#1|) (<= |ULTIMATE.start_sort_~pass~0#1| (+ |ULTIMATE.start_sort_~n#1| 2147483648)) (<= 1 |ULTIMATE.start_sort_#in~n#1|) (<= 1 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~numbers~0#1.base|) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_#t~malloc9#1.base|) (<= |ULTIMATE.start_sort_~n#1| 2147483647) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (<= 1 |ULTIMATE.start_main_~array_size~0#1|))' at error location [2022-11-26 00:44:51,043 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:44:51,043 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:44:51,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2022-11-26 00:44:51,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741704189] [2022-11-26 00:44:51,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:44:51,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-26 00:44:51,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:44:51,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-26 00:44:51,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=750, Unknown=0, NotChecked=0, Total=870 [2022-11-26 00:44:51,046 INFO L87 Difference]: Start difference. First operand 64 states and 71 transitions. Second operand has 17 states, 17 states have (on average 4.176470588235294) internal successors, (71), 16 states have internal predecessors, (71), 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:44:51,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:44:51,224 INFO L93 Difference]: Finished difference Result 126 states and 140 transitions. [2022-11-26 00:44:51,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-26 00:44:51,225 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.176470588235294) internal successors, (71), 16 states have internal predecessors, (71), 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 40 [2022-11-26 00:44:51,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:44:51,225 INFO L225 Difference]: With dead ends: 126 [2022-11-26 00:44:51,226 INFO L226 Difference]: Without dead ends: 69 [2022-11-26 00:44:51,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 85 SyntacticMatches, 14 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=158, Invalid=1032, Unknown=0, NotChecked=0, Total=1190 [2022-11-26 00:44:51,227 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 33 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:44:51,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 191 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:44:51,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-11-26 00:44:51,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2022-11-26 00:44:51,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 65 states have (on average 1.1384615384615384) internal successors, (74), 66 states have internal predecessors, (74), 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:44:51,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2022-11-26 00:44:51,235 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 40 [2022-11-26 00:44:51,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:44:51,235 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2022-11-26 00:44:51,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.176470588235294) internal successors, (71), 16 states have internal predecessors, (71), 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:44:51,236 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2022-11-26 00:44:51,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-26 00:44:51,237 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:44:51,237 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2022-11-26 00:44:51,247 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc3bf65-f0f4-454e-bd6f-f62f31849c73/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-26 00:44:51,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc3bf65-f0f4-454e-bd6f-f62f31849c73/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-26 00:44:51,442 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-26 00:44:51,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:44:51,443 INFO L85 PathProgramCache]: Analyzing trace with hash -2900030, now seen corresponding path program 2 times [2022-11-26 00:44:51,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:44:51,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119762996] [2022-11-26 00:44:51,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:44:51,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:44:51,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:44:51,700 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 20 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-26 00:44:51,700 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:44:51,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119762996] [2022-11-26 00:44:51,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119762996] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:44:51,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7561535] [2022-11-26 00:44:51,701 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 00:44:51,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:44:51,701 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc3bf65-f0f4-454e-bd6f-f62f31849c73/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:44:51,702 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc3bf65-f0f4-454e-bd6f-f62f31849c73/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:44:51,727 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc3bf65-f0f4-454e-bd6f-f62f31849c73/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-26 00:44:51,774 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-26 00:44:51,774 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:44:51,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-26 00:44:51,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:44:51,990 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-26 00:44:51,990 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:44:52,110 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-26 00:44:52,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [7561535] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:44:52,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2068870560] [2022-11-26 00:44:52,113 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2022-11-26 00:44:52,113 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:44:52,114 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:44:52,114 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:44:52,114 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:44:52,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-11-26 00:44:52,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-11-26 00:44:52,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 00:44:52,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 00:44:52,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 00:44:53,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 00:44:53,203 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:44:55,960 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3532#(and (<= |ULTIMATE.start_sort_~n#1| (+ |ULTIMATE.start_sort_~i~0#1| |ULTIMATE.start_sort_~pass~0#1|)) (<= |ULTIMATE.start_sort_#in~x#1.offset| 0) (<= 0 |ULTIMATE.start_sort_#in~x#1.offset|) (<= 0 |ULTIMATE.start_sort_~x#1.base|) (<= |ULTIMATE.start_sort_#in~n#1| 2147483647) (< 2147483646 |ULTIMATE.start_sort_#t~post2#1|) (<= |ULTIMATE.start_main_~array_size~0#1| 2147483647) (<= |ULTIMATE.start_sort_~i~0#1| 2147483647) (<= 1 |ULTIMATE.start_sort_~n#1|) (<= 0 |ULTIMATE.start_sort_~x#1.offset|) (<= 0 |ULTIMATE.start_sort_#in~x#1.base|) (<= |ULTIMATE.start_sort_~x#1.offset| 0) (<= |ULTIMATE.start_main_~numbers~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~numbers~0#1.offset|) (= |ULTIMATE.start_main_#t~malloc9#1.offset| 0) (= |ULTIMATE.start_sort_#t~post2#1| |ULTIMATE.start_sort_~pass~0#1|) (<= |ULTIMATE.start_sort_~pass~0#1| (+ |ULTIMATE.start_sort_~n#1| 2147483648)) (<= 1 |ULTIMATE.start_sort_#in~n#1|) (<= 1 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~numbers~0#1.base|) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_#t~malloc9#1.base|) (<= |ULTIMATE.start_sort_~n#1| 2147483647) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (<= 1 |ULTIMATE.start_main_~array_size~0#1|))' at error location [2022-11-26 00:44:55,960 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:44:55,960 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:44:55,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 19 [2022-11-26 00:44:55,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562185469] [2022-11-26 00:44:55,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:44:55,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-26 00:44:55,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:44:55,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-26 00:44:55,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=909, Unknown=0, NotChecked=0, Total=1056 [2022-11-26 00:44:55,962 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand has 20 states, 20 states have (on average 5.25) internal successors, (105), 19 states have internal predecessors, (105), 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:44:56,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:44:56,720 INFO L93 Difference]: Finished difference Result 118 states and 132 transitions. [2022-11-26 00:44:56,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-26 00:44:56,721 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.25) internal successors, (105), 19 states have internal predecessors, (105), 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 43 [2022-11-26 00:44:56,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:44:56,722 INFO L225 Difference]: With dead ends: 118 [2022-11-26 00:44:56,722 INFO L226 Difference]: Without dead ends: 79 [2022-11-26 00:44:56,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 98 SyntacticMatches, 9 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 559 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=366, Invalid=1986, Unknown=0, NotChecked=0, Total=2352 [2022-11-26 00:44:56,724 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 338 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:44:56,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 11 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 00:44:56,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-26 00:44:56,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2022-11-26 00:44:56,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.12) internal successors, (84), 75 states have internal predecessors, (84), 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:44:56,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2022-11-26 00:44:56,739 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 43 [2022-11-26 00:44:56,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:44:56,740 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2022-11-26 00:44:56,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.25) internal successors, (105), 19 states have internal predecessors, (105), 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:44:56,740 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2022-11-26 00:44:56,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-26 00:44:56,745 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:44:56,745 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:44:56,756 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc3bf65-f0f4-454e-bd6f-f62f31849c73/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-26 00:44:56,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc3bf65-f0f4-454e-bd6f-f62f31849c73/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-26 00:44:56,952 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-26 00:44:56,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:44:56,952 INFO L85 PathProgramCache]: Analyzing trace with hash 165350979, now seen corresponding path program 2 times [2022-11-26 00:44:56,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:44:56,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460633403] [2022-11-26 00:44:56,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:44:56,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:44:56,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:44:57,027 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-11-26 00:44:57,027 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:44:57,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460633403] [2022-11-26 00:44:57,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460633403] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:44:57,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:44:57,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:44:57,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926603722] [2022-11-26 00:44:57,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:44:57,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:44:57,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:44:57,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:44:57,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:44:57,030 INFO L87 Difference]: Start difference. First operand 76 states and 84 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 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:44:57,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:44:57,070 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2022-11-26 00:44:57,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:44:57,071 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 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 59 [2022-11-26 00:44:57,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:44:57,074 INFO L225 Difference]: With dead ends: 76 [2022-11-26 00:44:57,074 INFO L226 Difference]: Without dead ends: 0 [2022-11-26 00:44:57,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:44:57,075 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 14 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:44:57,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 22 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:44:57,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-26 00:44:57,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-26 00:44:57,076 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:44:57,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-26 00:44:57,077 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 59 [2022-11-26 00:44:57,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:44:57,077 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-26 00:44:57,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 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:44:57,077 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-26 00:44:57,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-26 00:44:57,082 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 14 remaining) [2022-11-26 00:44:57,083 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 14 remaining) [2022-11-26 00:44:57,083 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 14 remaining) [2022-11-26 00:44:57,083 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 14 remaining) [2022-11-26 00:44:57,083 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 14 remaining) [2022-11-26 00:44:57,083 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 14 remaining) [2022-11-26 00:44:57,085 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 14 remaining) [2022-11-26 00:44:57,085 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 14 remaining) [2022-11-26 00:44:57,086 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 14 remaining) [2022-11-26 00:44:57,086 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 14 remaining) [2022-11-26 00:44:57,086 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 14 remaining) [2022-11-26 00:44:57,087 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 14 remaining) [2022-11-26 00:44:57,087 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 14 remaining) [2022-11-26 00:44:57,087 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 14 remaining) [2022-11-26 00:44:57,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-26 00:44:57,090 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-26 00:44:58,525 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 516) no Hoare annotation was computed. [2022-11-26 00:44:58,525 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 516) no Hoare annotation was computed. [2022-11-26 00:44:58,525 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 518) no Hoare annotation was computed. [2022-11-26 00:44:58,525 INFO L899 garLoopResultBuilder]: For program point L515-2(lines 515 519) no Hoare annotation was computed. [2022-11-26 00:44:58,525 INFO L899 garLoopResultBuilder]: For program point L515-3(line 515) no Hoare annotation was computed. [2022-11-26 00:44:58,526 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 528) no Hoare annotation was computed. [2022-11-26 00:44:58,526 INFO L899 garLoopResultBuilder]: For program point L515-4(line 515) no Hoare annotation was computed. [2022-11-26 00:44:58,526 INFO L895 garLoopResultBuilder]: At program point L515-5(lines 515 519) the Hoare annotation is: (let ((.cse0 (<= 1 |ULTIMATE.start_sort_~pass~0#1|)) (.cse1 (<= |ULTIMATE.start_sort_~n#1| (+ |ULTIMATE.start_sort_~i~0#1| |ULTIMATE.start_sort_~pass~0#1|))) (.cse2 (<= |ULTIMATE.start_sort_#in~x#1.offset| 0)) (.cse3 (<= 0 |ULTIMATE.start_sort_#in~x#1.offset|)) (.cse28 (<= |ULTIMATE.start_main_~i~1#1| 2)) (.cse4 (<= 0 |ULTIMATE.start_sort_~x#1.base|)) (.cse5 (<= |ULTIMATE.start_sort_#in~n#1| 2147483647)) (.cse6 (<= |ULTIMATE.start_main_~array_size~0#1| 2147483647)) (.cse7 (<= |ULTIMATE.start_sort_~i~0#1| 2147483647)) (.cse8 (<= 1 |ULTIMATE.start_sort_~n#1|)) (.cse10 (<= 0 |ULTIMATE.start_sort_#in~x#1.base|)) (.cse17 (<= 1 |ULTIMATE.start_sort_#in~n#1|)) (.cse18 (<= 1 |ULTIMATE.start_main_~i~1#1|)) (.cse23 (<= |ULTIMATE.start_sort_~pass~0#1| 2147483647)) (.cse24 (<= |ULTIMATE.start_sort_~n#1| 2147483647)) (.cse27 (<= 1 |ULTIMATE.start_main_~array_size~0#1|)) (.cse9 (<= 0 |ULTIMATE.start_sort_~x#1.offset|)) (.cse11 (<= |ULTIMATE.start_sort_~x#1.offset| 0)) (.cse29 (= |ULTIMATE.start_main_~numbers~0#1.offset| |ULTIMATE.start_sort_#in~x#1.offset|)) (.cse30 (= |ULTIMATE.start_sort_~n#1| |ULTIMATE.start_sort_#in~n#1|)) (.cse12 (<= |ULTIMATE.start_main_~numbers~0#1.offset| 0)) (.cse13 (<= 3 |ULTIMATE.start_main_~array_size~0#1|)) (.cse14 (<= 0 |ULTIMATE.start_main_~numbers~0#1.offset|)) (.cse15 (= |ULTIMATE.start_main_#t~malloc9#1.offset| 0)) (.cse16 (<= |ULTIMATE.start_main_~i~1#1| 2147483647)) (.cse31 (= |ULTIMATE.start_main_~array_size~0#1| |ULTIMATE.start_sort_#in~n#1|)) (.cse32 (= |ULTIMATE.start_sort_#in~x#1.base| |ULTIMATE.start_main_~numbers~0#1.base|)) (.cse19 (<= 0 |ULTIMATE.start_main_~numbers~0#1.base|)) (.cse20 (= |#NULL.offset| 0)) (.cse21 (<= 0 |ULTIMATE.start_main_#t~malloc9#1.base|)) (.cse22 (mod |ULTIMATE.start_main_~array_size~0#1| 4294967296)) (.cse33 (<= |ULTIMATE.start_main_~array_size~0#1| |ULTIMATE.start_main_~i~1#1|)) (.cse34 (= |ULTIMATE.start_sort_#in~x#1.base| |ULTIMATE.start_sort_~x#1.base|)) (.cse25 (<= 0 |#StackHeapBarrier|)) (.cse26 (= |#NULL.base| 0)) (.cse35 (= |ULTIMATE.start_sort_~pass~0#1| 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 2 |ULTIMATE.start_main_~i~1#1|) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (< |ULTIMATE.start_sort_~pass~0#1| 2147483647) .cse17 .cse18 (<= |ULTIMATE.start_sort_~n#1| 536870910) .cse19 .cse20 .cse21 (not (<= 536870911 .cse22)) .cse23 .cse24 .cse25 .cse26 .cse27) (and .cse28 .cse9 .cse11 .cse29 .cse30 .cse12 .cse14 .cse15 .cse31 .cse32 .cse19 .cse20 .cse21 .cse33 .cse34 .cse25 .cse26 .cse35 .cse27) (and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_sort_~n#1| 0) .cse35) (and .cse0 .cse1 .cse2 .cse3 .cse28 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 (<= 2 |ULTIMATE.start_sort_~pass~0#1|) .cse15 .cse16 (<= |ULTIMATE.start_sort_~n#1| 2) .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse27) (and .cse9 .cse11 .cse29 .cse30 .cse12 .cse13 .cse14 .cse15 .cse16 .cse31 .cse32 .cse19 .cse20 .cse21 (< .cse22 536870911) .cse33 .cse34 .cse25 .cse26 .cse35))) [2022-11-26 00:44:58,527 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-26 00:44:58,527 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 517) no Hoare annotation was computed. [2022-11-26 00:44:58,527 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 515) no Hoare annotation was computed. [2022-11-26 00:44:58,527 INFO L899 garLoopResultBuilder]: For program point L528-3(line 528) no Hoare annotation was computed. [2022-11-26 00:44:58,527 INFO L899 garLoopResultBuilder]: For program point L528-4(line 528) no Hoare annotation was computed. [2022-11-26 00:44:58,528 INFO L895 garLoopResultBuilder]: At program point L528-5(lines 528 531) the Hoare annotation is: (let ((.cse1 (<= 2 |ULTIMATE.start_main_~i~1#1|)) (.cse0 (<= |ULTIMATE.start_main_~array_size~0#1| 2147483647)) (.cse2 (<= |ULTIMATE.start_main_~numbers~0#1.offset| 0)) (.cse3 (<= 0 |ULTIMATE.start_main_~numbers~0#1.offset|)) (.cse4 (= |ULTIMATE.start_main_#t~malloc9#1.offset| 0)) (.cse5 (<= 0 |ULTIMATE.start_main_~numbers~0#1.base|)) (.cse6 (= |#NULL.offset| 0)) (.cse7 (<= 0 |ULTIMATE.start_main_#t~malloc9#1.base|)) (.cse8 (< (mod |ULTIMATE.start_main_~array_size~0#1| 4294967296) 536870911)) (.cse9 (<= 0 |#StackHeapBarrier|)) (.cse10 (= |#NULL.base| 0)) (.cse11 (<= 1 |ULTIMATE.start_main_~array_size~0#1|))) (or (and (<= |ULTIMATE.start_main_~i~1#1| 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 (<= 3 |ULTIMATE.start_main_~array_size~0#1|) .cse3 .cse4 (<= |ULTIMATE.start_main_~i~1#1| 2147483647) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse2 .cse3 .cse4 (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 (= |ULTIMATE.start_main_~i~1#1| 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11))) [2022-11-26 00:44:58,528 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 518) no Hoare annotation was computed. [2022-11-26 00:44:58,528 INFO L899 garLoopResultBuilder]: For program point L516-1(line 516) no Hoare annotation was computed. [2022-11-26 00:44:58,528 INFO L899 garLoopResultBuilder]: For program point L516-2(lines 516 519) no Hoare annotation was computed. [2022-11-26 00:44:58,528 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 528) no Hoare annotation was computed. [2022-11-26 00:44:58,528 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-26 00:44:58,529 INFO L899 garLoopResultBuilder]: For program point L516-4(lines 516 519) no Hoare annotation was computed. [2022-11-26 00:44:58,529 INFO L899 garLoopResultBuilder]: For program point L516-5(line 516) no Hoare annotation was computed. [2022-11-26 00:44:58,529 INFO L899 garLoopResultBuilder]: For program point L516-6(line 516) no Hoare annotation was computed. [2022-11-26 00:44:58,529 INFO L895 garLoopResultBuilder]: At program point L516-7(lines 516 519) the Hoare annotation is: (let ((.cse3 (<= 0 |ULTIMATE.start_sort_~x#1.offset|)) (.cse4 (<= |ULTIMATE.start_sort_~x#1.offset| 0)) (.cse5 (<= |ULTIMATE.start_main_~numbers~0#1.offset| 0)) (.cse6 (<= 0 |ULTIMATE.start_main_~numbers~0#1.offset|)) (.cse7 (= |ULTIMATE.start_main_#t~malloc9#1.offset| 0)) (.cse8 (<= (+ |ULTIMATE.start_sort_~pass~0#1| 1) |ULTIMATE.start_sort_~n#1|)) (.cse0 (<= |ULTIMATE.start_sort_#in~x#1.offset| 0)) (.cse1 (<= 0 |ULTIMATE.start_sort_#in~x#1.offset|)) (.cse2 (<= |ULTIMATE.start_sort_~i~0#1| 2147483647)) (.cse9 (<= 0 |ULTIMATE.start_main_~numbers~0#1.base|)) (.cse10 (= |#NULL.offset| 0)) (.cse11 (<= 0 |ULTIMATE.start_main_#t~malloc9#1.base|)) (.cse12 (<= 0 |#StackHeapBarrier|)) (.cse13 (= |#NULL.base| 0))) (or (and (<= 1 |ULTIMATE.start_sort_~pass~0#1|) .cse0 (<= 0 (+ |ULTIMATE.start_sort_~i~0#1| 2147483648)) .cse1 (<= 0 |ULTIMATE.start_sort_~x#1.base|) (<= |ULTIMATE.start_sort_#in~n#1| 2147483647) (<= |ULTIMATE.start_main_~array_size~0#1| 2147483647) .cse2 (<= 2 |ULTIMATE.start_main_~i~1#1|) .cse3 (<= 0 |ULTIMATE.start_sort_#in~x#1.base|) .cse4 .cse5 (<= 3 |ULTIMATE.start_main_~array_size~0#1|) .cse6 .cse7 (<= |ULTIMATE.start_main_~i~1#1| 2147483647) (<= 1 |ULTIMATE.start_sort_#in~n#1|) .cse8 (<= |ULTIMATE.start_sort_~n#1| 536870910) .cse9 .cse10 .cse11 (< (mod |ULTIMATE.start_main_~array_size~0#1| 4294967296) 536870911) .cse12 .cse13) (and (<= |ULTIMATE.start_main_~i~1#1| 2) .cse3 .cse4 (= |ULTIMATE.start_sort_~n#1| |ULTIMATE.start_sort_#in~n#1|) .cse5 .cse6 .cse7 (= |ULTIMATE.start_main_~array_size~0#1| |ULTIMATE.start_sort_#in~n#1|) (= |ULTIMATE.start_sort_#in~x#1.base| |ULTIMATE.start_main_~numbers~0#1.base|) .cse8 (or (and (= |ULTIMATE.start_main_~numbers~0#1.offset| |ULTIMATE.start_sort_#in~x#1.offset|) (= |ULTIMATE.start_sort_~i~0#1| 0)) (and .cse0 (<= 1 |ULTIMATE.start_sort_~i~0#1|) .cse1 .cse2)) .cse9 .cse10 .cse11 (<= |ULTIMATE.start_main_~array_size~0#1| |ULTIMATE.start_main_~i~1#1|) (= |ULTIMATE.start_sort_#in~x#1.base| |ULTIMATE.start_sort_~x#1.base|) .cse12 .cse13 (= |ULTIMATE.start_sort_~pass~0#1| 1)))) [2022-11-26 00:44:58,529 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 517) no Hoare annotation was computed. [2022-11-26 00:44:58,530 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 515) no Hoare annotation was computed. [2022-11-26 00:44:58,530 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 518) no Hoare annotation was computed. [2022-11-26 00:44:58,530 INFO L899 garLoopResultBuilder]: For program point L517(line 517) no Hoare annotation was computed. [2022-11-26 00:44:58,530 INFO L899 garLoopResultBuilder]: For program point L517-1(line 517) no Hoare annotation was computed. [2022-11-26 00:44:58,530 INFO L899 garLoopResultBuilder]: For program point L517-2(lines 517 519) no Hoare annotation was computed. [2022-11-26 00:44:58,530 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 516) no Hoare annotation was computed. [2022-11-26 00:44:58,531 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 516) no Hoare annotation was computed. [2022-11-26 00:44:58,531 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 518) no Hoare annotation was computed. [2022-11-26 00:44:58,531 INFO L899 garLoopResultBuilder]: For program point L518(line 518) no Hoare annotation was computed. [2022-11-26 00:44:58,531 INFO L899 garLoopResultBuilder]: For program point L518-1(line 518) no Hoare annotation was computed. [2022-11-26 00:44:58,531 INFO L899 garLoopResultBuilder]: For program point L518-2(line 518) no Hoare annotation was computed. [2022-11-26 00:44:58,531 INFO L899 garLoopResultBuilder]: For program point L518-3(line 518) no Hoare annotation was computed. [2022-11-26 00:44:58,535 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:44:58,537 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-26 00:44:58,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 12:44:58 BoogieIcfgContainer [2022-11-26 00:44:58,565 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-26 00:44:58,566 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-26 00:44:58,566 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-26 00:44:58,566 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-26 00:44:58,567 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:44:31" (3/4) ... [2022-11-26 00:44:58,570 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-26 00:44:58,580 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2022-11-26 00:44:58,581 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-11-26 00:44:58,581 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-26 00:44:58,581 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-26 00:44:58,607 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((1 <= pass && n <= i + pass) && x <= 0) && 0 <= x) && 0 <= x) && \old(n) <= 2147483647) && array_size <= 2147483647) && i <= 2147483647) && 1 <= n) && 2 <= i) && 0 <= x) && 0 <= x) && x <= 0) && numbers <= 0) && 3 <= array_size) && 0 <= numbers) && __builtin_alloca (array_size * sizeof(int)) == 0) && i <= 2147483647) && pass < 2147483647) && 1 <= \old(n)) && 1 <= i) && n <= 536870910) && 0 <= numbers) && #NULL == 0) && 0 <= __builtin_alloca (array_size * sizeof(int))) && !(536870911 <= array_size % 4294967296)) && pass <= 2147483647) && n <= 2147483647) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) && 1 <= array_size) || ((((((((((((((((((i <= 2 && 0 <= x) && x <= 0) && numbers == x) && n == \old(n)) && numbers <= 0) && 0 <= numbers) && __builtin_alloca (array_size * sizeof(int)) == 0) && array_size == \old(n)) && x == numbers) && 0 <= numbers) && #NULL == 0) && 0 <= __builtin_alloca (array_size * sizeof(int))) && array_size <= i) && x == x) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) && pass == 1) && 1 <= array_size)) || ((i == 0 && n <= 0) && pass == 1)) || ((((((((((((((((((((((((((((1 <= pass && n <= i + pass) && x <= 0) && 0 <= x) && i <= 2) && 0 <= x) && \old(n) <= 2147483647) && array_size <= 2147483647) && i <= 2147483647) && 1 <= n) && 0 <= x) && 0 <= x) && x <= 0) && numbers <= 0) && 0 <= numbers) && 2 <= pass) && __builtin_alloca (array_size * sizeof(int)) == 0) && i <= 2147483647) && n <= 2) && 1 <= \old(n)) && 1 <= i) && 0 <= numbers) && #NULL == 0) && 0 <= __builtin_alloca (array_size * sizeof(int))) && pass <= 2147483647) && n <= 2147483647) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) && 1 <= array_size)) || (((((((((((((((((((0 <= x && x <= 0) && numbers == x) && n == \old(n)) && numbers <= 0) && 3 <= array_size) && 0 <= numbers) && __builtin_alloca (array_size * sizeof(int)) == 0) && i <= 2147483647) && array_size == \old(n)) && x == numbers) && 0 <= numbers) && #NULL == 0) && 0 <= __builtin_alloca (array_size * sizeof(int))) && array_size % 4294967296 < 536870911) && array_size <= i) && x == x) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) && pass == 1) [2022-11-26 00:44:58,607 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((1 <= pass && x <= 0) && 0 <= i + 2147483648) && 0 <= x) && 0 <= x) && \old(n) <= 2147483647) && array_size <= 2147483647) && i <= 2147483647) && 2 <= i) && 0 <= x) && 0 <= x) && x <= 0) && numbers <= 0) && 3 <= array_size) && 0 <= numbers) && __builtin_alloca (array_size * sizeof(int)) == 0) && i <= 2147483647) && 1 <= \old(n)) && pass + 1 <= n) && n <= 536870910) && 0 <= numbers) && #NULL == 0) && 0 <= __builtin_alloca (array_size * sizeof(int))) && array_size % 4294967296 < 536870911) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) || ((((((((((((((((((i <= 2 && 0 <= x) && x <= 0) && n == \old(n)) && numbers <= 0) && 0 <= numbers) && __builtin_alloca (array_size * sizeof(int)) == 0) && array_size == \old(n)) && x == numbers) && pass + 1 <= n) && ((numbers == x && i == 0) || (((x <= 0 && 1 <= i) && 0 <= x) && i <= 2147483647))) && 0 <= numbers) && #NULL == 0) && 0 <= __builtin_alloca (array_size * sizeof(int))) && array_size <= i) && x == x) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) && pass == 1) [2022-11-26 00:44:58,619 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc3bf65-f0f4-454e-bd6f-f62f31849c73/bin/utaipan-ByfvJB40ur/witness.graphml [2022-11-26 00:44:58,619 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-26 00:44:58,620 INFO L158 Benchmark]: Toolchain (without parser) took 28632.68ms. Allocated memory was 178.3MB in the beginning and 310.4MB in the end (delta: 132.1MB). Free memory was 137.1MB in the beginning and 210.1MB in the end (delta: -73.0MB). Peak memory consumption was 60.2MB. Max. memory is 16.1GB. [2022-11-26 00:44:58,620 INFO L158 Benchmark]: CDTParser took 0.97ms. Allocated memory is still 142.6MB. Free memory is still 83.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-26 00:44:58,621 INFO L158 Benchmark]: CACSL2BoogieTranslator took 441.80ms. Allocated memory is still 178.3MB. Free memory was 136.5MB in the beginning and 120.3MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-26 00:44:58,621 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.09ms. Allocated memory is still 178.3MB. Free memory was 120.3MB in the beginning and 118.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-26 00:44:58,621 INFO L158 Benchmark]: Boogie Preprocessor took 46.76ms. Allocated memory is still 178.3MB. Free memory was 118.7MB in the beginning and 117.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-26 00:44:58,621 INFO L158 Benchmark]: RCFGBuilder took 462.59ms. Allocated memory is still 178.3MB. Free memory was 117.2MB in the beginning and 102.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-26 00:44:58,622 INFO L158 Benchmark]: TraceAbstraction took 27547.50ms. Allocated memory was 178.3MB in the beginning and 310.4MB in the end (delta: 132.1MB). Free memory was 102.0MB in the beginning and 213.2MB in the end (delta: -111.2MB). Peak memory consumption was 141.1MB. Max. memory is 16.1GB. [2022-11-26 00:44:58,622 INFO L158 Benchmark]: Witness Printer took 53.31ms. Allocated memory is still 310.4MB. Free memory was 213.2MB in the beginning and 210.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-26 00:44:58,624 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.97ms. Allocated memory is still 142.6MB. Free memory is still 83.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 441.80ms. Allocated memory is still 178.3MB. Free memory was 136.5MB in the beginning and 120.3MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.09ms. Allocated memory is still 178.3MB. Free memory was 120.3MB in the beginning and 118.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.76ms. Allocated memory is still 178.3MB. Free memory was 118.7MB in the beginning and 117.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 462.59ms. Allocated memory is still 178.3MB. Free memory was 117.2MB in the beginning and 102.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 27547.50ms. Allocated memory was 178.3MB in the beginning and 310.4MB in the end (delta: 132.1MB). Free memory was 102.0MB in the beginning and 213.2MB in the end (delta: -111.2MB). Peak memory consumption was 141.1MB. Max. memory is 16.1GB. * Witness Printer took 53.31ms. Allocated memory is still 310.4MB. Free memory was 213.2MB in the beginning and 210.1MB 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: 528]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 528]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 516]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 516]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 517]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 517]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 518]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 518]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 518]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 518]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 516]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 516]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 515]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 515]: 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 1 procedures, 36 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 27.5s, OverallIterations: 17, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 863 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 863 mSDsluCounter, 1032 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 694 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1318 IncrementalHoareTripleChecker+Invalid, 1357 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 338 mSDtfsCounter, 1318 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 617 GetRequests, 367 SyntacticMatches, 51 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1522 ImplicationChecksByTransitivity, 13.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=16, InterpolantAutomatonStates: 105, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 144 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 20 NumberOfFragments, 651 HoareAnnotationTreeSize, 3 FomulaSimplifications, 407 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 2330 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 497 NumberOfCodeBlocks, 463 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 634 ConstructedInterpolants, 0 QuantifiedInterpolants, 1684 SizeOfPredicates, 42 NumberOfNonLiveVariables, 635 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 31 InterpolantComputations, 11 PerfectInterpolantSequences, 367/466 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: OVERALL_TIME: 2.4s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 3, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 35, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 195, TOOLS_POST_TIME: 1.9s, TOOLS_POST_CALL_APPLICATIONS: 0, TOOLS_POST_CALL_TIME: 0.0s, TOOLS_POST_RETURN_APPLICATIONS: 0, TOOLS_POST_RETURN_TIME: 0.0s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 195, TOOLS_QUANTIFIERELIM_TIME: 1.8s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.1s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 293, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 10, DOMAIN_JOIN_TIME: 0.1s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 12, DOMAIN_WIDEN_TIME: 0.2s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 23, DOMAIN_ISSUBSETEQ_TIME: 0.1s, DOMAIN_ISBOTTOM_APPLICATIONS: 35, DOMAIN_ISBOTTOM_TIME: 0.0s, LOOP_SUMMARIZER_APPLICATIONS: 11, LOOP_SUMMARIZER_CACHE_MISSES: 11, LOOP_SUMMARIZER_OVERALL_TIME: 1.5s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 1.5s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 23, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 739, DAG_COMPRESSION_RETAINED_NODES: 150, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: ((((((((((((((i <= 2 && array_size <= 2147483647) && 2 <= i) && numbers <= 0) && 0 <= numbers) && __builtin_alloca (array_size * sizeof(int)) == 0) && 0 <= numbers) && #NULL == 0) && 0 <= __builtin_alloca (array_size * sizeof(int))) && array_size % 4294967296 < 536870911) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) && 1 <= array_size) || ((((((((((((array_size <= 2147483647 && 2 <= i) && numbers <= 0) && 3 <= array_size) && 0 <= numbers) && __builtin_alloca (array_size * sizeof(int)) == 0) && i <= 2147483647) && 0 <= numbers) && #NULL == 0) && 0 <= __builtin_alloca (array_size * sizeof(int))) && array_size % 4294967296 < 536870911) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || ((((((((((((array_size <= 2147483647 && numbers <= 0) && 0 <= numbers) && __builtin_alloca (array_size * sizeof(int)) == 0) && i <= 1) && 1 <= i) && 0 <= numbers) && #NULL == 0) && 0 <= __builtin_alloca (array_size * sizeof(int))) && array_size % 4294967296 < 536870911) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) && 1 <= array_size)) || (((((((((((array_size <= 2147483647 && i == 0) && numbers <= 0) && 0 <= numbers) && __builtin_alloca (array_size * sizeof(int)) == 0) && 0 <= numbers) && #NULL == 0) && 0 <= __builtin_alloca (array_size * sizeof(int))) && array_size % 4294967296 < 536870911) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) && 1 <= array_size) - InvariantResult [Line: 515]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((1 <= pass && n <= i + pass) && x <= 0) && 0 <= x) && 0 <= x) && \old(n) <= 2147483647) && array_size <= 2147483647) && i <= 2147483647) && 1 <= n) && 2 <= i) && 0 <= x) && 0 <= x) && x <= 0) && numbers <= 0) && 3 <= array_size) && 0 <= numbers) && __builtin_alloca (array_size * sizeof(int)) == 0) && i <= 2147483647) && pass < 2147483647) && 1 <= \old(n)) && 1 <= i) && n <= 536870910) && 0 <= numbers) && #NULL == 0) && 0 <= __builtin_alloca (array_size * sizeof(int))) && !(536870911 <= array_size % 4294967296)) && pass <= 2147483647) && n <= 2147483647) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) && 1 <= array_size) || ((((((((((((((((((i <= 2 && 0 <= x) && x <= 0) && numbers == x) && n == \old(n)) && numbers <= 0) && 0 <= numbers) && __builtin_alloca (array_size * sizeof(int)) == 0) && array_size == \old(n)) && x == numbers) && 0 <= numbers) && #NULL == 0) && 0 <= __builtin_alloca (array_size * sizeof(int))) && array_size <= i) && x == x) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) && pass == 1) && 1 <= array_size)) || ((i == 0 && n <= 0) && pass == 1)) || ((((((((((((((((((((((((((((1 <= pass && n <= i + pass) && x <= 0) && 0 <= x) && i <= 2) && 0 <= x) && \old(n) <= 2147483647) && array_size <= 2147483647) && i <= 2147483647) && 1 <= n) && 0 <= x) && 0 <= x) && x <= 0) && numbers <= 0) && 0 <= numbers) && 2 <= pass) && __builtin_alloca (array_size * sizeof(int)) == 0) && i <= 2147483647) && n <= 2) && 1 <= \old(n)) && 1 <= i) && 0 <= numbers) && #NULL == 0) && 0 <= __builtin_alloca (array_size * sizeof(int))) && pass <= 2147483647) && n <= 2147483647) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) && 1 <= array_size)) || (((((((((((((((((((0 <= x && x <= 0) && numbers == x) && n == \old(n)) && numbers <= 0) && 3 <= array_size) && 0 <= numbers) && __builtin_alloca (array_size * sizeof(int)) == 0) && i <= 2147483647) && array_size == \old(n)) && x == numbers) && 0 <= numbers) && #NULL == 0) && 0 <= __builtin_alloca (array_size * sizeof(int))) && array_size % 4294967296 < 536870911) && array_size <= i) && x == x) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) && pass == 1) - InvariantResult [Line: 516]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((1 <= pass && x <= 0) && 0 <= i + 2147483648) && 0 <= x) && 0 <= x) && \old(n) <= 2147483647) && array_size <= 2147483647) && i <= 2147483647) && 2 <= i) && 0 <= x) && 0 <= x) && x <= 0) && numbers <= 0) && 3 <= array_size) && 0 <= numbers) && __builtin_alloca (array_size * sizeof(int)) == 0) && i <= 2147483647) && 1 <= \old(n)) && pass + 1 <= n) && n <= 536870910) && 0 <= numbers) && #NULL == 0) && 0 <= __builtin_alloca (array_size * sizeof(int))) && array_size % 4294967296 < 536870911) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) || ((((((((((((((((((i <= 2 && 0 <= x) && x <= 0) && n == \old(n)) && numbers <= 0) && 0 <= numbers) && __builtin_alloca (array_size * sizeof(int)) == 0) && array_size == \old(n)) && x == numbers) && pass + 1 <= n) && ((numbers == x && i == 0) || (((x <= 0 && 1 <= i) && 0 <= x) && i <= 2147483647))) && 0 <= numbers) && #NULL == 0) && 0 <= __builtin_alloca (array_size * sizeof(int))) && array_size <= i) && x == x) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) && pass == 1) RESULT: Ultimate proved your program to be correct! [2022-11-26 00:44:58,656 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc3bf65-f0f4-454e-bd6f-f62f31849c73/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE