./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5e95759-f673-4561-9ebd-1223b8f7a7dd/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5e95759-f673-4561-9ebd-1223b8f7a7dd/bin/utaipan-g80aRyZoba/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5e95759-f673-4561-9ebd-1223b8f7a7dd/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5e95759-f673-4561-9ebd-1223b8f7a7dd/bin/utaipan-g80aRyZoba/config/TaipanReach.xml -i ../../sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5e95759-f673-4561-9ebd-1223b8f7a7dd/bin/utaipan-g80aRyZoba/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5e95759-f673-4561-9ebd-1223b8f7a7dd/bin/utaipan-g80aRyZoba --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 0286582125bb2879636b8cf3b934bed172850a3a3b0d880c07306d10439134a7 --- 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-b5237d8 [2022-11-22 01:58:54,435 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 01:58:54,439 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 01:58:54,473 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 01:58:54,474 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 01:58:54,475 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 01:58:54,477 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 01:58:54,483 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 01:58:54,485 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 01:58:54,487 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 01:58:54,488 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 01:58:54,489 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 01:58:54,490 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 01:58:54,491 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 01:58:54,493 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 01:58:54,494 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 01:58:54,495 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 01:58:54,496 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 01:58:54,498 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 01:58:54,501 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 01:58:54,502 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 01:58:54,504 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 01:58:54,506 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 01:58:54,507 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 01:58:54,511 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 01:58:54,512 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 01:58:54,512 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 01:58:54,514 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 01:58:54,514 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 01:58:54,516 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 01:58:54,516 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 01:58:54,518 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 01:58:54,519 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 01:58:54,520 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 01:58:54,521 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 01:58:54,522 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 01:58:54,523 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 01:58:54,523 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 01:58:54,524 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 01:58:54,525 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 01:58:54,526 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 01:58:54,527 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5e95759-f673-4561-9ebd-1223b8f7a7dd/bin/utaipan-g80aRyZoba/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-22 01:58:54,557 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 01:58:54,558 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 01:58:54,558 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 01:58:54,559 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 01:58:54,560 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 01:58:54,560 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 01:58:54,560 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 01:58:54,561 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 01:58:54,561 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 01:58:54,561 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-22 01:58:54,562 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 01:58:54,562 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 01:58:54,562 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-22 01:58:54,562 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-22 01:58:54,563 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 01:58:54,563 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-22 01:58:54,563 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-22 01:58:54,564 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-22 01:58:54,565 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 01:58:54,565 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-22 01:58:54,565 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-22 01:58:54,565 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 01:58:54,566 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-22 01:58:54,566 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 01:58:54,566 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-22 01:58:54,567 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 01:58:54,567 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-22 01:58:54,567 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-22 01:58:54,568 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-22 01:58:54,568 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-22 01:58:54,568 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 01:58:54,569 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-22 01:58:54,569 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 01:58:54,569 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 01:58:54,570 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 01:58:54,570 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 01:58:54,570 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-22 01:58:54,570 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 01:58:54,571 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-22 01:58:54,571 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-22 01:58:54,571 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-22 01:58:54,572 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-22 01:58:54,572 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 01:58:54,572 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_d5e95759-f673-4561-9ebd-1223b8f7a7dd/bin/utaipan-g80aRyZoba/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_d5e95759-f673-4561-9ebd-1223b8f7a7dd/bin/utaipan-g80aRyZoba 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 -> 0286582125bb2879636b8cf3b934bed172850a3a3b0d880c07306d10439134a7 [2022-11-22 01:58:54,909 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 01:58:54,931 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 01:58:54,934 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 01:58:54,935 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 01:58:54,936 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 01:58:54,937 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5e95759-f673-4561-9ebd-1223b8f7a7dd/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i [2022-11-22 01:58:58,625 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 01:58:58,913 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 01:58:58,914 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5e95759-f673-4561-9ebd-1223b8f7a7dd/sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i [2022-11-22 01:58:58,927 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5e95759-f673-4561-9ebd-1223b8f7a7dd/bin/utaipan-g80aRyZoba/data/95b7de3fc/5f4a228a5ef9471c91c06fb8c2d29855/FLAGa119c01eb [2022-11-22 01:58:58,950 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5e95759-f673-4561-9ebd-1223b8f7a7dd/bin/utaipan-g80aRyZoba/data/95b7de3fc/5f4a228a5ef9471c91c06fb8c2d29855 [2022-11-22 01:58:58,957 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 01:58:58,960 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 01:58:58,966 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 01:58:58,967 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 01:58:58,972 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 01:58:58,973 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:58:58" (1/1) ... [2022-11-22 01:58:58,974 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18f03b96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:58:58, skipping insertion in model container [2022-11-22 01:58:58,975 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:58:58" (1/1) ... [2022-11-22 01:58:58,985 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 01:58:59,005 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 01:58:59,184 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5e95759-f673-4561-9ebd-1223b8f7a7dd/sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i[838,851] [2022-11-22 01:58:59,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 01:58:59,227 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 01:58:59,243 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5e95759-f673-4561-9ebd-1223b8f7a7dd/sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i[838,851] [2022-11-22 01:58:59,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 01:58:59,280 INFO L208 MainTranslator]: Completed translation [2022-11-22 01:58:59,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:58:59 WrapperNode [2022-11-22 01:58:59,281 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 01:58:59,282 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 01:58:59,283 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 01:58:59,283 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 01:58:59,293 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:58:59" (1/1) ... [2022-11-22 01:58:59,303 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:58:59" (1/1) ... [2022-11-22 01:58:59,355 INFO L138 Inliner]: procedures = 18, calls = 29, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 186 [2022-11-22 01:58:59,355 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 01:58:59,356 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 01:58:59,357 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 01:58:59,357 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 01:58:59,372 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:58:59" (1/1) ... [2022-11-22 01:58:59,373 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:58:59" (1/1) ... [2022-11-22 01:58:59,395 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:58:59" (1/1) ... [2022-11-22 01:58:59,396 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:58:59" (1/1) ... [2022-11-22 01:58:59,404 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:58:59" (1/1) ... [2022-11-22 01:58:59,427 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:58:59" (1/1) ... [2022-11-22 01:58:59,429 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:58:59" (1/1) ... [2022-11-22 01:58:59,430 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:58:59" (1/1) ... [2022-11-22 01:58:59,433 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 01:58:59,434 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 01:58:59,435 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 01:58:59,435 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 01:58:59,436 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:58:59" (1/1) ... [2022-11-22 01:58:59,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 01:58:59,469 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5e95759-f673-4561-9ebd-1223b8f7a7dd/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:58:59,488 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5e95759-f673-4561-9ebd-1223b8f7a7dd/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 01:58:59,497 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5e95759-f673-4561-9ebd-1223b8f7a7dd/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 01:58:59,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 01:58:59,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-22 01:58:59,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-22 01:58:59,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-22 01:58:59,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 01:58:59,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 01:58:59,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-22 01:58:59,537 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-22 01:58:59,537 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-22 01:58:59,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-22 01:58:59,632 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 01:58:59,634 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 01:59:00,274 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 01:59:00,428 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 01:59:00,428 INFO L300 CfgBuilder]: Removed 10 assume(true) statements. [2022-11-22 01:59:00,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:59:00 BoogieIcfgContainer [2022-11-22 01:59:00,432 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 01:59:00,435 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 01:59:00,436 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 01:59:00,440 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 01:59:00,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:58:58" (1/3) ... [2022-11-22 01:59:00,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ffcea53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:59:00, skipping insertion in model container [2022-11-22 01:59:00,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:58:59" (2/3) ... [2022-11-22 01:59:00,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ffcea53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:59:00, skipping insertion in model container [2022-11-22 01:59:00,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:59:00" (3/3) ... [2022-11-22 01:59:00,451 INFO L112 eAbstractionObserver]: Analyzing ICFG data_structures_set_multi_proc_trivial_ground.i [2022-11-22 01:59:00,478 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 01:59:00,478 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2022-11-22 01:59:00,575 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 01:59:00,586 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;@3a978c68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 01:59:00,587 INFO L358 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2022-11-22 01:59:00,594 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 47 states have (on average 1.851063829787234) internal successors, (87), 75 states have internal predecessors, (87), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-22 01:59:00,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-22 01:59:00,608 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:59:00,609 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-22 01:59:00,609 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-11-22 01:59:00,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:59:00,621 INFO L85 PathProgramCache]: Analyzing trace with hash 268783, now seen corresponding path program 1 times [2022-11-22 01:59:00,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:59:00,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497229154] [2022-11-22 01:59:00,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:59:00,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:59:00,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:59:01,013 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-22 01:59:01,014 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:59:01,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497229154] [2022-11-22 01:59:01,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497229154] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:59:01,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:59:01,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 01:59:01,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162273571] [2022-11-22 01:59:01,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:59:01,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:59:01,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:59:01,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:59:01,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:59:01,143 INFO L87 Difference]: Start difference. First operand has 80 states, 47 states have (on average 1.851063829787234) internal successors, (87), 75 states have internal predecessors, (87), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 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-22 01:59:01,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:59:01,528 INFO L93 Difference]: Finished difference Result 225 states and 270 transitions. [2022-11-22 01:59:01,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 01:59:01,532 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-22 01:59:01,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:59:01,545 INFO L225 Difference]: With dead ends: 225 [2022-11-22 01:59:01,546 INFO L226 Difference]: Without dead ends: 148 [2022-11-22 01:59:01,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:59:01,555 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 76 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 01:59:01,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 168 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 01:59:01,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-11-22 01:59:01,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 87. [2022-11-22 01:59:01,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 55 states have (on average 1.7454545454545454) internal successors, (96), 82 states have internal predecessors, (96), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-22 01:59:01,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 102 transitions. [2022-11-22 01:59:01,617 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 102 transitions. Word has length 3 [2022-11-22 01:59:01,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:59:01,618 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 102 transitions. [2022-11-22 01:59:01,618 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-22 01:59:01,619 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 102 transitions. [2022-11-22 01:59:01,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-22 01:59:01,620 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:59:01,620 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-22 01:59:01,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-22 01:59:01,621 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-11-22 01:59:01,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:59:01,622 INFO L85 PathProgramCache]: Analyzing trace with hash 8332319, now seen corresponding path program 1 times [2022-11-22 01:59:01,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:59:01,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171527146] [2022-11-22 01:59:01,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:59:01,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:59:01,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:59:01,754 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-22 01:59:01,754 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:59:01,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171527146] [2022-11-22 01:59:01,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171527146] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:59:01,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:59:01,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 01:59:01,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700088462] [2022-11-22 01:59:01,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:59:01,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:59:01,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:59:01,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:59:01,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:59:01,760 INFO L87 Difference]: Start difference. First operand 87 states and 102 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) 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-22 01:59:01,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:59:01,959 INFO L93 Difference]: Finished difference Result 149 states and 175 transitions. [2022-11-22 01:59:01,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:59:01,960 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) 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-22 01:59:01,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:59:01,962 INFO L225 Difference]: With dead ends: 149 [2022-11-22 01:59:01,962 INFO L226 Difference]: Without dead ends: 145 [2022-11-22 01:59:01,963 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-22 01:59:01,964 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 71 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:59:01,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 178 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:59:01,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-11-22 01:59:01,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 89. [2022-11-22 01:59:01,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 58 states have (on average 1.6896551724137931) internal successors, (98), 84 states have internal predecessors, (98), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-22 01:59:01,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 104 transitions. [2022-11-22 01:59:01,979 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 104 transitions. Word has length 4 [2022-11-22 01:59:01,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:59:01,980 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 104 transitions. [2022-11-22 01:59:01,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) 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-22 01:59:01,980 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 104 transitions. [2022-11-22 01:59:01,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-22 01:59:01,981 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:59:01,981 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2022-11-22 01:59:01,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-22 01:59:01,982 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-11-22 01:59:01,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:59:01,983 INFO L85 PathProgramCache]: Analyzing trace with hash -582567681, now seen corresponding path program 1 times [2022-11-22 01:59:01,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:59:01,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393314678] [2022-11-22 01:59:01,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:59:01,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:59:02,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:59:02,044 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:59:02,045 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:59:02,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393314678] [2022-11-22 01:59:02,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393314678] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:59:02,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:59:02,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 01:59:02,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127874294] [2022-11-22 01:59:02,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:59:02,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:59:02,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:59:02,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:59:02,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:59:02,049 INFO L87 Difference]: Start difference. First operand 89 states and 104 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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-22 01:59:02,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:59:02,123 INFO L93 Difference]: Finished difference Result 89 states and 104 transitions. [2022-11-22 01:59:02,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:59:02,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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-22 01:59:02,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:59:02,125 INFO L225 Difference]: With dead ends: 89 [2022-11-22 01:59:02,126 INFO L226 Difference]: Without dead ends: 88 [2022-11-22 01:59:02,126 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-22 01:59:02,128 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 1 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:59:02,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 140 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:59:02,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-11-22 01:59:02,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2022-11-22 01:59:02,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 57 states have (on average 1.6842105263157894) internal successors, (96), 82 states have internal predecessors, (96), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-22 01:59:02,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 102 transitions. [2022-11-22 01:59:02,144 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 102 transitions. Word has length 6 [2022-11-22 01:59:02,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:59:02,146 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 102 transitions. [2022-11-22 01:59:02,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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-22 01:59:02,146 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 102 transitions. [2022-11-22 01:59:02,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-22 01:59:02,147 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:59:02,147 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:59:02,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-22 01:59:02,149 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-11-22 01:59:02,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:59:02,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1501017704, now seen corresponding path program 1 times [2022-11-22 01:59:02,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:59:02,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382653244] [2022-11-22 01:59:02,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:59:02,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:59:02,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:59:02,320 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-22 01:59:02,320 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:59:02,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382653244] [2022-11-22 01:59:02,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382653244] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:59:02,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:59:02,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:59:02,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893254170] [2022-11-22 01:59:02,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:59:02,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:59:02,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:59:02,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:59:02,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:59:02,325 INFO L87 Difference]: Start difference. First operand 87 states and 102 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-22 01:59:02,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:59:02,455 INFO L93 Difference]: Finished difference Result 187 states and 220 transitions. [2022-11-22 01:59:02,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:59:02,457 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-22 01:59:02,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:59:02,458 INFO L225 Difference]: With dead ends: 187 [2022-11-22 01:59:02,458 INFO L226 Difference]: Without dead ends: 127 [2022-11-22 01:59:02,464 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-22 01:59:02,476 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 40 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:59:02,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 212 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:59:02,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-11-22 01:59:02,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 91. [2022-11-22 01:59:02,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 61 states have (on average 1.639344262295082) internal successors, (100), 86 states have internal predecessors, (100), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-22 01:59:02,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 106 transitions. [2022-11-22 01:59:02,505 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 106 transitions. Word has length 8 [2022-11-22 01:59:02,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:59:02,506 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 106 transitions. [2022-11-22 01:59:02,506 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-22 01:59:02,506 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 106 transitions. [2022-11-22 01:59:02,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-22 01:59:02,507 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:59:02,508 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:59:02,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-22 01:59:02,508 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-11-22 01:59:02,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:59:02,509 INFO L85 PathProgramCache]: Analyzing trace with hash 416085629, now seen corresponding path program 1 times [2022-11-22 01:59:02,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:59:02,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871860468] [2022-11-22 01:59:02,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:59:02,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:59:02,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:59:02,647 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-22 01:59:02,648 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:59:02,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871860468] [2022-11-22 01:59:02,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871860468] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:59:02,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:59:02,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:59:02,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479372170] [2022-11-22 01:59:02,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:59:02,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:59:02,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:59:02,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:59:02,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:59:02,652 INFO L87 Difference]: Start difference. First operand 91 states and 106 transitions. Second operand has 4 states, 4 states have (on average 2.5) 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-22 01:59:02,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:59:02,774 INFO L93 Difference]: Finished difference Result 180 states and 210 transitions. [2022-11-22 01:59:02,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:59:02,779 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) 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-22 01:59:02,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:59:02,780 INFO L225 Difference]: With dead ends: 180 [2022-11-22 01:59:02,780 INFO L226 Difference]: Without dead ends: 94 [2022-11-22 01:59:02,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:59:02,785 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 30 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:59:02,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 132 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:59:02,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-11-22 01:59:02,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 83. [2022-11-22 01:59:02,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 60 states have (on average 1.6166666666666667) internal successors, (97), 79 states have internal predecessors, (97), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 01:59:02,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 101 transitions. [2022-11-22 01:59:02,808 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 101 transitions. Word has length 10 [2022-11-22 01:59:02,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:59:02,809 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 101 transitions. [2022-11-22 01:59:02,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) 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-22 01:59:02,812 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2022-11-22 01:59:02,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-22 01:59:02,813 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:59:02,813 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:59:02,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-22 01:59:02,814 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-11-22 01:59:02,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:59:02,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1913792885, now seen corresponding path program 1 times [2022-11-22 01:59:02,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:59:02,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006264326] [2022-11-22 01:59:02,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:59:02,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:59:02,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:59:02,922 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-22 01:59:02,923 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:59:02,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006264326] [2022-11-22 01:59:02,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006264326] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:59:02,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:59:02,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 01:59:02,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702806915] [2022-11-22 01:59:02,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:59:02,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:59:02,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:59:02,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:59:02,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:59:02,926 INFO L87 Difference]: Start difference. First operand 83 states and 101 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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-22 01:59:02,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:59:02,969 INFO L93 Difference]: Finished difference Result 83 states and 101 transitions. [2022-11-22 01:59:02,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:59:02,969 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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-22 01:59:02,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:59:02,970 INFO L225 Difference]: With dead ends: 83 [2022-11-22 01:59:02,971 INFO L226 Difference]: Without dead ends: 82 [2022-11-22 01:59:02,971 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-22 01:59:02,972 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 2 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 01:59:02,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 104 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 01:59:02,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-22 01:59:02,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-11-22 01:59:02,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 60 states have (on average 1.6) internal successors, (96), 78 states have internal predecessors, (96), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 01:59:02,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 100 transitions. [2022-11-22 01:59:02,983 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 100 transitions. Word has length 11 [2022-11-22 01:59:02,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:59:02,983 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 100 transitions. [2022-11-22 01:59:02,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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-22 01:59:02,984 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 100 transitions. [2022-11-22 01:59:02,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-22 01:59:02,984 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:59:02,985 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:59:02,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-22 01:59:02,985 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-11-22 01:59:02,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:59:02,986 INFO L85 PathProgramCache]: Analyzing trace with hash 801962813, now seen corresponding path program 1 times [2022-11-22 01:59:02,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:59:02,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157442491] [2022-11-22 01:59:02,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:59:02,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:59:03,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:59:03,050 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 01:59:03,050 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:59:03,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157442491] [2022-11-22 01:59:03,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157442491] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:59:03,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442906848] [2022-11-22 01:59:03,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:59:03,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:59:03,052 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5e95759-f673-4561-9ebd-1223b8f7a7dd/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:59:03,056 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5e95759-f673-4561-9ebd-1223b8f7a7dd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:59:03,075 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5e95759-f673-4561-9ebd-1223b8f7a7dd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-22 01:59:03,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:59:03,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-22 01:59:03,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:59:03,207 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 01:59:03,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:59:03,246 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 01:59:03,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1442906848] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:59:03,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2140739295] [2022-11-22 01:59:03,274 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2022-11-22 01:59:03,275 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 01:59:03,283 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 01:59:03,291 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 01:59:03,291 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 01:59:03,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:03,424 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-22 01:59:03,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-11-22 01:59:03,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:03,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-22 01:59:03,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:03,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-22 01:59:03,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:03,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:03,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2022-11-22 01:59:03,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:03,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:03,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:03,923 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:59:03,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:03,945 INFO L321 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2022-11-22 01:59:03,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 227 treesize of output 215 [2022-11-22 01:59:04,128 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-22 01:59:04,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-22 01:59:04,216 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 6 treesize of output 5 [2022-11-22 01:59:04,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 11 [2022-11-22 01:59:04,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:04,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2022-11-22 01:59:04,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:04,531 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-22 01:59:04,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 153 treesize of output 143 [2022-11-22 01:59:04,717 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-22 01:59:04,761 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-22 01:59:04,780 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 01:59:05,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [2140739295] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:59:05,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:59:05,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4, 4, 4] total 14 [2022-11-22 01:59:05,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032864717] [2022-11-22 01:59:05,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:59:05,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-22 01:59:05,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:59:05,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-22 01:59:05,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2022-11-22 01:59:05,784 INFO L87 Difference]: Start difference. First operand 82 states and 100 transitions. Second operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 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-22 01:59:06,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:59:06,546 INFO L93 Difference]: Finished difference Result 92 states and 106 transitions. [2022-11-22 01:59:06,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-22 01:59:06,546 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 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 12 [2022-11-22 01:59:06,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:59:06,547 INFO L225 Difference]: With dead ends: 92 [2022-11-22 01:59:06,547 INFO L226 Difference]: Without dead ends: 91 [2022-11-22 01:59:06,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2022-11-22 01:59:06,549 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 31 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 01:59:06,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 243 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 01:59:06,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-22 01:59:06,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 79. [2022-11-22 01:59:06,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 58 states have (on average 1.603448275862069) internal successors, (93), 75 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 01:59:06,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 97 transitions. [2022-11-22 01:59:06,560 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 97 transitions. Word has length 12 [2022-11-22 01:59:06,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:59:06,561 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 97 transitions. [2022-11-22 01:59:06,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 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-22 01:59:06,561 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions. [2022-11-22 01:59:06,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-22 01:59:06,562 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:59:06,562 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:59:06,570 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5e95759-f673-4561-9ebd-1223b8f7a7dd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-22 01:59:06,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5e95759-f673-4561-9ebd-1223b8f7a7dd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:59:06,768 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-11-22 01:59:06,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:59:06,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1897720837, now seen corresponding path program 1 times [2022-11-22 01:59:06,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:59:06,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307353396] [2022-11-22 01:59:06,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:59:06,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:59:06,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:59:06,869 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:59:06,869 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:59:06,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307353396] [2022-11-22 01:59:06,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307353396] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:59:06,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172464573] [2022-11-22 01:59:06,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:59:06,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:59:06,870 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5e95759-f673-4561-9ebd-1223b8f7a7dd/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:59:06,873 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5e95759-f673-4561-9ebd-1223b8f7a7dd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:59:06,878 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5e95759-f673-4561-9ebd-1223b8f7a7dd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-22 01:59:06,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:59:06,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-22 01:59:06,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:59:06,998 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:59:06,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:59:07,047 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:59:07,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172464573] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:59:07,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [805456769] [2022-11-22 01:59:07,056 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-11-22 01:59:07,056 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 01:59:07,057 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 01:59:07,057 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 01:59:07,057 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 01:59:07,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:07,118 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-22 01:59:07,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-11-22 01:59:07,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:07,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-22 01:59:07,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:07,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-22 01:59:07,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:07,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:07,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2022-11-22 01:59:07,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:07,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:07,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:07,385 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:59:07,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:07,394 INFO L321 Elim1Store]: treesize reduction 34, result has 2.9 percent of original size [2022-11-22 01:59:07,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 243 treesize of output 212 [2022-11-22 01:59:07,462 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-22 01:59:07,511 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 6 treesize of output 5 [2022-11-22 01:59:07,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-22 01:59:07,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 11 [2022-11-22 01:59:07,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:07,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2022-11-22 01:59:07,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:07,725 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-22 01:59:07,726 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 153 treesize of output 143 [2022-11-22 01:59:07,823 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-22 01:59:07,878 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 01:59:08,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [805456769] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:59:08,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:59:08,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [5, 4, 4] total 20 [2022-11-22 01:59:08,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025749698] [2022-11-22 01:59:08,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:59:08,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-22 01:59:08,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:59:08,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-22 01:59:08,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2022-11-22 01:59:08,613 INFO L87 Difference]: Start difference. First operand 79 states and 97 transitions. Second operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 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-22 01:59:09,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:59:09,756 INFO L93 Difference]: Finished difference Result 174 states and 206 transitions. [2022-11-22 01:59:09,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-22 01:59:09,757 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 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-22 01:59:09,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:59:09,759 INFO L225 Difference]: With dead ends: 174 [2022-11-22 01:59:09,759 INFO L226 Difference]: Without dead ends: 105 [2022-11-22 01:59:09,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=142, Invalid=508, Unknown=0, NotChecked=0, Total=650 [2022-11-22 01:59:09,761 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 65 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 01:59:09,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 230 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 01:59:09,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-11-22 01:59:09,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 81. [2022-11-22 01:59:09,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 60 states have (on average 1.5833333333333333) internal successors, (95), 77 states have internal predecessors, (95), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 01:59:09,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 99 transitions. [2022-11-22 01:59:09,778 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 99 transitions. Word has length 14 [2022-11-22 01:59:09,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:59:09,778 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 99 transitions. [2022-11-22 01:59:09,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 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-22 01:59:09,779 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 99 transitions. [2022-11-22 01:59:09,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-22 01:59:09,779 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:59:09,780 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:59:09,794 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5e95759-f673-4561-9ebd-1223b8f7a7dd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-22 01:59:09,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5e95759-f673-4561-9ebd-1223b8f7a7dd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:59:09,987 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-11-22 01:59:09,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:59:09,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1295851029, now seen corresponding path program 1 times [2022-11-22 01:59:09,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:59:09,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619950407] [2022-11-22 01:59:09,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:59:09,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:59:10,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:59:10,102 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:59:10,102 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:59:10,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619950407] [2022-11-22 01:59:10,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619950407] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:59:10,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516810839] [2022-11-22 01:59:10,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:59:10,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:59:10,104 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5e95759-f673-4561-9ebd-1223b8f7a7dd/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:59:10,105 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5e95759-f673-4561-9ebd-1223b8f7a7dd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:59:10,109 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5e95759-f673-4561-9ebd-1223b8f7a7dd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-22 01:59:10,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:59:10,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-22 01:59:10,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:59:10,220 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:59:10,221 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:59:10,260 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:59:10,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516810839] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:59:10,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1621661738] [2022-11-22 01:59:10,264 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2022-11-22 01:59:10,264 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 01:59:10,265 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 01:59:10,265 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 01:59:10,265 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 01:59:10,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:10,313 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-22 01:59:10,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 26 [2022-11-22 01:59:10,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:10,346 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-22 01:59:10,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-11-22 01:59:10,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:10,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-22 01:59:10,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:10,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:10,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2022-11-22 01:59:10,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:10,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:10,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:10,559 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:59:10,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:10,569 INFO L321 Elim1Store]: treesize reduction 34, result has 2.9 percent of original size [2022-11-22 01:59:10,570 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 243 treesize of output 212 [2022-11-22 01:59:10,649 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-22 01:59:10,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-22 01:59:10,710 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 6 treesize of output 5 [2022-11-22 01:59:10,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 11 [2022-11-22 01:59:10,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:10,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2022-11-22 01:59:10,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:10,916 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-22 01:59:10,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 169 treesize of output 140 [2022-11-22 01:59:10,964 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-22 01:59:11,036 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 01:59:12,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1621661738] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:59:12,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:59:12,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [5, 4, 4] total 22 [2022-11-22 01:59:12,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569541682] [2022-11-22 01:59:12,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:59:12,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-22 01:59:12,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:59:12,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-22 01:59:12,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2022-11-22 01:59:12,088 INFO L87 Difference]: Start difference. First operand 81 states and 99 transitions. Second operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 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-22 01:59:13,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:59:13,288 INFO L93 Difference]: Finished difference Result 159 states and 183 transitions. [2022-11-22 01:59:13,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-22 01:59:13,289 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 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-22 01:59:13,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:59:13,290 INFO L225 Difference]: With dead ends: 159 [2022-11-22 01:59:13,290 INFO L226 Difference]: Without dead ends: 101 [2022-11-22 01:59:13,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2022-11-22 01:59:13,291 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 49 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-22 01:59:13,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 296 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-22 01:59:13,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-11-22 01:59:13,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 83. [2022-11-22 01:59:13,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 62 states have (on average 1.564516129032258) internal successors, (97), 79 states have internal predecessors, (97), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 01:59:13,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 101 transitions. [2022-11-22 01:59:13,321 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 101 transitions. Word has length 15 [2022-11-22 01:59:13,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:59:13,321 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 101 transitions. [2022-11-22 01:59:13,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 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-22 01:59:13,322 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2022-11-22 01:59:13,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-22 01:59:13,322 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:59:13,323 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:59:13,335 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5e95759-f673-4561-9ebd-1223b8f7a7dd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-22 01:59:13,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5e95759-f673-4561-9ebd-1223b8f7a7dd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:59:13,530 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-11-22 01:59:13,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:59:13,531 INFO L85 PathProgramCache]: Analyzing trace with hash 227932173, now seen corresponding path program 1 times [2022-11-22 01:59:13,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:59:13,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621024958] [2022-11-22 01:59:13,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:59:13,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:59:13,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:59:13,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:59:13,603 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:59:13,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621024958] [2022-11-22 01:59:13,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621024958] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:59:13,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054135815] [2022-11-22 01:59:13,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:59:13,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:59:13,605 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5e95759-f673-4561-9ebd-1223b8f7a7dd/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:59:13,606 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5e95759-f673-4561-9ebd-1223b8f7a7dd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:59:13,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5e95759-f673-4561-9ebd-1223b8f7a7dd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-22 01:59:13,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:59:13,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-22 01:59:13,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:59:13,732 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:59:13,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:59:13,776 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:59:13,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1054135815] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:59:13,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1193714497] [2022-11-22 01:59:13,780 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-22 01:59:13,781 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 01:59:13,781 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 01:59:13,781 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 01:59:13,782 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 01:59:13,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:13,818 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-22 01:59:13,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 26 [2022-11-22 01:59:13,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:13,848 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-22 01:59:13,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-11-22 01:59:13,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:13,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-22 01:59:13,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:13,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:13,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2022-11-22 01:59:14,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:14,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:14,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:14,060 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:59:14,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:14,068 INFO L321 Elim1Store]: treesize reduction 34, result has 2.9 percent of original size [2022-11-22 01:59:14,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 233 treesize of output 212 [2022-11-22 01:59:14,126 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-22 01:59:14,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-22 01:59:14,178 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 6 treesize of output 5 [2022-11-22 01:59:14,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 11 [2022-11-22 01:59:14,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:14,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2022-11-22 01:59:14,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:14,337 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-22 01:59:14,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 169 treesize of output 140 [2022-11-22 01:59:14,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-22 01:59:14,461 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 01:59:15,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1193714497] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:59:15,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:59:15,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [5, 4, 4] total 24 [2022-11-22 01:59:15,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791507995] [2022-11-22 01:59:15,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:59:15,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-22 01:59:15,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:59:15,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-22 01:59:15,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=425, Unknown=0, NotChecked=0, Total=552 [2022-11-22 01:59:15,785 INFO L87 Difference]: Start difference. First operand 83 states and 101 transitions. Second operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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-22 01:59:16,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:59:16,938 INFO L93 Difference]: Finished difference Result 120 states and 137 transitions. [2022-11-22 01:59:16,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-22 01:59:16,938 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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 17 [2022-11-22 01:59:16,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:59:16,941 INFO L225 Difference]: With dead ends: 120 [2022-11-22 01:59:16,941 INFO L226 Difference]: Without dead ends: 118 [2022-11-22 01:59:16,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=188, Invalid=682, Unknown=0, NotChecked=0, Total=870 [2022-11-22 01:59:16,943 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 67 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 01:59:16,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 238 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 01:59:16,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-11-22 01:59:16,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 87. [2022-11-22 01:59:16,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 66 states have (on average 1.5303030303030303) internal successors, (101), 83 states have internal predecessors, (101), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 01:59:16,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 105 transitions. [2022-11-22 01:59:16,954 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 105 transitions. Word has length 17 [2022-11-22 01:59:16,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:59:16,954 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 105 transitions. [2022-11-22 01:59:16,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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-22 01:59:16,955 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 105 transitions. [2022-11-22 01:59:16,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-22 01:59:16,956 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:59:16,956 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:59:16,967 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5e95759-f673-4561-9ebd-1223b8f7a7dd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-22 01:59:17,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5e95759-f673-4561-9ebd-1223b8f7a7dd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-22 01:59:17,162 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-11-22 01:59:17,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:59:17,162 INFO L85 PathProgramCache]: Analyzing trace with hash 2058412952, now seen corresponding path program 1 times [2022-11-22 01:59:17,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:59:17,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9207677] [2022-11-22 01:59:17,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:59:17,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:59:17,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:59:17,235 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 01:59:17,235 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:59:17,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9207677] [2022-11-22 01:59:17,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9207677] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:59:17,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086532294] [2022-11-22 01:59:17,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:59:17,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:59:17,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5e95759-f673-4561-9ebd-1223b8f7a7dd/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:59:17,237 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5e95759-f673-4561-9ebd-1223b8f7a7dd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:59:17,241 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5e95759-f673-4561-9ebd-1223b8f7a7dd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-22 01:59:17,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:59:17,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-22 01:59:17,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:59:17,338 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 01:59:17,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:59:17,368 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 01:59:17,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1086532294] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:59:17,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2018831266] [2022-11-22 01:59:17,371 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2022-11-22 01:59:17,371 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 01:59:17,372 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 01:59:17,372 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 01:59:17,372 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 01:59:17,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:17,410 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-22 01:59:17,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-11-22 01:59:17,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:17,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-22 01:59:17,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:17,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-22 01:59:17,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:17,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2022-11-22 01:59:17,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:17,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:17,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:17,577 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:59:17,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:17,593 INFO L321 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2022-11-22 01:59:17,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 227 treesize of output 215 [2022-11-22 01:59:17,672 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-22 01:59:17,705 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 6 treesize of output 5 [2022-11-22 01:59:17,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-22 01:59:17,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 11 [2022-11-22 01:59:17,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:17,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2022-11-22 01:59:17,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:17,851 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-22 01:59:17,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 159 treesize of output 140 [2022-11-22 01:59:17,896 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-22 01:59:18,586 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 01:59:20,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [2018831266] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:59:20,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:59:20,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [5, 4, 4] total 25 [2022-11-22 01:59:20,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840396248] [2022-11-22 01:59:20,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:59:20,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-22 01:59:20,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:59:20,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-22 01:59:20,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2022-11-22 01:59:20,059 INFO L87 Difference]: Start difference. First operand 87 states and 105 transitions. Second operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 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-22 01:59:22,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:59:22,184 INFO L93 Difference]: Finished difference Result 99 states and 121 transitions. [2022-11-22 01:59:22,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-22 01:59:22,185 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 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 22 [2022-11-22 01:59:22,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:59:22,185 INFO L225 Difference]: With dead ends: 99 [2022-11-22 01:59:22,185 INFO L226 Difference]: Without dead ends: 0 [2022-11-22 01:59:22,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=263, Invalid=1069, Unknown=0, NotChecked=0, Total=1332 [2022-11-22 01:59:22,193 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 42 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 01:59:22,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 2 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 01:59:22,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-22 01:59:22,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-22 01:59:22,195 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-22 01:59:22,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-22 01:59:22,195 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2022-11-22 01:59:22,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:59:22,195 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-22 01:59:22,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 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-22 01:59:22,196 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-22 01:59:22,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-22 01:59:22,198 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 28 remaining) [2022-11-22 01:59:22,199 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 28 remaining) [2022-11-22 01:59:22,199 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 28 remaining) [2022-11-22 01:59:22,199 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 28 remaining) [2022-11-22 01:59:22,200 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 28 remaining) [2022-11-22 01:59:22,200 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 28 remaining) [2022-11-22 01:59:22,200 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 28 remaining) [2022-11-22 01:59:22,200 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 28 remaining) [2022-11-22 01:59:22,200 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 28 remaining) [2022-11-22 01:59:22,201 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 28 remaining) [2022-11-22 01:59:22,201 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 28 remaining) [2022-11-22 01:59:22,201 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 28 remaining) [2022-11-22 01:59:22,201 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 28 remaining) [2022-11-22 01:59:22,202 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 28 remaining) [2022-11-22 01:59:22,202 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 28 remaining) [2022-11-22 01:59:22,202 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 28 remaining) [2022-11-22 01:59:22,202 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 28 remaining) [2022-11-22 01:59:22,203 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 28 remaining) [2022-11-22 01:59:22,203 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 28 remaining) [2022-11-22 01:59:22,203 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 28 remaining) [2022-11-22 01:59:22,203 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 28 remaining) [2022-11-22 01:59:22,203 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 28 remaining) [2022-11-22 01:59:22,204 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 28 remaining) [2022-11-22 01:59:22,204 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 28 remaining) [2022-11-22 01:59:22,204 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 28 remaining) [2022-11-22 01:59:22,204 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 28 remaining) [2022-11-22 01:59:22,204 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 28 remaining) [2022-11-22 01:59:22,205 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 28 remaining) [2022-11-22 01:59:22,215 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5e95759-f673-4561-9ebd-1223b8f7a7dd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-22 01:59:22,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5e95759-f673-4561-9ebd-1223b8f7a7dd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-22 01:59:22,413 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-22 01:59:23,933 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 40) no Hoare annotation was computed. [2022-11-22 01:59:23,933 INFO L899 garLoopResultBuilder]: For program point L52(lines 52 54) no Hoare annotation was computed. [2022-11-22 01:59:23,933 INFO L899 garLoopResultBuilder]: For program point L52-2(lines 52 54) no Hoare annotation was computed. [2022-11-22 01:59:23,933 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW(line 56) no Hoare annotation was computed. [2022-11-22 01:59:23,934 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-22 01:59:23,934 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW(line 62) no Hoare annotation was computed. [2022-11-22 01:59:23,934 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 47) no Hoare annotation was computed. [2022-11-22 01:59:23,934 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW(line 62) no Hoare annotation was computed. [2022-11-22 01:59:23,934 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 47) no Hoare annotation was computed. [2022-11-22 01:59:23,934 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW(line 55) no Hoare annotation was computed. [2022-11-22 01:59:23,935 INFO L899 garLoopResultBuilder]: For program point L55-3(line 55) no Hoare annotation was computed. [2022-11-22 01:59:23,935 INFO L899 garLoopResultBuilder]: For program point L22-3(line 22) no Hoare annotation was computed. [2022-11-22 01:59:23,935 INFO L899 garLoopResultBuilder]: For program point L55-4(line 55) no Hoare annotation was computed. [2022-11-22 01:59:23,935 INFO L899 garLoopResultBuilder]: For program point L22-4(line 22) no Hoare annotation was computed. [2022-11-22 01:59:23,936 INFO L895 garLoopResultBuilder]: At program point L55-5(lines 55 59) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~#values~0#1.offset| 0)) (.cse1 (<= 0 |ULTIMATE.start_main_~#set~0#1.base|)) (.cse2 (= |ULTIMATE.start_elem_exists_~i~0#1| 0)) (.cse3 (<= 0 |ULTIMATE.start_main_~#values~0#1.base|)) (.cse4 (<= |ULTIMATE.start_elem_exists_~size#1| 0)) (.cse5 (= 0 |ULTIMATE.start_elem_exists_#res#1|)) (.cse6 (= |ULTIMATE.start_main_~#set~0#1.offset| 0)) (.cse7 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse8 (= |#NULL.offset| 0)) (.cse9 (<= 0 |ULTIMATE.start_elem_exists_#in~set#1.offset|)) (.cse10 (= |ULTIMATE.start_main_~x~0#1| 0)) (.cse11 (<= 0 |#StackHeapBarrier|)) (.cse12 (<= 0 |ULTIMATE.start_elem_exists_~size#1|)) (.cse13 (= |#NULL.base| 0)) (.cse14 (<= |ULTIMATE.start_elem_exists_~set#1.offset| 0))) (or (and (= |ULTIMATE.start_elem_exists_~set#1.base| |ULTIMATE.start_elem_exists_#in~set#1.base|) .cse0 .cse1 (= (select (select |#memory_int| |ULTIMATE.start_main_~#values~0#1.base|) (+ |ULTIMATE.start_main_~#values~0#1.offset| (* |ULTIMATE.start_main_~v~0#1| 4))) |ULTIMATE.start_elem_exists_#in~value#1|) .cse2 (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_elem_exists_#in~size#1|) (= |ULTIMATE.start_main_~#set~0#1.base| |ULTIMATE.start_elem_exists_#in~set#1.base|) .cse3 .cse4 .cse5 .cse6 .cse7 (= |ULTIMATE.start_main_~v~0#1| 0) .cse8 .cse9 .cse10 (= |ULTIMATE.start_elem_exists_#in~value#1| |ULTIMATE.start_elem_exists_~value#1|) .cse11 .cse12 (= |ULTIMATE.start_elem_exists_#in~set#1.offset| |ULTIMATE.start_elem_exists_~set#1.offset|) .cse13 .cse14) (and (<= |ULTIMATE.start_elem_exists_#in~size#1| 0) (<= |ULTIMATE.start_main_~v~0#1| 100000) (<= 0 |ULTIMATE.start_elem_exists_#in~set#1.base|) (<= 0 |ULTIMATE.start_elem_exists_~set#1.base|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 0 |ULTIMATE.start_elem_exists_~set#1.offset|) .cse8 .cse9 (or (<= 1 |ULTIMATE.start_main_~v~0#1|) (and (= (select |#length| |ULTIMATE.start_main_~#values~0#1.base|) 400000) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#values~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#values~0#1.base|) 1))) (<= 0 |ULTIMATE.start_main_~v~0#1|) .cse10 .cse11 .cse12 (<= 0 |ULTIMATE.start_elem_exists_#in~size#1|) (<= |ULTIMATE.start_elem_exists_#in~set#1.offset| 0) .cse13 .cse14))) [2022-11-22 01:59:23,936 INFO L895 garLoopResultBuilder]: At program point L22-5(lines 22 24) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~#values~0#1.offset| 0)) (.cse1 (<= 0 |ULTIMATE.start_main_~#set~0#1.base|)) (.cse2 (= |ULTIMATE.start_elem_exists_~i~0#1| 0)) (.cse3 (<= 0 |ULTIMATE.start_main_~#values~0#1.base|)) (.cse4 (<= |ULTIMATE.start_elem_exists_~size#1| 0)) (.cse5 (= |ULTIMATE.start_main_~#set~0#1.offset| 0)) (.cse6 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse7 (= |#NULL.offset| 0)) (.cse8 (<= 0 |ULTIMATE.start_elem_exists_#in~set#1.offset|)) (.cse9 (= |ULTIMATE.start_main_~x~0#1| 0)) (.cse10 (<= 0 |#StackHeapBarrier|)) (.cse11 (<= 0 |ULTIMATE.start_elem_exists_~size#1|)) (.cse12 (= |#NULL.base| 0)) (.cse13 (<= |ULTIMATE.start_elem_exists_~set#1.offset| 0))) (or (and (= |ULTIMATE.start_elem_exists_~set#1.base| |ULTIMATE.start_elem_exists_#in~set#1.base|) (= |ULTIMATE.start_elem_exists_#in~value#1| |ULTIMATE.start_main_#t~mem12#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#values~0#1.base|) (+ |ULTIMATE.start_main_~#values~0#1.offset| (* |ULTIMATE.start_main_~v~0#1| 4))) |ULTIMATE.start_main_#t~mem12#1|) .cse0 .cse1 .cse2 (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_elem_exists_#in~size#1|) (= |ULTIMATE.start_main_~#set~0#1.base| |ULTIMATE.start_elem_exists_#in~set#1.base|) .cse3 .cse4 .cse5 .cse6 (= |ULTIMATE.start_main_~v~0#1| 0) .cse7 .cse8 .cse9 (= |ULTIMATE.start_elem_exists_#in~value#1| |ULTIMATE.start_elem_exists_~value#1|) .cse10 .cse11 (= |ULTIMATE.start_elem_exists_#in~set#1.offset| |ULTIMATE.start_elem_exists_~set#1.offset|) .cse12 .cse13) (and (<= |ULTIMATE.start_elem_exists_#in~size#1| 0) (<= |ULTIMATE.start_main_~v~0#1| 100000) (<= 0 |ULTIMATE.start_elem_exists_#in~set#1.base|) (<= 0 |ULTIMATE.start_elem_exists_~set#1.base|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 0 |ULTIMATE.start_elem_exists_~set#1.offset|) .cse7 .cse8 (or (<= 1 |ULTIMATE.start_main_~v~0#1|) (and (= (select |#length| |ULTIMATE.start_main_~#values~0#1.base|) 400000) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#values~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#values~0#1.base|) 1))) (<= 0 |ULTIMATE.start_main_~v~0#1|) .cse9 .cse10 .cse11 (<= 0 |ULTIMATE.start_elem_exists_#in~size#1|) (<= |ULTIMATE.start_elem_exists_#in~set#1.offset| 0) .cse12 .cse13))) [2022-11-22 01:59:23,937 INFO L899 garLoopResultBuilder]: For program point L39-3(line 39) no Hoare annotation was computed. [2022-11-22 01:59:23,937 INFO L899 garLoopResultBuilder]: For program point L39-4(line 39) no Hoare annotation was computed. [2022-11-22 01:59:23,937 INFO L895 garLoopResultBuilder]: At program point L39-5(lines 39 43) the Hoare annotation is: (and (<= 0 |ULTIMATE.start_main_~#set~0#1.base|) (= |ULTIMATE.start_main_~#set~0#1.offset| 0) (= |ULTIMATE.start_main_~n~0#1| 0) (= |#NULL.offset| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0)) [2022-11-22 01:59:23,937 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW(line 55) no Hoare annotation was computed. [2022-11-22 01:59:23,937 INFO L899 garLoopResultBuilder]: For program point L56(line 56) no Hoare annotation was computed. [2022-11-22 01:59:23,938 INFO L899 garLoopResultBuilder]: For program point L23(line 23) no Hoare annotation was computed. [2022-11-22 01:59:23,938 INFO L899 garLoopResultBuilder]: For program point L56-1(line 56) no Hoare annotation was computed. [2022-11-22 01:59:23,938 INFO L899 garLoopResultBuilder]: For program point L56-5(line 56) no Hoare annotation was computed. [2022-11-22 01:59:23,938 INFO L899 garLoopResultBuilder]: For program point L56-6(line 56) no Hoare annotation was computed. [2022-11-22 01:59:23,938 INFO L895 garLoopResultBuilder]: At program point L56-7(lines 56 58) the Hoare annotation is: false [2022-11-22 01:59:23,938 INFO L899 garLoopResultBuilder]: For program point L40(line 40) no Hoare annotation was computed. [2022-11-22 01:59:23,939 INFO L899 garLoopResultBuilder]: For program point L40-1(line 40) no Hoare annotation was computed. [2022-11-22 01:59:23,939 INFO L899 garLoopResultBuilder]: For program point L40-5(line 40) no Hoare annotation was computed. [2022-11-22 01:59:23,939 INFO L899 garLoopResultBuilder]: For program point L40-6(line 40) no Hoare annotation was computed. [2022-11-22 01:59:23,939 INFO L895 garLoopResultBuilder]: At program point L40-7(lines 40 42) the Hoare annotation is: false [2022-11-22 01:59:23,939 INFO L895 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: false [2022-11-22 01:59:23,939 INFO L899 garLoopResultBuilder]: For program point L57-1(line 57) no Hoare annotation was computed. [2022-11-22 01:59:23,940 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 18) no Hoare annotation was computed. [2022-11-22 01:59:23,940 INFO L895 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: false [2022-11-22 01:59:23,940 INFO L899 garLoopResultBuilder]: For program point L41-1(line 41) no Hoare annotation was computed. [2022-11-22 01:59:23,940 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-22 01:59:23,941 INFO L895 garLoopResultBuilder]: At program point L25(lines 20 26) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~#values~0#1.offset| 0)) (.cse1 (<= 0 |ULTIMATE.start_main_~#set~0#1.base|)) (.cse2 (= |ULTIMATE.start_elem_exists_~i~0#1| 0)) (.cse3 (<= 0 |ULTIMATE.start_main_~#values~0#1.base|)) (.cse4 (<= |ULTIMATE.start_elem_exists_~size#1| 0)) (.cse5 (= 0 |ULTIMATE.start_elem_exists_#res#1|)) (.cse6 (= |ULTIMATE.start_main_~#set~0#1.offset| 0)) (.cse7 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse8 (= |#NULL.offset| 0)) (.cse9 (<= 0 |ULTIMATE.start_elem_exists_#in~set#1.offset|)) (.cse10 (= |ULTIMATE.start_main_~x~0#1| 0)) (.cse11 (<= 0 |#StackHeapBarrier|)) (.cse12 (<= 0 |ULTIMATE.start_elem_exists_~size#1|)) (.cse13 (= |#NULL.base| 0)) (.cse14 (<= |ULTIMATE.start_elem_exists_~set#1.offset| 0))) (or (and (<= |ULTIMATE.start_elem_exists_#in~size#1| 0) (<= |ULTIMATE.start_main_~v~0#1| 100000) (<= 0 |ULTIMATE.start_elem_exists_#in~set#1.base|) (<= 0 |ULTIMATE.start_elem_exists_~set#1.base|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 0 |ULTIMATE.start_elem_exists_~set#1.offset|) .cse8 .cse9 (or (<= 1 |ULTIMATE.start_main_~v~0#1|) (and (= (select |#length| |ULTIMATE.start_main_~#values~0#1.base|) 400000) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#values~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#values~0#1.base|) 1))) (<= 0 |ULTIMATE.start_main_~v~0#1|) .cse10 .cse11 .cse12 (<= 0 |ULTIMATE.start_elem_exists_#in~size#1|) (<= |ULTIMATE.start_elem_exists_#in~set#1.offset| 0) .cse13 .cse14) (and (= |ULTIMATE.start_elem_exists_~set#1.base| |ULTIMATE.start_elem_exists_#in~set#1.base|) (= |ULTIMATE.start_elem_exists_#in~value#1| |ULTIMATE.start_main_#t~mem12#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#values~0#1.base|) (+ |ULTIMATE.start_main_~#values~0#1.offset| (* |ULTIMATE.start_main_~v~0#1| 4))) |ULTIMATE.start_main_#t~mem12#1|) .cse0 .cse1 .cse2 (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_elem_exists_#in~size#1|) (= |ULTIMATE.start_main_~#set~0#1.base| |ULTIMATE.start_elem_exists_#in~set#1.base|) .cse3 .cse4 .cse5 .cse6 .cse7 (= |ULTIMATE.start_main_~v~0#1| 0) .cse8 .cse9 .cse10 (= |ULTIMATE.start_elem_exists_#in~value#1| |ULTIMATE.start_elem_exists_~value#1|) .cse11 .cse12 (= |ULTIMATE.start_elem_exists_#in~set#1.offset| |ULTIMATE.start_elem_exists_~set#1.offset|) .cse13 .cse14))) [2022-11-22 01:59:23,941 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 18) no Hoare annotation was computed. [2022-11-22 01:59:23,941 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW(line 62) no Hoare annotation was computed. [2022-11-22 01:59:23,942 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 40) no Hoare annotation was computed. [2022-11-22 01:59:23,942 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2022-11-22 01:59:23,942 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW(line 62) no Hoare annotation was computed. [2022-11-22 01:59:23,942 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2022-11-22 01:59:23,942 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 33) no Hoare annotation was computed. [2022-11-22 01:59:23,942 INFO L899 garLoopResultBuilder]: For program point L61-3(line 61) no Hoare annotation was computed. [2022-11-22 01:59:23,943 INFO L899 garLoopResultBuilder]: For program point L61-4(line 61) no Hoare annotation was computed. [2022-11-22 01:59:23,943 INFO L895 garLoopResultBuilder]: At program point L61-5(lines 61 65) the Hoare annotation is: (and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0)) [2022-11-22 01:59:23,943 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW(line 56) no Hoare annotation was computed. [2022-11-22 01:59:23,943 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 33) no Hoare annotation was computed. [2022-11-22 01:59:23,943 INFO L899 garLoopResultBuilder]: For program point L62(line 62) no Hoare annotation was computed. [2022-11-22 01:59:23,944 INFO L899 garLoopResultBuilder]: For program point L62-1(line 62) no Hoare annotation was computed. [2022-11-22 01:59:23,944 INFO L899 garLoopResultBuilder]: For program point L62-5(line 62) no Hoare annotation was computed. [2022-11-22 01:59:23,944 INFO L899 garLoopResultBuilder]: For program point L62-6(line 62) no Hoare annotation was computed. [2022-11-22 01:59:23,944 INFO L895 garLoopResultBuilder]: At program point L62-7(lines 62 64) the Hoare annotation is: false [2022-11-22 01:59:23,944 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW(line 56) no Hoare annotation was computed. [2022-11-22 01:59:23,944 INFO L895 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: false [2022-11-22 01:59:23,945 INFO L899 garLoopResultBuilder]: For program point L63-1(line 63) no Hoare annotation was computed. [2022-11-22 01:59:23,945 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW(line 61) no Hoare annotation was computed. [2022-11-22 01:59:23,945 INFO L899 garLoopResultBuilder]: For program point L47-3(line 47) no Hoare annotation was computed. [2022-11-22 01:59:23,945 INFO L899 garLoopResultBuilder]: For program point L47-4(line 47) no Hoare annotation was computed. [2022-11-22 01:59:23,945 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2022-11-22 01:59:23,946 INFO L895 garLoopResultBuilder]: At program point L47-5(lines 47 50) the Hoare annotation is: (and (let ((.cse0 (= |ULTIMATE.start_main_~#values~0#1.offset| 0)) (.cse1 (<= 0 |ULTIMATE.start_main_~#set~0#1.base|)) (.cse2 (= |ULTIMATE.start_main_~#set~0#1.offset| 0)) (.cse3 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse4 (= |#NULL.offset| 0)) (.cse5 (= |ULTIMATE.start_main_~x~0#1| 0)) (.cse6 (<= 0 |#StackHeapBarrier|)) (.cse7 (= |#NULL.base| 0))) (or (and .cse0 (= (select |#length| |ULTIMATE.start_main_~#values~0#1.base|) 400000) .cse1 (< |#StackHeapBarrier| |ULTIMATE.start_main_~#values~0#1.base|) .cse2 .cse3 (= |ULTIMATE.start_main_~v~0#1| 0) .cse4 (= (select |#valid| |ULTIMATE.start_main_~#values~0#1.base|) 1) .cse5 .cse6 .cse7) (and .cse0 .cse1 (<= 0 |ULTIMATE.start_main_~#values~0#1.base|) (<= 1 |ULTIMATE.start_main_~v~0#1|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) (<= |ULTIMATE.start_main_~v~0#1| 2147483647)) [2022-11-22 01:59:23,946 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW(line 61) no Hoare annotation was computed. [2022-11-22 01:59:23,946 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2022-11-22 01:59:23,946 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 40) no Hoare annotation was computed. [2022-11-22 01:59:23,946 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW(line 51) no Hoare annotation was computed. [2022-11-22 01:59:23,947 INFO L899 garLoopResultBuilder]: For program point L33-3(line 33) no Hoare annotation was computed. [2022-11-22 01:59:23,947 INFO L899 garLoopResultBuilder]: For program point L33-4(line 33) no Hoare annotation was computed. [2022-11-22 01:59:23,947 INFO L895 garLoopResultBuilder]: At program point L33-5(lines 33 36) the Hoare annotation is: (and (let ((.cse0 (= |ULTIMATE.start_main_~#set~0#1.offset| 0)) (.cse1 (= |#NULL.offset| 0)) (.cse3 (= |#NULL.base| 0))) (or (let ((.cse2 (select |#memory_int| 1))) (and (= 48 (select |#length| 2)) (= (select |#valid| |ULTIMATE.start_main_~#set~0#1.base|) 1) (= 2 (select |#length| 1)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#set~0#1.base|) (= (select |#valid| 1) 1) (= (select |#length| |ULTIMATE.start_main_~#set~0#1.base|) 400000) .cse0 (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) .cse1 (= (select .cse2 0) 48) (= |ULTIMATE.start_main_~x~0#1| 0) (= (select .cse2 1) 0) (< 0 |#StackHeapBarrier|) .cse3)) (and (<= |ULTIMATE.start_main_~x~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_~#set~0#1.base|) (<= 1 |ULTIMATE.start_main_~x~0#1|) .cse0 .cse1 (<= 0 |#StackHeapBarrier|) .cse3))) (= |ULTIMATE.start_main_~n~0#1| 0)) [2022-11-22 01:59:23,947 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 40) no Hoare annotation was computed. [2022-11-22 01:59:23,948 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW(line 51) no Hoare annotation was computed. [2022-11-22 01:59:23,948 INFO L899 garLoopResultBuilder]: For program point L18(line 18) no Hoare annotation was computed. [2022-11-22 01:59:23,950 INFO L895 garLoopResultBuilder]: At program point L18-1(line 18) the Hoare annotation is: false [2022-11-22 01:59:23,950 INFO L899 garLoopResultBuilder]: For program point L51-3(line 51) no Hoare annotation was computed. [2022-11-22 01:59:23,951 INFO L899 garLoopResultBuilder]: For program point L51-4(line 51) no Hoare annotation was computed. [2022-11-22 01:59:23,951 INFO L895 garLoopResultBuilder]: At program point L51-5(lines 51 60) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~#values~0#1.offset| 0)) (.cse1 (<= 0 |ULTIMATE.start_main_~#set~0#1.base|)) (.cse2 (<= 0 |ULTIMATE.start_main_~#values~0#1.base|)) (.cse3 (= |ULTIMATE.start_main_~#set~0#1.offset| 0)) (.cse4 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse5 (= |#NULL.offset| 0)) (.cse6 (= |ULTIMATE.start_main_~x~0#1| 0)) (.cse7 (<= 0 |#StackHeapBarrier|)) (.cse8 (= |#NULL.base| 0))) (or (and (<= |ULTIMATE.start_elem_exists_#in~size#1| 0) (<= 0 |ULTIMATE.start_elem_exists_#in~set#1.base|) (<= 0 |ULTIMATE.start_elem_exists_~set#1.base|) .cse0 .cse1 (= |ULTIMATE.start_elem_exists_~i~0#1| 0) .cse2 (<= |ULTIMATE.start_elem_exists_~size#1| 0) (= 0 |ULTIMATE.start_elem_exists_#res#1|) .cse3 .cse4 (<= 0 |ULTIMATE.start_elem_exists_~set#1.offset|) .cse5 (<= 0 |ULTIMATE.start_elem_exists_#in~set#1.offset|) (<= 0 |ULTIMATE.start_main_~v~0#1|) .cse6 (<= |ULTIMATE.start_main_~v~0#1| 2147483647) .cse7 (<= 0 |ULTIMATE.start_elem_exists_~size#1|) (<= 0 |ULTIMATE.start_elem_exists_#in~size#1|) (<= |ULTIMATE.start_elem_exists_#in~set#1.offset| 0) .cse8 (<= |ULTIMATE.start_elem_exists_~set#1.offset| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_main_~v~0#1| 0) .cse5 .cse6 .cse7 .cse8))) [2022-11-22 01:59:23,951 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW(line 56) no Hoare annotation was computed. [2022-11-22 01:59:23,951 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(line 13) the Hoare annotation is: true [2022-11-22 01:59:23,951 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(line 13) no Hoare annotation was computed. [2022-11-22 01:59:23,955 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:59:23,956 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-22 01:59:23,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 01:59:23 BoogieIcfgContainer [2022-11-22 01:59:23,988 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-22 01:59:23,988 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-22 01:59:23,988 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-22 01:59:23,989 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-22 01:59:23,989 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:59:00" (3/4) ... [2022-11-22 01:59:23,992 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-22 01:59:23,998 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-11-22 01:59:24,003 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 42 nodes and edges [2022-11-22 01:59:24,004 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2022-11-22 01:59:24,004 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-22 01:59:24,005 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-22 01:59:24,029 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((\old(size) <= 0 && 0 <= set) && 0 <= set) && values == 0) && 0 <= set) && i == 0) && 0 <= values) && size <= 0) && 0 == \result) && set == 0) && n == 0) && 0 <= set) && #NULL == 0) && 0 <= set) && 0 <= v) && x == 0) && v <= 2147483647) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= size) && 0 <= \old(size)) && set <= 0) && #NULL == 0) && set <= 0) || (((((((((values == 0 && 0 <= set) && 0 <= values) && set == 0) && n == 0) && v == 0) && #NULL == 0) && x == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) [2022-11-22 01:59:24,030 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((set == set && \old(value) == aux-values[ v ]-aux) && unknown-#memory_int-unknown[values][values + v * 4] == aux-values[ v ]-aux) && values == 0) && 0 <= set) && i == 0) && n == \old(size)) && set == set) && 0 <= values) && size <= 0) && set == 0) && n == 0) && v == 0) && #NULL == 0) && 0 <= set) && x == 0) && \old(value) == value) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= size) && set == set) && #NULL == 0) && set <= 0) || ((((((((((((((((((((((\old(size) <= 0 && v <= 100000) && 0 <= set) && 0 <= set) && values == 0) && 0 <= set) && i == 0) && 0 <= values) && size <= 0) && set == 0) && n == 0) && 0 <= set) && #NULL == 0) && 0 <= set) && (1 <= v || ((unknown-#length-unknown[values] == 400000 && unknown-#StackHeapBarrier-unknown < values) && \valid[values] == 1))) && 0 <= v) && x == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= size) && 0 <= \old(size)) && set <= 0) && #NULL == 0) && set <= 0) [2022-11-22 01:59:24,031 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((\old(size) <= 0 && v <= 100000) && 0 <= set) && 0 <= set) && values == 0) && 0 <= set) && i == 0) && 0 <= values) && size <= 0) && 0 == \result) && set == 0) && n == 0) && 0 <= set) && #NULL == 0) && 0 <= set) && (1 <= v || ((unknown-#length-unknown[values] == 400000 && unknown-#StackHeapBarrier-unknown < values) && \valid[values] == 1))) && 0 <= v) && x == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= size) && 0 <= \old(size)) && set <= 0) && #NULL == 0) && set <= 0) || ((((((((((((((((((((((set == set && \old(value) == aux-values[ v ]-aux) && unknown-#memory_int-unknown[values][values + v * 4] == aux-values[ v ]-aux) && values == 0) && 0 <= set) && i == 0) && n == \old(size)) && set == set) && 0 <= values) && size <= 0) && 0 == \result) && set == 0) && n == 0) && v == 0) && #NULL == 0) && 0 <= set) && x == 0) && \old(value) == value) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= size) && set == set) && #NULL == 0) && set <= 0) [2022-11-22 01:59:24,031 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((set == set && values == 0) && 0 <= set) && unknown-#memory_int-unknown[values][values + v * 4] == \old(value)) && i == 0) && n == \old(size)) && set == set) && 0 <= values) && size <= 0) && 0 == \result) && set == 0) && n == 0) && v == 0) && #NULL == 0) && 0 <= set) && x == 0) && \old(value) == value) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= size) && set == set) && #NULL == 0) && set <= 0) || (((((((((((((((((((((((\old(size) <= 0 && v <= 100000) && 0 <= set) && 0 <= set) && values == 0) && 0 <= set) && i == 0) && 0 <= values) && size <= 0) && 0 == \result) && set == 0) && n == 0) && 0 <= set) && #NULL == 0) && 0 <= set) && (1 <= v || ((unknown-#length-unknown[values] == 400000 && unknown-#StackHeapBarrier-unknown < values) && \valid[values] == 1))) && 0 <= v) && x == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= size) && 0 <= \old(size)) && set <= 0) && #NULL == 0) && set <= 0) [2022-11-22 01:59:24,056 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5e95759-f673-4561-9ebd-1223b8f7a7dd/bin/utaipan-g80aRyZoba/witness.graphml [2022-11-22 01:59:24,056 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-22 01:59:24,057 INFO L158 Benchmark]: Toolchain (without parser) took 25097.46ms. Allocated memory was 167.8MB in the beginning and 285.2MB in the end (delta: 117.4MB). Free memory was 122.3MB in the beginning and 172.0MB in the end (delta: -49.6MB). Peak memory consumption was 69.5MB. Max. memory is 16.1GB. [2022-11-22 01:59:24,058 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 167.8MB. Free memory is still 138.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 01:59:24,058 INFO L158 Benchmark]: CACSL2BoogieTranslator took 315.69ms. Allocated memory is still 167.8MB. Free memory was 122.1MB in the beginning and 110.4MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-22 01:59:24,059 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.16ms. Allocated memory is still 167.8MB. Free memory was 110.4MB in the beginning and 108.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 01:59:24,059 INFO L158 Benchmark]: Boogie Preprocessor took 77.23ms. Allocated memory is still 167.8MB. Free memory was 108.2MB in the beginning and 106.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 01:59:24,059 INFO L158 Benchmark]: RCFGBuilder took 997.65ms. Allocated memory is still 167.8MB. Free memory was 106.7MB in the beginning and 85.2MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-22 01:59:24,060 INFO L158 Benchmark]: TraceAbstraction took 23552.45ms. Allocated memory was 167.8MB in the beginning and 285.2MB in the end (delta: 117.4MB). Free memory was 84.6MB in the beginning and 176.2MB in the end (delta: -91.5MB). Peak memory consumption was 120.1MB. Max. memory is 16.1GB. [2022-11-22 01:59:24,060 INFO L158 Benchmark]: Witness Printer took 67.86ms. Allocated memory is still 285.2MB. Free memory was 176.2MB in the beginning and 172.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-22 01:59:24,067 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.28ms. Allocated memory is still 167.8MB. Free memory is still 138.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 315.69ms. Allocated memory is still 167.8MB. Free memory was 122.1MB in the beginning and 110.4MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.16ms. Allocated memory is still 167.8MB. Free memory was 110.4MB in the beginning and 108.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.23ms. Allocated memory is still 167.8MB. Free memory was 108.2MB in the beginning and 106.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 997.65ms. Allocated memory is still 167.8MB. Free memory was 106.7MB in the beginning and 85.2MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 23552.45ms. Allocated memory was 167.8MB in the beginning and 285.2MB in the end (delta: 117.4MB). Free memory was 84.6MB in the beginning and 176.2MB in the end (delta: -91.5MB). Peak memory consumption was 120.1MB. Max. memory is 16.1GB. * Witness Printer took 67.86ms. Allocated memory is still 285.2MB. Free memory was 176.2MB in the beginning and 172.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 18]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 18]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 62]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 62]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 62]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 62]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 80 locations, 28 error locations. Started 1 CEGAR loops. OverallTime: 23.4s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 481 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 474 mSDsluCounter, 1943 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1377 mSDsCounter, 96 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1710 IncrementalHoareTripleChecker+Invalid, 1806 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 96 mSolverCounterUnsat, 566 mSDtfsCounter, 1710 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 305 GetRequests, 162 SyntacticMatches, 1 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 828 ImplicationChecksByTransitivity, 10.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=91occurred in iteration=4, InterpolantAutomatonStates: 98, 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, 11 MinimizatonAttempts, 250 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 29 PreInvPairs, 42 NumberOfFragments, 803 HoareAnnotationTreeSize, 29 FomulaSimplifications, 102 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 16 FomulaSimplificationsInter, 1932 FormulaSimplificationTreeSizeReductionInter, 1.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 202 NumberOfCodeBlocks, 202 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 261 ConstructedInterpolants, 0 QuantifiedInterpolants, 413 SizeOfPredicates, 5 NumberOfNonLiveVariables, 611 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 21 InterpolantComputations, 6 PerfectInterpolantSequences, 34/49 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: 5.0s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 5, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 77, DAG_INTERPRETER_EARLY_EXITS: 3, TOOLS_POST_APPLICATIONS: 191, TOOLS_POST_TIME: 4.1s, 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: 191, TOOLS_QUANTIFIERELIM_TIME: 4.0s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.2s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 336, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 26, DOMAIN_JOIN_TIME: 0.2s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 22, DOMAIN_WIDEN_TIME: 0.3s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 33, DOMAIN_ISSUBSETEQ_TIME: 0.1s, DOMAIN_ISBOTTOM_APPLICATIONS: 77, DOMAIN_ISBOTTOM_TIME: 0.1s, LOOP_SUMMARIZER_APPLICATIONS: 11, LOOP_SUMMARIZER_CACHE_MISSES: 11, LOOP_SUMMARIZER_OVERALL_TIME: 3.4s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 3.4s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 33, 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.1s, DAG_COMPRESSION_PROCESSED_NODES: 2240, DAG_COMPRESSION_RETAINED_NODES: 233, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 28 specifications checked. All of them hold - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: ((((((((((((values == 0 && unknown-#length-unknown[values] == 400000) && 0 <= set) && unknown-#StackHeapBarrier-unknown < values) && set == 0) && n == 0) && v == 0) && #NULL == 0) && \valid[values] == 1) && x == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) || (((((((((values == 0 && 0 <= set) && 0 <= values) && 1 <= v) && set == 0) && n == 0) && #NULL == 0) && x == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0)) && v <= 2147483647 - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (((((((((((((((((((((set == set && \old(value) == aux-values[ v ]-aux) && unknown-#memory_int-unknown[values][values + v * 4] == aux-values[ v ]-aux) && values == 0) && 0 <= set) && i == 0) && n == \old(size)) && set == set) && 0 <= values) && size <= 0) && set == 0) && n == 0) && v == 0) && #NULL == 0) && 0 <= set) && x == 0) && \old(value) == value) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= size) && set == set) && #NULL == 0) && set <= 0) || ((((((((((((((((((((((\old(size) <= 0 && v <= 100000) && 0 <= set) && 0 <= set) && values == 0) && 0 <= set) && i == 0) && 0 <= values) && size <= 0) && set == 0) && n == 0) && 0 <= set) && #NULL == 0) && 0 <= set) && (1 <= v || ((unknown-#length-unknown[values] == 400000 && unknown-#StackHeapBarrier-unknown < values) && \valid[values] == 1))) && 0 <= v) && x == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= size) && 0 <= \old(size)) && set <= 0) && #NULL == 0) && set <= 0) - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((\old(size) <= 0 && 0 <= set) && 0 <= set) && values == 0) && 0 <= set) && i == 0) && 0 <= values) && size <= 0) && 0 == \result) && set == 0) && n == 0) && 0 <= set) && #NULL == 0) && 0 <= set) && 0 <= v) && x == 0) && v <= 2147483647) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= size) && 0 <= \old(size)) && set <= 0) && #NULL == 0) && set <= 0) || (((((((((values == 0 && 0 <= set) && 0 <= values) && set == 0) && n == 0) && v == 0) && #NULL == 0) && x == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 62]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: (((((0 <= set && set == 0) && n == 0) && #NULL == 0) && x == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0 - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (((((((((((((((48 == unknown-#length-unknown[2] && \valid[set] == 1) && 2 == unknown-#length-unknown[1]) && unknown-#StackHeapBarrier-unknown < set) && \valid[1] == 1) && unknown-#length-unknown[set] == 400000) && set == 0) && \valid[0] == 0) && \valid[2] == 1) && #NULL == 0) && unknown-#memory_int-unknown[1][0] == 48) && x == 0) && unknown-#memory_int-unknown[1][1] == 0) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) || ((((((x <= 2147483647 && 0 <= set) && 1 <= x) && set == 0) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0)) && n == 0 - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((\old(size) <= 0 && v <= 100000) && 0 <= set) && 0 <= set) && values == 0) && 0 <= set) && i == 0) && 0 <= values) && size <= 0) && 0 == \result) && set == 0) && n == 0) && 0 <= set) && #NULL == 0) && 0 <= set) && (1 <= v || ((unknown-#length-unknown[values] == 400000 && unknown-#StackHeapBarrier-unknown < values) && \valid[values] == 1))) && 0 <= v) && x == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= size) && 0 <= \old(size)) && set <= 0) && #NULL == 0) && set <= 0) || ((((((((((((((((((((((set == set && \old(value) == aux-values[ v ]-aux) && unknown-#memory_int-unknown[values][values + v * 4] == aux-values[ v ]-aux) && values == 0) && 0 <= set) && i == 0) && n == \old(size)) && set == set) && 0 <= values) && size <= 0) && 0 == \result) && set == 0) && n == 0) && v == 0) && #NULL == 0) && 0 <= set) && x == 0) && \old(value) == value) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= size) && set == set) && #NULL == 0) && set <= 0) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: (((((((((((((((((((((set == set && values == 0) && 0 <= set) && unknown-#memory_int-unknown[values][values + v * 4] == \old(value)) && i == 0) && n == \old(size)) && set == set) && 0 <= values) && size <= 0) && 0 == \result) && set == 0) && n == 0) && v == 0) && #NULL == 0) && 0 <= set) && x == 0) && \old(value) == value) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= size) && set == set) && #NULL == 0) && set <= 0) || (((((((((((((((((((((((\old(size) <= 0 && v <= 100000) && 0 <= set) && 0 <= set) && values == 0) && 0 <= set) && i == 0) && 0 <= values) && size <= 0) && 0 == \result) && set == 0) && n == 0) && 0 <= set) && #NULL == 0) && 0 <= set) && (1 <= v || ((unknown-#length-unknown[values] == 400000 && unknown-#StackHeapBarrier-unknown < values) && \valid[values] == 1))) && 0 <= v) && x == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= size) && 0 <= \old(size)) && set <= 0) && #NULL == 0) && set <= 0) - InvariantResult [Line: 61]: Loop Invariant Derived loop invariant: n == 0 && x == 0 RESULT: Ultimate proved your program to be correct! [2022-11-22 01:59:24,112 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5e95759-f673-4561-9ebd-1223b8f7a7dd/bin/utaipan-g80aRyZoba/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