./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/systemc/kundu1.cil.c --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_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/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_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/kundu1.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/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_e58e1a93-b583-473f-a44b-bddb3b2a1c59/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 c114a15ea6b1c9b012290758a6a9559b9c02a944706c9768958a3bd9c86822a7 --- 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 00:33:40,936 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 00:33:40,938 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 00:33:40,959 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 00:33:40,959 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 00:33:40,961 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 00:33:40,962 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 00:33:40,964 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 00:33:40,966 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 00:33:40,967 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 00:33:40,969 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 00:33:40,970 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 00:33:40,970 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 00:33:40,972 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 00:33:40,973 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 00:33:40,974 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 00:33:40,975 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 00:33:40,976 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 00:33:40,978 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 00:33:40,981 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 00:33:40,982 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 00:33:40,990 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 00:33:40,992 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 00:33:40,993 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 00:33:40,997 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 00:33:40,997 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 00:33:40,998 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 00:33:40,999 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 00:33:40,999 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 00:33:41,000 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 00:33:41,001 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 00:33:41,011 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 00:33:41,012 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 00:33:41,013 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 00:33:41,014 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 00:33:41,014 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 00:33:41,015 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 00:33:41,016 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 00:33:41,016 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 00:33:41,017 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 00:33:41,018 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 00:33:41,022 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-22 00:33:41,072 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 00:33:41,072 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 00:33:41,073 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 00:33:41,073 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 00:33:41,074 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 00:33:41,074 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 00:33:41,074 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 00:33:41,074 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 00:33:41,075 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 00:33:41,075 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-22 00:33:41,076 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 00:33:41,076 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 00:33:41,076 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-22 00:33:41,076 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-22 00:33:41,077 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 00:33:41,077 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-22 00:33:41,077 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-22 00:33:41,077 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-22 00:33:41,079 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 00:33:41,079 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-22 00:33:41,079 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-22 00:33:41,079 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 00:33:41,079 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-22 00:33:41,080 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 00:33:41,080 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-22 00:33:41,080 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 00:33:41,080 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-22 00:33:41,080 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-22 00:33:41,081 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-22 00:33:41,081 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-22 00:33:41,081 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 00:33:41,081 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-22 00:33:41,082 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 00:33:41,082 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 00:33:41,083 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 00:33:41,083 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 00:33:41,084 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-22 00:33:41,084 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 00:33:41,084 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-22 00:33:41,084 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-22 00:33:41,084 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-22 00:33:41,085 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-22 00:33:41,085 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 00:33:41,086 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_e58e1a93-b583-473f-a44b-bddb3b2a1c59/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_e58e1a93-b583-473f-a44b-bddb3b2a1c59/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 -> c114a15ea6b1c9b012290758a6a9559b9c02a944706c9768958a3bd9c86822a7 [2022-11-22 00:33:41,444 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 00:33:41,481 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 00:33:41,484 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 00:33:41,486 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 00:33:41,487 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 00:33:41,488 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/systemc/kundu1.cil.c [2022-11-22 00:33:44,916 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 00:33:45,179 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 00:33:45,180 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/sv-benchmarks/c/systemc/kundu1.cil.c [2022-11-22 00:33:45,190 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/data/a3d216236/c0dde1c17ec740ebb4dc1c9988a44999/FLAG91dd4ef74 [2022-11-22 00:33:45,217 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/data/a3d216236/c0dde1c17ec740ebb4dc1c9988a44999 [2022-11-22 00:33:45,223 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 00:33:45,226 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 00:33:45,230 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 00:33:45,230 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 00:33:45,236 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 00:33:45,237 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:33:45" (1/1) ... [2022-11-22 00:33:45,238 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@415cf87a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:33:45, skipping insertion in model container [2022-11-22 00:33:45,238 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:33:45" (1/1) ... [2022-11-22 00:33:45,254 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 00:33:45,290 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 00:33:45,465 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_e58e1a93-b583-473f-a44b-bddb3b2a1c59/sv-benchmarks/c/systemc/kundu1.cil.c[636,649] [2022-11-22 00:33:45,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 00:33:45,543 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 00:33:45,557 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_e58e1a93-b583-473f-a44b-bddb3b2a1c59/sv-benchmarks/c/systemc/kundu1.cil.c[636,649] [2022-11-22 00:33:45,589 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 00:33:45,605 INFO L208 MainTranslator]: Completed translation [2022-11-22 00:33:45,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:33:45 WrapperNode [2022-11-22 00:33:45,606 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 00:33:45,607 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 00:33:45,607 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 00:33:45,608 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 00:33:45,614 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:33:45" (1/1) ... [2022-11-22 00:33:45,624 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:33:45" (1/1) ... [2022-11-22 00:33:45,656 INFO L138 Inliner]: procedures = 32, calls = 36, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 265 [2022-11-22 00:33:45,656 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 00:33:45,657 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 00:33:45,657 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 00:33:45,658 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 00:33:45,668 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:33:45" (1/1) ... [2022-11-22 00:33:45,669 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:33:45" (1/1) ... [2022-11-22 00:33:45,672 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:33:45" (1/1) ... [2022-11-22 00:33:45,672 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:33:45" (1/1) ... [2022-11-22 00:33:45,678 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:33:45" (1/1) ... [2022-11-22 00:33:45,684 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:33:45" (1/1) ... [2022-11-22 00:33:45,686 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:33:45" (1/1) ... [2022-11-22 00:33:45,688 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:33:45" (1/1) ... [2022-11-22 00:33:45,691 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 00:33:45,692 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 00:33:45,692 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 00:33:45,692 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 00:33:45,693 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:33:45" (1/1) ... [2022-11-22 00:33:45,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 00:33:45,716 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:33:45,747 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 00:33:45,752 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 00:33:45,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 00:33:45,795 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-11-22 00:33:45,795 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-11-22 00:33:45,795 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-11-22 00:33:45,795 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-11-22 00:33:45,796 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-11-22 00:33:45,796 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-11-22 00:33:45,796 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-11-22 00:33:45,797 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-11-22 00:33:45,797 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-11-22 00:33:45,797 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-11-22 00:33:45,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-22 00:33:45,798 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-11-22 00:33:45,798 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-11-22 00:33:45,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 00:33:45,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 00:33:45,938 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 00:33:45,941 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 00:33:46,296 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 00:33:46,561 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 00:33:46,561 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-22 00:33:46,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:33:46 BoogieIcfgContainer [2022-11-22 00:33:46,575 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 00:33:46,577 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 00:33:46,577 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 00:33:46,581 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 00:33:46,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:33:45" (1/3) ... [2022-11-22 00:33:46,582 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72e649dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:33:46, skipping insertion in model container [2022-11-22 00:33:46,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:33:45" (2/3) ... [2022-11-22 00:33:46,583 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72e649dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:33:46, skipping insertion in model container [2022-11-22 00:33:46,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:33:46" (3/3) ... [2022-11-22 00:33:46,584 INFO L112 eAbstractionObserver]: Analyzing ICFG kundu1.cil.c [2022-11-22 00:33:46,622 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 00:33:46,623 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-11-22 00:33:46,676 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 00:33:46,685 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;@18894127, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 00:33:46,686 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-11-22 00:33:46,693 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 59 states have (on average 1.5593220338983051) internal successors, (92), 70 states have internal predecessors, (92), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-22 00:33:46,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-22 00:33:46,707 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:33:46,707 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:33:46,708 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 00:33:46,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:33:46,720 INFO L85 PathProgramCache]: Analyzing trace with hash 2123757291, now seen corresponding path program 1 times [2022-11-22 00:33:46,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:33:46,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716214133] [2022-11-22 00:33:46,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:33:46,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:33:46,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:33:47,062 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 00:33:47,063 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:33:47,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716214133] [2022-11-22 00:33:47,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716214133] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:33:47,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:33:47,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 00:33:47,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933456341] [2022-11-22 00:33:47,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:33:47,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:33:47,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:33:47,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:33:47,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:33:47,104 INFO L87 Difference]: Start difference. First operand has 89 states, 59 states have (on average 1.5593220338983051) internal successors, (92), 70 states have internal predecessors, (92), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-22 00:33:47,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:33:47,326 INFO L93 Difference]: Finished difference Result 251 states and 347 transitions. [2022-11-22 00:33:47,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 00:33:47,335 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-11-22 00:33:47,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:33:47,346 INFO L225 Difference]: With dead ends: 251 [2022-11-22 00:33:47,346 INFO L226 Difference]: Without dead ends: 155 [2022-11-22 00:33:47,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:33:47,357 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 205 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:33:47,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 320 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:33:47,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-11-22 00:33:47,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 142. [2022-11-22 00:33:47,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 104 states have (on average 1.4711538461538463) internal successors, (153), 112 states have internal predecessors, (153), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-11-22 00:33:47,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 193 transitions. [2022-11-22 00:33:47,452 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 193 transitions. Word has length 33 [2022-11-22 00:33:47,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:33:47,453 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 193 transitions. [2022-11-22 00:33:47,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-22 00:33:47,453 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 193 transitions. [2022-11-22 00:33:47,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-22 00:33:47,455 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:33:47,455 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:33:47,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-22 00:33:47,456 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 00:33:47,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:33:47,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1391229076, now seen corresponding path program 1 times [2022-11-22 00:33:47,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:33:47,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223678616] [2022-11-22 00:33:47,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:33:47,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:33:47,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:33:47,584 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 00:33:47,584 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:33:47,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223678616] [2022-11-22 00:33:47,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223678616] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:33:47,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:33:47,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 00:33:47,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355440382] [2022-11-22 00:33:47,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:33:47,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:33:47,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:33:47,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:33:47,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:33:47,588 INFO L87 Difference]: Start difference. First operand 142 states and 193 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-22 00:33:47,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:33:47,815 INFO L93 Difference]: Finished difference Result 411 states and 558 transitions. [2022-11-22 00:33:47,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 00:33:47,818 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-11-22 00:33:47,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:33:47,821 INFO L225 Difference]: With dead ends: 411 [2022-11-22 00:33:47,821 INFO L226 Difference]: Without dead ends: 274 [2022-11-22 00:33:47,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:33:47,823 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 185 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:33:47,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 272 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 00:33:47,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2022-11-22 00:33:47,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 242. [2022-11-22 00:33:47,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 178 states have (on average 1.3932584269662922) internal successors, (248), 186 states have internal predecessors, (248), 36 states have call successors, (36), 20 states have call predecessors, (36), 20 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-11-22 00:33:47,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 320 transitions. [2022-11-22 00:33:47,866 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 320 transitions. Word has length 33 [2022-11-22 00:33:47,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:33:47,866 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 320 transitions. [2022-11-22 00:33:47,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-22 00:33:47,867 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 320 transitions. [2022-11-22 00:33:47,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-22 00:33:47,868 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:33:47,868 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:33:47,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-22 00:33:47,869 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 00:33:47,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:33:47,870 INFO L85 PathProgramCache]: Analyzing trace with hash -187866102, now seen corresponding path program 1 times [2022-11-22 00:33:47,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:33:47,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938610399] [2022-11-22 00:33:47,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:33:47,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:33:47,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:33:47,950 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 00:33:47,951 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:33:47,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938610399] [2022-11-22 00:33:47,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938610399] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:33:47,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:33:47,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 00:33:47,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905132817] [2022-11-22 00:33:47,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:33:47,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:33:47,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:33:47,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:33:47,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:33:47,954 INFO L87 Difference]: Start difference. First operand 242 states and 320 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-22 00:33:48,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:33:48,067 INFO L93 Difference]: Finished difference Result 493 states and 662 transitions. [2022-11-22 00:33:48,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:33:48,068 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 34 [2022-11-22 00:33:48,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:33:48,071 INFO L225 Difference]: With dead ends: 493 [2022-11-22 00:33:48,072 INFO L226 Difference]: Without dead ends: 357 [2022-11-22 00:33:48,073 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 00:33:48,075 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 74 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:33:48,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 171 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:33:48,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2022-11-22 00:33:48,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2022-11-22 00:33:48,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 267 states have (on average 1.3745318352059925) internal successors, (367), 275 states have internal predecessors, (367), 52 states have call successors, (52), 30 states have call predecessors, (52), 30 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-11-22 00:33:48,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 471 transitions. [2022-11-22 00:33:48,163 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 471 transitions. Word has length 34 [2022-11-22 00:33:48,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:33:48,165 INFO L495 AbstractCegarLoop]: Abstraction has 357 states and 471 transitions. [2022-11-22 00:33:48,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-22 00:33:48,165 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 471 transitions. [2022-11-22 00:33:48,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-22 00:33:48,166 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:33:48,167 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:33:48,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-22 00:33:48,167 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 00:33:48,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:33:48,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1638929732, now seen corresponding path program 1 times [2022-11-22 00:33:48,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:33:48,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221242423] [2022-11-22 00:33:48,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:33:48,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:33:48,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:33:48,234 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 00:33:48,234 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:33:48,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221242423] [2022-11-22 00:33:48,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221242423] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:33:48,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:33:48,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 00:33:48,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83245465] [2022-11-22 00:33:48,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:33:48,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:33:48,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:33:48,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:33:48,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:33:48,237 INFO L87 Difference]: Start difference. First operand 357 states and 471 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-22 00:33:48,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:33:48,343 INFO L93 Difference]: Finished difference Result 378 states and 496 transitions. [2022-11-22 00:33:48,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:33:48,344 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 35 [2022-11-22 00:33:48,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:33:48,350 INFO L225 Difference]: With dead ends: 378 [2022-11-22 00:33:48,350 INFO L226 Difference]: Without dead ends: 376 [2022-11-22 00:33:48,351 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 00:33:48,353 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 79 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:33:48,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 175 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:33:48,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2022-11-22 00:33:48,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 369. [2022-11-22 00:33:48,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 279 states have (on average 1.3727598566308243) internal successors, (383), 287 states have internal predecessors, (383), 52 states have call successors, (52), 30 states have call predecessors, (52), 30 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-11-22 00:33:48,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 487 transitions. [2022-11-22 00:33:48,389 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 487 transitions. Word has length 35 [2022-11-22 00:33:48,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:33:48,389 INFO L495 AbstractCegarLoop]: Abstraction has 369 states and 487 transitions. [2022-11-22 00:33:48,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-22 00:33:48,390 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 487 transitions. [2022-11-22 00:33:48,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-22 00:33:48,391 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:33:48,391 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:33:48,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-22 00:33:48,392 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 00:33:48,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:33:48,393 INFO L85 PathProgramCache]: Analyzing trace with hash 732786114, now seen corresponding path program 1 times [2022-11-22 00:33:48,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:33:48,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574951594] [2022-11-22 00:33:48,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:33:48,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:33:48,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:33:48,453 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 00:33:48,453 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:33:48,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574951594] [2022-11-22 00:33:48,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574951594] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:33:48,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:33:48,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 00:33:48,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402215474] [2022-11-22 00:33:48,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:33:48,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:33:48,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:33:48,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:33:48,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:33:48,456 INFO L87 Difference]: Start difference. First operand 369 states and 487 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-22 00:33:48,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:33:48,527 INFO L93 Difference]: Finished difference Result 369 states and 487 transitions. [2022-11-22 00:33:48,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:33:48,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 36 [2022-11-22 00:33:48,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:33:48,538 INFO L225 Difference]: With dead ends: 369 [2022-11-22 00:33:48,538 INFO L226 Difference]: Without dead ends: 367 [2022-11-22 00:33:48,540 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 00:33:48,547 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 85 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 00:33:48,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 83 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 00:33:48,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2022-11-22 00:33:48,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2022-11-22 00:33:48,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 279 states have (on average 1.3584229390681004) internal successors, (379), 285 states have internal predecessors, (379), 52 states have call successors, (52), 30 states have call predecessors, (52), 30 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-11-22 00:33:48,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 483 transitions. [2022-11-22 00:33:48,590 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 483 transitions. Word has length 36 [2022-11-22 00:33:48,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:33:48,591 INFO L495 AbstractCegarLoop]: Abstraction has 367 states and 483 transitions. [2022-11-22 00:33:48,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-22 00:33:48,591 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 483 transitions. [2022-11-22 00:33:48,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-22 00:33:48,596 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:33:48,596 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:33:48,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-22 00:33:48,597 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 00:33:48,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:33:48,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1018655309, now seen corresponding path program 1 times [2022-11-22 00:33:48,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:33:48,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037219052] [2022-11-22 00:33:48,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:33:48,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:33:48,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:33:48,750 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 00:33:48,751 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:33:48,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037219052] [2022-11-22 00:33:48,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037219052] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:33:48,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:33:48,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:33:48,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123461764] [2022-11-22 00:33:48,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:33:48,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:33:48,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:33:48,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:33:48,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:33:48,753 INFO L87 Difference]: Start difference. First operand 367 states and 483 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-22 00:33:48,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:33:48,952 INFO L93 Difference]: Finished difference Result 497 states and 657 transitions. [2022-11-22 00:33:48,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 00:33:48,953 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 42 [2022-11-22 00:33:48,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:33:48,957 INFO L225 Difference]: With dead ends: 497 [2022-11-22 00:33:48,958 INFO L226 Difference]: Without dead ends: 495 [2022-11-22 00:33:48,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 00:33:48,963 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 164 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:33:48,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 228 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:33:48,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2022-11-22 00:33:49,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 492. [2022-11-22 00:33:49,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 378 states have (on average 1.3544973544973544) internal successors, (512), 384 states have internal predecessors, (512), 68 states have call successors, (68), 40 states have call predecessors, (68), 40 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2022-11-22 00:33:49,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 648 transitions. [2022-11-22 00:33:49,021 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 648 transitions. Word has length 42 [2022-11-22 00:33:49,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:33:49,022 INFO L495 AbstractCegarLoop]: Abstraction has 492 states and 648 transitions. [2022-11-22 00:33:49,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-22 00:33:49,022 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 648 transitions. [2022-11-22 00:33:49,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-22 00:33:49,030 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:33:49,031 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:33:49,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-22 00:33:49,031 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 00:33:49,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:33:49,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1513543769, now seen corresponding path program 1 times [2022-11-22 00:33:49,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:33:49,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631154582] [2022-11-22 00:33:49,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:33:49,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:33:49,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:33:49,146 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 00:33:49,146 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:33:49,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631154582] [2022-11-22 00:33:49,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631154582] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:33:49,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:33:49,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:33:49,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422971125] [2022-11-22 00:33:49,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:33:49,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:33:49,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:33:49,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:33:49,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:33:49,148 INFO L87 Difference]: Start difference. First operand 492 states and 648 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-22 00:33:49,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:33:49,344 INFO L93 Difference]: Finished difference Result 802 states and 1066 transitions. [2022-11-22 00:33:49,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 00:33:49,344 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 43 [2022-11-22 00:33:49,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:33:49,348 INFO L225 Difference]: With dead ends: 802 [2022-11-22 00:33:49,348 INFO L226 Difference]: Without dead ends: 606 [2022-11-22 00:33:49,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:33:49,350 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 143 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:33:49,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 281 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:33:49,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2022-11-22 00:33:49,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 604. [2022-11-22 00:33:49,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 464 states have (on average 1.3512931034482758) internal successors, (627), 470 states have internal predecessors, (627), 84 states have call successors, (84), 50 states have call predecessors, (84), 50 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2022-11-22 00:33:49,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 795 transitions. [2022-11-22 00:33:49,402 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 795 transitions. Word has length 43 [2022-11-22 00:33:49,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:33:49,402 INFO L495 AbstractCegarLoop]: Abstraction has 604 states and 795 transitions. [2022-11-22 00:33:49,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-22 00:33:49,403 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 795 transitions. [2022-11-22 00:33:49,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-22 00:33:49,404 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:33:49,404 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:33:49,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-22 00:33:49,404 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 00:33:49,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:33:49,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1001935339, now seen corresponding path program 1 times [2022-11-22 00:33:49,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:33:49,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431035915] [2022-11-22 00:33:49,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:33:49,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:33:49,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:33:49,454 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-22 00:33:49,454 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:33:49,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431035915] [2022-11-22 00:33:49,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431035915] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:33:49,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:33:49,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:33:49,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109815991] [2022-11-22 00:33:49,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:33:49,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:33:49,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:33:49,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:33:49,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:33:49,456 INFO L87 Difference]: Start difference. First operand 604 states and 795 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-22 00:33:49,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:33:49,609 INFO L93 Difference]: Finished difference Result 1542 states and 2032 transitions. [2022-11-22 00:33:49,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:33:49,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 51 [2022-11-22 00:33:49,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:33:49,618 INFO L225 Difference]: With dead ends: 1542 [2022-11-22 00:33:49,618 INFO L226 Difference]: Without dead ends: 944 [2022-11-22 00:33:49,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:33:49,623 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 43 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 00:33:49,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 208 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 00:33:49,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2022-11-22 00:33:49,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 759. [2022-11-22 00:33:49,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 759 states, 595 states have (on average 1.361344537815126) internal successors, (810), 602 states have internal predecessors, (810), 96 states have call successors, (96), 62 states have call predecessors, (96), 62 states have return successors, (96), 95 states have call predecessors, (96), 96 states have call successors, (96) [2022-11-22 00:33:49,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1002 transitions. [2022-11-22 00:33:49,722 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1002 transitions. Word has length 51 [2022-11-22 00:33:49,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:33:49,723 INFO L495 AbstractCegarLoop]: Abstraction has 759 states and 1002 transitions. [2022-11-22 00:33:49,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-22 00:33:49,723 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1002 transitions. [2022-11-22 00:33:49,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-22 00:33:49,726 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:33:49,727 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:33:49,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-22 00:33:49,727 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 00:33:49,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:33:49,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1805542076, now seen corresponding path program 1 times [2022-11-22 00:33:49,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:33:49,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047316689] [2022-11-22 00:33:49,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:33:49,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:33:49,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:33:49,940 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-22 00:33:49,942 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:33:49,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047316689] [2022-11-22 00:33:49,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047316689] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:33:49,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:33:49,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-22 00:33:49,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679089629] [2022-11-22 00:33:49,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:33:49,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 00:33:49,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:33:49,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 00:33:49,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-22 00:33:49,945 INFO L87 Difference]: Start difference. First operand 759 states and 1002 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-22 00:33:50,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:33:50,373 INFO L93 Difference]: Finished difference Result 2020 states and 2658 transitions. [2022-11-22 00:33:50,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-22 00:33:50,374 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 57 [2022-11-22 00:33:50,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:33:50,381 INFO L225 Difference]: With dead ends: 2020 [2022-11-22 00:33:50,382 INFO L226 Difference]: Without dead ends: 1267 [2022-11-22 00:33:50,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-11-22 00:33:50,387 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 188 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:33:50,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 283 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 00:33:50,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267 states. [2022-11-22 00:33:50,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267 to 1229. [2022-11-22 00:33:50,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1229 states, 939 states have (on average 1.3397231096911608) internal successors, (1258), 945 states have internal predecessors, (1258), 174 states have call successors, (174), 110 states have call predecessors, (174), 110 states have return successors, (174), 174 states have call predecessors, (174), 174 states have call successors, (174) [2022-11-22 00:33:50,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1229 states and 1606 transitions. [2022-11-22 00:33:50,536 INFO L78 Accepts]: Start accepts. Automaton has 1229 states and 1606 transitions. Word has length 57 [2022-11-22 00:33:50,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:33:50,537 INFO L495 AbstractCegarLoop]: Abstraction has 1229 states and 1606 transitions. [2022-11-22 00:33:50,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-22 00:33:50,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 1606 transitions. [2022-11-22 00:33:50,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-22 00:33:50,539 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:33:50,539 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:33:50,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-22 00:33:50,539 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 00:33:50,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:33:50,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1755401506, now seen corresponding path program 1 times [2022-11-22 00:33:50,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:33:50,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174132204] [2022-11-22 00:33:50,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:33:50,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:33:50,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:33:50,638 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-22 00:33:50,638 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:33:50,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174132204] [2022-11-22 00:33:50,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174132204] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:33:50,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:33:50,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:33:50,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048705918] [2022-11-22 00:33:50,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:33:50,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:33:50,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:33:50,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:33:50,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:33:50,641 INFO L87 Difference]: Start difference. First operand 1229 states and 1606 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-22 00:33:50,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:33:50,888 INFO L93 Difference]: Finished difference Result 3084 states and 3997 transitions. [2022-11-22 00:33:50,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:33:50,888 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 58 [2022-11-22 00:33:50,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:33:50,898 INFO L225 Difference]: With dead ends: 3084 [2022-11-22 00:33:50,898 INFO L226 Difference]: Without dead ends: 1861 [2022-11-22 00:33:50,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:33:50,906 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 46 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 00:33:50,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 208 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 00:33:50,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1861 states. [2022-11-22 00:33:51,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1861 to 1591. [2022-11-22 00:33:51,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1591 states, 1237 states have (on average 1.3298302344381567) internal successors, (1645), 1244 states have internal predecessors, (1645), 206 states have call successors, (206), 142 states have call predecessors, (206), 142 states have return successors, (206), 205 states have call predecessors, (206), 206 states have call successors, (206) [2022-11-22 00:33:51,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1591 states and 2057 transitions. [2022-11-22 00:33:51,068 INFO L78 Accepts]: Start accepts. Automaton has 1591 states and 2057 transitions. Word has length 58 [2022-11-22 00:33:51,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:33:51,069 INFO L495 AbstractCegarLoop]: Abstraction has 1591 states and 2057 transitions. [2022-11-22 00:33:51,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-22 00:33:51,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 2057 transitions. [2022-11-22 00:33:51,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-22 00:33:51,071 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:33:51,072 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:33:51,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-22 00:33:51,073 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 00:33:51,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:33:51,074 INFO L85 PathProgramCache]: Analyzing trace with hash -2040998419, now seen corresponding path program 1 times [2022-11-22 00:33:51,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:33:51,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892551299] [2022-11-22 00:33:51,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:33:51,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:33:51,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:33:51,273 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-22 00:33:51,280 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:33:51,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892551299] [2022-11-22 00:33:51,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892551299] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:33:51,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59088693] [2022-11-22 00:33:51,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:33:51,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:33:51,282 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:33:51,286 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:33:51,293 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-22 00:33:51,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:33:51,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-22 00:33:51,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:33:51,528 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-22 00:33:51,528 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:33:51,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59088693] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:33:51,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 00:33:51,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2022-11-22 00:33:51,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124669165] [2022-11-22 00:33:51,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:33:51,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:33:51,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:33:51,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:33:51,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:33:51,531 INFO L87 Difference]: Start difference. First operand 1591 states and 2057 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-22 00:33:51,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:33:51,695 INFO L93 Difference]: Finished difference Result 2695 states and 3532 transitions. [2022-11-22 00:33:51,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:33:51,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 89 [2022-11-22 00:33:51,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:33:51,702 INFO L225 Difference]: With dead ends: 2695 [2022-11-22 00:33:51,703 INFO L226 Difference]: Without dead ends: 1591 [2022-11-22 00:33:51,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:33:51,706 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 58 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 00:33:51,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 88 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 00:33:51,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2022-11-22 00:33:51,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 1591. [2022-11-22 00:33:51,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1591 states, 1237 states have (on average 1.318512530315279) internal successors, (1631), 1244 states have internal predecessors, (1631), 206 states have call successors, (206), 142 states have call predecessors, (206), 142 states have return successors, (206), 205 states have call predecessors, (206), 206 states have call successors, (206) [2022-11-22 00:33:51,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1591 states and 2043 transitions. [2022-11-22 00:33:51,914 INFO L78 Accepts]: Start accepts. Automaton has 1591 states and 2043 transitions. Word has length 89 [2022-11-22 00:33:51,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:33:51,915 INFO L495 AbstractCegarLoop]: Abstraction has 1591 states and 2043 transitions. [2022-11-22 00:33:51,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-22 00:33:51,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 2043 transitions. [2022-11-22 00:33:51,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-11-22 00:33:51,918 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:33:51,918 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:33:51,924 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-22 00:33:52,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:33:52,125 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 00:33:52,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:33:52,125 INFO L85 PathProgramCache]: Analyzing trace with hash 939030162, now seen corresponding path program 1 times [2022-11-22 00:33:52,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:33:52,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018291813] [2022-11-22 00:33:52,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:33:52,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:33:52,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:33:52,261 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-22 00:33:52,261 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:33:52,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018291813] [2022-11-22 00:33:52,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018291813] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:33:52,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064369160] [2022-11-22 00:33:52,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:33:52,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:33:52,262 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:33:52,267 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:33:52,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-22 00:33:52,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:33:52,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-22 00:33:52,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:33:52,482 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-22 00:33:52,482 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:33:52,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064369160] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:33:52,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 00:33:52,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2022-11-22 00:33:52,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386154960] [2022-11-22 00:33:52,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:33:52,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:33:52,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:33:52,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:33:52,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:33:52,485 INFO L87 Difference]: Start difference. First operand 1591 states and 2043 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-22 00:33:52,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:33:52,754 INFO L93 Difference]: Finished difference Result 4240 states and 5463 transitions. [2022-11-22 00:33:52,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:33:52,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 90 [2022-11-22 00:33:52,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:33:52,769 INFO L225 Difference]: With dead ends: 4240 [2022-11-22 00:33:52,769 INFO L226 Difference]: Without dead ends: 3136 [2022-11-22 00:33:52,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:33:52,774 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 53 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 00:33:52,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 182 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 00:33:52,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3136 states. [2022-11-22 00:33:53,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3136 to 3122. [2022-11-22 00:33:53,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3122 states, 2448 states have (on average 1.3161764705882353) internal successors, (3222), 2455 states have internal predecessors, (3222), 386 states have call successors, (386), 282 states have call predecessors, (386), 282 states have return successors, (386), 385 states have call predecessors, (386), 386 states have call successors, (386) [2022-11-22 00:33:53,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 3994 transitions. [2022-11-22 00:33:53,057 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 3994 transitions. Word has length 90 [2022-11-22 00:33:53,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:33:53,058 INFO L495 AbstractCegarLoop]: Abstraction has 3122 states and 3994 transitions. [2022-11-22 00:33:53,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-22 00:33:53,058 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 3994 transitions. [2022-11-22 00:33:53,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-11-22 00:33:53,061 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:33:53,061 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:33:53,076 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-22 00:33:53,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:33:53,268 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 00:33:53,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:33:53,268 INFO L85 PathProgramCache]: Analyzing trace with hash -637527597, now seen corresponding path program 1 times [2022-11-22 00:33:53,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:33:53,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821758676] [2022-11-22 00:33:53,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:33:53,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:33:53,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:33:53,425 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-22 00:33:53,426 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:33:53,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821758676] [2022-11-22 00:33:53,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821758676] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:33:53,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500307629] [2022-11-22 00:33:53,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:33:53,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:33:53,427 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:33:53,431 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:33:53,456 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-22 00:33:53,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:33:53,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-22 00:33:53,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:33:53,618 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-22 00:33:53,619 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:33:53,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500307629] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:33:53,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 00:33:53,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-11-22 00:33:53,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750702291] [2022-11-22 00:33:53,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:33:53,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:33:53,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:33:53,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:33:53,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:33:53,622 INFO L87 Difference]: Start difference. First operand 3122 states and 3994 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-11-22 00:33:54,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:33:54,008 INFO L93 Difference]: Finished difference Result 5945 states and 7712 transitions. [2022-11-22 00:33:54,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:33:54,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 90 [2022-11-22 00:33:54,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:33:54,025 INFO L225 Difference]: With dead ends: 5945 [2022-11-22 00:33:54,025 INFO L226 Difference]: Without dead ends: 3771 [2022-11-22 00:33:54,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:33:54,031 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 62 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:33:54,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 231 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:33:54,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3771 states. [2022-11-22 00:33:54,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3771 to 3650. [2022-11-22 00:33:54,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3650 states, 2814 states have (on average 1.2864250177683014) internal successors, (3620), 2821 states have internal predecessors, (3620), 482 states have call successors, (482), 348 states have call predecessors, (482), 348 states have return successors, (500), 481 states have call predecessors, (500), 482 states have call successors, (500) [2022-11-22 00:33:54,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3650 states to 3650 states and 4602 transitions. [2022-11-22 00:33:54,508 INFO L78 Accepts]: Start accepts. Automaton has 3650 states and 4602 transitions. Word has length 90 [2022-11-22 00:33:54,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:33:54,509 INFO L495 AbstractCegarLoop]: Abstraction has 3650 states and 4602 transitions. [2022-11-22 00:33:54,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-11-22 00:33:54,509 INFO L276 IsEmpty]: Start isEmpty. Operand 3650 states and 4602 transitions. [2022-11-22 00:33:54,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-11-22 00:33:54,512 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:33:54,512 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:33:54,523 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-22 00:33:54,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-22 00:33:54,719 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 00:33:54,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:33:54,720 INFO L85 PathProgramCache]: Analyzing trace with hash 608542812, now seen corresponding path program 1 times [2022-11-22 00:33:54,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:33:54,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773157973] [2022-11-22 00:33:54,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:33:54,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:33:54,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:33:54,890 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-22 00:33:54,890 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:33:54,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773157973] [2022-11-22 00:33:54,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773157973] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:33:54,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074830637] [2022-11-22 00:33:54,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:33:54,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:33:54,891 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:33:54,892 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:33:54,918 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-22 00:33:55,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:33:55,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-22 00:33:55,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:33:55,243 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-22 00:33:55,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:33:55,435 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-22 00:33:55,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074830637] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:33:55,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [915306598] [2022-11-22 00:33:55,463 INFO L159 IcfgInterpreter]: Started Sifa with 60 locations of interest [2022-11-22 00:33:55,463 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 00:33:55,468 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 00:33:55,477 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 00:33:55,477 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 00:34:00,566 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events with input of size 105 for LOIs [2022-11-22 00:34:00,600 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events with input of size 111 for LOIs [2022-11-22 00:34:00,643 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels with input of size 111 for LOIs [2022-11-22 00:34:00,680 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread with input of size 38 for LOIs [2022-11-22 00:34:00,686 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads with input of size 119 for LOIs [2022-11-22 00:34:01,156 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 00:34:10,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [915306598] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:34:10,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:34:10,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [6, 2, 3] total 47 [2022-11-22 00:34:10,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463021198] [2022-11-22 00:34:10,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:34:10,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-22 00:34:10,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:34:10,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-22 00:34:10,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=1854, Unknown=0, NotChecked=0, Total=2162 [2022-11-22 00:34:10,558 INFO L87 Difference]: Start difference. First operand 3650 states and 4602 transitions. Second operand has 39 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 33 states have internal predecessors, (46), 7 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 9 states have call predecessors, (11), 7 states have call successors, (11) [2022-11-22 00:34:18,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:34:18,481 INFO L93 Difference]: Finished difference Result 6558 states and 8274 transitions. [2022-11-22 00:34:18,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-22 00:34:18,482 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 33 states have internal predecessors, (46), 7 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 9 states have call predecessors, (11), 7 states have call successors, (11) Word has length 95 [2022-11-22 00:34:18,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:34:18,496 INFO L225 Difference]: With dead ends: 6558 [2022-11-22 00:34:18,496 INFO L226 Difference]: Without dead ends: 3846 [2022-11-22 00:34:18,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 237 SyntacticMatches, 8 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1934 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=692, Invalid=4710, Unknown=0, NotChecked=0, Total=5402 [2022-11-22 00:34:18,504 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 174 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 1894 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 1970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:34:18,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 617 Invalid, 1970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1894 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-11-22 00:34:18,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3846 states. [2022-11-22 00:34:18,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3846 to 3776. [2022-11-22 00:34:18,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3776 states, 2908 states have (on average 1.284387895460798) internal successors, (3735), 2915 states have internal predecessors, (3735), 500 states have call successors, (500), 362 states have call predecessors, (500), 362 states have return successors, (518), 499 states have call predecessors, (518), 500 states have call successors, (518) [2022-11-22 00:34:18,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3776 states to 3776 states and 4753 transitions. [2022-11-22 00:34:18,846 INFO L78 Accepts]: Start accepts. Automaton has 3776 states and 4753 transitions. Word has length 95 [2022-11-22 00:34:18,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:34:18,847 INFO L495 AbstractCegarLoop]: Abstraction has 3776 states and 4753 transitions. [2022-11-22 00:34:18,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 33 states have internal predecessors, (46), 7 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 9 states have call predecessors, (11), 7 states have call successors, (11) [2022-11-22 00:34:18,847 INFO L276 IsEmpty]: Start isEmpty. Operand 3776 states and 4753 transitions. [2022-11-22 00:34:18,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-11-22 00:34:18,850 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:34:18,851 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:34:18,863 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-22 00:34:19,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:34:19,058 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 00:34:19,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:34:19,058 INFO L85 PathProgramCache]: Analyzing trace with hash 250979577, now seen corresponding path program 1 times [2022-11-22 00:34:19,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:34:19,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900566779] [2022-11-22 00:34:19,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:34:19,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:34:19,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:34:19,192 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-22 00:34:19,193 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:34:19,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900566779] [2022-11-22 00:34:19,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900566779] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:34:19,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999319025] [2022-11-22 00:34:19,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:34:19,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:34:19,194 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:34:19,195 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:34:19,202 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-22 00:34:19,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:34:19,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-22 00:34:19,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:34:19,455 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-22 00:34:19,455 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:34:19,611 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-22 00:34:19,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999319025] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:34:19,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1013848193] [2022-11-22 00:34:19,620 INFO L159 IcfgInterpreter]: Started Sifa with 61 locations of interest [2022-11-22 00:34:19,620 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 00:34:19,622 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 00:34:19,623 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 00:34:19,623 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 00:34:23,572 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events with input of size 105 for LOIs [2022-11-22 00:34:23,591 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events with input of size 111 for LOIs [2022-11-22 00:34:23,611 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels with input of size 111 for LOIs [2022-11-22 00:34:23,633 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread with input of size 38 for LOIs [2022-11-22 00:34:23,639 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads with input of size 119 for LOIs [2022-11-22 00:34:24,022 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 00:34:31,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1013848193] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:34:31,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:34:31,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [6, 2, 3] total 47 [2022-11-22 00:34:31,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622347696] [2022-11-22 00:34:31,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:34:31,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-22 00:34:31,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:34:31,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-22 00:34:31,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=1868, Unknown=0, NotChecked=0, Total=2162 [2022-11-22 00:34:31,710 INFO L87 Difference]: Start difference. First operand 3776 states and 4753 transitions. Second operand has 39 states, 34 states have (on average 1.411764705882353) internal successors, (48), 33 states have internal predecessors, (48), 7 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 9 states have call predecessors, (11), 7 states have call successors, (11) [2022-11-22 00:34:42,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:34:42,114 INFO L93 Difference]: Finished difference Result 6208 states and 7850 transitions. [2022-11-22 00:34:42,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-11-22 00:34:42,115 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 34 states have (on average 1.411764705882353) internal successors, (48), 33 states have internal predecessors, (48), 7 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 9 states have call predecessors, (11), 7 states have call successors, (11) Word has length 96 [2022-11-22 00:34:42,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:34:42,130 INFO L225 Difference]: With dead ends: 6208 [2022-11-22 00:34:42,130 INFO L226 Difference]: Without dead ends: 3501 [2022-11-22 00:34:42,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 238 SyntacticMatches, 10 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2816 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=1000, Invalid=7190, Unknown=0, NotChecked=0, Total=8190 [2022-11-22 00:34:42,140 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 219 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 2035 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 2142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 2035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-22 00:34:42,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 618 Invalid, 2142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 2035 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-11-22 00:34:42,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3501 states. [2022-11-22 00:34:42,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3501 to 3389. [2022-11-22 00:34:42,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3389 states, 2613 states have (on average 1.2866437045541523) internal successors, (3362), 2620 states have internal predecessors, (3362), 448 states have call successors, (448), 322 states have call predecessors, (448), 322 states have return successors, (464), 447 states have call predecessors, (464), 448 states have call successors, (464) [2022-11-22 00:34:42,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3389 states to 3389 states and 4274 transitions. [2022-11-22 00:34:42,480 INFO L78 Accepts]: Start accepts. Automaton has 3389 states and 4274 transitions. Word has length 96 [2022-11-22 00:34:42,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:34:42,481 INFO L495 AbstractCegarLoop]: Abstraction has 3389 states and 4274 transitions. [2022-11-22 00:34:42,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 34 states have (on average 1.411764705882353) internal successors, (48), 33 states have internal predecessors, (48), 7 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 9 states have call predecessors, (11), 7 states have call successors, (11) [2022-11-22 00:34:42,481 INFO L276 IsEmpty]: Start isEmpty. Operand 3389 states and 4274 transitions. [2022-11-22 00:34:42,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-11-22 00:34:42,484 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:34:42,485 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:34:42,496 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-22 00:34:42,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-22 00:34:42,692 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 00:34:42,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:34:42,693 INFO L85 PathProgramCache]: Analyzing trace with hash -618437047, now seen corresponding path program 1 times [2022-11-22 00:34:42,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:34:42,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980680885] [2022-11-22 00:34:42,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:34:42,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:34:42,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:34:43,098 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 19 proven. 17 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-22 00:34:43,098 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:34:43,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980680885] [2022-11-22 00:34:43,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980680885] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:34:43,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892092183] [2022-11-22 00:34:43,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:34:43,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:34:43,099 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:34:43,100 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:34:43,118 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-22 00:34:43,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:34:43,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-22 00:34:43,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:34:43,286 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-22 00:34:43,286 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:34:43,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892092183] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:34:43,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 00:34:43,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [12] total 13 [2022-11-22 00:34:43,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973886015] [2022-11-22 00:34:43,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:34:43,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:34:43,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:34:43,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:34:43,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-11-22 00:34:43,289 INFO L87 Difference]: Start difference. First operand 3389 states and 4274 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-22 00:34:43,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:34:43,610 INFO L93 Difference]: Finished difference Result 5959 states and 7552 transitions. [2022-11-22 00:34:43,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:34:43,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 97 [2022-11-22 00:34:43,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:34:43,633 INFO L225 Difference]: With dead ends: 5959 [2022-11-22 00:34:43,633 INFO L226 Difference]: Without dead ends: 3395 [2022-11-22 00:34:43,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-11-22 00:34:43,639 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 51 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 00:34:43,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 182 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 00:34:43,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3395 states. [2022-11-22 00:34:43,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3395 to 3389. [2022-11-22 00:34:43,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3389 states, 2613 states have (on average 1.2797550707998468) internal successors, (3344), 2620 states have internal predecessors, (3344), 448 states have call successors, (448), 322 states have call predecessors, (448), 322 states have return successors, (464), 447 states have call predecessors, (464), 448 states have call successors, (464) [2022-11-22 00:34:43,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3389 states to 3389 states and 4256 transitions. [2022-11-22 00:34:43,944 INFO L78 Accepts]: Start accepts. Automaton has 3389 states and 4256 transitions. Word has length 97 [2022-11-22 00:34:43,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:34:43,944 INFO L495 AbstractCegarLoop]: Abstraction has 3389 states and 4256 transitions. [2022-11-22 00:34:43,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-22 00:34:43,945 INFO L276 IsEmpty]: Start isEmpty. Operand 3389 states and 4256 transitions. [2022-11-22 00:34:43,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-11-22 00:34:43,947 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:34:43,948 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:34:43,959 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-22 00:34:44,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-22 00:34:44,160 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 00:34:44,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:34:44,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1280093258, now seen corresponding path program 1 times [2022-11-22 00:34:44,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:34:44,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390748380] [2022-11-22 00:34:44,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:34:44,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:34:44,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:34:44,548 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 19 proven. 18 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-22 00:34:44,548 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:34:44,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390748380] [2022-11-22 00:34:44,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390748380] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:34:44,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448894094] [2022-11-22 00:34:44,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:34:44,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:34:44,550 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:34:44,551 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:34:44,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-22 00:34:44,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:34:44,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-22 00:34:44,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:34:44,685 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-22 00:34:44,685 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:34:44,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448894094] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:34:44,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 00:34:44,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2022-11-22 00:34:44,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851262730] [2022-11-22 00:34:44,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:34:44,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:34:44,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:34:44,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:34:44,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-11-22 00:34:44,688 INFO L87 Difference]: Start difference. First operand 3389 states and 4256 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-11-22 00:34:44,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:34:44,965 INFO L93 Difference]: Finished difference Result 6012 states and 7631 transitions. [2022-11-22 00:34:44,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:34:44,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 97 [2022-11-22 00:34:44,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:34:44,982 INFO L225 Difference]: With dead ends: 6012 [2022-11-22 00:34:44,982 INFO L226 Difference]: Without dead ends: 3448 [2022-11-22 00:34:44,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-11-22 00:34:44,989 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 73 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 00:34:44,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 229 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 00:34:44,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3448 states. [2022-11-22 00:34:45,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3448 to 3389. [2022-11-22 00:34:45,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3389 states, 2613 states have (on average 1.265977803291236) internal successors, (3308), 2620 states have internal predecessors, (3308), 448 states have call successors, (448), 322 states have call predecessors, (448), 322 states have return successors, (464), 447 states have call predecessors, (464), 448 states have call successors, (464) [2022-11-22 00:34:45,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3389 states to 3389 states and 4220 transitions. [2022-11-22 00:34:45,290 INFO L78 Accepts]: Start accepts. Automaton has 3389 states and 4220 transitions. Word has length 97 [2022-11-22 00:34:45,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:34:45,291 INFO L495 AbstractCegarLoop]: Abstraction has 3389 states and 4220 transitions. [2022-11-22 00:34:45,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-11-22 00:34:45,291 INFO L276 IsEmpty]: Start isEmpty. Operand 3389 states and 4220 transitions. [2022-11-22 00:34:45,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-11-22 00:34:45,294 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:34:45,294 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:34:45,306 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-22 00:34:45,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-22 00:34:45,500 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 00:34:45,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:34:45,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1695623373, now seen corresponding path program 1 times [2022-11-22 00:34:45,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:34:45,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709064839] [2022-11-22 00:34:45,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:34:45,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:34:45,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:34:45,865 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 19 proven. 18 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-22 00:34:45,865 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:34:45,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709064839] [2022-11-22 00:34:45,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709064839] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:34:45,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067627676] [2022-11-22 00:34:45,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:34:45,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:34:45,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:34:45,875 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:34:45,898 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-22 00:34:45,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:34:45,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-22 00:34:45,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:34:46,126 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 41 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-22 00:34:46,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:34:46,267 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-22 00:34:46,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067627676] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:34:46,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1833432925] [2022-11-22 00:34:46,270 INFO L159 IcfgInterpreter]: Started Sifa with 57 locations of interest [2022-11-22 00:34:46,270 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 00:34:46,271 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 00:34:46,271 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 00:34:46,271 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 00:34:49,410 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events with input of size 103 for LOIs [2022-11-22 00:34:49,439 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events with input of size 111 for LOIs [2022-11-22 00:34:49,470 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels with input of size 111 for LOIs [2022-11-22 00:34:49,500 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread with input of size 38 for LOIs [2022-11-22 00:34:49,505 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads with input of size 119 for LOIs [2022-11-22 00:34:49,657 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 00:34:55,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1833432925] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:34:55,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:34:55,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [12, 4, 5] total 45 [2022-11-22 00:34:55,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435506370] [2022-11-22 00:34:55,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:34:55,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-22 00:34:55,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:34:55,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-22 00:34:55,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=1705, Unknown=0, NotChecked=0, Total=1980 [2022-11-22 00:34:55,042 INFO L87 Difference]: Start difference. First operand 3389 states and 4220 transitions. Second operand has 32 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 27 states have internal predecessors, (43), 6 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2022-11-22 00:34:58,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:34:58,305 INFO L93 Difference]: Finished difference Result 6879 states and 8572 transitions. [2022-11-22 00:34:58,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-22 00:34:58,315 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 27 states have internal predecessors, (43), 6 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) Word has length 98 [2022-11-22 00:34:58,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:34:58,343 INFO L225 Difference]: With dead ends: 6879 [2022-11-22 00:34:58,343 INFO L226 Difference]: Without dead ends: 3496 [2022-11-22 00:34:58,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 254 SyntacticMatches, 11 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 996 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=466, Invalid=3074, Unknown=0, NotChecked=0, Total=3540 [2022-11-22 00:34:58,350 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 95 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 1622 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 1665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-22 00:34:58,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 608 Invalid, 1665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1622 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-22 00:34:58,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3496 states. [2022-11-22 00:34:58,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3496 to 3408. [2022-11-22 00:34:58,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3408 states, 2628 states have (on average 1.2625570776255708) internal successors, (3318), 2634 states have internal predecessors, (3318), 451 states have call successors, (451), 323 states have call predecessors, (451), 323 states have return successors, (467), 451 states have call predecessors, (467), 451 states have call successors, (467) [2022-11-22 00:34:58,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3408 states to 3408 states and 4236 transitions. [2022-11-22 00:34:58,661 INFO L78 Accepts]: Start accepts. Automaton has 3408 states and 4236 transitions. Word has length 98 [2022-11-22 00:34:58,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:34:58,661 INFO L495 AbstractCegarLoop]: Abstraction has 3408 states and 4236 transitions. [2022-11-22 00:34:58,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 27 states have internal predecessors, (43), 6 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2022-11-22 00:34:58,662 INFO L276 IsEmpty]: Start isEmpty. Operand 3408 states and 4236 transitions. [2022-11-22 00:34:58,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-22 00:34:58,665 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:34:58,665 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:34:58,675 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-22 00:34:58,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-22 00:34:58,871 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 00:34:58,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:34:58,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1651816005, now seen corresponding path program 1 times [2022-11-22 00:34:58,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:34:58,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338816605] [2022-11-22 00:34:58,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:34:58,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:34:58,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:34:59,197 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 19 proven. 18 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-22 00:34:59,198 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:34:59,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338816605] [2022-11-22 00:34:59,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338816605] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:34:59,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486208614] [2022-11-22 00:34:59,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:34:59,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:34:59,198 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:34:59,200 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:34:59,206 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-22 00:34:59,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:34:59,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-22 00:34:59,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:34:59,455 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-22 00:34:59,455 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:34:59,621 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-22 00:34:59,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486208614] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:34:59,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1489803479] [2022-11-22 00:34:59,624 INFO L159 IcfgInterpreter]: Started Sifa with 58 locations of interest [2022-11-22 00:34:59,624 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 00:34:59,625 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 00:34:59,625 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 00:34:59,625 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 00:35:03,418 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events with input of size 103 for LOIs [2022-11-22 00:35:03,478 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events with input of size 111 for LOIs [2022-11-22 00:35:03,508 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels with input of size 111 for LOIs [2022-11-22 00:35:03,534 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread with input of size 38 for LOIs [2022-11-22 00:35:03,539 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads with input of size 119 for LOIs [2022-11-22 00:35:03,676 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 00:35:11,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1489803479] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:35:11,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:35:11,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [12, 3, 4] total 49 [2022-11-22 00:35:11,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922336893] [2022-11-22 00:35:11,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:35:11,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-22 00:35:11,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:35:11,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-22 00:35:11,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=2067, Unknown=0, NotChecked=0, Total=2352 [2022-11-22 00:35:11,842 INFO L87 Difference]: Start difference. First operand 3408 states and 4236 transitions. Second operand has 33 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 28 states have internal predecessors, (45), 6 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2022-11-22 00:35:16,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:35:16,816 INFO L93 Difference]: Finished difference Result 5927 states and 7386 transitions. [2022-11-22 00:35:16,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-22 00:35:16,816 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 28 states have internal predecessors, (45), 6 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) Word has length 99 [2022-11-22 00:35:16,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:35:16,827 INFO L225 Difference]: With dead ends: 5927 [2022-11-22 00:35:16,827 INFO L226 Difference]: Without dead ends: 3363 [2022-11-22 00:35:16,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 248 SyntacticMatches, 16 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1663 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=470, Invalid=3562, Unknown=0, NotChecked=0, Total=4032 [2022-11-22 00:35:16,834 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 116 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 2001 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 2048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 2001 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-22 00:35:16,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 709 Invalid, 2048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 2001 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-11-22 00:35:16,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3363 states. [2022-11-22 00:35:17,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3363 to 3123. [2022-11-22 00:35:17,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3123 states, 2407 states have (on average 1.2617366015787288) internal successors, (3037), 2413 states have internal predecessors, (3037), 415 states have call successors, (415), 295 states have call predecessors, (415), 295 states have return successors, (431), 415 states have call predecessors, (431), 415 states have call successors, (431) [2022-11-22 00:35:17,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 3883 transitions. [2022-11-22 00:35:17,178 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 3883 transitions. Word has length 99 [2022-11-22 00:35:17,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:35:17,178 INFO L495 AbstractCegarLoop]: Abstraction has 3123 states and 3883 transitions. [2022-11-22 00:35:17,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 28 states have internal predecessors, (45), 6 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2022-11-22 00:35:17,179 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 3883 transitions. [2022-11-22 00:35:17,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-11-22 00:35:17,182 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:35:17,182 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:35:17,200 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-22 00:35:17,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:35:17,388 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 00:35:17,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:35:17,389 INFO L85 PathProgramCache]: Analyzing trace with hash 94128976, now seen corresponding path program 1 times [2022-11-22 00:35:17,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:35:17,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617655944] [2022-11-22 00:35:17,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:35:17,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:35:17,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:35:17,502 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-22 00:35:17,502 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:35:17,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617655944] [2022-11-22 00:35:17,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617655944] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:35:17,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806467193] [2022-11-22 00:35:17,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:35:17,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:35:17,503 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:35:17,504 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:35:17,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-22 00:35:17,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:35:17,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-22 00:35:17,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:35:17,754 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-22 00:35:17,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:35:17,877 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-22 00:35:17,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806467193] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:35:17,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1005908697] [2022-11-22 00:35:17,881 INFO L159 IcfgInterpreter]: Started Sifa with 67 locations of interest [2022-11-22 00:35:17,882 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 00:35:17,883 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 00:35:17,883 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 00:35:17,883 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 00:35:21,709 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events with input of size 105 for LOIs [2022-11-22 00:35:21,727 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events with input of size 111 for LOIs [2022-11-22 00:35:21,747 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels with input of size 111 for LOIs [2022-11-22 00:35:21,766 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread with input of size 38 for LOIs [2022-11-22 00:35:21,770 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads with input of size 119 for LOIs [2022-11-22 00:35:22,182 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 00:35:33,040 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '142096#(and (= |ULTIMATE.start_read_data_~__retres3~0#1| ~data_0~0) (<= 0 ~data_0~0) (= ~C_1_pc~0 1) (< 2147483646 ~i~0) (= ~P_1_pc~0 1) (<= |ULTIMATE.start_eval_~tmp___2~0#1| 1) (= ~e~0 0) (<= ~data_0~0 65) (= |ULTIMATE.start_read_data_#in~i___0#1| ~num~0) (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1) (= |ULTIMATE.start_write_data_~i___0#1| 0) (= ~P_1_ev~0 0) (= |ULTIMATE.start_main_~count~0#1| 0) (= ~C_1_pr~0 0) (not (= |ULTIMATE.start_eval_~tmp___1~0#1| 0)) (= ~max_loop~0 2) (= 2 ~P_1_st~0) (= ~P_1_i~0 1) (= |ULTIMATE.start_write_data_#in~c#1| 65) (= |ULTIMATE.start_read_data_#res#1| |ULTIMATE.start_read_data_~__retres3~0#1|) (= |ULTIMATE.start_read_data_#res#1| |ULTIMATE.start_C_1_~c~1#1|) (= ~num~0 0) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_eval_~tmp___2~0#1|) (<= 0 ~timer~0) (= |ULTIMATE.start_read_data_#in~i___0#1| |ULTIMATE.start_read_data_~i___0#1|) (= ~C_1_ev~0 0) (<= |ULTIMATE.start_eval_~tmp___1~0#1| 2147483647) (<= 0 |#StackHeapBarrier|) (= ~data_1~0 0) (<= 0 (+ |ULTIMATE.start_eval_~tmp___1~0#1| 2147483648)) (= ~C_1_st~0 1) (= ~C_1_i~0 1) (= |#NULL.base| 0))' at error location [2022-11-22 00:35:33,040 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 00:35:33,040 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:35:33,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 2, 3] total 10 [2022-11-22 00:35:33,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638193370] [2022-11-22 00:35:33,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 00:35:33,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-22 00:35:33,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:35:33,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-22 00:35:33,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=2845, Unknown=0, NotChecked=0, Total=3192 [2022-11-22 00:35:33,043 INFO L87 Difference]: Start difference. First operand 3123 states and 3883 transitions. Second operand has 10 states, 10 states have (on average 18.3) internal successors, (183), 10 states have internal predecessors, (183), 7 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 7 states have call predecessors, (36), 7 states have call successors, (36) [2022-11-22 00:35:35,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:35:35,379 INFO L93 Difference]: Finished difference Result 18779 states and 23216 transitions. [2022-11-22 00:35:35,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-22 00:35:35,380 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 18.3) internal successors, (183), 10 states have internal predecessors, (183), 7 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 7 states have call predecessors, (36), 7 states have call successors, (36) Word has length 102 [2022-11-22 00:35:35,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:35:35,433 INFO L225 Difference]: With dead ends: 18779 [2022-11-22 00:35:35,434 INFO L226 Difference]: Without dead ends: 15662 [2022-11-22 00:35:35,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 262 SyntacticMatches, 8 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2785 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=715, Invalid=5765, Unknown=0, NotChecked=0, Total=6480 [2022-11-22 00:35:35,447 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 1511 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 487 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1519 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 1007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 487 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-22 00:35:35,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1519 Valid, 578 Invalid, 1007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [487 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-22 00:35:35,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15662 states. [2022-11-22 00:35:36,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15662 to 15637. [2022-11-22 00:35:36,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15637 states, 11717 states have (on average 1.2259964154647094) internal successors, (14365), 11723 states have internal predecessors, (14365), 2310 states have call successors, (2310), 1604 states have call predecessors, (2310), 1604 states have return successors, (2430), 2310 states have call predecessors, (2430), 2310 states have call successors, (2430) [2022-11-22 00:35:36,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15637 states to 15637 states and 19105 transitions. [2022-11-22 00:35:36,777 INFO L78 Accepts]: Start accepts. Automaton has 15637 states and 19105 transitions. Word has length 102 [2022-11-22 00:35:36,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:35:36,777 INFO L495 AbstractCegarLoop]: Abstraction has 15637 states and 19105 transitions. [2022-11-22 00:35:36,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.3) internal successors, (183), 10 states have internal predecessors, (183), 7 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 7 states have call predecessors, (36), 7 states have call successors, (36) [2022-11-22 00:35:36,778 INFO L276 IsEmpty]: Start isEmpty. Operand 15637 states and 19105 transitions. [2022-11-22 00:35:36,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-11-22 00:35:36,781 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:35:36,782 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:35:36,791 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-22 00:35:36,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2022-11-22 00:35:36,991 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 00:35:36,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:35:36,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1284965956, now seen corresponding path program 1 times [2022-11-22 00:35:36,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:35:36,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694693037] [2022-11-22 00:35:36,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:35:36,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:35:37,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:35:37,038 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-11-22 00:35:37,039 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:35:37,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694693037] [2022-11-22 00:35:37,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694693037] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:35:37,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:35:37,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 00:35:37,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850072557] [2022-11-22 00:35:37,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:35:37,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:35:37,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:35:37,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:35:37,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:35:37,041 INFO L87 Difference]: Start difference. First operand 15637 states and 19105 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 3 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-11-22 00:35:38,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:35:38,491 INFO L93 Difference]: Finished difference Result 25453 states and 31412 transitions. [2022-11-22 00:35:38,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 00:35:38,492 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 3 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 103 [2022-11-22 00:35:38,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:35:38,529 INFO L225 Difference]: With dead ends: 25453 [2022-11-22 00:35:38,530 INFO L226 Difference]: Without dead ends: 12230 [2022-11-22 00:35:38,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:35:38,554 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 170 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:35:38,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 256 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:35:38,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12230 states. [2022-11-22 00:35:39,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12230 to 11864. [2022-11-22 00:35:39,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11864 states, 8976 states have (on average 1.2144607843137254) internal successors, (10901), 8982 states have internal predecessors, (10901), 1696 states have call successors, (1696), 1186 states have call predecessors, (1696), 1186 states have return successors, (1696), 1696 states have call predecessors, (1696), 1696 states have call successors, (1696) [2022-11-22 00:35:39,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11864 states to 11864 states and 14293 transitions. [2022-11-22 00:35:39,999 INFO L78 Accepts]: Start accepts. Automaton has 11864 states and 14293 transitions. Word has length 103 [2022-11-22 00:35:39,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:35:39,999 INFO L495 AbstractCegarLoop]: Abstraction has 11864 states and 14293 transitions. [2022-11-22 00:35:40,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 3 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-11-22 00:35:40,000 INFO L276 IsEmpty]: Start isEmpty. Operand 11864 states and 14293 transitions. [2022-11-22 00:35:40,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-11-22 00:35:40,003 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:35:40,003 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:35:40,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-22 00:35:40,004 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 00:35:40,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:35:40,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1331966623, now seen corresponding path program 1 times [2022-11-22 00:35:40,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:35:40,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364692060] [2022-11-22 00:35:40,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:35:40,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:35:40,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:35:40,056 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-22 00:35:40,056 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:35:40,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364692060] [2022-11-22 00:35:40,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364692060] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:35:40,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:35:40,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 00:35:40,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260519589] [2022-11-22 00:35:40,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:35:40,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:35:40,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:35:40,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:35:40,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:35:40,059 INFO L87 Difference]: Start difference. First operand 11864 states and 14293 transitions. Second operand has 3 states, 2 states have (on average 31.5) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-22 00:35:41,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:35:41,352 INFO L93 Difference]: Finished difference Result 11864 states and 14293 transitions. [2022-11-22 00:35:41,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:35:41,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 31.5) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 104 [2022-11-22 00:35:41,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:35:41,386 INFO L225 Difference]: With dead ends: 11864 [2022-11-22 00:35:41,386 INFO L226 Difference]: Without dead ends: 11862 [2022-11-22 00:35:41,391 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 00:35:41,392 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 67 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 00:35:41,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 78 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 00:35:41,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11862 states. [2022-11-22 00:35:42,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11862 to 11754. [2022-11-22 00:35:42,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11754 states, 8868 states have (on average 1.205232295895354) internal successors, (10688), 8872 states have internal predecessors, (10688), 1696 states have call successors, (1696), 1186 states have call predecessors, (1696), 1186 states have return successors, (1696), 1696 states have call predecessors, (1696), 1696 states have call successors, (1696) [2022-11-22 00:35:42,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11754 states to 11754 states and 14080 transitions. [2022-11-22 00:35:42,762 INFO L78 Accepts]: Start accepts. Automaton has 11754 states and 14080 transitions. Word has length 104 [2022-11-22 00:35:42,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:35:42,762 INFO L495 AbstractCegarLoop]: Abstraction has 11754 states and 14080 transitions. [2022-11-22 00:35:42,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 31.5) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-22 00:35:42,763 INFO L276 IsEmpty]: Start isEmpty. Operand 11754 states and 14080 transitions. [2022-11-22 00:35:42,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-11-22 00:35:42,766 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:35:42,766 INFO L195 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:35:42,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-22 00:35:42,767 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 00:35:42,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:35:42,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1583546344, now seen corresponding path program 1 times [2022-11-22 00:35:42,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:35:42,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450503795] [2022-11-22 00:35:42,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:35:42,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:35:42,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:35:43,116 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 30 proven. 20 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-22 00:35:43,116 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:35:43,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450503795] [2022-11-22 00:35:43,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450503795] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:35:43,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883227531] [2022-11-22 00:35:43,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:35:43,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:35:43,118 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:35:43,119 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:35:43,124 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-22 00:35:43,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:35:43,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-22 00:35:43,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:35:43,421 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 67 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-22 00:35:43,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:35:43,594 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 34 proven. 1 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-11-22 00:35:43,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883227531] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:35:43,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1003325793] [2022-11-22 00:35:43,597 INFO L159 IcfgInterpreter]: Started Sifa with 57 locations of interest [2022-11-22 00:35:43,597 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 00:35:43,598 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 00:35:43,598 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 00:35:43,598 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 00:35:46,645 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events with input of size 107 for LOIs [2022-11-22 00:35:46,683 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events with input of size 115 for LOIs [2022-11-22 00:35:46,715 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels with input of size 115 for LOIs [2022-11-22 00:35:46,743 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread with input of size 42 for LOIs [2022-11-22 00:35:46,751 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads with input of size 123 for LOIs [2022-11-22 00:35:46,898 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 00:35:54,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1003325793] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:35:54,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:35:54,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [12, 4, 5] total 47 [2022-11-22 00:35:54,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071146623] [2022-11-22 00:35:54,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:35:54,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-22 00:35:54,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:35:54,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-22 00:35:54,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=1857, Unknown=0, NotChecked=0, Total=2162 [2022-11-22 00:35:54,472 INFO L87 Difference]: Start difference. First operand 11754 states and 14080 transitions. Second operand has 34 states, 29 states have (on average 1.5172413793103448) internal successors, (44), 29 states have internal predecessors, (44), 6 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2022-11-22 00:35:58,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:35:58,328 INFO L93 Difference]: Finished difference Result 12040 states and 14408 transitions. [2022-11-22 00:35:58,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-11-22 00:35:58,329 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 29 states have (on average 1.5172413793103448) internal successors, (44), 29 states have internal predecessors, (44), 6 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) Word has length 107 [2022-11-22 00:35:58,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:35:58,362 INFO L225 Difference]: With dead ends: 12040 [2022-11-22 00:35:58,362 INFO L226 Difference]: Without dead ends: 12039 [2022-11-22 00:35:58,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 277 SyntacticMatches, 13 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1172 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=518, Invalid=3264, Unknown=0, NotChecked=0, Total=3782 [2022-11-22 00:35:58,367 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 198 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 1142 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 1217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:35:58,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 320 Invalid, 1217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1142 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-22 00:35:58,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12039 states. [2022-11-22 00:35:59,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12039 to 11948. [2022-11-22 00:35:59,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11948 states, 9010 states have (on average 1.204328523862375) internal successors, (10851), 9014 states have internal predecessors, (10851), 1726 states have call successors, (1726), 1208 states have call predecessors, (1726), 1208 states have return successors, (1726), 1726 states have call predecessors, (1726), 1726 states have call successors, (1726) [2022-11-22 00:35:59,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11948 states to 11948 states and 14303 transitions. [2022-11-22 00:35:59,597 INFO L78 Accepts]: Start accepts. Automaton has 11948 states and 14303 transitions. Word has length 107 [2022-11-22 00:35:59,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:35:59,597 INFO L495 AbstractCegarLoop]: Abstraction has 11948 states and 14303 transitions. [2022-11-22 00:35:59,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 29 states have (on average 1.5172413793103448) internal successors, (44), 29 states have internal predecessors, (44), 6 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2022-11-22 00:35:59,598 INFO L276 IsEmpty]: Start isEmpty. Operand 11948 states and 14303 transitions. [2022-11-22 00:35:59,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-11-22 00:35:59,602 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:35:59,602 INFO L195 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:35:59,614 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-22 00:35:59,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:35:59,814 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 00:35:59,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:35:59,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1502874298, now seen corresponding path program 1 times [2022-11-22 00:35:59,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:35:59,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859752004] [2022-11-22 00:35:59,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:35:59,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:35:59,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:36:00,177 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 30 proven. 20 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-22 00:36:00,177 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:36:00,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859752004] [2022-11-22 00:36:00,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859752004] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:36:00,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627769523] [2022-11-22 00:36:00,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:36:00,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:36:00,177 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:36:00,179 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:36:00,192 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-22 00:36:00,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:36:00,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-22 00:36:00,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:36:00,444 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-22 00:36:00,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:36:00,597 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-11-22 00:36:00,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627769523] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:36:00,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1087257159] [2022-11-22 00:36:00,599 INFO L159 IcfgInterpreter]: Started Sifa with 58 locations of interest [2022-11-22 00:36:00,599 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 00:36:00,600 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 00:36:00,600 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 00:36:00,600 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 00:36:03,812 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events with input of size 103 for LOIs [2022-11-22 00:36:03,838 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events with input of size 111 for LOIs [2022-11-22 00:36:03,863 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels with input of size 111 for LOIs [2022-11-22 00:36:03,890 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread with input of size 38 for LOIs [2022-11-22 00:36:03,896 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads with input of size 119 for LOIs [2022-11-22 00:36:04,029 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 00:36:12,918 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '316504#(and (<= 0 ~data_0~0) (<= 0 ~P_1_ev~0) (<= |ULTIMATE.start_eval_~tmp___2~0#1| 1) (< 2147483648 ~num~0) (= ~i~0 0) (<= ~e~0 0) (<= 0 ~e~0) (<= 2 ~max_loop~0) (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1) (<= |#NULL.offset| 0) (<= ~max_loop~0 2) (<= 1 ~P_1_i~0) (= |ULTIMATE.start_main_~count~0#1| 0) (<= ~timer~0 0) (<= ~C_1_i~0 1) (<= ~P_1_ev~0 0) (= ~C_1_pr~0 0) (not (= |ULTIMATE.start_eval_~tmp___1~0#1| 0)) (<= ~C_1_ev~0 0) (= ~C_1_pc~0 0) (<= 0 ~data_1~0) (<= 0 ~C_1_ev~0) (<= 0 ~P_1_pc~0) (<= 0 |ULTIMATE.start_eval_~tmp___2~0#1|) (<= 0 ~timer~0) (<= 0 |#NULL.offset|) (<= ~P_1_i~0 1) (<= |ULTIMATE.start_eval_~tmp___1~0#1| 2147483647) (<= 0 |#StackHeapBarrier|) (<= 0 (+ |ULTIMATE.start_eval_~tmp___1~0#1| 2147483648)) (<= 1 ~C_1_i~0) (= ~C_1_st~0 1) (= |#NULL.base| 0))' at error location [2022-11-22 00:36:12,918 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 00:36:12,919 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:36:12,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 3, 4] total 18 [2022-11-22 00:36:12,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035624677] [2022-11-22 00:36:12,919 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 00:36:12,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-22 00:36:12,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:36:12,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-22 00:36:12,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=2272, Unknown=0, NotChecked=0, Total=2550 [2022-11-22 00:36:12,921 INFO L87 Difference]: Start difference. First operand 11948 states and 14303 transitions. Second operand has 18 states, 16 states have (on average 12.0) internal successors, (192), 16 states have internal predecessors, (192), 9 states have call successors, (38), 5 states have call predecessors, (38), 7 states have return successors, (39), 11 states have call predecessors, (39), 9 states have call successors, (39) [2022-11-22 00:36:16,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:36:16,908 INFO L93 Difference]: Finished difference Result 29610 states and 36443 transitions. [2022-11-22 00:36:16,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2022-11-22 00:36:16,908 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 12.0) internal successors, (192), 16 states have internal predecessors, (192), 9 states have call successors, (38), 5 states have call predecessors, (38), 7 states have return successors, (39), 11 states have call predecessors, (39), 9 states have call successors, (39) Word has length 108 [2022-11-22 00:36:16,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:36:16,954 INFO L225 Difference]: With dead ends: 29610 [2022-11-22 00:36:16,955 INFO L226 Difference]: Without dead ends: 17654 [2022-11-22 00:36:16,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 282 SyntacticMatches, 17 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7865 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=1947, Invalid=15875, Unknown=0, NotChecked=0, Total=17822 [2022-11-22 00:36:16,988 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 1941 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 1135 mSolverCounterSat, 569 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1941 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 1704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 569 IncrementalHoareTripleChecker+Valid, 1135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-22 00:36:16,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1941 Valid, 810 Invalid, 1704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [569 Valid, 1135 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-22 00:36:17,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17654 states. [2022-11-22 00:36:18,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17654 to 14180. [2022-11-22 00:36:18,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14180 states, 11063 states have (on average 1.2200126547952634) internal successors, (13497), 11065 states have internal predecessors, (13497), 1772 states have call successors, (1772), 1342 states have call predecessors, (1772), 1342 states have return successors, (1772), 1772 states have call predecessors, (1772), 1772 states have call successors, (1772) [2022-11-22 00:36:18,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14180 states to 14180 states and 17041 transitions. [2022-11-22 00:36:18,274 INFO L78 Accepts]: Start accepts. Automaton has 14180 states and 17041 transitions. Word has length 108 [2022-11-22 00:36:18,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:36:18,275 INFO L495 AbstractCegarLoop]: Abstraction has 14180 states and 17041 transitions. [2022-11-22 00:36:18,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 12.0) internal successors, (192), 16 states have internal predecessors, (192), 9 states have call successors, (38), 5 states have call predecessors, (38), 7 states have return successors, (39), 11 states have call predecessors, (39), 9 states have call successors, (39) [2022-11-22 00:36:18,275 INFO L276 IsEmpty]: Start isEmpty. Operand 14180 states and 17041 transitions. [2022-11-22 00:36:18,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2022-11-22 00:36:18,303 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:36:18,304 INFO L195 NwaCegarLoop]: trace histogram [18, 10, 10, 10, 10, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:36:18,315 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-22 00:36:18,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:36:18,510 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 00:36:18,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:36:18,511 INFO L85 PathProgramCache]: Analyzing trace with hash -2135072933, now seen corresponding path program 1 times [2022-11-22 00:36:18,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:36:18,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063826597] [2022-11-22 00:36:18,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:36:18,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:36:18,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:36:18,797 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 208 proven. 45 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2022-11-22 00:36:18,797 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:36:18,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063826597] [2022-11-22 00:36:18,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063826597] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:36:18,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395128132] [2022-11-22 00:36:18,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:36:18,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:36:18,798 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:36:18,807 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:36:18,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-22 00:36:18,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:36:18,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 813 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-22 00:36:18,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:36:19,131 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 485 proven. 1 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2022-11-22 00:36:19,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:36:19,352 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 214 proven. 1 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2022-11-22 00:36:19,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395128132] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:36:19,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [130243836] [2022-11-22 00:36:19,354 INFO L159 IcfgInterpreter]: Started Sifa with 60 locations of interest [2022-11-22 00:36:19,354 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 00:36:19,355 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 00:36:19,355 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 00:36:19,355 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 00:36:22,227 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events with input of size 105 for LOIs [2022-11-22 00:36:22,244 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events with input of size 111 for LOIs [2022-11-22 00:36:22,262 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels with input of size 111 for LOIs [2022-11-22 00:36:22,283 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread with input of size 38 for LOIs [2022-11-22 00:36:22,286 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads with input of size 119 for LOIs [2022-11-22 00:36:22,428 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 00:36:32,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [130243836] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:36:32,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:36:32,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [5, 4, 5] total 48 [2022-11-22 00:36:32,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398502472] [2022-11-22 00:36:32,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:36:32,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-22 00:36:32,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:36:32,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-22 00:36:32,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=316, Invalid=1940, Unknown=0, NotChecked=0, Total=2256 [2022-11-22 00:36:32,239 INFO L87 Difference]: Start difference. First operand 14180 states and 17041 transitions. Second operand has 41 states, 35 states have (on average 1.4) internal successors, (49), 35 states have internal predecessors, (49), 7 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 9 states have call predecessors, (11), 7 states have call successors, (11) [2022-11-22 00:36:49,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:36:49,584 INFO L93 Difference]: Finished difference Result 33082 states and 39661 transitions. [2022-11-22 00:36:49,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2022-11-22 00:36:49,585 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 35 states have (on average 1.4) internal successors, (49), 35 states have internal predecessors, (49), 7 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 9 states have call predecessors, (11), 7 states have call successors, (11) Word has length 274 [2022-11-22 00:36:49,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:36:49,625 INFO L225 Difference]: With dead ends: 33082 [2022-11-22 00:36:49,625 INFO L226 Difference]: Without dead ends: 21569 [2022-11-22 00:36:49,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 887 GetRequests, 765 SyntacticMatches, 14 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4035 ImplicationChecksByTransitivity, 22.4s TimeCoverageRelationStatistics Valid=1245, Invalid=10745, Unknown=0, NotChecked=0, Total=11990 [2022-11-22 00:36:49,652 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 534 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 2617 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 2815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 2617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-22 00:36:49,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 491 Invalid, 2815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 2617 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-11-22 00:36:49,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21569 states. [2022-11-22 00:36:51,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21569 to 20274. [2022-11-22 00:36:51,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20274 states, 15801 states have (on average 1.2210619581039175) internal successors, (19294), 15803 states have internal predecessors, (19294), 2528 states have call successors, (2528), 1942 states have call predecessors, (2528), 1942 states have return successors, (2528), 2528 states have call predecessors, (2528), 2528 states have call successors, (2528) [2022-11-22 00:36:51,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20274 states to 20274 states and 24350 transitions. [2022-11-22 00:36:51,970 INFO L78 Accepts]: Start accepts. Automaton has 20274 states and 24350 transitions. Word has length 274 [2022-11-22 00:36:51,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:36:51,971 INFO L495 AbstractCegarLoop]: Abstraction has 20274 states and 24350 transitions. [2022-11-22 00:36:51,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 35 states have (on average 1.4) internal successors, (49), 35 states have internal predecessors, (49), 7 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 9 states have call predecessors, (11), 7 states have call successors, (11) [2022-11-22 00:36:51,971 INFO L276 IsEmpty]: Start isEmpty. Operand 20274 states and 24350 transitions. [2022-11-22 00:36:52,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2022-11-22 00:36:52,006 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:36:52,006 INFO L195 NwaCegarLoop]: trace histogram [18, 10, 10, 10, 10, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:36:52,018 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-22 00:36:52,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-22 00:36:52,213 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 00:36:52,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:36:52,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1762697529, now seen corresponding path program 1 times [2022-11-22 00:36:52,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:36:52,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701878091] [2022-11-22 00:36:52,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:36:52,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:36:52,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:36:52,386 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 816 trivial. 0 not checked. [2022-11-22 00:36:52,387 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:36:52,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701878091] [2022-11-22 00:36:52,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701878091] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:36:52,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:36:52,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:36:52,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936368009] [2022-11-22 00:36:52,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:36:52,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:36:52,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:36:52,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:36:52,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:36:52,390 INFO L87 Difference]: Start difference. First operand 20274 states and 24350 transitions. Second operand has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2022-11-22 00:36:54,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:36:54,327 INFO L93 Difference]: Finished difference Result 21209 states and 25473 transitions. [2022-11-22 00:36:54,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 00:36:54,327 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 275 [2022-11-22 00:36:54,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:36:54,374 INFO L225 Difference]: With dead ends: 21209 [2022-11-22 00:36:54,374 INFO L226 Difference]: Without dead ends: 21208 [2022-11-22 00:36:54,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:36:54,381 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 101 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:36:54,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 231 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:36:54,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21208 states. [2022-11-22 00:36:55,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21208 to 5643. [2022-11-22 00:36:55,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5643 states, 4457 states have (on average 1.2140453219654477) internal successors, (5411), 4458 states have internal predecessors, (5411), 668 states have call successors, (668), 516 states have call predecessors, (668), 516 states have return successors, (668), 668 states have call predecessors, (668), 668 states have call successors, (668) [2022-11-22 00:36:55,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5643 states to 5643 states and 6747 transitions. [2022-11-22 00:36:55,344 INFO L78 Accepts]: Start accepts. Automaton has 5643 states and 6747 transitions. Word has length 275 [2022-11-22 00:36:55,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:36:55,345 INFO L495 AbstractCegarLoop]: Abstraction has 5643 states and 6747 transitions. [2022-11-22 00:36:55,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2022-11-22 00:36:55,346 INFO L276 IsEmpty]: Start isEmpty. Operand 5643 states and 6747 transitions. [2022-11-22 00:36:55,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2022-11-22 00:36:55,361 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:36:55,361 INFO L195 NwaCegarLoop]: trace histogram [17, 9, 9, 9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:36:55,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-22 00:36:55,362 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 00:36:55,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:36:55,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1894867230, now seen corresponding path program 1 times [2022-11-22 00:36:55,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:36:55,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294546679] [2022-11-22 00:36:55,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:36:55,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:36:55,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:36:55,559 INFO L134 CoverageAnalysis]: Checked inductivity of 730 backedges. 92 proven. 15 refuted. 0 times theorem prover too weak. 623 trivial. 0 not checked. [2022-11-22 00:36:55,559 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:36:55,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294546679] [2022-11-22 00:36:55,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294546679] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:36:55,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844581012] [2022-11-22 00:36:55,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:36:55,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:36:55,560 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:36:55,561 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:36:55,572 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-22 00:36:55,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:36:55,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 798 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-22 00:36:55,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:36:56,249 INFO L134 CoverageAnalysis]: Checked inductivity of 730 backedges. 580 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-22 00:36:56,249 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:36:56,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844581012] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:36:56,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 00:36:56,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2022-11-22 00:36:56,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651336565] [2022-11-22 00:36:56,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:36:56,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 00:36:56,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:36:56,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 00:36:56,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-22 00:36:56,252 INFO L87 Difference]: Start difference. First operand 5643 states and 6747 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 4 states have internal predecessors, (155), 4 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26) [2022-11-22 00:36:56,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:36:56,898 INFO L93 Difference]: Finished difference Result 6885 states and 8226 transitions. [2022-11-22 00:36:56,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 00:36:56,898 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 4 states have internal predecessors, (155), 4 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26) Word has length 278 [2022-11-22 00:36:56,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:36:56,899 INFO L225 Difference]: With dead ends: 6885 [2022-11-22 00:36:56,900 INFO L226 Difference]: Without dead ends: 0 [2022-11-22 00:36:56,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-22 00:36:56,905 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 100 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:36:56,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 298 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:36:56,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-22 00:36:56,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-22 00:36:56,906 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 00:36:56,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-22 00:36:56,907 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 278 [2022-11-22 00:36:56,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:36:56,908 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-22 00:36:56,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 4 states have internal predecessors, (155), 4 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26) [2022-11-22 00:36:56,908 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-22 00:36:56,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-22 00:36:56,911 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-11-22 00:36:56,911 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-11-22 00:36:56,911 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-11-22 00:36:56,911 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-11-22 00:36:56,912 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-11-22 00:36:56,912 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-11-22 00:36:56,912 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-11-22 00:36:56,912 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-11-22 00:36:56,917 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-22 00:36:57,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-22 00:36:57,114 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-22 00:37:35,896 WARN L233 SmtUtils]: Spent 25.51s on a formula simplification. DAG size of input: 1586 DAG size of output: 1430 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-22 00:38:03,792 WARN L233 SmtUtils]: Spent 25.46s on a formula simplification. DAG size of input: 1586 DAG size of output: 1430 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-22 00:38:53,525 WARN L233 SmtUtils]: Spent 17.47s on a formula simplification. DAG size of input: 1430 DAG size of output: 103 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-22 00:39:14,138 WARN L233 SmtUtils]: Spent 17.72s on a formula simplification. DAG size of input: 1430 DAG size of output: 103 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-22 00:39:22,751 WARN L233 SmtUtils]: Spent 5.57s on a formula simplification. DAG size of input: 1887 DAG size of output: 1 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-22 00:39:22,755 INFO L899 garLoopResultBuilder]: For program point L118(lines 118 123) no Hoare annotation was computed. [2022-11-22 00:39:22,755 INFO L899 garLoopResultBuilder]: For program point L209-1(lines 209 218) no Hoare annotation was computed. [2022-11-22 00:39:22,756 INFO L899 garLoopResultBuilder]: For program point L210(lines 210 215) no Hoare annotation was computed. [2022-11-22 00:39:22,763 INFO L895 garLoopResultBuilder]: At program point L128(lines 116 130) the Hoare annotation is: (let ((.cse32 (= ~C_1_st~0 |old(~C_1_st~0)|)) (.cse33 (= |old(~P_1_st~0)| ~P_1_st~0))) (let ((.cse4 (not (= 2 ~C_1_pc~0))) (.cse6 (not (<= 0 ~num~0))) (.cse31 (not (<= 0 ~P_1_pc~0))) (.cse35 (not (<= 0 ~e~0))) (.cse36 (not (= ~data_0~0 0))) (.cse17 (not (= ~C_1_pr~0 0))) (.cse18 (not (= |#NULL.offset| 0))) (.cse19 (not (= ~data_1~0 0))) (.cse20 (not (= ~P_1_ev~0 0))) (.cse21 (not (= ~e~0 0))) (.cse22 (not (<= 0 ~data_0~0))) (.cse23 (not (= |#NULL.base| 0))) (.cse24 (not (= ~C_1_ev~0 0))) (.cse25 (not (= ~max_loop~0 2))) (.cse27 (not (<= 0 |#StackHeapBarrier|))) (.cse28 (not (<= 0 ~timer~0))) (.cse26 (= |activate_threads_is_P_1_triggered_~__retres1~0#1| 0)) (.cse0 (not (<= 1 ~i~0))) (.cse14 (not (<= ~P_1_pc~0 0))) (.cse8 (not (<= ~i~0 1))) (.cse2 (and .cse32 .cse33)) (.cse5 (not (<= ~max_loop~0 2))) (.cse15 (not (<= 2 ~i~0))) (.cse34 (not (= ~num~0 0))) (.cse13 (not (<= 1 ~P_1_pc~0))) (.cse1 (not (= ~C_1_i~0 1))) (.cse3 (not (<= 1 ~C_1_pc~0))) (.cse29 (not (= ~C_1_pc~0 1))) (.cse16 (not (< ~i~0 2147483646))) (.cse7 (not (<= 0 ~i~0))) (.cse9 (not (= ~P_1_i~0 1))) (.cse10 (not (= ~P_1_pc~0 1))) (.cse11 (not (<= ~e~0 0))) (.cse30 (not (<= 1 ~num~0))) (.cse12 (not (< ~num~0 2147483648)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse1 .cse2 .cse4 .cse14 .cse5 (not (<= ~num~0 0)) .cse15 .cse6 .cse16 .cse9 .cse11) (or .cse17 .cse18 .cse19 .cse0 .cse1 .cse3 .cse20 .cse4 .cse21 .cse22 .cse6 .cse7 .cse23 .cse24 .cse8 .cse9 .cse10 .cse25 .cse26 .cse27 .cse12 .cse13 .cse28) (or .cse17 .cse18 .cse19 .cse0 .cse1 .cse3 .cse20 .cse29 .cse21 .cse22 .cse7 .cse23 .cse24 .cse8 .cse9 .cse10 .cse25 .cse26 .cse27 .cse30 .cse12 .cse28) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse6 .cse7 (not (<= ~i~0 2147483646)) .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse17 .cse18 .cse19 .cse1 .cse3 .cse20 .cse4 .cse21 .cse22 .cse15 .cse6 .cse16 .cse7 .cse23 .cse24 .cse9 .cse10 .cse25 .cse26 .cse27 .cse12 .cse13 .cse28) (or (not (= |old(~P_1_st~0)| 0)) .cse18 .cse19 .cse1 .cse31 (not (<= 0 ~C_1_pr~0)) (and .cse32 .cse33 .cse26) .cse14 (not (<= ~C_1_pc~0 0)) (not (<= 0 ~P_1_ev~0)) (not (= ~timer~0 0)) (not (<= 0 |#NULL.base|)) .cse9 .cse11 .cse25 (not (<= ~C_1_pr~0 0)) .cse27 (not (<= 0 ~C_1_pc~0)) (not (<= 0 ~C_1_ev~0)) (not (<= ~P_1_ev~0 0)) .cse34 .cse35 .cse36 (not (<= |#NULL.base| 0)) (not (<= ~C_1_ev~0 0)) (not (= |old(~C_1_st~0)| 0)) (not (= ~i~0 0))) (or .cse0 .cse1 .cse2 .cse3 .cse29 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse30 .cse12) (or .cse17 .cse18 .cse19 .cse0 .cse1 .cse31 .cse3 .cse20 .cse14 .cse29 .cse7 .cse23 .cse24 .cse8 .cse9 .cse11 .cse25 .cse26 .cse27 .cse34 .cse35 .cse36 .cse28) (or (and (or .cse17 .cse18 .cse19 .cse1 .cse3 .cse20 .cse29 .cse21 .cse22 .cse16 .cse7 .cse23 .cse24 .cse9 .cse10 .cse25 .cse27 .cse30 .cse12 .cse28) (or .cse17 .cse18 .cse19 .cse1 .cse3 .cse20 .cse29 .cse21 .cse22 .cse16 .cse23 .cse24 .cse9 .cse10 .cse25 .cse27 .cse34 .cse13 .cse28)) .cse15 .cse26) (or .cse0 .cse1 .cse2 .cse3 .cse14 .cse29 .cse5 .cse7 .cse8 .cse9 .cse11 .cse34) (or .cse2 .cse5 .cse15 (and (or .cse1 .cse3 .cse29 .cse16 .cse9 .cse10 .cse11 .cse34 .cse13) (or .cse1 .cse3 .cse29 .cse16 .cse7 .cse9 .cse10 .cse11 .cse30 .cse12)))))) [2022-11-22 00:39:22,763 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 208) no Hoare annotation was computed. [2022-11-22 00:39:22,763 INFO L899 garLoopResultBuilder]: For program point L199-2(lines 198 222) no Hoare annotation was computed. [2022-11-22 00:39:22,764 INFO L895 garLoopResultBuilder]: At program point L220(lines 198 222) the Hoare annotation is: (let ((.cse35 (= |old(~P_1_st~0)| ~P_1_st~0))) (let ((.cse49 (<= 0 ~i~0)) (.cse48 (<= 1 ~P_1_pc~0)) (.cse50 (<= 1 ~C_1_pc~0)) (.cse36 (<= |activate_threads_~tmp~1#1| 0)) (.cse40 (<= 0 |activate_threads_~tmp~1#1|)) (.cse37 (= |activate_threads_is_P_1_triggered_~__retres1~0#1| 0)) (.cse39 (= |activate_threads_is_P_1_triggered_~__retres1~0#1| |activate_threads_is_P_1_triggered_#res#1|)) (.cse34 (= ~C_1_st~0 |old(~C_1_st~0)|)) (.cse47 (or (= ~P_1_st~0 0) .cse35)) (.cse38 (= |activate_threads_is_C_1_triggered_~__retres1~1#1| 0))) (let ((.cse0 (and .cse34 .cse47 .cse38)) (.cse27 (and (= |activate_threads_~tmp~1#1| |activate_threads_is_P_1_triggered_#res#1|) .cse35 .cse37 .cse39)) (.cse33 (not (<= ~i~0 2147483646))) (.cse41 (not (<= 0 ~P_1_pc~0))) (.cse43 (not (<= 0 ~e~0))) (.cse44 (not (= ~data_0~0 0))) (.cse13 (not (<= 1 ~num~0))) (.cse18 (not (= ~C_1_pr~0 0))) (.cse19 (not (= |#NULL.offset| 0))) (.cse20 (not (= ~data_1~0 0))) (.cse21 (not (= ~P_1_ev~0 0))) (.cse5 (not (= ~C_1_pc~0 1))) (.cse23 (not (= ~e~0 0))) (.cse24 (not (<= 0 ~data_0~0))) (.cse26 (not (= |#NULL.base| 0))) (.cse28 (not (= ~C_1_ev~0 0))) (.cse29 (not (= ~max_loop~0 2))) (.cse30 (not (<= 0 |#StackHeapBarrier|))) (.cse11 (not (= ~num~0 0))) (.cse31 (not (<= 0 ~timer~0))) (.cse46 (and .cse35 .cse36 .cse37 .cse39 .cse40)) (.cse32 (and .cse49 .cse34 .cse48 .cse47 .cse50)) (.cse1 (not (<= 1 ~i~0))) (.cse3 (not .cse50)) (.cse7 (not .cse49)) (.cse8 (not (<= ~i~0 1))) (.cse12 (not (= ~P_1_pc~0 1))) (.cse42 (not (<= ~P_1_ev~0 0))) (.cse14 (not (< ~num~0 2147483648))) (.cse45 (not (<= ~C_1_ev~0 0))) (.cse17 (not .cse48)) (.cse2 (not (= ~C_1_i~0 1))) (.cse22 (not (= 2 ~C_1_pc~0))) (.cse4 (not (<= ~P_1_pc~0 0))) (.cse6 (not (<= ~max_loop~0 2))) (.cse15 (not (<= 2 ~i~0))) (.cse25 (not (<= 0 ~num~0))) (.cse16 (not (< ~i~0 2147483646))) (.cse9 (not (= ~P_1_i~0 1))) (.cse10 (not (<= ~e~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse10 .cse13 .cse14) (or .cse0 .cse6 .cse15 (and (or .cse2 .cse3 .cse5 .cse16 .cse9 .cse12 .cse10 .cse11 .cse17) (or .cse2 .cse3 .cse5 .cse16 .cse7 .cse9 .cse12 .cse10 .cse13 .cse14))) (or .cse18 .cse19 .cse20 .cse1 .cse2 .cse3 .cse21 .cse22 .cse23 .cse24 .cse25 .cse7 .cse26 .cse27 .cse28 .cse8 .cse9 .cse12 .cse29 .cse30 .cse14 .cse17 .cse31) (or .cse2 .cse32 .cse3 .cse22 .cse6 .cse15 .cse25 .cse7 .cse33 .cse9 .cse12 .cse10 .cse14 .cse17) (or (not (= |old(~P_1_st~0)| 0)) .cse19 .cse20 (and .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40) .cse2 .cse41 (not (<= 0 ~C_1_pr~0)) .cse4 (not (<= ~C_1_pc~0 0)) (not (<= 0 ~P_1_ev~0)) (not (= ~timer~0 0)) (not (<= 0 |#NULL.base|)) .cse9 .cse10 .cse29 (not (<= ~C_1_pr~0 0)) .cse30 (not (<= 0 ~C_1_pc~0)) (not (<= 0 ~C_1_ev~0)) .cse42 .cse11 .cse43 .cse44 (not (<= |#NULL.base| 0)) .cse45 (not (= |old(~C_1_st~0)| 0)) (not (= ~i~0 0))) (or .cse18 .cse19 .cse20 .cse2 .cse3 .cse21 .cse22 .cse23 .cse24 .cse15 .cse25 .cse16 .cse7 .cse26 .cse27 .cse28 .cse9 .cse12 .cse29 .cse30 .cse14 .cse17 .cse31) (or .cse18 .cse19 .cse20 .cse1 .cse2 .cse3 .cse21 .cse5 .cse23 .cse24 .cse7 .cse26 .cse28 .cse8 .cse9 .cse12 .cse29 .cse30 .cse46 .cse13 .cse14 .cse31) (or .cse2 .cse3 .cse22 .cse6 .cse15 .cse25 .cse7 .cse33 .cse9 .cse12 .cse10 .cse42 .cse14 .cse45 .cse38 .cse17) (or .cse18 .cse19 .cse20 .cse1 .cse2 .cse41 .cse3 .cse21 .cse4 .cse5 .cse7 .cse26 .cse28 .cse8 .cse9 .cse10 .cse29 .cse30 .cse46 .cse11 .cse43 .cse44 .cse31) (or (and (or .cse18 .cse19 .cse20 .cse2 .cse3 .cse21 .cse5 .cse23 .cse24 .cse16 .cse7 .cse26 .cse28 .cse9 .cse12 .cse29 .cse30 .cse13 .cse14 .cse31) (or .cse18 .cse19 .cse20 .cse2 .cse3 .cse21 .cse5 .cse23 .cse24 .cse16 .cse26 .cse28 .cse9 .cse12 .cse29 .cse30 .cse11 .cse17 .cse31)) .cse15 .cse46) (or .cse1 .cse2 .cse32 .cse3 .cse22 .cse6 .cse25 .cse7 .cse8 .cse9 .cse12 .cse10 .cse14 .cse17) (or .cse1 .cse2 .cse3 .cse22 .cse6 .cse25 .cse7 .cse8 .cse9 .cse12 .cse10 .cse42 .cse14 .cse45 .cse38 .cse17) (or (and .cse34 .cse47) .cse2 .cse22 .cse4 .cse6 (not (<= ~num~0 0)) .cse15 .cse25 .cse16 .cse9 .cse10))))) [2022-11-22 00:39:22,764 INFO L899 garLoopResultBuilder]: For program point L117(lines 117 126) no Hoare annotation was computed. [2022-11-22 00:39:22,764 INFO L899 garLoopResultBuilder]: For program point L117-2(lines 117 126) no Hoare annotation was computed. [2022-11-22 00:39:22,765 INFO L895 garLoopResultBuilder]: At program point activate_threadsENTRY(lines 374 399) the Hoare annotation is: (let ((.cse4 (not (= 2 ~C_1_pc~0))) (.cse6 (not (<= 0 ~num~0))) (.cse13 (not (<= 1 ~P_1_pc~0))) (.cse3 (not (<= 1 ~C_1_pc~0))) (.cse17 (not (< ~i~0 2147483646))) (.cse7 (not (<= 0 ~i~0))) (.cse10 (not (= ~P_1_pc~0 1))) (.cse19 (not (<= 1 ~num~0))) (.cse12 (not (< ~num~0 2147483648))) (.cse16 (not (<= 2 ~i~0))) (.cse0 (not (<= 1 ~i~0))) (.cse1 (not (= ~C_1_i~0 1))) (.cse2 (and (= ~C_1_st~0 |old(~C_1_st~0)|) (= |old(~P_1_st~0)| ~P_1_st~0))) (.cse14 (not (<= ~P_1_pc~0 0))) (.cse18 (not (= ~C_1_pc~0 1))) (.cse5 (not (<= ~max_loop~0 2))) (.cse8 (not (<= ~i~0 1))) (.cse9 (not (= ~P_1_i~0 1))) (.cse11 (not (<= ~e~0 0))) (.cse15 (not (= ~num~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or (not (= |old(~P_1_st~0)| 0)) (not (= |#NULL.offset| 0)) (not (= ~data_1~0 0)) .cse1 (not (<= 0 ~P_1_pc~0)) .cse2 (not (<= 0 ~C_1_pr~0)) .cse14 (not (<= ~C_1_pc~0 0)) (not (<= 0 ~P_1_ev~0)) (not (= ~timer~0 0)) (not (<= 0 |#NULL.base|)) .cse9 .cse11 (not (= ~max_loop~0 2)) (not (<= ~C_1_pr~0 0)) (not (<= 0 |#StackHeapBarrier|)) (not (<= 0 ~C_1_pc~0)) (not (<= 0 ~C_1_ev~0)) (not (<= ~P_1_ev~0 0)) .cse15 (not (<= 0 ~e~0)) (not (= ~data_0~0 0)) (not (<= |#NULL.base| 0)) (not (<= ~C_1_ev~0 0)) (not (= |old(~C_1_st~0)| 0)) (not (= ~i~0 0))) (or .cse1 .cse2 .cse4 .cse14 .cse5 (not (<= ~num~0 0)) .cse16 .cse6 .cse17 .cse9 .cse11) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse16 .cse6 .cse7 (not (<= ~i~0 2147483646)) .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse1 .cse2 .cse3 .cse18 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse19 .cse12) (or .cse2 (and (or .cse1 .cse18 .cse17 .cse9 .cse10 .cse11 .cse15) (or .cse1 .cse3 .cse18 .cse17 .cse7 .cse9 .cse10 .cse11 .cse19 .cse12)) .cse5 .cse16) (or .cse0 .cse1 .cse2 .cse14 .cse18 .cse5 .cse8 .cse9 .cse11 .cse15))) [2022-11-22 00:39:22,765 INFO L899 garLoopResultBuilder]: For program point activate_threadsEXIT(lines 374 399) no Hoare annotation was computed. [2022-11-22 00:39:22,765 INFO L899 garLoopResultBuilder]: For program point L200(lines 200 205) no Hoare annotation was computed. [2022-11-22 00:39:22,765 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadEXIT(lines 250 269) no Hoare annotation was computed. [2022-11-22 00:39:22,765 INFO L902 garLoopResultBuilder]: At program point exists_runnable_threadENTRY(lines 250 269) the Hoare annotation is: true [2022-11-22 00:39:22,766 INFO L902 garLoopResultBuilder]: At program point fire_delta_eventsFINAL(lines 326 333) the Hoare annotation is: true [2022-11-22 00:39:22,766 INFO L899 garLoopResultBuilder]: For program point fire_delta_eventsEXIT(lines 326 333) no Hoare annotation was computed. [2022-11-22 00:39:22,766 INFO L899 garLoopResultBuilder]: For program point update_channelsEXIT(lines 224 231) no Hoare annotation was computed. [2022-11-22 00:39:22,766 INFO L902 garLoopResultBuilder]: At program point update_channelsFINAL(lines 224 231) the Hoare annotation is: true [2022-11-22 00:39:22,766 INFO L899 garLoopResultBuilder]: For program point reset_delta_eventsEXIT(lines 334 341) no Hoare annotation was computed. [2022-11-22 00:39:22,766 INFO L902 garLoopResultBuilder]: At program point reset_delta_eventsFINAL(lines 334 341) the Hoare annotation is: true [2022-11-22 00:39:22,766 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 160) no Hoare annotation was computed. [2022-11-22 00:39:22,766 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-11-22 00:39:22,766 INFO L899 garLoopResultBuilder]: For program point L284(lines 284 288) no Hoare annotation was computed. [2022-11-22 00:39:22,767 INFO L899 garLoopResultBuilder]: For program point L284-1(lines 279 319) no Hoare annotation was computed. [2022-11-22 00:39:22,767 INFO L895 garLoopResultBuilder]: At program point L86(lines 81 111) the Hoare annotation is: (let ((.cse9 (< ~i~0 2147483646)) (.cse7 (<= 2 ~i~0)) (.cse11 (= ~C_1_pc~0 1)) (.cse14 (<= 1 ~num~0)) (.cse16 (<= 1 ~i~0)) (.cse0 (= 2 ~C_1_pc~0)) (.cse12 (= ~P_1_pc~0 1)) (.cse13 (< ~num~0 2147483648)) (.cse2 (<= ~max_loop~0 2)) (.cse17 (<= ~i~0 1)) (.cse6 (<= 0 ~num~0)) (.cse8 (or (= |exists_runnable_thread_#res| 1) (not (= ~P_1_st~0 0)))) (.cse1 (<= ~e~0 0)) (.cse3 (= ~P_1_i~0 1)) (.cse15 (= ~num~0 0)) (.cse4 (<= ~P_1_pc~0 0)) (.cse5 (not (= |ULTIMATE.start_eval_~tmp___2~0#1| 0))) (.cse10 (= ~C_1_i~0 1))) (or (and (<= ~num~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse2 (or (and .cse11 .cse12 .cse1 .cse13 .cse3 .cse5 .cse14 .cse8 .cse9 .cse10) (and .cse11 .cse12 .cse1 .cse3 .cse15 .cse5 .cse8 .cse9 .cse10)) .cse7) (and .cse16 .cse11 .cse1 .cse2 .cse17 .cse3 .cse15 .cse4 .cse5 .cse8 .cse10) (and .cse0 .cse12 .cse1 .cse13 .cse2 .cse3 (<= ~i~0 2147483646) .cse5 .cse6 .cse7 .cse8 .cse10) (and .cse16 .cse11 .cse12 .cse1 .cse13 .cse2 .cse17 .cse3 .cse5 .cse14 .cse8 .cse10) (and .cse16 .cse0 .cse12 .cse1 .cse13 .cse2 .cse17 .cse3 .cse5 .cse6 .cse8 .cse10) (and (<= 0 (+ |ULTIMATE.start_eval_~tmp~0#1| 2147483648)) (<= ~i~0 0) (= ~C_1_st~0 0) (<= |ULTIMATE.start_eval_~tmp~0#1| 2147483647) (<= |ULTIMATE.start_eval_~tmp___2~0#1| 1) .cse1 (<= 0 ~e~0) (= ~data_0~0 0) (<= 0 ~i~0) (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1) (not (= |ULTIMATE.start_eval_~tmp~0#1| 0)) (= ~P_1_ev~0 0) (= |ULTIMATE.start_main_~count~0#1| 0) (= ~P_1_st~0 1) (= ~C_1_pr~0 0) (= ~max_loop~0 2) .cse3 (<= ~C_1_ev~0 0) .cse15 .cse4 (<= 0 ~C_1_ev~0) (<= 0 ~P_1_pc~0) (= |#NULL.offset| 0) .cse5 (<= 0 |ULTIMATE.start_eval_~tmp___2~0#1|) (<= 0 ~C_1_pc~0) (<= ~C_1_pc~0 0) (<= 0 |#StackHeapBarrier|) (= ~data_1~0 0) (= ~timer~0 0) .cse10 (= |#NULL.base| 0)))) [2022-11-22 00:39:22,767 INFO L899 garLoopResultBuilder]: For program point L169(line 169) no Hoare annotation was computed. [2022-11-22 00:39:22,767 INFO L899 garLoopResultBuilder]: For program point L37(lines 37 49) no Hoare annotation was computed. [2022-11-22 00:39:22,768 INFO L902 garLoopResultBuilder]: At program point L483(lines 430 488) the Hoare annotation is: true [2022-11-22 00:39:22,768 INFO L895 garLoopResultBuilder]: At program point L417(line 417) the Hoare annotation is: (let ((.cse0 (<= 1 ~i~0)) (.cse6 (<= ~i~0 1)) (.cse10 (= ~num~0 0)) (.cse1 (= ~C_1_pc~0 1)) (.cse8 (<= 1 ~num~0)) (.cse11 (<= ~P_1_pc~0 0)) (.cse14 (< ~i~0 2147483646)) (.cse12 (= 2 ~C_1_pc~0)) (.cse2 (= ~P_1_pc~0 1)) (.cse3 (<= ~e~0 0)) (.cse4 (< ~num~0 2147483648)) (.cse5 (<= ~max_loop~0 2)) (.cse7 (= ~P_1_i~0 1)) (.cse13 (<= 0 ~num~0)) (.cse15 (<= 2 ~i~0)) (.cse9 (= ~C_1_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse10 .cse11 .cse9) (and .cse0 .cse12 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse13 .cse9) (and (or (and .cse1 .cse2 .cse3 .cse7 .cse10 .cse14 .cse9) (and .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse14 .cse9)) .cse5 .cse15) (and (<= ~num~0 0) .cse12 .cse3 .cse5 .cse7 .cse11 .cse13 .cse15 .cse14 .cse9) (and .cse12 .cse2 .cse3 .cse4 .cse5 .cse7 (<= ~i~0 2147483646) .cse13 .cse15 .cse9))) [2022-11-22 00:39:22,768 INFO L895 garLoopResultBuilder]: At program point L417-1(line 417) the Hoare annotation is: (let ((.cse0 (<= 1 ~i~0)) (.cse6 (<= ~i~0 1)) (.cse10 (= ~num~0 0)) (.cse1 (= ~C_1_pc~0 1)) (.cse8 (<= 1 ~num~0)) (.cse11 (<= ~P_1_pc~0 0)) (.cse14 (< ~i~0 2147483646)) (.cse12 (= 2 ~C_1_pc~0)) (.cse2 (= ~P_1_pc~0 1)) (.cse3 (<= ~e~0 0)) (.cse4 (< ~num~0 2147483648)) (.cse5 (<= ~max_loop~0 2)) (.cse7 (= ~P_1_i~0 1)) (.cse13 (<= 0 ~num~0)) (.cse15 (<= 2 ~i~0)) (.cse9 (= ~C_1_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse10 .cse11 .cse9) (and .cse0 .cse12 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse13 .cse9) (and (or (and .cse1 .cse2 .cse3 .cse7 .cse10 .cse14 .cse9) (and .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse14 .cse9)) .cse5 .cse15) (and (<= ~num~0 0) .cse12 .cse3 .cse5 .cse7 .cse11 .cse13 .cse15 .cse14 .cse9) (and .cse12 .cse2 .cse3 .cse4 .cse5 .cse7 (<= ~i~0 2147483646) .cse13 .cse15 .cse9))) [2022-11-22 00:39:22,768 INFO L899 garLoopResultBuilder]: For program point L170(lines 170 176) no Hoare annotation was computed. [2022-11-22 00:39:22,768 INFO L899 garLoopResultBuilder]: For program point L170-1(lines 170 176) no Hoare annotation was computed. [2022-11-22 00:39:22,769 INFO L895 garLoopResultBuilder]: At program point L468(line 468) the Hoare annotation is: (let ((.cse0 (<= 1 ~i~0)) (.cse6 (<= ~i~0 1)) (.cse10 (= ~num~0 0)) (.cse1 (= ~C_1_pc~0 1)) (.cse8 (<= 1 ~num~0)) (.cse11 (<= ~P_1_pc~0 0)) (.cse14 (< ~i~0 2147483646)) (.cse12 (= 2 ~C_1_pc~0)) (.cse2 (= ~P_1_pc~0 1)) (.cse3 (<= ~e~0 0)) (.cse4 (< ~num~0 2147483648)) (.cse5 (<= ~max_loop~0 2)) (.cse7 (= ~P_1_i~0 1)) (.cse13 (<= 0 ~num~0)) (.cse15 (<= 2 ~i~0)) (.cse9 (= ~C_1_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse10 .cse11 .cse9) (and .cse0 .cse12 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse13 .cse9) (and (or (and .cse1 .cse2 .cse3 .cse7 .cse10 .cse14 .cse9) (and .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse14 .cse9)) .cse5 .cse15) (and (<= ~num~0 0) .cse12 .cse3 .cse5 .cse7 .cse11 .cse13 .cse15 .cse14 .cse9) (and .cse12 .cse2 .cse3 .cse4 .cse5 .cse7 (<= ~i~0 2147483646) .cse13 .cse15 .cse9))) [2022-11-22 00:39:22,769 INFO L895 garLoopResultBuilder]: At program point L468-1(line 468) the Hoare annotation is: (let ((.cse0 (<= 1 ~i~0)) (.cse6 (<= ~i~0 1)) (.cse10 (= ~num~0 0)) (.cse1 (= ~C_1_pc~0 1)) (.cse8 (<= 1 ~num~0)) (.cse11 (<= ~P_1_pc~0 0)) (.cse14 (< ~i~0 2147483646)) (.cse12 (= 2 ~C_1_pc~0)) (.cse2 (= ~P_1_pc~0 1)) (.cse3 (<= ~e~0 0)) (.cse4 (< ~num~0 2147483648)) (.cse5 (<= ~max_loop~0 2)) (.cse7 (= ~P_1_i~0 1)) (.cse13 (<= 0 ~num~0)) (.cse15 (<= 2 ~i~0)) (.cse9 (= ~C_1_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse10 .cse11 .cse9) (and .cse0 .cse12 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse13 .cse9) (and (or (and .cse1 .cse2 .cse3 .cse7 .cse10 .cse14 .cse9) (and .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse14 .cse9)) .cse5 .cse15) (and (<= ~num~0 0) .cse12 .cse3 .cse5 .cse7 .cse11 .cse13 .cse15 .cse14 .cse9) (and .cse12 .cse2 .cse3 .cse4 .cse5 .cse7 (<= ~i~0 2147483646) .cse13 .cse15 .cse9))) [2022-11-22 00:39:22,769 INFO L895 garLoopResultBuilder]: At program point L320(lines 271 325) the Hoare annotation is: (let ((.cse0 (= ~C_1_pc~0 1)) (.cse10 (<= 1 ~i~0)) (.cse11 (<= ~i~0 1)) (.cse12 (<= ~P_1_pc~0 0)) (.cse8 (< ~i~0 2147483646)) (.cse13 (= 2 ~C_1_pc~0)) (.cse1 (= ~P_1_pc~0 1)) (.cse2 (<= ~e~0 0)) (.cse3 (< ~num~0 2147483648)) (.cse4 (<= ~max_loop~0 2)) (.cse5 (= ~P_1_i~0 1)) (.cse6 (<= 0 ~num~0)) (.cse7 (<= 2 ~i~0)) (.cse9 (= ~C_1_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 (<= 1 ~num~0) .cse9) (and .cse10 .cse0 .cse2 .cse4 .cse11 .cse5 (= ~num~0 0) .cse12 .cse9) (and .cse10 .cse13 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse9) (and (<= ~num~0 0) .cse13 .cse2 .cse4 .cse5 .cse12 .cse6 .cse7 .cse8 .cse9) (and .cse13 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~i~0 2147483646) .cse6 .cse7 .cse9))) [2022-11-22 00:39:22,770 INFO L895 garLoopResultBuilder]: At program point L304(lines 279 319) the Hoare annotation is: (let ((.cse24 (<= 1 ~i~0)) (.cse9 (<= ~i~0 1)) (.cse2 (<= |ULTIMATE.start_eval_~tmp___2~0#1| 1)) (.cse11 (= 2 ~P_1_st~0)) (.cse17 (not (= |ULTIMATE.start_eval_~tmp___2~0#1| 0))) (.cse18 (<= 0 |ULTIMATE.start_eval_~tmp___2~0#1|)) (.cse1 (= ~C_1_st~0 0)) (.cse31 (= ~i~0 0)) (.cse32 (= ~e~0 0)) (.cse4 (= ~data_0~0 0)) (.cse5 (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1)) (.cse6 (= ~P_1_ev~0 0)) (.cse7 (= |ULTIMATE.start_main_~count~0#1| 0)) (.cse8 (= ~C_1_pr~0 0)) (.cse10 (= ~max_loop~0 2)) (.cse33 (= ~C_1_pc~0 0)) (.cse15 (<= 0 ~P_1_pc~0)) (.cse16 (= |#NULL.offset| 0)) (.cse19 (= ~C_1_ev~0 0)) (.cse20 (<= 0 |#StackHeapBarrier|)) (.cse21 (= ~data_1~0 0)) (.cse34 (= ~timer~0 0)) (.cse23 (= |#NULL.base| 0)) (.cse13 (= ~num~0 0)) (.cse0 (= ~C_1_pc~0 1)) (.cse28 (<= 1 ~num~0)) (.cse14 (<= ~P_1_pc~0 0)) (.cse35 (< ~i~0 2147483646)) (.cse29 (= 2 ~C_1_pc~0)) (.cse25 (= ~P_1_pc~0 1)) (.cse3 (<= ~e~0 0)) (.cse26 (< ~num~0 2147483648)) (.cse27 (<= ~max_loop~0 2)) (.cse12 (= ~P_1_i~0 1)) (.cse30 (<= 0 ~num~0)) (.cse36 (<= 2 ~i~0)) (.cse22 (= ~C_1_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 (<= 0 ~e~0) .cse4 (<= 0 ~i~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (<= 0 ~timer~0) .cse19 (<= |ULTIMATE.start_eval_~tmp___1~0#1| 2147483647) .cse20 .cse21 (<= 0 (+ |ULTIMATE.start_eval_~tmp___1~0#1| 2147483648)) .cse22 .cse23) (and .cse24 .cse0 .cse25 .cse3 .cse26 .cse27 .cse9 .cse12 .cse28 .cse22) (and .cse24 .cse0 .cse3 .cse27 .cse9 .cse12 .cse13 .cse14 .cse22) (and .cse24 .cse29 .cse25 .cse3 .cse26 .cse27 .cse9 .cse12 .cse30 .cse22) (and (<= 0 ~data_0~0) .cse1 .cse25 .cse2 .cse31 .cse32 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse33 (<= 0 ~data_1~0) .cse16 .cse17 .cse18 (<= ~num~0 1) .cse19 .cse20 .cse28 .cse34 .cse22 .cse23) (and .cse1 .cse31 .cse32 .cse4 .cse5 (= ~P_1_st~0 0) .cse6 .cse7 .cse8 .cse10 .cse12 .cse33 .cse13 .cse14 .cse15 .cse16 .cse19 .cse20 .cse21 .cse34 .cse22 .cse23) (and (or (and .cse0 .cse25 .cse3 .cse12 .cse13 .cse35 .cse22) (and .cse0 .cse25 .cse3 .cse26 .cse12 .cse28 .cse35 .cse22)) .cse27 .cse36) (and (<= ~num~0 0) .cse29 .cse3 .cse27 .cse12 .cse14 .cse30 .cse36 .cse35 .cse22) (and .cse29 .cse25 .cse3 .cse26 .cse27 .cse12 (<= ~i~0 2147483646) .cse30 .cse36 .cse22))) [2022-11-22 00:39:22,770 INFO L902 garLoopResultBuilder]: At program point L172(line 172) the Hoare annotation is: true [2022-11-22 00:39:22,770 INFO L895 garLoopResultBuilder]: At program point L453(line 453) the Hoare annotation is: (let ((.cse0 (= ~C_1_pc~0 1)) (.cse10 (<= 1 ~i~0)) (.cse11 (<= ~i~0 1)) (.cse12 (<= ~P_1_pc~0 0)) (.cse8 (< ~i~0 2147483646)) (.cse13 (= 2 ~C_1_pc~0)) (.cse1 (= ~P_1_pc~0 1)) (.cse2 (<= ~e~0 0)) (.cse3 (< ~num~0 2147483648)) (.cse4 (<= ~max_loop~0 2)) (.cse5 (= ~P_1_i~0 1)) (.cse6 (<= 0 ~num~0)) (.cse7 (<= 2 ~i~0)) (.cse9 (= ~C_1_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 (<= 1 ~num~0) .cse9) (and .cse10 .cse0 .cse2 .cse4 .cse11 .cse5 (= ~num~0 0) .cse12 .cse9) (and .cse10 .cse13 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse9) (and (<= ~num~0 0) .cse13 .cse2 .cse4 .cse5 .cse12 .cse6 .cse7 .cse8 .cse9) (and .cse13 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~i~0 2147483646) .cse6 .cse7 .cse9))) [2022-11-22 00:39:22,770 INFO L899 garLoopResultBuilder]: For program point L453-1(line 453) no Hoare annotation was computed. [2022-11-22 00:39:22,770 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 48) no Hoare annotation was computed. [2022-11-22 00:39:22,770 INFO L899 garLoopResultBuilder]: For program point L289(lines 279 319) no Hoare annotation was computed. [2022-11-22 00:39:22,770 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-22 00:39:22,770 INFO L899 garLoopResultBuilder]: For program point L157(lines 156 186) no Hoare annotation was computed. [2022-11-22 00:39:22,771 INFO L895 garLoopResultBuilder]: At program point L438(line 438) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= (select |#length| 3) 12) (= 13 (select |#length| 2)) (= ~C_1_st~0 0) (= ~i~0 0) (= ~e~0 0) (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 0) (= ~data_0~0 0) (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (= ~P_1_st~0 0) (= ~P_1_ev~0 0) (= |ULTIMATE.start_main_~count~0#1| 0) (= ~C_1_pr~0 0) (= ~max_loop~0 2) (= ~P_1_i~0 1) (= (select |#valid| 1) 1) (= ~P_1_pc~0 0) (= ~C_1_pc~0 0) (= ~num~0 0) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= (select .cse0 0) 48) (= (select .cse0 1) 0) (= ~C_1_ev~0 0) (= ~data_1~0 0) (= ~timer~0 0) (= ~C_1_i~0 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2022-11-22 00:39:22,771 INFO L895 garLoopResultBuilder]: At program point L438-1(line 438) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= (select |#length| 3) 12) (= 13 (select |#length| 2)) (= ~C_1_st~0 0) (= ~i~0 0) (= ~e~0 0) (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 0) (= ~data_0~0 0) (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (= ~P_1_st~0 0) (= ~P_1_ev~0 0) (= |ULTIMATE.start_main_~count~0#1| 0) (= ~C_1_pr~0 0) (= ~max_loop~0 2) (= ~P_1_i~0 1) (= (select |#valid| 1) 1) (= ~P_1_pc~0 0) (= ~C_1_pc~0 0) (= ~num~0 0) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= (select .cse0 0) 48) (= (select .cse0 1) 0) (= ~C_1_ev~0 0) (= ~data_1~0 0) (= ~timer~0 0) (= ~C_1_i~0 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2022-11-22 00:39:22,771 INFO L899 garLoopResultBuilder]: For program point L141(lines 141 153) no Hoare annotation was computed. [2022-11-22 00:39:22,772 INFO L895 garLoopResultBuilder]: At program point L191(lines 137 194) the Hoare annotation is: (let ((.cse5 (<= ~P_1_pc~0 0)) (.cse12 (= ~C_1_pc~0 1)) (.cse14 (= ~num~0 0)) (.cse8 (<= 2 ~i~0)) (.cse9 (< ~i~0 2147483646)) (.cse11 (<= 1 ~i~0)) (.cse0 (= 2 ~C_1_st~0)) (.cse1 (= 2 ~C_1_pc~0)) (.cse15 (= ~P_1_pc~0 1)) (.cse2 (<= ~e~0 0)) (.cse16 (< ~num~0 2147483648)) (.cse3 (<= ~max_loop~0 2)) (.cse13 (<= ~i~0 1)) (.cse4 (= ~P_1_i~0 1)) (.cse6 (not (= |ULTIMATE.start_eval_~tmp___2~0#1| 0))) (.cse7 (<= 0 ~num~0)) (.cse10 (= ~C_1_i~0 1))) (or (and (<= ~num~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse12 (<= |ULTIMATE.start_eval_~tmp___2~0#1| 1) .cse2 (<= 0 ~e~0) (= ~data_0~0 0) (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1) (= ~P_1_st~0 0) (= ~P_1_ev~0 0) (= |ULTIMATE.start_eval_~tmp~0#1| 0) (= |ULTIMATE.start_main_~count~0#1| 0) (= ~timer~0 1) (= ~C_1_pr~0 0) .cse13 (not (= |ULTIMATE.start_eval_~tmp___1~0#1| 0)) (= ~max_loop~0 2) .cse4 .cse14 .cse5 (<= 0 ~P_1_pc~0) (= |#NULL.offset| 0) .cse6 (<= 0 |ULTIMATE.start_eval_~tmp___2~0#1|) (= ~C_1_ev~0 0) (<= |ULTIMATE.start_eval_~tmp___1~0#1| 2147483647) (<= 0 |#StackHeapBarrier|) (= ~data_1~0 0) (<= 0 (+ |ULTIMATE.start_eval_~tmp___1~0#1| 2147483648)) .cse10 (= |#NULL.base| 0)) (and .cse0 .cse1 .cse15 .cse2 .cse16 .cse3 .cse4 (<= ~i~0 2147483646) .cse6 .cse7 .cse8 .cse10) (and .cse0 .cse12 .cse15 .cse2 .cse3 .cse4 .cse14 .cse6 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse15 .cse2 .cse16 .cse3 .cse13 .cse4 .cse6 .cse7 .cse10))) [2022-11-22 00:39:22,772 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 160) no Hoare annotation was computed. [2022-11-22 00:39:22,773 INFO L895 garLoopResultBuilder]: At program point L158(lines 140 193) the Hoare annotation is: (let ((.cse10 (<= 0 ~data_1~0)) (.cse17 (<= 1 ~num~0)) (.cse29 (= 2 ~C_1_pc~0)) (.cse28 (< ~num~0 2147483648)) (.cse21 (<= 1 ~i~0)) (.cse25 (<= ~i~0 1)) (.cse0 (= ~P_1_pc~0 1)) (.cse24 (<= ~e~0 0)) (.cse22 (<= ~max_loop~0 2)) (.cse26 (<= 1 ~P_1_pc~0)) (.cse14 (<= ~num~0 1)) (.cse27 (<= 0 ~num~0)) (.cse40 (<= 2 ~i~0)) (.cse18 (or (= |exists_runnable_thread_#res| 1) (not (= ~C_1_st~0 0)))) (.cse39 (< ~i~0 2147483646)) (.cse23 (= ~C_1_pc~0 1)) (.cse1 (<= |ULTIMATE.start_eval_~tmp___2~0#1| 1)) (.cse2 (= ~e~0 0)) (.cse30 (= ~data_0~0 0)) (.cse3 (<= 0 ~i~0)) (.cse4 (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1)) (.cse5 (= ~P_1_ev~0 0)) (.cse6 (= |ULTIMATE.start_main_~count~0#1| 0)) (.cse7 (= ~C_1_pr~0 0)) (.cse31 (not (= |ULTIMATE.start_eval_~tmp___1~0#1| 0))) (.cse8 (= ~max_loop~0 2)) (.cse9 (= ~P_1_i~0 1)) (.cse32 (= ~num~0 0)) (.cse33 (<= ~P_1_pc~0 0)) (.cse34 (<= 0 ~P_1_pc~0)) (.cse11 (= |#NULL.offset| 0)) (.cse12 (not (= |ULTIMATE.start_eval_~tmp___2~0#1| 0))) (.cse13 (<= 0 |ULTIMATE.start_eval_~tmp___2~0#1|)) (.cse35 (<= 0 ~timer~0)) (.cse15 (= ~C_1_ev~0 0)) (.cse36 (<= |ULTIMATE.start_eval_~tmp___1~0#1| 2147483647)) (.cse16 (<= 0 |#StackHeapBarrier|)) (.cse37 (<= 0 (+ |ULTIMATE.start_eval_~tmp___1~0#1| 2147483648))) (.cse38 (= ~C_1_st~0 1)) (.cse19 (= ~C_1_i~0 1)) (.cse20 (= |#NULL.base| 0))) (or (and (<= ~i~0 0) (<= 0 ~data_0~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 2 ~P_1_st~0) .cse9 (= ~C_1_pc~0 0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= ~timer~0 0) .cse19 .cse20) (and .cse21 .cse22 (or (and .cse23 .cse0 .cse24 .cse3 .cse25 .cse9 .cse26 .cse12 .cse14 .cse27 .cse18 .cse19) (and .cse28 .cse12 (or (and .cse23 .cse0 .cse24 .cse25 .cse9 .cse17) (and .cse29 .cse0 .cse24 .cse3 .cse25 .cse9 .cse26 .cse27)) .cse18 .cse19))) (and .cse23 .cse1 .cse2 .cse30 .cse3 .cse4 .cse5 .cse6 .cse7 .cse31 .cse8 .cse9 (<= ~C_1_ev~0 0) .cse10 .cse32 .cse33 (<= 0 ~C_1_ev~0) .cse34 .cse11 .cse12 .cse13 .cse35 (<= ~data_1~0 0) .cse36 .cse16 .cse37 .cse38 .cse19 (not (= ~P_1_st~0 0)) .cse20) (and (or (and .cse23 .cse0 .cse24 .cse9 .cse17 .cse39) (and .cse29 .cse0 .cse24 .cse3 .cse9 .cse26 .cse27 .cse39)) .cse28 .cse22 .cse12 .cse40 .cse18 .cse19) (and .cse21 .cse23 .cse24 .cse22 .cse25 .cse9 .cse32 .cse33 .cse12 .cse18 .cse19) (and .cse23 .cse0 .cse24 .cse3 .cse22 .cse9 .cse26 .cse12 .cse14 .cse27 .cse40 .cse18 .cse39 .cse19) (and (<= 0 (+ |ULTIMATE.start_eval_~tmp~0#1| 2147483648)) .cse23 (<= |ULTIMATE.start_eval_~tmp~0#1| 2147483647) .cse1 .cse2 .cse30 .cse3 .cse4 .cse5 .cse6 .cse7 .cse31 .cse8 .cse9 .cse32 .cse33 .cse34 .cse11 .cse12 .cse13 .cse35 .cse15 .cse36 .cse16 (= ~data_1~0 0) .cse37 .cse38 .cse19 .cse20))) [2022-11-22 00:39:22,773 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 69) no Hoare annotation was computed. [2022-11-22 00:39:22,774 INFO L895 garLoopResultBuilder]: At program point L109(lines 78 112) the Hoare annotation is: (let ((.cse0 (<= 1 ~i~0)) (.cse23 (<= 1 ~num~0)) (.cse29 (< ~i~0 2147483646)) (.cse1 (= ~C_1_pc~0 1)) (.cse11 (= ~C_1_st~0 0)) (.cse13 (<= |ULTIMATE.start_eval_~tmp___2~0#1| 1)) (.cse14 (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1)) (.cse15 (= ~P_1_ev~0 0)) (.cse16 (= |ULTIMATE.start_main_~count~0#1| 0)) (.cse17 (= ~C_1_pr~0 0)) (.cse4 (<= ~i~0 1)) (.cse18 (= ~max_loop~0 2)) (.cse19 (<= 0 ~data_1~0)) (.cse7 (= ~num~0 0)) (.cse8 (<= ~P_1_pc~0 0)) (.cse20 (= |#NULL.offset| 0)) (.cse21 (<= 0 |ULTIMATE.start_eval_~tmp___2~0#1|)) (.cse22 (<= 0 |#StackHeapBarrier|)) (.cse24 (= |#NULL.base| 0)) (.cse26 (= 2 ~C_1_pc~0)) (.cse12 (= ~P_1_pc~0 1)) (.cse2 (<= ~e~0 0)) (.cse25 (< ~num~0 2147483648)) (.cse3 (<= ~max_loop~0 2)) (.cse5 (= 2 ~P_1_st~0)) (.cse6 (= ~P_1_i~0 1)) (.cse9 (not (= |ULTIMATE.start_eval_~tmp___2~0#1| 0))) (.cse27 (<= 0 ~num~0)) (.cse28 (<= 2 ~i~0)) (.cse10 (= ~C_1_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (<= 0 (+ |ULTIMATE.start_eval_~tmp~0#1| 2147483648)) .cse11 .cse12 (<= |ULTIMATE.start_eval_~tmp~0#1| 2147483647) .cse13 (= ~i~0 0) (= ~e~0 0) .cse14 (= |ULTIMATE.start_write_data_~c#1| ~data_0~0) (not (= |ULTIMATE.start_eval_~tmp~0#1| 0)) (= |ULTIMATE.start_write_data_#in~i___0#1| |ULTIMATE.start_write_data_~i___0#1|) .cse15 .cse16 (<= 65 |ULTIMATE.start_write_data_~c#1|) .cse17 .cse18 .cse5 (<= |ULTIMATE.start_write_data_~c#1| 65) .cse6 (= |ULTIMATE.start_write_data_#in~c#1| 65) (<= 0 |ULTIMATE.start_write_data_#in~i___0#1|) (= ~C_1_pc~0 0) .cse19 .cse20 .cse9 .cse21 (<= ~num~0 1) (<= |ULTIMATE.start_write_data_#in~i___0#1| 0) (= ~C_1_ev~0 0) .cse22 .cse23 (= ~timer~0 0) .cse10 .cse24) (and .cse0 .cse1 .cse12 .cse2 .cse25 .cse3 .cse4 .cse5 .cse6 .cse9 .cse23 .cse10) (and (<= ~num~0 0) .cse26 .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse27 .cse28 .cse29 .cse10) (and .cse0 .cse26 .cse12 .cse2 .cse25 .cse3 .cse4 .cse5 .cse6 .cse9 .cse27 .cse10) (and .cse3 (or (and .cse1 .cse12 .cse2 .cse5 .cse6 .cse7 .cse9 .cse29 .cse10) (and .cse1 .cse12 .cse2 .cse25 .cse5 .cse6 .cse9 .cse23 .cse29 .cse10)) .cse28) (and .cse1 .cse11 .cse13 .cse2 (<= 0 ~e~0) (= ~data_0~0 0) (<= 0 ~i~0) .cse14 .cse15 .cse16 .cse17 .cse4 .cse18 .cse5 .cse6 (<= ~C_1_ev~0 0) .cse19 .cse7 .cse8 (<= 0 ~C_1_ev~0) (<= 0 ~P_1_pc~0) .cse20 .cse9 .cse21 (<= 0 ~timer~0) (<= ~data_1~0 0) .cse22 .cse10 .cse24) (and .cse26 .cse12 .cse2 .cse25 .cse3 .cse5 .cse6 (<= ~i~0 2147483646) .cse9 .cse27 .cse28 .cse10))) [2022-11-22 00:39:22,774 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 179) no Hoare annotation was computed. [2022-11-22 00:39:22,774 INFO L895 garLoopResultBuilder]: At program point L440(line 440) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= (select |#length| 3) 12) (= 13 (select |#length| 2)) (= ~C_1_st~0 0) (= ~i~0 0) (= ~e~0 0) (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 0) (= ~data_0~0 0) (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (= ~P_1_st~0 0) (= ~P_1_ev~0 0) (= |ULTIMATE.start_main_~count~0#1| 0) (= ~C_1_pr~0 0) (= ~max_loop~0 2) (= ~P_1_i~0 1) (= (select |#valid| 1) 1) (= ~P_1_pc~0 0) (= ~C_1_pc~0 0) (= ~num~0 0) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= (select .cse0 0) 48) (= (select .cse0 1) 0) (= ~C_1_ev~0 0) (= ~data_1~0 0) (= ~timer~0 0) (= ~C_1_i~0 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2022-11-22 00:39:22,774 INFO L895 garLoopResultBuilder]: At program point L440-1(line 440) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= (select |#length| 3) 12) (= 13 (select |#length| 2)) (= ~C_1_st~0 0) (= ~i~0 0) (= ~e~0 0) (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 0) (= ~data_0~0 0) (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (= ~P_1_st~0 0) (= ~P_1_ev~0 0) (= |ULTIMATE.start_main_~count~0#1| 0) (= ~C_1_pr~0 0) (= ~max_loop~0 2) (= ~P_1_i~0 1) (= (select |#valid| 1) 1) (= ~P_1_pc~0 0) (= ~C_1_pc~0 0) (= ~num~0 0) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= (select .cse0 0) 48) (= (select .cse0 1) 0) (= ~C_1_ev~0 0) (= ~data_1~0 0) (= ~timer~0 0) (= ~C_1_i~0 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2022-11-22 00:39:22,774 INFO L899 garLoopResultBuilder]: For program point L308(lines 308 315) no Hoare annotation was computed. [2022-11-22 00:39:22,775 INFO L895 garLoopResultBuilder]: At program point L457(line 457) the Hoare annotation is: (let ((.cse0 (= ~C_1_pc~0 1)) (.cse10 (<= 1 ~i~0)) (.cse11 (<= ~i~0 1)) (.cse12 (<= ~P_1_pc~0 0)) (.cse8 (< ~i~0 2147483646)) (.cse13 (= 2 ~C_1_pc~0)) (.cse1 (= ~P_1_pc~0 1)) (.cse2 (<= ~e~0 0)) (.cse3 (< ~num~0 2147483648)) (.cse4 (<= ~max_loop~0 2)) (.cse5 (= ~P_1_i~0 1)) (.cse6 (<= 0 ~num~0)) (.cse7 (<= 2 ~i~0)) (.cse9 (= ~C_1_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 (<= 1 ~num~0) .cse9) (and .cse10 .cse0 .cse2 .cse4 .cse11 .cse5 (= ~num~0 0) .cse12 .cse9) (and .cse10 .cse13 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse9) (and (<= ~num~0 0) .cse13 .cse2 .cse4 .cse5 .cse12 .cse6 .cse7 .cse8 .cse9) (and .cse13 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~i~0 2147483646) .cse6 .cse7 .cse9))) [2022-11-22 00:39:22,775 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 179) no Hoare annotation was computed. [2022-11-22 00:39:22,775 INFO L895 garLoopResultBuilder]: At program point L457-1(line 457) the Hoare annotation is: (let ((.cse0 (= ~C_1_pc~0 1)) (.cse10 (<= 1 ~i~0)) (.cse11 (<= ~i~0 1)) (.cse12 (<= ~P_1_pc~0 0)) (.cse8 (< ~i~0 2147483646)) (.cse13 (= 2 ~C_1_pc~0)) (.cse1 (= ~P_1_pc~0 1)) (.cse2 (<= ~e~0 0)) (.cse3 (< ~num~0 2147483648)) (.cse4 (<= ~max_loop~0 2)) (.cse5 (= ~P_1_i~0 1)) (.cse6 (<= 0 ~num~0)) (.cse7 (<= 2 ~i~0)) (.cse9 (= ~C_1_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 (<= 1 ~num~0) .cse9) (and .cse10 .cse0 .cse2 .cse4 .cse11 .cse5 (= ~num~0 0) .cse12 .cse9) (and .cse10 .cse13 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse9) (and (<= ~num~0 0) .cse13 .cse2 .cse4 .cse5 .cse12 .cse6 .cse7 .cse8 .cse9) (and .cse13 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~i~0 2147483646) .cse6 .cse7 .cse9))) [2022-11-22 00:39:22,775 INFO L899 garLoopResultBuilder]: For program point L160(line 160) no Hoare annotation was computed. [2022-11-22 00:39:22,775 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 97) no Hoare annotation was computed. [2022-11-22 00:39:22,775 INFO L899 garLoopResultBuilder]: For program point L160-1(line 160) no Hoare annotation was computed. [2022-11-22 00:39:22,775 INFO L895 garLoopResultBuilder]: At program point L441(line 441) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= (select |#length| 3) 12) (= 13 (select |#length| 2)) (= ~C_1_st~0 0) (= ~i~0 0) (= ~e~0 0) (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 0) (= ~data_0~0 0) (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (= ~P_1_st~0 0) (= ~P_1_ev~0 0) (= |ULTIMATE.start_main_~count~0#1| 0) (= ~C_1_pr~0 0) (= ~max_loop~0 2) (= ~P_1_i~0 1) (= (select |#valid| 1) 1) (= ~P_1_pc~0 0) (= ~C_1_pc~0 0) (= ~num~0 0) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= (select .cse0 0) 48) (= (select .cse0 1) 0) (= ~C_1_ev~0 0) (= ~data_1~0 0) (= ~timer~0 0) (= ~C_1_i~0 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2022-11-22 00:39:22,776 INFO L899 garLoopResultBuilder]: For program point L144(lines 144 152) no Hoare annotation was computed. [2022-11-22 00:39:22,776 INFO L895 garLoopResultBuilder]: At program point L458(line 458) the Hoare annotation is: (let ((.cse0 (<= 1 ~i~0)) (.cse6 (<= ~i~0 1)) (.cse10 (= ~num~0 0)) (.cse1 (= ~C_1_pc~0 1)) (.cse8 (<= 1 ~num~0)) (.cse11 (<= ~P_1_pc~0 0)) (.cse14 (< ~i~0 2147483646)) (.cse12 (= 2 ~C_1_pc~0)) (.cse2 (= ~P_1_pc~0 1)) (.cse3 (<= ~e~0 0)) (.cse4 (< ~num~0 2147483648)) (.cse5 (<= ~max_loop~0 2)) (.cse7 (= ~P_1_i~0 1)) (.cse13 (<= 0 ~num~0)) (.cse15 (<= 2 ~i~0)) (.cse9 (= ~C_1_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse10 .cse11 .cse9) (and .cse0 .cse12 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse13 .cse9) (and (or (and .cse1 .cse2 .cse3 .cse7 .cse10 .cse14 .cse9) (and .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse14 .cse9)) .cse5 .cse15) (and (<= ~num~0 0) .cse12 .cse3 .cse5 .cse7 .cse11 .cse13 .cse15 .cse14 .cse9) (and .cse12 .cse2 .cse3 .cse4 .cse5 .cse7 (<= ~i~0 2147483646) .cse13 .cse15 .cse9))) [2022-11-22 00:39:22,776 INFO L899 garLoopResultBuilder]: For program point L293(lines 293 300) no Hoare annotation was computed. [2022-11-22 00:39:22,776 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 97) no Hoare annotation was computed. [2022-11-22 00:39:22,776 INFO L899 garLoopResultBuilder]: For program point L62(lines 62 68) no Hoare annotation was computed. [2022-11-22 00:39:22,776 INFO L902 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: true [2022-11-22 00:39:22,776 INFO L899 garLoopResultBuilder]: For program point L46-1(line 46) no Hoare annotation was computed. [2022-11-22 00:39:22,776 INFO L895 garLoopResultBuilder]: At program point L459(line 459) the Hoare annotation is: (let ((.cse0 (<= 1 ~i~0)) (.cse6 (<= ~i~0 1)) (.cse10 (= ~num~0 0)) (.cse1 (= ~C_1_pc~0 1)) (.cse8 (<= 1 ~num~0)) (.cse11 (<= ~P_1_pc~0 0)) (.cse14 (< ~i~0 2147483646)) (.cse12 (= 2 ~C_1_pc~0)) (.cse2 (= ~P_1_pc~0 1)) (.cse3 (<= ~e~0 0)) (.cse4 (< ~num~0 2147483648)) (.cse5 (<= ~max_loop~0 2)) (.cse7 (= ~P_1_i~0 1)) (.cse13 (<= 0 ~num~0)) (.cse15 (<= 2 ~i~0)) (.cse9 (= ~C_1_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse10 .cse11 .cse9) (and .cse0 .cse12 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse13 .cse9) (and (or (and .cse1 .cse2 .cse3 .cse7 .cse10 .cse14 .cse9) (and .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse14 .cse9)) .cse5 .cse15) (and (<= ~num~0 0) .cse12 .cse3 .cse5 .cse7 .cse11 .cse13 .cse15 .cse14 .cse9) (and .cse12 .cse2 .cse3 .cse4 .cse5 .cse7 (<= ~i~0 2147483646) .cse13 .cse15 .cse9))) [2022-11-22 00:39:22,777 INFO L899 garLoopResultBuilder]: For program point L179(line 179) no Hoare annotation was computed. [2022-11-22 00:39:22,777 INFO L899 garLoopResultBuilder]: For program point L179-1(line 179) no Hoare annotation was computed. [2022-11-22 00:39:22,777 INFO L899 garLoopResultBuilder]: For program point L97(line 97) no Hoare annotation was computed. [2022-11-22 00:39:22,777 INFO L899 garLoopResultBuilder]: For program point L97-1(line 97) no Hoare annotation was computed. [2022-11-22 00:39:22,777 INFO L899 garLoopResultBuilder]: For program point L477(lines 477 481) no Hoare annotation was computed. [2022-11-22 00:39:22,777 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 169) no Hoare annotation was computed. [2022-11-22 00:39:22,778 INFO L895 garLoopResultBuilder]: At program point L445-1(lines 442 482) the Hoare annotation is: (let ((.cse0 (<= 1 ~i~0)) (.cse6 (<= ~i~0 1)) (.cse10 (= ~num~0 0)) (.cse1 (= ~C_1_pc~0 1)) (.cse8 (<= 1 ~num~0)) (.cse11 (<= ~P_1_pc~0 0)) (.cse15 (< ~i~0 2147483646)) (.cse12 (= 2 ~C_1_pc~0)) (.cse2 (= ~P_1_pc~0 1)) (.cse3 (<= ~e~0 0)) (.cse4 (< ~num~0 2147483648)) (.cse5 (<= ~max_loop~0 2)) (.cse7 (= ~P_1_i~0 1)) (.cse13 (<= 0 ~num~0)) (.cse16 (<= 2 ~i~0)) (.cse9 (= ~C_1_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse10 .cse11 .cse9) (and .cse0 .cse12 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse13 .cse9) (let ((.cse14 (select |#memory_int| 1))) (and (= (select |#length| 3) 12) (= 13 (select |#length| 2)) (= ~C_1_st~0 0) (= ~i~0 0) (= ~e~0 0) (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 0) (= ~data_0~0 0) (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (= ~P_1_st~0 0) (= ~P_1_ev~0 0) (= |ULTIMATE.start_main_~count~0#1| 0) (= ~C_1_pr~0 0) (= ~max_loop~0 2) .cse7 (= (select |#valid| 1) 1) (= ~P_1_pc~0 0) (= ~C_1_pc~0 0) .cse10 (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= (select .cse14 0) 48) (= (select .cse14 1) 0) (= ~C_1_ev~0 0) (= ~data_1~0 0) (= ~timer~0 0) .cse9 (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) (and (or (and .cse1 .cse2 .cse3 .cse7 .cse10 .cse15 .cse9) (and .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse15 .cse9)) .cse5 .cse16) (and (<= ~num~0 0) .cse12 .cse3 .cse5 .cse7 .cse11 .cse13 .cse16 .cse15 .cse9) (and .cse12 .cse2 .cse3 .cse4 .cse5 .cse7 (<= ~i~0 2147483646) .cse13 .cse16 .cse9))) [2022-11-22 00:39:22,782 INFO L895 garLoopResultBuilder]: At program point L280(line 280) the Hoare annotation is: (let ((.cse24 (<= 1 ~i~0)) (.cse9 (<= ~i~0 1)) (.cse2 (<= |ULTIMATE.start_eval_~tmp___2~0#1| 1)) (.cse11 (= 2 ~P_1_st~0)) (.cse17 (not (= |ULTIMATE.start_eval_~tmp___2~0#1| 0))) (.cse18 (<= 0 |ULTIMATE.start_eval_~tmp___2~0#1|)) (.cse1 (= ~C_1_st~0 0)) (.cse31 (= ~i~0 0)) (.cse32 (= ~e~0 0)) (.cse4 (= ~data_0~0 0)) (.cse5 (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1)) (.cse6 (= ~P_1_ev~0 0)) (.cse7 (= |ULTIMATE.start_main_~count~0#1| 0)) (.cse8 (= ~C_1_pr~0 0)) (.cse10 (= ~max_loop~0 2)) (.cse33 (= ~C_1_pc~0 0)) (.cse15 (<= 0 ~P_1_pc~0)) (.cse16 (= |#NULL.offset| 0)) (.cse19 (= ~C_1_ev~0 0)) (.cse20 (<= 0 |#StackHeapBarrier|)) (.cse21 (= ~data_1~0 0)) (.cse34 (= ~timer~0 0)) (.cse23 (= |#NULL.base| 0)) (.cse13 (= ~num~0 0)) (.cse0 (= ~C_1_pc~0 1)) (.cse28 (<= 1 ~num~0)) (.cse14 (<= ~P_1_pc~0 0)) (.cse35 (< ~i~0 2147483646)) (.cse29 (= 2 ~C_1_pc~0)) (.cse25 (= ~P_1_pc~0 1)) (.cse3 (<= ~e~0 0)) (.cse26 (< ~num~0 2147483648)) (.cse27 (<= ~max_loop~0 2)) (.cse12 (= ~P_1_i~0 1)) (.cse30 (<= 0 ~num~0)) (.cse36 (<= 2 ~i~0)) (.cse22 (= ~C_1_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 (<= 0 ~e~0) .cse4 (<= 0 ~i~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (<= 0 ~timer~0) .cse19 (<= |ULTIMATE.start_eval_~tmp___1~0#1| 2147483647) .cse20 .cse21 (<= 0 (+ |ULTIMATE.start_eval_~tmp___1~0#1| 2147483648)) .cse22 .cse23) (and .cse24 .cse0 .cse25 .cse3 .cse26 .cse27 .cse9 .cse12 .cse28 .cse22) (and .cse24 .cse0 .cse3 .cse27 .cse9 .cse12 .cse13 .cse14 .cse22) (and .cse24 .cse29 .cse25 .cse3 .cse26 .cse27 .cse9 .cse12 .cse30 .cse22) (and (<= 0 ~data_0~0) .cse1 .cse25 .cse2 .cse31 .cse32 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse33 (<= 0 ~data_1~0) .cse16 .cse17 .cse18 (<= ~num~0 1) .cse19 .cse20 .cse28 .cse34 .cse22 .cse23) (and .cse1 .cse31 .cse32 .cse4 .cse5 (= ~P_1_st~0 0) .cse6 .cse7 .cse8 .cse10 .cse12 .cse33 .cse13 .cse14 .cse15 .cse16 .cse19 .cse20 .cse21 .cse34 .cse22 .cse23) (and (or (and .cse0 .cse25 .cse3 .cse12 .cse13 .cse35 .cse22) (and .cse0 .cse25 .cse3 .cse26 .cse12 .cse28 .cse35 .cse22)) .cse27 .cse36) (and (<= ~num~0 0) .cse29 .cse3 .cse27 .cse12 .cse14 .cse30 .cse36 .cse35 .cse22) (and .cse29 .cse25 .cse3 .cse26 .cse27 .cse12 (<= ~i~0 2147483646) .cse30 .cse36 .cse22))) [2022-11-22 00:39:22,783 INFO L895 garLoopResultBuilder]: At program point L148(lines 140 193) the Hoare annotation is: (let ((.cse0 (<= ~num~0 0)) (.cse11 (<= ~P_1_pc~0 0)) (.cse24 (<= 2 ~i~0)) (.cse21 (= 2 ~C_1_pc~0)) (.cse22 (<= ~e~0 0)) (.cse27 (< ~num~0 2147483648)) (.cse23 (<= ~max_loop~0 2)) (.cse15 (<= 0 ~num~0)) (.cse26 (= ~P_1_pc~0 1)) (.cse1 (<= |ULTIMATE.start_eval_~tmp___2~0#1| 1)) (.cse2 (= ~i~0 0)) (.cse3 (= ~e~0 0)) (.cse4 (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1)) (.cse5 (= ~P_1_ev~0 0)) (.cse6 (= |ULTIMATE.start_main_~count~0#1| 0)) (.cse7 (= ~C_1_pr~0 0)) (.cse8 (= ~max_loop~0 2)) (.cse9 (= ~P_1_i~0 1)) (.cse10 (= ~C_1_pc~0 0)) (.cse12 (= |#NULL.offset| 0)) (.cse13 (not (= |ULTIMATE.start_eval_~tmp___2~0#1| 0))) (.cse14 (<= 0 |ULTIMATE.start_eval_~tmp___2~0#1|)) (.cse16 (= ~C_1_ev~0 0)) (.cse17 (<= 0 |#StackHeapBarrier|)) (.cse25 (or (= |exists_runnable_thread_#res| 1) (not (= ~C_1_st~0 0)))) (.cse18 (= ~timer~0 0)) (.cse19 (= ~C_1_i~0 1)) (.cse20 (= |#NULL.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~data_0~0 0) .cse4 (= ~P_1_st~0 0) .cse5 .cse6 .cse7 (not (= |ULTIMATE.start_eval_~tmp___1~0#1| 0)) .cse8 .cse9 .cse10 .cse11 (<= 0 ~P_1_pc~0) .cse12 .cse13 .cse14 .cse15 .cse16 (<= |ULTIMATE.start_eval_~tmp~0#1| 0) (<= |ULTIMATE.start_eval_~tmp___1~0#1| 2147483647) .cse17 (<= 0 |ULTIMATE.start_eval_~tmp~0#1|) (= ~data_1~0 0) (<= 0 (+ |ULTIMATE.start_eval_~tmp___1~0#1| 2147483648)) .cse18 (= ~C_1_st~0 1) .cse19 .cse20) (and .cse0 .cse21 .cse22 .cse23 .cse9 .cse11 .cse13 .cse15 .cse24 .cse25 (< ~i~0 2147483646) .cse19) (and .cse21 .cse26 .cse22 .cse27 .cse23 .cse9 (<= ~i~0 2147483646) .cse13 .cse15 .cse24 .cse25 .cse19) (and (<= 1 ~i~0) .cse21 .cse26 .cse22 .cse27 .cse23 (<= ~i~0 1) .cse9 .cse13 .cse15 .cse25 .cse19) (and (<= 0 ~data_0~0) .cse26 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 2 ~P_1_st~0) .cse9 .cse10 (<= 0 ~data_1~0) .cse12 .cse13 .cse14 (<= ~num~0 1) .cse16 .cse17 (<= 1 ~num~0) .cse25 .cse18 .cse19 .cse20))) [2022-11-22 00:39:22,783 INFO L899 garLoopResultBuilder]: For program point L462(line 462) no Hoare annotation was computed. [2022-11-22 00:39:22,783 INFO L902 garLoopResultBuilder]: At program point L66(line 66) the Hoare annotation is: true [2022-11-22 00:39:22,784 INFO L895 garLoopResultBuilder]: At program point L66-1(lines 55 73) the Hoare annotation is: (let ((.cse3 (<= 0 ~num~0)) (.cse5 (<= 1 ~i~0)) (.cse6 (<= ~max_loop~0 2)) (.cse11 (= ~P_1_pc~0 1)) (.cse8 (<= ~e~0 0)) (.cse9 (<= ~i~0 1)) (.cse0 (= ~P_1_i~0 1)) (.cse1 (<= ~num~0 |ULTIMATE.start_write_data_~i___0#1|)) (.cse2 (not (= |ULTIMATE.start_eval_~tmp___2~0#1| 0))) (.cse12 (<= ~num~0 1)) (.cse10 (or (= |exists_runnable_thread_#res| 1) (not (= ~P_1_st~0 0)))) (.cse4 (= ~C_1_i~0 1))) (or (and (<= 0 (+ |ULTIMATE.start_eval_~tmp~0#1| 2147483648)) (= |ULTIMATE.start_write_data_#in~c#1| |ULTIMATE.start_write_data_~c#1|) (= ~C_1_st~0 0) (<= |ULTIMATE.start_eval_~tmp~0#1| 2147483647) (<= |ULTIMATE.start_eval_~tmp___2~0#1| 1) (= ~i~0 0) (= ~e~0 0) (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1) (= |ULTIMATE.start_write_data_~i___0#1| 0) (= |ULTIMATE.start_write_data_~c#1| ~data_0~0) (not (= |ULTIMATE.start_eval_~tmp~0#1| 0)) (= |ULTIMATE.start_write_data_#in~i___0#1| |ULTIMATE.start_write_data_~i___0#1|) (= ~P_1_ev~0 0) (= |ULTIMATE.start_main_~count~0#1| 0) (= ~P_1_st~0 1) (= ~C_1_pr~0 0) (= ~max_loop~0 2) .cse0 (= |ULTIMATE.start_write_data_#in~c#1| 65) .cse1 (= ~C_1_pc~0 0) (<= 0 ~P_1_pc~0) (= |#NULL.offset| 0) .cse2 (<= 0 |ULTIMATE.start_eval_~tmp___2~0#1|) .cse3 (= ~C_1_ev~0 0) (<= 0 |#StackHeapBarrier|) (= ~data_1~0 0) (= ~timer~0 0) .cse4 (= |#NULL.base| 0)) (and .cse5 .cse6 (let ((.cse7 (= 2 ~C_1_pc~0))) (or (and (<= ~num~0 0) .cse7 .cse8 .cse9 .cse0 .cse1 .cse2 .cse3 .cse10 .cse4) (and .cse7 .cse11 .cse8 .cse9 .cse0 .cse1 .cse2 .cse12 .cse3 .cse10 .cse4)))) (and .cse5 .cse6 (let ((.cse13 (= ~C_1_pc~0 1))) (or (and .cse13 .cse8 .cse9 .cse0 .cse1 (= ~num~0 0) .cse2 .cse10 .cse4) (and .cse13 .cse11 .cse8 .cse9 .cse0 .cse1 .cse2 .cse12 (<= 1 ~num~0) .cse10 .cse4)))))) [2022-11-22 00:39:22,785 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 169) no Hoare annotation was computed. [2022-11-22 00:39:22,785 INFO L899 garLoopResultBuilder]: For program point L282(line 282) no Hoare annotation was computed. [2022-11-22 00:39:22,785 INFO L895 garLoopResultBuilder]: At program point L51(lines 36 53) the Hoare annotation is: (let ((.cse0 (<= 1 ~i~0)) (.cse13 (<= ~num~0 0)) (.cse14 (not (= 2 ~C_1_pc~0))) (.cse5 (<= ~i~0 1)) (.cse1 (= ~P_1_pc~0 1)) (.cse2 (<= ~e~0 0)) (.cse3 (<= 0 ~i~0)) (.cse4 (<= ~max_loop~0 2)) (.cse6 (= ~P_1_i~0 1)) (.cse7 (<= 1 ~P_1_pc~0)) (.cse8 (not (= |ULTIMATE.start_eval_~tmp___2~0#1| 0))) (.cse9 (< ~num~0 2147483647)) (.cse10 (<= 0 ~num~0)) (.cse11 (or (= |exists_runnable_thread_#res| 1) (not (= ~C_1_st~0 0)))) (.cse12 (= ~C_1_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 (<= ~i~0 0) .cse1 .cse2 .cse3 .cse14 .cse4 (<= ~P_1_ev~0 0) (= 2 ~P_1_st~0) .cse6 (<= ~C_1_ev~0 0) .cse8 .cse10 .cse11 .cse12) (and .cse0 .cse13 .cse2 .cse14 .cse4 .cse5 .cse6 (<= ~P_1_pc~0 0) .cse8 .cse10 .cse11 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 (<= 2 ~i~0) .cse11 (< ~i~0 2147483646) .cse12))) [2022-11-22 00:39:22,786 INFO L895 garLoopResultBuilder]: At program point L464(lines 464 473) the Hoare annotation is: (let ((.cse0 (<= 1 ~i~0)) (.cse6 (<= ~i~0 1)) (.cse10 (= ~num~0 0)) (.cse1 (= ~C_1_pc~0 1)) (.cse8 (<= 1 ~num~0)) (.cse11 (<= ~P_1_pc~0 0)) (.cse14 (< ~i~0 2147483646)) (.cse12 (= 2 ~C_1_pc~0)) (.cse2 (= ~P_1_pc~0 1)) (.cse3 (<= ~e~0 0)) (.cse4 (< ~num~0 2147483648)) (.cse5 (<= ~max_loop~0 2)) (.cse7 (= ~P_1_i~0 1)) (.cse13 (<= 0 ~num~0)) (.cse15 (<= 2 ~i~0)) (.cse9 (= ~C_1_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse10 .cse11 .cse9) (and .cse0 .cse12 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse13 .cse9) (and (or (and .cse1 .cse2 .cse3 .cse7 .cse10 .cse14 .cse9) (and .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse14 .cse9)) .cse5 .cse15) (and (<= ~num~0 0) .cse12 .cse3 .cse5 .cse7 .cse11 .cse13 .cse15 .cse14 .cse9) (and .cse12 .cse2 .cse3 .cse4 .cse5 .cse7 (<= ~i~0 2147483646) .cse13 .cse15 .cse9))) [2022-11-22 00:39:22,786 INFO L899 garLoopResultBuilder]: For program point L464-2(lines 464 473) no Hoare annotation was computed. [2022-11-22 00:39:22,786 INFO L899 garLoopResultBuilder]: For program point errorEXIT(lines 15 22) no Hoare annotation was computed. [2022-11-22 00:39:22,786 INFO L902 garLoopResultBuilder]: At program point errorENTRY(lines 15 22) the Hoare annotation is: true [2022-11-22 00:39:22,790 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:39:22,792 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-22 00:39:22,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 12:39:22 BoogieIcfgContainer [2022-11-22 00:39:22,925 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-22 00:39:22,926 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-22 00:39:22,926 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-22 00:39:22,926 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-22 00:39:22,927 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:33:46" (3/4) ... [2022-11-22 00:39:22,930 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-22 00:39:22,936 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2022-11-22 00:39:22,937 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2022-11-22 00:39:22,937 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2022-11-22 00:39:22,937 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2022-11-22 00:39:22,937 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2022-11-22 00:39:22,938 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2022-11-22 00:39:22,957 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 44 nodes and edges [2022-11-22 00:39:22,957 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2022-11-22 00:39:22,958 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-22 00:39:22,958 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-22 00:39:22,998 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((!(1 <= i) || !(C_1_i == 1)) || (C_1_st == \old(C_1_st) && \old(P_1_st) == P_1_st)) || !(1 <= C_1_pc)) || !(2 == C_1_pc)) || !(max_loop <= 2)) || !(0 <= num)) || !(0 <= i)) || !(i <= 1)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(e <= 0)) || !(num < 2147483648)) || !(1 <= P_1_pc)) && ((((((((((!(C_1_i == 1) || (C_1_st == \old(C_1_st) && \old(P_1_st) == P_1_st)) || !(2 == C_1_pc)) || !(P_1_pc <= 0)) || !(max_loop <= 2)) || !(num <= 0)) || !(2 <= i)) || !(0 <= num)) || !(i < 2147483646)) || !(P_1_i == 1)) || !(e <= 0))) && ((((((((((((((((((((((!(C_1_pr == 0) || !(#NULL == 0)) || !(data_1 == 0)) || !(1 <= i)) || !(C_1_i == 1)) || !(1 <= C_1_pc)) || !(P_1_ev == 0)) || !(2 == C_1_pc)) || !(e == 0)) || !(0 <= data_0)) || !(0 <= num)) || !(0 <= i)) || !(#NULL == 0)) || !(C_1_ev == 0)) || !(i <= 1)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(max_loop == 2)) || __retres1 == 0) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(num < 2147483648)) || !(1 <= P_1_pc)) || !(0 <= timer))) && (((((((((((((((((((((!(C_1_pr == 0) || !(#NULL == 0)) || !(data_1 == 0)) || !(1 <= i)) || !(C_1_i == 1)) || !(1 <= C_1_pc)) || !(P_1_ev == 0)) || !(C_1_pc == 1)) || !(e == 0)) || !(0 <= data_0)) || !(0 <= i)) || !(#NULL == 0)) || !(C_1_ev == 0)) || !(i <= 1)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(max_loop == 2)) || __retres1 == 0) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(1 <= num)) || !(num < 2147483648)) || !(0 <= timer))) && (((((((((((((!(C_1_i == 1) || (C_1_st == \old(C_1_st) && \old(P_1_st) == P_1_st)) || !(1 <= C_1_pc)) || !(2 == C_1_pc)) || !(max_loop <= 2)) || !(2 <= i)) || !(0 <= num)) || !(0 <= i)) || !(i <= 2147483646)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(e <= 0)) || !(num < 2147483648)) || !(1 <= P_1_pc))) && ((((((((((((((((((((((!(C_1_pr == 0) || !(#NULL == 0)) || !(data_1 == 0)) || !(C_1_i == 1)) || !(1 <= C_1_pc)) || !(P_1_ev == 0)) || !(2 == C_1_pc)) || !(e == 0)) || !(0 <= data_0)) || !(2 <= i)) || !(0 <= num)) || !(i < 2147483646)) || !(0 <= i)) || !(#NULL == 0)) || !(C_1_ev == 0)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(max_loop == 2)) || __retres1 == 0) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(num < 2147483648)) || !(1 <= P_1_pc)) || !(0 <= timer))) && ((((((((((((((((((((((((((!(\old(P_1_st) == 0) || !(#NULL == 0)) || !(data_1 == 0)) || !(C_1_i == 1)) || !(0 <= P_1_pc)) || !(0 <= C_1_pr)) || ((C_1_st == \old(C_1_st) && \old(P_1_st) == P_1_st) && __retres1 == 0)) || !(P_1_pc <= 0)) || !(C_1_pc <= 0)) || !(0 <= P_1_ev)) || !(timer == 0)) || !(0 <= #NULL)) || !(P_1_i == 1)) || !(e <= 0)) || !(max_loop == 2)) || !(C_1_pr <= 0)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(0 <= C_1_pc)) || !(0 <= C_1_ev)) || !(P_1_ev <= 0)) || !(num == 0)) || !(0 <= e)) || !(data_0 == 0)) || !(#NULL <= 0)) || !(C_1_ev <= 0)) || !(\old(C_1_st) == 0)) || !(i == 0))) && ((((((((((((!(1 <= i) || !(C_1_i == 1)) || (C_1_st == \old(C_1_st) && \old(P_1_st) == P_1_st)) || !(1 <= C_1_pc)) || !(C_1_pc == 1)) || !(max_loop <= 2)) || !(0 <= i)) || !(i <= 1)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(e <= 0)) || !(1 <= num)) || !(num < 2147483648))) && ((((((((((((((((((((((!(C_1_pr == 0) || !(#NULL == 0)) || !(data_1 == 0)) || !(1 <= i)) || !(C_1_i == 1)) || !(0 <= P_1_pc)) || !(1 <= C_1_pc)) || !(P_1_ev == 0)) || !(P_1_pc <= 0)) || !(C_1_pc == 1)) || !(0 <= i)) || !(#NULL == 0)) || !(C_1_ev == 0)) || !(i <= 1)) || !(P_1_i == 1)) || !(e <= 0)) || !(max_loop == 2)) || __retres1 == 0) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(num == 0)) || !(0 <= e)) || !(data_0 == 0)) || !(0 <= timer))) && ((((((((((((((((((((((!(C_1_pr == 0) || !(#NULL == 0)) || !(data_1 == 0)) || !(C_1_i == 1)) || !(1 <= C_1_pc)) || !(P_1_ev == 0)) || !(C_1_pc == 1)) || !(e == 0)) || !(0 <= data_0)) || !(i < 2147483646)) || !(0 <= i)) || !(#NULL == 0)) || !(C_1_ev == 0)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(max_loop == 2)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(1 <= num)) || !(num < 2147483648)) || !(0 <= timer)) && ((((((((((((((((((!(C_1_pr == 0) || !(#NULL == 0)) || !(data_1 == 0)) || !(C_1_i == 1)) || !(1 <= C_1_pc)) || !(P_1_ev == 0)) || !(C_1_pc == 1)) || !(e == 0)) || !(0 <= data_0)) || !(i < 2147483646)) || !(#NULL == 0)) || !(C_1_ev == 0)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(max_loop == 2)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(num == 0)) || !(1 <= P_1_pc)) || !(0 <= timer))) || !(2 <= i)) || __retres1 == 0)) && (((((((((((!(1 <= i) || !(C_1_i == 1)) || (C_1_st == \old(C_1_st) && \old(P_1_st) == P_1_st)) || !(1 <= C_1_pc)) || !(P_1_pc <= 0)) || !(C_1_pc == 1)) || !(max_loop <= 2)) || !(0 <= i)) || !(i <= 1)) || !(P_1_i == 1)) || !(e <= 0)) || !(num == 0))) && ((((C_1_st == \old(C_1_st) && \old(P_1_st) == P_1_st) || !(max_loop <= 2)) || !(2 <= i)) || (((((((((!(C_1_i == 1) || !(1 <= C_1_pc)) || !(C_1_pc == 1)) || !(i < 2147483646)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(e <= 0)) || !(num == 0)) || !(1 <= P_1_pc)) && (((((((((!(C_1_i == 1) || !(1 <= C_1_pc)) || !(C_1_pc == 1)) || !(i < 2147483646)) || !(0 <= i)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(e <= 0)) || !(1 <= num)) || !(num < 2147483648)))) [2022-11-22 00:39:23,000 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((num <= 0 && 2 == C_1_pc) && e <= 0) && max_loop <= 2) && P_1_i == 1) && P_1_pc <= 0) && !(tmp___2 == 0)) && 0 <= num) && 2 <= i) && (\result == 1 || !(P_1_st == 0))) && i < 2147483646) && C_1_i == 1) || ((max_loop <= 2 && ((((((((((C_1_pc == 1 && P_1_pc == 1) && e <= 0) && num < 2147483648) && P_1_i == 1) && !(tmp___2 == 0)) && 1 <= num) && (\result == 1 || !(P_1_st == 0))) && i < 2147483646) && C_1_i == 1) || ((((((((C_1_pc == 1 && P_1_pc == 1) && e <= 0) && P_1_i == 1) && num == 0) && !(tmp___2 == 0)) && (\result == 1 || !(P_1_st == 0))) && i < 2147483646) && C_1_i == 1))) && 2 <= i)) || ((((((((((1 <= i && C_1_pc == 1) && e <= 0) && max_loop <= 2) && i <= 1) && P_1_i == 1) && num == 0) && P_1_pc <= 0) && !(tmp___2 == 0)) && (\result == 1 || !(P_1_st == 0))) && C_1_i == 1)) || (((((((((((2 == C_1_pc && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && P_1_i == 1) && i <= 2147483646) && !(tmp___2 == 0)) && 0 <= num) && 2 <= i) && (\result == 1 || !(P_1_st == 0))) && C_1_i == 1)) || (((((((((((1 <= i && C_1_pc == 1) && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && i <= 1) && P_1_i == 1) && !(tmp___2 == 0)) && 1 <= num) && (\result == 1 || !(P_1_st == 0))) && C_1_i == 1)) || (((((((((((1 <= i && 2 == C_1_pc) && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && i <= 1) && P_1_i == 1) && !(tmp___2 == 0)) && 0 <= num) && (\result == 1 || !(P_1_st == 0))) && C_1_i == 1)) || (((((((((((((((((((((((((((((((0 <= tmp + 2147483648 && i <= 0) && C_1_st == 0) && tmp <= 2147483647) && tmp___2 <= 1) && e <= 0) && 0 <= e) && data_0 == 0) && 0 <= i) && kernel_st == 1) && !(tmp == 0)) && P_1_ev == 0) && count == 0) && P_1_st == 1) && C_1_pr == 0) && max_loop == 2) && P_1_i == 1) && C_1_ev <= 0) && num == 0) && P_1_pc <= 0) && 0 <= C_1_ev) && 0 <= P_1_pc) && #NULL == 0) && !(tmp___2 == 0)) && 0 <= tmp___2) && 0 <= C_1_pc) && C_1_pc <= 0) && 0 <= unknown-#StackHeapBarrier-unknown) && data_1 == 0) && timer == 0) && C_1_i == 1) && #NULL == 0) [2022-11-22 00:39:23,001 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((num <= 0 && tmp___2 <= 1) && i == 0) && e == 0) && data_0 == 0) && kernel_st == 1) && P_1_st == 0) && P_1_ev == 0) && count == 0) && C_1_pr == 0) && !(tmp___1 == 0)) && max_loop == 2) && P_1_i == 1) && C_1_pc == 0) && P_1_pc <= 0) && 0 <= P_1_pc) && #NULL == 0) && !(tmp___2 == 0)) && 0 <= tmp___2) && 0 <= num) && C_1_ev == 0) && tmp <= 0) && tmp___1 <= 2147483647) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= tmp) && data_1 == 0) && 0 <= tmp___1 + 2147483648) && timer == 0) && C_1_st == 1) && C_1_i == 1) && #NULL == 0) || (((((((((((num <= 0 && 2 == C_1_pc) && e <= 0) && max_loop <= 2) && P_1_i == 1) && P_1_pc <= 0) && !(tmp___2 == 0)) && 0 <= num) && 2 <= i) && (\result == 1 || !(C_1_st == 0))) && i < 2147483646) && C_1_i == 1)) || (((((((((((2 == C_1_pc && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && P_1_i == 1) && i <= 2147483646) && !(tmp___2 == 0)) && 0 <= num) && 2 <= i) && (\result == 1 || !(C_1_st == 0))) && C_1_i == 1)) || (((((((((((1 <= i && 2 == C_1_pc) && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && i <= 1) && P_1_i == 1) && !(tmp___2 == 0)) && 0 <= num) && (\result == 1 || !(C_1_st == 0))) && C_1_i == 1)) || ((((((((((((((((((((((((0 <= data_0 && P_1_pc == 1) && tmp___2 <= 1) && i == 0) && e == 0) && kernel_st == 1) && P_1_ev == 0) && count == 0) && C_1_pr == 0) && max_loop == 2) && 2 == P_1_st) && P_1_i == 1) && C_1_pc == 0) && 0 <= data_1) && #NULL == 0) && !(tmp___2 == 0)) && 0 <= tmp___2) && num <= 1) && C_1_ev == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 1 <= num) && (\result == 1 || !(C_1_st == 0))) && timer == 0) && C_1_i == 1) && #NULL == 0) [2022-11-22 00:39:23,001 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((C_1_st == \old(C_1_st) && (P_1_st == 0 || \old(P_1_st) == P_1_st)) && __retres1 == 0) || !(1 <= i)) || !(C_1_i == 1)) || !(1 <= C_1_pc)) || !(P_1_pc <= 0)) || !(C_1_pc == 1)) || !(max_loop <= 2)) || !(0 <= i)) || !(i <= 1)) || !(P_1_i == 1)) || !(e <= 0)) || !(num == 0)) && ((((((((((((((C_1_st == \old(C_1_st) && (P_1_st == 0 || \old(P_1_st) == P_1_st)) && __retres1 == 0) || !(1 <= i)) || !(C_1_i == 1)) || !(1 <= C_1_pc)) || !(C_1_pc == 1)) || !(max_loop <= 2)) || !(0 <= i)) || !(i <= 1)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(e <= 0)) || !(1 <= num)) || !(num < 2147483648))) && (((((C_1_st == \old(C_1_st) && (P_1_st == 0 || \old(P_1_st) == P_1_st)) && __retres1 == 0) || !(max_loop <= 2)) || !(2 <= i)) || (((((((((!(C_1_i == 1) || !(1 <= C_1_pc)) || !(C_1_pc == 1)) || !(i < 2147483646)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(e <= 0)) || !(num == 0)) || !(1 <= P_1_pc)) && (((((((((!(C_1_i == 1) || !(1 <= C_1_pc)) || !(C_1_pc == 1)) || !(i < 2147483646)) || !(0 <= i)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(e <= 0)) || !(1 <= num)) || !(num < 2147483648))))) && ((((((((((((((((((((((!(C_1_pr == 0) || !(#NULL == 0)) || !(data_1 == 0)) || !(1 <= i)) || !(C_1_i == 1)) || !(1 <= C_1_pc)) || !(P_1_ev == 0)) || !(2 == C_1_pc)) || !(e == 0)) || !(0 <= data_0)) || !(0 <= num)) || !(0 <= i)) || !(#NULL == 0)) || (((tmp == \result && \old(P_1_st) == P_1_st) && __retres1 == 0) && __retres1 == \result)) || !(C_1_ev == 0)) || !(i <= 1)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(max_loop == 2)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(num < 2147483648)) || !(1 <= P_1_pc)) || !(0 <= timer))) && (((((((((((((!(C_1_i == 1) || ((((0 <= i && C_1_st == \old(C_1_st)) && 1 <= P_1_pc) && (P_1_st == 0 || \old(P_1_st) == P_1_st)) && 1 <= C_1_pc)) || !(1 <= C_1_pc)) || !(2 == C_1_pc)) || !(max_loop <= 2)) || !(2 <= i)) || !(0 <= num)) || !(0 <= i)) || !(i <= 2147483646)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(e <= 0)) || !(num < 2147483648)) || !(1 <= P_1_pc))) && ((((((((((((((((((((((((((!(\old(P_1_st) == 0) || !(#NULL == 0)) || !(data_1 == 0)) || ((((((C_1_st == \old(C_1_st) && \old(P_1_st) == P_1_st) && tmp <= 0) && __retres1 == 0) && __retres1 == 0) && __retres1 == \result) && 0 <= tmp)) || !(C_1_i == 1)) || !(0 <= P_1_pc)) || !(0 <= C_1_pr)) || !(P_1_pc <= 0)) || !(C_1_pc <= 0)) || !(0 <= P_1_ev)) || !(timer == 0)) || !(0 <= #NULL)) || !(P_1_i == 1)) || !(e <= 0)) || !(max_loop == 2)) || !(C_1_pr <= 0)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(0 <= C_1_pc)) || !(0 <= C_1_ev)) || !(P_1_ev <= 0)) || !(num == 0)) || !(0 <= e)) || !(data_0 == 0)) || !(#NULL <= 0)) || !(C_1_ev <= 0)) || !(\old(C_1_st) == 0)) || !(i == 0))) && ((((((((((((((((((((((!(C_1_pr == 0) || !(#NULL == 0)) || !(data_1 == 0)) || !(C_1_i == 1)) || !(1 <= C_1_pc)) || !(P_1_ev == 0)) || !(2 == C_1_pc)) || !(e == 0)) || !(0 <= data_0)) || !(2 <= i)) || !(0 <= num)) || !(i < 2147483646)) || !(0 <= i)) || !(#NULL == 0)) || (((tmp == \result && \old(P_1_st) == P_1_st) && __retres1 == 0) && __retres1 == \result)) || !(C_1_ev == 0)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(max_loop == 2)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(num < 2147483648)) || !(1 <= P_1_pc)) || !(0 <= timer))) && (((((((((((((((((((((!(C_1_pr == 0) || !(#NULL == 0)) || !(data_1 == 0)) || !(1 <= i)) || !(C_1_i == 1)) || !(1 <= C_1_pc)) || !(P_1_ev == 0)) || !(C_1_pc == 1)) || !(e == 0)) || !(0 <= data_0)) || !(0 <= i)) || !(#NULL == 0)) || !(C_1_ev == 0)) || !(i <= 1)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(max_loop == 2)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || ((((\old(P_1_st) == P_1_st && tmp <= 0) && __retres1 == 0) && __retres1 == \result) && 0 <= tmp)) || !(1 <= num)) || !(num < 2147483648)) || !(0 <= timer))) && (((((((((((((((!(C_1_i == 1) || !(1 <= C_1_pc)) || !(2 == C_1_pc)) || !(max_loop <= 2)) || !(2 <= i)) || !(0 <= num)) || !(0 <= i)) || !(i <= 2147483646)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(e <= 0)) || !(P_1_ev <= 0)) || !(num < 2147483648)) || !(C_1_ev <= 0)) || __retres1 == 0) || !(1 <= P_1_pc))) && ((((((((((((((((((((((!(C_1_pr == 0) || !(#NULL == 0)) || !(data_1 == 0)) || !(1 <= i)) || !(C_1_i == 1)) || !(0 <= P_1_pc)) || !(1 <= C_1_pc)) || !(P_1_ev == 0)) || !(P_1_pc <= 0)) || !(C_1_pc == 1)) || !(0 <= i)) || !(#NULL == 0)) || !(C_1_ev == 0)) || !(i <= 1)) || !(P_1_i == 1)) || !(e <= 0)) || !(max_loop == 2)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || ((((\old(P_1_st) == P_1_st && tmp <= 0) && __retres1 == 0) && __retres1 == \result) && 0 <= tmp)) || !(num == 0)) || !(0 <= e)) || !(data_0 == 0)) || !(0 <= timer))) && ((((((((((((((((((((((!(C_1_pr == 0) || !(#NULL == 0)) || !(data_1 == 0)) || !(C_1_i == 1)) || !(1 <= C_1_pc)) || !(P_1_ev == 0)) || !(C_1_pc == 1)) || !(e == 0)) || !(0 <= data_0)) || !(i < 2147483646)) || !(0 <= i)) || !(#NULL == 0)) || !(C_1_ev == 0)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(max_loop == 2)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(1 <= num)) || !(num < 2147483648)) || !(0 <= timer)) && ((((((((((((((((((!(C_1_pr == 0) || !(#NULL == 0)) || !(data_1 == 0)) || !(C_1_i == 1)) || !(1 <= C_1_pc)) || !(P_1_ev == 0)) || !(C_1_pc == 1)) || !(e == 0)) || !(0 <= data_0)) || !(i < 2147483646)) || !(#NULL == 0)) || !(C_1_ev == 0)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(max_loop == 2)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(num == 0)) || !(1 <= P_1_pc)) || !(0 <= timer))) || !(2 <= i)) || ((((\old(P_1_st) == P_1_st && tmp <= 0) && __retres1 == 0) && __retres1 == \result) && 0 <= tmp))) && (((((((((((((!(1 <= i) || !(C_1_i == 1)) || ((((0 <= i && C_1_st == \old(C_1_st)) && 1 <= P_1_pc) && (P_1_st == 0 || \old(P_1_st) == P_1_st)) && 1 <= C_1_pc)) || !(1 <= C_1_pc)) || !(2 == C_1_pc)) || !(max_loop <= 2)) || !(0 <= num)) || !(0 <= i)) || !(i <= 1)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(e <= 0)) || !(num < 2147483648)) || !(1 <= P_1_pc))) && (((((((((((((((!(1 <= i) || !(C_1_i == 1)) || !(1 <= C_1_pc)) || !(2 == C_1_pc)) || !(max_loop <= 2)) || !(0 <= num)) || !(0 <= i)) || !(i <= 1)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(e <= 0)) || !(P_1_ev <= 0)) || !(num < 2147483648)) || !(C_1_ev <= 0)) || __retres1 == 0) || !(1 <= P_1_pc))) && (((((((((((C_1_st == \old(C_1_st) && (P_1_st == 0 || \old(P_1_st) == P_1_st)) || !(C_1_i == 1)) || !(2 == C_1_pc)) || !(P_1_pc <= 0)) || !(max_loop <= 2)) || !(num <= 0)) || !(2 <= i)) || !(0 <= num)) || !(i < 2147483646)) || !(P_1_i == 1)) || !(e <= 0)) [2022-11-22 00:39:23,002 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((i <= 0 && 0 <= data_0) && P_1_pc == 1) && tmp___2 <= 1) && e == 0) && 0 <= i) && kernel_st == 1) && P_1_ev == 0) && count == 0) && C_1_pr == 0) && max_loop == 2) && 2 == P_1_st) && P_1_i == 1) && C_1_pc == 0) && 0 <= data_1) && #NULL == 0) && !(tmp___2 == 0)) && 0 <= tmp___2) && num <= 1) && C_1_ev == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 1 <= num) && (\result == 1 || !(C_1_st == 0))) && timer == 0) && C_1_i == 1) && #NULL == 0) || ((1 <= i && max_loop <= 2) && ((((((((((((C_1_pc == 1 && P_1_pc == 1) && e <= 0) && 0 <= i) && i <= 1) && P_1_i == 1) && 1 <= P_1_pc) && !(tmp___2 == 0)) && num <= 1) && 0 <= num) && (\result == 1 || !(C_1_st == 0))) && C_1_i == 1) || ((((num < 2147483648 && !(tmp___2 == 0)) && ((((((C_1_pc == 1 && P_1_pc == 1) && e <= 0) && i <= 1) && P_1_i == 1) && 1 <= num) || (((((((2 == C_1_pc && P_1_pc == 1) && e <= 0) && 0 <= i) && i <= 1) && P_1_i == 1) && 1 <= P_1_pc) && 0 <= num))) && (\result == 1 || !(C_1_st == 0))) && C_1_i == 1)))) || (((((((((((((((((((((((((((((C_1_pc == 1 && tmp___2 <= 1) && e == 0) && data_0 == 0) && 0 <= i) && kernel_st == 1) && P_1_ev == 0) && count == 0) && C_1_pr == 0) && !(tmp___1 == 0)) && max_loop == 2) && P_1_i == 1) && C_1_ev <= 0) && 0 <= data_1) && num == 0) && P_1_pc <= 0) && 0 <= C_1_ev) && 0 <= P_1_pc) && #NULL == 0) && !(tmp___2 == 0)) && 0 <= tmp___2) && 0 <= timer) && data_1 <= 0) && tmp___1 <= 2147483647) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= tmp___1 + 2147483648) && C_1_st == 1) && C_1_i == 1) && !(P_1_st == 0)) && #NULL == 0)) || ((((((((((((C_1_pc == 1 && P_1_pc == 1) && e <= 0) && P_1_i == 1) && 1 <= num) && i < 2147483646) || (((((((2 == C_1_pc && P_1_pc == 1) && e <= 0) && 0 <= i) && P_1_i == 1) && 1 <= P_1_pc) && 0 <= num) && i < 2147483646)) && num < 2147483648) && max_loop <= 2) && !(tmp___2 == 0)) && 2 <= i) && (\result == 1 || !(C_1_st == 0))) && C_1_i == 1)) || ((((((((((1 <= i && C_1_pc == 1) && e <= 0) && max_loop <= 2) && i <= 1) && P_1_i == 1) && num == 0) && P_1_pc <= 0) && !(tmp___2 == 0)) && (\result == 1 || !(C_1_st == 0))) && C_1_i == 1)) || (((((((((((((C_1_pc == 1 && P_1_pc == 1) && e <= 0) && 0 <= i) && max_loop <= 2) && P_1_i == 1) && 1 <= P_1_pc) && !(tmp___2 == 0)) && num <= 1) && 0 <= num) && 2 <= i) && (\result == 1 || !(C_1_st == 0))) && i < 2147483646) && C_1_i == 1)) || ((((((((((((((((((((((((((((0 <= tmp + 2147483648 && C_1_pc == 1) && tmp <= 2147483647) && tmp___2 <= 1) && e == 0) && data_0 == 0) && 0 <= i) && kernel_st == 1) && P_1_ev == 0) && count == 0) && C_1_pr == 0) && !(tmp___1 == 0)) && max_loop == 2) && P_1_i == 1) && num == 0) && P_1_pc <= 0) && 0 <= P_1_pc) && #NULL == 0) && !(tmp___2 == 0)) && 0 <= tmp___2) && 0 <= timer) && C_1_ev == 0) && tmp___1 <= 2147483647) && 0 <= unknown-#StackHeapBarrier-unknown) && data_1 == 0) && 0 <= tmp___1 + 2147483648) && C_1_st == 1) && C_1_i == 1) && #NULL == 0) [2022-11-22 00:39:23,002 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((1 <= i && C_1_pc == 1) && e <= 0) && max_loop <= 2) && i <= 1) && 2 == P_1_st) && P_1_i == 1) && num == 0) && P_1_pc <= 0) && !(tmp___2 == 0)) && C_1_i == 1) || (((((((((((((((((((((((((((((((((0 <= tmp + 2147483648 && C_1_st == 0) && P_1_pc == 1) && tmp <= 2147483647) && tmp___2 <= 1) && i == 0) && e == 0) && kernel_st == 1) && c == data_0) && !(tmp == 0)) && \old(i___0) == i___0) && P_1_ev == 0) && count == 0) && 65 <= c) && C_1_pr == 0) && max_loop == 2) && 2 == P_1_st) && c <= 65) && P_1_i == 1) && \old(c) == 65) && 0 <= \old(i___0)) && C_1_pc == 0) && 0 <= data_1) && #NULL == 0) && !(tmp___2 == 0)) && 0 <= tmp___2) && num <= 1) && \old(i___0) <= 0) && C_1_ev == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 1 <= num) && timer == 0) && C_1_i == 1) && #NULL == 0)) || (((((((((((1 <= i && C_1_pc == 1) && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && i <= 1) && 2 == P_1_st) && P_1_i == 1) && !(tmp___2 == 0)) && 1 <= num) && C_1_i == 1)) || (((((((((((num <= 0 && 2 == C_1_pc) && e <= 0) && max_loop <= 2) && 2 == P_1_st) && P_1_i == 1) && P_1_pc <= 0) && !(tmp___2 == 0)) && 0 <= num) && 2 <= i) && i < 2147483646) && C_1_i == 1)) || (((((((((((1 <= i && 2 == C_1_pc) && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && i <= 1) && 2 == P_1_st) && P_1_i == 1) && !(tmp___2 == 0)) && 0 <= num) && C_1_i == 1)) || ((max_loop <= 2 && (((((((((C_1_pc == 1 && P_1_pc == 1) && e <= 0) && 2 == P_1_st) && P_1_i == 1) && num == 0) && !(tmp___2 == 0)) && i < 2147483646) && C_1_i == 1) || (((((((((C_1_pc == 1 && P_1_pc == 1) && e <= 0) && num < 2147483648) && 2 == P_1_st) && P_1_i == 1) && !(tmp___2 == 0)) && 1 <= num) && i < 2147483646) && C_1_i == 1))) && 2 <= i)) || ((((((((((((((((((((((((((((C_1_pc == 1 && C_1_st == 0) && tmp___2 <= 1) && e <= 0) && 0 <= e) && data_0 == 0) && 0 <= i) && kernel_st == 1) && P_1_ev == 0) && count == 0) && C_1_pr == 0) && i <= 1) && max_loop == 2) && 2 == P_1_st) && P_1_i == 1) && C_1_ev <= 0) && 0 <= data_1) && num == 0) && P_1_pc <= 0) && 0 <= C_1_ev) && 0 <= P_1_pc) && #NULL == 0) && !(tmp___2 == 0)) && 0 <= tmp___2) && 0 <= timer) && data_1 <= 0) && 0 <= unknown-#StackHeapBarrier-unknown) && C_1_i == 1) && #NULL == 0)) || (((((((((((2 == C_1_pc && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && 2 == P_1_st) && P_1_i == 1) && i <= 2147483646) && !(tmp___2 == 0)) && 0 <= num) && 2 <= i) && C_1_i == 1) [2022-11-22 00:39:23,004 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((0 <= tmp + 2147483648 && \old(c) == c) && C_1_st == 0) && tmp <= 2147483647) && tmp___2 <= 1) && i == 0) && e == 0) && kernel_st == 1) && i___0 == 0) && c == data_0) && !(tmp == 0)) && \old(i___0) == i___0) && P_1_ev == 0) && count == 0) && P_1_st == 1) && C_1_pr == 0) && max_loop == 2) && P_1_i == 1) && \old(c) == 65) && num <= i___0) && C_1_pc == 0) && 0 <= P_1_pc) && #NULL == 0) && !(tmp___2 == 0)) && 0 <= tmp___2) && 0 <= num) && C_1_ev == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && data_1 == 0) && timer == 0) && C_1_i == 1) && #NULL == 0) || ((1 <= i && max_loop <= 2) && ((((((((((num <= 0 && 2 == C_1_pc) && e <= 0) && i <= 1) && P_1_i == 1) && num <= i___0) && !(tmp___2 == 0)) && 0 <= num) && (\result == 1 || !(P_1_st == 0))) && C_1_i == 1) || ((((((((((2 == C_1_pc && P_1_pc == 1) && e <= 0) && i <= 1) && P_1_i == 1) && num <= i___0) && !(tmp___2 == 0)) && num <= 1) && 0 <= num) && (\result == 1 || !(P_1_st == 0))) && C_1_i == 1)))) || ((1 <= i && max_loop <= 2) && (((((((((C_1_pc == 1 && e <= 0) && i <= 1) && P_1_i == 1) && num <= i___0) && num == 0) && !(tmp___2 == 0)) && (\result == 1 || !(P_1_st == 0))) && C_1_i == 1) || ((((((((((C_1_pc == 1 && P_1_pc == 1) && e <= 0) && i <= 1) && P_1_i == 1) && num <= i___0) && !(tmp___2 == 0)) && num <= 1) && 1 <= num) && (\result == 1 || !(P_1_st == 0))) && C_1_i == 1))) [2022-11-22 00:39:23,010 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((1 <= i && P_1_pc == 1) && e <= 0) && 0 <= i) && max_loop <= 2) && i <= 1) && P_1_i == 1) && 1 <= P_1_pc) && !(tmp___2 == 0)) && num < 2147483647) && 0 <= num) && (\result == 1 || !(C_1_st == 0))) && C_1_i == 1) || ((((((((((((((num <= 0 && i <= 0) && P_1_pc == 1) && e <= 0) && 0 <= i) && !(2 == C_1_pc)) && max_loop <= 2) && P_1_ev <= 0) && 2 == P_1_st) && P_1_i == 1) && C_1_ev <= 0) && !(tmp___2 == 0)) && 0 <= num) && (\result == 1 || !(C_1_st == 0))) && C_1_i == 1)) || (((((((((((1 <= i && num <= 0) && e <= 0) && !(2 == C_1_pc)) && max_loop <= 2) && i <= 1) && P_1_i == 1) && P_1_pc <= 0) && !(tmp___2 == 0)) && 0 <= num) && (\result == 1 || !(C_1_st == 0))) && C_1_i == 1)) || ((((((((((((P_1_pc == 1 && e <= 0) && 0 <= i) && max_loop <= 2) && P_1_i == 1) && 1 <= P_1_pc) && !(tmp___2 == 0)) && num < 2147483647) && 0 <= num) && 2 <= i) && (\result == 1 || !(C_1_st == 0))) && i < 2147483646) && C_1_i == 1) [2022-11-22 00:39:23,066 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/bin/utaipan-g80aRyZoba/witness.graphml [2022-11-22 00:39:23,066 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-22 00:39:23,067 INFO L158 Benchmark]: Toolchain (without parser) took 337841.45ms. Allocated memory was 178.3MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 134.1MB in the beginning and 3.4GB in the end (delta: -3.2GB). Peak memory consumption was 574.8MB. Max. memory is 16.1GB. [2022-11-22 00:39:23,070 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 134.2MB. Free memory is still 76.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 00:39:23,070 INFO L158 Benchmark]: CACSL2BoogieTranslator took 376.39ms. Allocated memory is still 178.3MB. Free memory was 134.1MB in the beginning and 120.9MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-22 00:39:23,073 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.33ms. Allocated memory is still 178.3MB. Free memory was 120.9MB in the beginning and 118.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 00:39:23,073 INFO L158 Benchmark]: Boogie Preprocessor took 34.10ms. Allocated memory is still 178.3MB. Free memory was 118.9MB in the beginning and 117.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 00:39:23,078 INFO L158 Benchmark]: RCFGBuilder took 882.94ms. Allocated memory is still 178.3MB. Free memory was 117.3MB in the beginning and 143.5MB in the end (delta: -26.1MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. [2022-11-22 00:39:23,078 INFO L158 Benchmark]: TraceAbstraction took 336348.20ms. Allocated memory was 178.3MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 142.3MB in the beginning and 3.4GB in the end (delta: -3.2GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. [2022-11-22 00:39:23,084 INFO L158 Benchmark]: Witness Printer took 140.68ms. Allocated memory is still 4.0GB. Free memory was 3.4GB in the beginning and 3.4GB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-22 00:39:23,085 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.37ms. Allocated memory is still 134.2MB. Free memory is still 76.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 376.39ms. Allocated memory is still 178.3MB. Free memory was 134.1MB in the beginning and 120.9MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.33ms. Allocated memory is still 178.3MB. Free memory was 120.9MB in the beginning and 118.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.10ms. Allocated memory is still 178.3MB. Free memory was 118.9MB in the beginning and 117.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 882.94ms. Allocated memory is still 178.3MB. Free memory was 117.3MB in the beginning and 143.5MB in the end (delta: -26.1MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. * TraceAbstraction took 336348.20ms. Allocated memory was 178.3MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 142.3MB in the beginning and 3.4GB in the end (delta: -3.2GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. * Witness Printer took 140.68ms. Allocated memory is still 4.0GB. Free memory was 3.4GB in the beginning and 3.4GB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. 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: 97]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 97]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 160]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 160]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 169]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 169]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 179]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 179]: 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 7 procedures, 89 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 336.1s, OverallIterations: 27, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 63.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 145.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6788 SdHoareTripleChecker+Valid, 14.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6735 mSDsluCounter, 8755 SdHoareTripleChecker+Invalid, 12.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5712 mSDsCounter, 1752 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14328 IncrementalHoareTripleChecker+Invalid, 16080 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1752 mSolverCounterUnsat, 3043 mSDtfsCounter, 14328 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4166 GetRequests, 3337 SyntacticMatches, 97 SemanticMatches, 732 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23307 ImplicationChecksByTransitivity, 103.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20274occurred in iteration=25, InterpolantAutomatonStates: 476, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 13.6s AutomataMinimizationTime, 27 MinimizatonAttempts, 22184 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 39 LocationsWithAnnotation, 12723 PreInvPairs, 13709 NumberOfFragments, 9141 HoareAnnotationTreeSize, 12723 FomulaSimplifications, 157542 FormulaSimplificationTreeSizeReduction, 70.2s HoareSimplificationTime, 39 FomulaSimplificationsInter, 900223 FormulaSimplificationTreeSizeReductionInter, 74.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 8.0s InterpolantComputationTime, 4344 NumberOfCodeBlocks, 4344 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 5274 ConstructedInterpolants, 0 QuantifiedInterpolants, 10638 SizeOfPredicates, 8 NumberOfNonLiveVariables, 5460 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 49 InterpolantComputations, 19 PerfectInterpolantSequences, 6273/6812 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: 23.9s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 36, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 548, DAG_INTERPRETER_EARLY_EXITS: 2, TOOLS_POST_APPLICATIONS: 656, TOOLS_POST_TIME: 9.1s, TOOLS_POST_CALL_APPLICATIONS: 380, TOOLS_POST_CALL_TIME: 6.1s, TOOLS_POST_RETURN_APPLICATIONS: 314, TOOLS_POST_RETURN_TIME: 2.6s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 1350, TOOLS_QUANTIFIERELIM_TIME: 17.3s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.2s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 1507, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 419, DOMAIN_JOIN_TIME: 4.8s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 7, DOMAIN_WIDEN_TIME: 0.1s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 13, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 548, DOMAIN_ISBOTTOM_TIME: 0.7s, LOOP_SUMMARIZER_APPLICATIONS: 6, LOOP_SUMMARIZER_CACHE_MISSES: 6, LOOP_SUMMARIZER_OVERALL_TIME: 12.4s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 12.4s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 13, CALL_SUMMARIZER_APPLICATIONS: 314, CALL_SUMMARIZER_CACHE_MISSES: 30, CALL_SUMMARIZER_OVERALL_TIME: 0.2s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.2s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.2s, DAG_COMPRESSION_TIME: 0.1s, DAG_COMPRESSION_PROCESSED_NODES: 9877, DAG_COMPRESSION_RETAINED_NODES: 1202, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 417]: Loop Invariant Derived loop invariant: (((((((((((((1 <= i && C_1_pc == 1) && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && i <= 1) && P_1_i == 1) && 1 <= num) && C_1_i == 1) || ((((((((1 <= i && C_1_pc == 1) && e <= 0) && max_loop <= 2) && i <= 1) && P_1_i == 1) && num == 0) && P_1_pc <= 0) && C_1_i == 1)) || (((((((((1 <= i && 2 == C_1_pc) && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && i <= 1) && P_1_i == 1) && 0 <= num) && C_1_i == 1)) || (((((((((C_1_pc == 1 && P_1_pc == 1) && e <= 0) && P_1_i == 1) && num == 0) && i < 2147483646) && C_1_i == 1) || (((((((C_1_pc == 1 && P_1_pc == 1) && e <= 0) && num < 2147483648) && P_1_i == 1) && 1 <= num) && i < 2147483646) && C_1_i == 1)) && max_loop <= 2) && 2 <= i)) || (((((((((num <= 0 && 2 == C_1_pc) && e <= 0) && max_loop <= 2) && P_1_i == 1) && P_1_pc <= 0) && 0 <= num) && 2 <= i) && i < 2147483646) && C_1_i == 1)) || (((((((((2 == C_1_pc && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && P_1_i == 1) && i <= 2147483646) && 0 <= num) && 2 <= i) && C_1_i == 1) - InvariantResult [Line: 81]: Loop Invariant Derived loop invariant: ((((((((((((((((num <= 0 && 2 == C_1_pc) && e <= 0) && max_loop <= 2) && P_1_i == 1) && P_1_pc <= 0) && !(tmp___2 == 0)) && 0 <= num) && 2 <= i) && (\result == 1 || !(P_1_st == 0))) && i < 2147483646) && C_1_i == 1) || ((max_loop <= 2 && ((((((((((C_1_pc == 1 && P_1_pc == 1) && e <= 0) && num < 2147483648) && P_1_i == 1) && !(tmp___2 == 0)) && 1 <= num) && (\result == 1 || !(P_1_st == 0))) && i < 2147483646) && C_1_i == 1) || ((((((((C_1_pc == 1 && P_1_pc == 1) && e <= 0) && P_1_i == 1) && num == 0) && !(tmp___2 == 0)) && (\result == 1 || !(P_1_st == 0))) && i < 2147483646) && C_1_i == 1))) && 2 <= i)) || ((((((((((1 <= i && C_1_pc == 1) && e <= 0) && max_loop <= 2) && i <= 1) && P_1_i == 1) && num == 0) && P_1_pc <= 0) && !(tmp___2 == 0)) && (\result == 1 || !(P_1_st == 0))) && C_1_i == 1)) || (((((((((((2 == C_1_pc && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && P_1_i == 1) && i <= 2147483646) && !(tmp___2 == 0)) && 0 <= num) && 2 <= i) && (\result == 1 || !(P_1_st == 0))) && C_1_i == 1)) || (((((((((((1 <= i && C_1_pc == 1) && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && i <= 1) && P_1_i == 1) && !(tmp___2 == 0)) && 1 <= num) && (\result == 1 || !(P_1_st == 0))) && C_1_i == 1)) || (((((((((((1 <= i && 2 == C_1_pc) && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && i <= 1) && P_1_i == 1) && !(tmp___2 == 0)) && 0 <= num) && (\result == 1 || !(P_1_st == 0))) && C_1_i == 1)) || (((((((((((((((((((((((((((((((0 <= tmp + 2147483648 && i <= 0) && C_1_st == 0) && tmp <= 2147483647) && tmp___2 <= 1) && e <= 0) && 0 <= e) && data_0 == 0) && 0 <= i) && kernel_st == 1) && !(tmp == 0)) && P_1_ev == 0) && count == 0) && P_1_st == 1) && C_1_pr == 0) && max_loop == 2) && P_1_i == 1) && C_1_ev <= 0) && num == 0) && P_1_pc <= 0) && 0 <= C_1_ev) && 0 <= P_1_pc) && #NULL == 0) && !(tmp___2 == 0)) && 0 <= tmp___2) && 0 <= C_1_pc) && C_1_pc <= 0) && 0 <= unknown-#StackHeapBarrier-unknown) && data_1 == 0) && timer == 0) && C_1_i == 1) && #NULL == 0) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 430]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((C_1_st == \old(C_1_st) && (P_1_st == 0 || \old(P_1_st) == P_1_st)) && __retres1 == 0) || !(1 <= i)) || !(C_1_i == 1)) || !(1 <= C_1_pc)) || !(P_1_pc <= 0)) || !(C_1_pc == 1)) || !(max_loop <= 2)) || !(0 <= i)) || !(i <= 1)) || !(P_1_i == 1)) || !(e <= 0)) || !(num == 0)) && ((((((((((((((C_1_st == \old(C_1_st) && (P_1_st == 0 || \old(P_1_st) == P_1_st)) && __retres1 == 0) || !(1 <= i)) || !(C_1_i == 1)) || !(1 <= C_1_pc)) || !(C_1_pc == 1)) || !(max_loop <= 2)) || !(0 <= i)) || !(i <= 1)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(e <= 0)) || !(1 <= num)) || !(num < 2147483648))) && (((((C_1_st == \old(C_1_st) && (P_1_st == 0 || \old(P_1_st) == P_1_st)) && __retres1 == 0) || !(max_loop <= 2)) || !(2 <= i)) || (((((((((!(C_1_i == 1) || !(1 <= C_1_pc)) || !(C_1_pc == 1)) || !(i < 2147483646)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(e <= 0)) || !(num == 0)) || !(1 <= P_1_pc)) && (((((((((!(C_1_i == 1) || !(1 <= C_1_pc)) || !(C_1_pc == 1)) || !(i < 2147483646)) || !(0 <= i)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(e <= 0)) || !(1 <= num)) || !(num < 2147483648))))) && ((((((((((((((((((((((!(C_1_pr == 0) || !(#NULL == 0)) || !(data_1 == 0)) || !(1 <= i)) || !(C_1_i == 1)) || !(1 <= C_1_pc)) || !(P_1_ev == 0)) || !(2 == C_1_pc)) || !(e == 0)) || !(0 <= data_0)) || !(0 <= num)) || !(0 <= i)) || !(#NULL == 0)) || (((tmp == \result && \old(P_1_st) == P_1_st) && __retres1 == 0) && __retres1 == \result)) || !(C_1_ev == 0)) || !(i <= 1)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(max_loop == 2)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(num < 2147483648)) || !(1 <= P_1_pc)) || !(0 <= timer))) && (((((((((((((!(C_1_i == 1) || ((((0 <= i && C_1_st == \old(C_1_st)) && 1 <= P_1_pc) && (P_1_st == 0 || \old(P_1_st) == P_1_st)) && 1 <= C_1_pc)) || !(1 <= C_1_pc)) || !(2 == C_1_pc)) || !(max_loop <= 2)) || !(2 <= i)) || !(0 <= num)) || !(0 <= i)) || !(i <= 2147483646)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(e <= 0)) || !(num < 2147483648)) || !(1 <= P_1_pc))) && ((((((((((((((((((((((((((!(\old(P_1_st) == 0) || !(#NULL == 0)) || !(data_1 == 0)) || ((((((C_1_st == \old(C_1_st) && \old(P_1_st) == P_1_st) && tmp <= 0) && __retres1 == 0) && __retres1 == 0) && __retres1 == \result) && 0 <= tmp)) || !(C_1_i == 1)) || !(0 <= P_1_pc)) || !(0 <= C_1_pr)) || !(P_1_pc <= 0)) || !(C_1_pc <= 0)) || !(0 <= P_1_ev)) || !(timer == 0)) || !(0 <= #NULL)) || !(P_1_i == 1)) || !(e <= 0)) || !(max_loop == 2)) || !(C_1_pr <= 0)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(0 <= C_1_pc)) || !(0 <= C_1_ev)) || !(P_1_ev <= 0)) || !(num == 0)) || !(0 <= e)) || !(data_0 == 0)) || !(#NULL <= 0)) || !(C_1_ev <= 0)) || !(\old(C_1_st) == 0)) || !(i == 0))) && ((((((((((((((((((((((!(C_1_pr == 0) || !(#NULL == 0)) || !(data_1 == 0)) || !(C_1_i == 1)) || !(1 <= C_1_pc)) || !(P_1_ev == 0)) || !(2 == C_1_pc)) || !(e == 0)) || !(0 <= data_0)) || !(2 <= i)) || !(0 <= num)) || !(i < 2147483646)) || !(0 <= i)) || !(#NULL == 0)) || (((tmp == \result && \old(P_1_st) == P_1_st) && __retres1 == 0) && __retres1 == \result)) || !(C_1_ev == 0)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(max_loop == 2)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(num < 2147483648)) || !(1 <= P_1_pc)) || !(0 <= timer))) && (((((((((((((((((((((!(C_1_pr == 0) || !(#NULL == 0)) || !(data_1 == 0)) || !(1 <= i)) || !(C_1_i == 1)) || !(1 <= C_1_pc)) || !(P_1_ev == 0)) || !(C_1_pc == 1)) || !(e == 0)) || !(0 <= data_0)) || !(0 <= i)) || !(#NULL == 0)) || !(C_1_ev == 0)) || !(i <= 1)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(max_loop == 2)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || ((((\old(P_1_st) == P_1_st && tmp <= 0) && __retres1 == 0) && __retres1 == \result) && 0 <= tmp)) || !(1 <= num)) || !(num < 2147483648)) || !(0 <= timer))) && (((((((((((((((!(C_1_i == 1) || !(1 <= C_1_pc)) || !(2 == C_1_pc)) || !(max_loop <= 2)) || !(2 <= i)) || !(0 <= num)) || !(0 <= i)) || !(i <= 2147483646)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(e <= 0)) || !(P_1_ev <= 0)) || !(num < 2147483648)) || !(C_1_ev <= 0)) || __retres1 == 0) || !(1 <= P_1_pc))) && ((((((((((((((((((((((!(C_1_pr == 0) || !(#NULL == 0)) || !(data_1 == 0)) || !(1 <= i)) || !(C_1_i == 1)) || !(0 <= P_1_pc)) || !(1 <= C_1_pc)) || !(P_1_ev == 0)) || !(P_1_pc <= 0)) || !(C_1_pc == 1)) || !(0 <= i)) || !(#NULL == 0)) || !(C_1_ev == 0)) || !(i <= 1)) || !(P_1_i == 1)) || !(e <= 0)) || !(max_loop == 2)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || ((((\old(P_1_st) == P_1_st && tmp <= 0) && __retres1 == 0) && __retres1 == \result) && 0 <= tmp)) || !(num == 0)) || !(0 <= e)) || !(data_0 == 0)) || !(0 <= timer))) && ((((((((((((((((((((((!(C_1_pr == 0) || !(#NULL == 0)) || !(data_1 == 0)) || !(C_1_i == 1)) || !(1 <= C_1_pc)) || !(P_1_ev == 0)) || !(C_1_pc == 1)) || !(e == 0)) || !(0 <= data_0)) || !(i < 2147483646)) || !(0 <= i)) || !(#NULL == 0)) || !(C_1_ev == 0)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(max_loop == 2)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(1 <= num)) || !(num < 2147483648)) || !(0 <= timer)) && ((((((((((((((((((!(C_1_pr == 0) || !(#NULL == 0)) || !(data_1 == 0)) || !(C_1_i == 1)) || !(1 <= C_1_pc)) || !(P_1_ev == 0)) || !(C_1_pc == 1)) || !(e == 0)) || !(0 <= data_0)) || !(i < 2147483646)) || !(#NULL == 0)) || !(C_1_ev == 0)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(max_loop == 2)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(num == 0)) || !(1 <= P_1_pc)) || !(0 <= timer))) || !(2 <= i)) || ((((\old(P_1_st) == P_1_st && tmp <= 0) && __retres1 == 0) && __retres1 == \result) && 0 <= tmp))) && (((((((((((((!(1 <= i) || !(C_1_i == 1)) || ((((0 <= i && C_1_st == \old(C_1_st)) && 1 <= P_1_pc) && (P_1_st == 0 || \old(P_1_st) == P_1_st)) && 1 <= C_1_pc)) || !(1 <= C_1_pc)) || !(2 == C_1_pc)) || !(max_loop <= 2)) || !(0 <= num)) || !(0 <= i)) || !(i <= 1)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(e <= 0)) || !(num < 2147483648)) || !(1 <= P_1_pc))) && (((((((((((((((!(1 <= i) || !(C_1_i == 1)) || !(1 <= C_1_pc)) || !(2 == C_1_pc)) || !(max_loop <= 2)) || !(0 <= num)) || !(0 <= i)) || !(i <= 1)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(e <= 0)) || !(P_1_ev <= 0)) || !(num < 2147483648)) || !(C_1_ev <= 0)) || __retres1 == 0) || !(1 <= P_1_pc))) && (((((((((((C_1_st == \old(C_1_st) && (P_1_st == 0 || \old(P_1_st) == P_1_st)) || !(C_1_i == 1)) || !(2 == C_1_pc)) || !(P_1_pc <= 0)) || !(max_loop <= 2)) || !(num <= 0)) || !(2 <= i)) || !(0 <= num)) || !(i < 2147483646)) || !(P_1_i == 1)) || !(e <= 0)) - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: ((((((((((((((1 <= i && P_1_pc == 1) && e <= 0) && 0 <= i) && max_loop <= 2) && i <= 1) && P_1_i == 1) && 1 <= P_1_pc) && !(tmp___2 == 0)) && num < 2147483647) && 0 <= num) && (\result == 1 || !(C_1_st == 0))) && C_1_i == 1) || ((((((((((((((num <= 0 && i <= 0) && P_1_pc == 1) && e <= 0) && 0 <= i) && !(2 == C_1_pc)) && max_loop <= 2) && P_1_ev <= 0) && 2 == P_1_st) && P_1_i == 1) && C_1_ev <= 0) && !(tmp___2 == 0)) && 0 <= num) && (\result == 1 || !(C_1_st == 0))) && C_1_i == 1)) || (((((((((((1 <= i && num <= 0) && e <= 0) && !(2 == C_1_pc)) && max_loop <= 2) && i <= 1) && P_1_i == 1) && P_1_pc <= 0) && !(tmp___2 == 0)) && 0 <= num) && (\result == 1 || !(C_1_st == 0))) && C_1_i == 1)) || ((((((((((((P_1_pc == 1 && e <= 0) && 0 <= i) && max_loop <= 2) && P_1_i == 1) && 1 <= P_1_pc) && !(tmp___2 == 0)) && num < 2147483647) && 0 <= num) && 2 <= i) && (\result == 1 || !(C_1_st == 0))) && i < 2147483646) && C_1_i == 1) - InvariantResult [Line: 464]: Loop Invariant Derived loop invariant: (((((((((((((1 <= i && C_1_pc == 1) && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && i <= 1) && P_1_i == 1) && 1 <= num) && C_1_i == 1) || ((((((((1 <= i && C_1_pc == 1) && e <= 0) && max_loop <= 2) && i <= 1) && P_1_i == 1) && num == 0) && P_1_pc <= 0) && C_1_i == 1)) || (((((((((1 <= i && 2 == C_1_pc) && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && i <= 1) && P_1_i == 1) && 0 <= num) && C_1_i == 1)) || (((((((((C_1_pc == 1 && P_1_pc == 1) && e <= 0) && P_1_i == 1) && num == 0) && i < 2147483646) && C_1_i == 1) || (((((((C_1_pc == 1 && P_1_pc == 1) && e <= 0) && num < 2147483648) && P_1_i == 1) && 1 <= num) && i < 2147483646) && C_1_i == 1)) && max_loop <= 2) && 2 <= i)) || (((((((((num <= 0 && 2 == C_1_pc) && e <= 0) && max_loop <= 2) && P_1_i == 1) && P_1_pc <= 0) && 0 <= num) && 2 <= i) && i < 2147483646) && C_1_i == 1)) || (((((((((2 == C_1_pc && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && P_1_i == 1) && i <= 2147483646) && 0 <= num) && 2 <= i) && C_1_i == 1) - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((!(1 <= i) || !(C_1_i == 1)) || (C_1_st == \old(C_1_st) && \old(P_1_st) == P_1_st)) || !(1 <= C_1_pc)) || !(2 == C_1_pc)) || !(max_loop <= 2)) || !(0 <= num)) || !(0 <= i)) || !(i <= 1)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(e <= 0)) || !(num < 2147483648)) || !(1 <= P_1_pc)) && ((((((((((!(C_1_i == 1) || (C_1_st == \old(C_1_st) && \old(P_1_st) == P_1_st)) || !(2 == C_1_pc)) || !(P_1_pc <= 0)) || !(max_loop <= 2)) || !(num <= 0)) || !(2 <= i)) || !(0 <= num)) || !(i < 2147483646)) || !(P_1_i == 1)) || !(e <= 0))) && ((((((((((((((((((((((!(C_1_pr == 0) || !(#NULL == 0)) || !(data_1 == 0)) || !(1 <= i)) || !(C_1_i == 1)) || !(1 <= C_1_pc)) || !(P_1_ev == 0)) || !(2 == C_1_pc)) || !(e == 0)) || !(0 <= data_0)) || !(0 <= num)) || !(0 <= i)) || !(#NULL == 0)) || !(C_1_ev == 0)) || !(i <= 1)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(max_loop == 2)) || __retres1 == 0) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(num < 2147483648)) || !(1 <= P_1_pc)) || !(0 <= timer))) && (((((((((((((((((((((!(C_1_pr == 0) || !(#NULL == 0)) || !(data_1 == 0)) || !(1 <= i)) || !(C_1_i == 1)) || !(1 <= C_1_pc)) || !(P_1_ev == 0)) || !(C_1_pc == 1)) || !(e == 0)) || !(0 <= data_0)) || !(0 <= i)) || !(#NULL == 0)) || !(C_1_ev == 0)) || !(i <= 1)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(max_loop == 2)) || __retres1 == 0) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(1 <= num)) || !(num < 2147483648)) || !(0 <= timer))) && (((((((((((((!(C_1_i == 1) || (C_1_st == \old(C_1_st) && \old(P_1_st) == P_1_st)) || !(1 <= C_1_pc)) || !(2 == C_1_pc)) || !(max_loop <= 2)) || !(2 <= i)) || !(0 <= num)) || !(0 <= i)) || !(i <= 2147483646)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(e <= 0)) || !(num < 2147483648)) || !(1 <= P_1_pc))) && ((((((((((((((((((((((!(C_1_pr == 0) || !(#NULL == 0)) || !(data_1 == 0)) || !(C_1_i == 1)) || !(1 <= C_1_pc)) || !(P_1_ev == 0)) || !(2 == C_1_pc)) || !(e == 0)) || !(0 <= data_0)) || !(2 <= i)) || !(0 <= num)) || !(i < 2147483646)) || !(0 <= i)) || !(#NULL == 0)) || !(C_1_ev == 0)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(max_loop == 2)) || __retres1 == 0) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(num < 2147483648)) || !(1 <= P_1_pc)) || !(0 <= timer))) && ((((((((((((((((((((((((((!(\old(P_1_st) == 0) || !(#NULL == 0)) || !(data_1 == 0)) || !(C_1_i == 1)) || !(0 <= P_1_pc)) || !(0 <= C_1_pr)) || ((C_1_st == \old(C_1_st) && \old(P_1_st) == P_1_st) && __retres1 == 0)) || !(P_1_pc <= 0)) || !(C_1_pc <= 0)) || !(0 <= P_1_ev)) || !(timer == 0)) || !(0 <= #NULL)) || !(P_1_i == 1)) || !(e <= 0)) || !(max_loop == 2)) || !(C_1_pr <= 0)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(0 <= C_1_pc)) || !(0 <= C_1_ev)) || !(P_1_ev <= 0)) || !(num == 0)) || !(0 <= e)) || !(data_0 == 0)) || !(#NULL <= 0)) || !(C_1_ev <= 0)) || !(\old(C_1_st) == 0)) || !(i == 0))) && ((((((((((((!(1 <= i) || !(C_1_i == 1)) || (C_1_st == \old(C_1_st) && \old(P_1_st) == P_1_st)) || !(1 <= C_1_pc)) || !(C_1_pc == 1)) || !(max_loop <= 2)) || !(0 <= i)) || !(i <= 1)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(e <= 0)) || !(1 <= num)) || !(num < 2147483648))) && ((((((((((((((((((((((!(C_1_pr == 0) || !(#NULL == 0)) || !(data_1 == 0)) || !(1 <= i)) || !(C_1_i == 1)) || !(0 <= P_1_pc)) || !(1 <= C_1_pc)) || !(P_1_ev == 0)) || !(P_1_pc <= 0)) || !(C_1_pc == 1)) || !(0 <= i)) || !(#NULL == 0)) || !(C_1_ev == 0)) || !(i <= 1)) || !(P_1_i == 1)) || !(e <= 0)) || !(max_loop == 2)) || __retres1 == 0) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(num == 0)) || !(0 <= e)) || !(data_0 == 0)) || !(0 <= timer))) && ((((((((((((((((((((((!(C_1_pr == 0) || !(#NULL == 0)) || !(data_1 == 0)) || !(C_1_i == 1)) || !(1 <= C_1_pc)) || !(P_1_ev == 0)) || !(C_1_pc == 1)) || !(e == 0)) || !(0 <= data_0)) || !(i < 2147483646)) || !(0 <= i)) || !(#NULL == 0)) || !(C_1_ev == 0)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(max_loop == 2)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(1 <= num)) || !(num < 2147483648)) || !(0 <= timer)) && ((((((((((((((((((!(C_1_pr == 0) || !(#NULL == 0)) || !(data_1 == 0)) || !(C_1_i == 1)) || !(1 <= C_1_pc)) || !(P_1_ev == 0)) || !(C_1_pc == 1)) || !(e == 0)) || !(0 <= data_0)) || !(i < 2147483646)) || !(#NULL == 0)) || !(C_1_ev == 0)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(max_loop == 2)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(num == 0)) || !(1 <= P_1_pc)) || !(0 <= timer))) || !(2 <= i)) || __retres1 == 0)) && (((((((((((!(1 <= i) || !(C_1_i == 1)) || (C_1_st == \old(C_1_st) && \old(P_1_st) == P_1_st)) || !(1 <= C_1_pc)) || !(P_1_pc <= 0)) || !(C_1_pc == 1)) || !(max_loop <= 2)) || !(0 <= i)) || !(i <= 1)) || !(P_1_i == 1)) || !(e <= 0)) || !(num == 0))) && ((((C_1_st == \old(C_1_st) && \old(P_1_st) == P_1_st) || !(max_loop <= 2)) || !(2 <= i)) || (((((((((!(C_1_i == 1) || !(1 <= C_1_pc)) || !(C_1_pc == 1)) || !(i < 2147483646)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(e <= 0)) || !(num == 0)) || !(1 <= P_1_pc)) && (((((((((!(C_1_i == 1) || !(1 <= C_1_pc)) || !(C_1_pc == 1)) || !(i < 2147483646)) || !(0 <= i)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(e <= 0)) || !(1 <= num)) || !(num < 2147483648)))) - InvariantResult [Line: 438]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((unknown-#length-unknown[3] == 12 && 13 == unknown-#length-unknown[2]) && C_1_st == 0) && i == 0) && e == 0) && kernel_st == 0) && data_0 == 0) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && P_1_st == 0) && P_1_ev == 0) && count == 0) && C_1_pr == 0) && max_loop == 2) && P_1_i == 1) && \valid[1] == 1) && P_1_pc == 0) && C_1_pc == 0) && num == 0) && \valid[0] == 0) && \valid[2] == 1) && #NULL == 0) && unknown-#memory_int-unknown[1][0] == 48) && unknown-#memory_int-unknown[1][1] == 0) && C_1_ev == 0) && data_1 == 0) && timer == 0) && C_1_i == 1) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0 - InvariantResult [Line: 442]: Loop Invariant Derived loop invariant: ((((((((((((((1 <= i && C_1_pc == 1) && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && i <= 1) && P_1_i == 1) && 1 <= num) && C_1_i == 1) || ((((((((1 <= i && C_1_pc == 1) && e <= 0) && max_loop <= 2) && i <= 1) && P_1_i == 1) && num == 0) && P_1_pc <= 0) && C_1_i == 1)) || (((((((((1 <= i && 2 == C_1_pc) && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && i <= 1) && P_1_i == 1) && 0 <= num) && C_1_i == 1)) || (((((((((((((((((((((((((((((unknown-#length-unknown[3] == 12 && 13 == unknown-#length-unknown[2]) && C_1_st == 0) && i == 0) && e == 0) && kernel_st == 0) && data_0 == 0) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && P_1_st == 0) && P_1_ev == 0) && count == 0) && C_1_pr == 0) && max_loop == 2) && P_1_i == 1) && \valid[1] == 1) && P_1_pc == 0) && C_1_pc == 0) && num == 0) && \valid[0] == 0) && \valid[2] == 1) && #NULL == 0) && unknown-#memory_int-unknown[1][0] == 48) && unknown-#memory_int-unknown[1][1] == 0) && C_1_ev == 0) && data_1 == 0) && timer == 0) && C_1_i == 1) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || (((((((((C_1_pc == 1 && P_1_pc == 1) && e <= 0) && P_1_i == 1) && num == 0) && i < 2147483646) && C_1_i == 1) || (((((((C_1_pc == 1 && P_1_pc == 1) && e <= 0) && num < 2147483648) && P_1_i == 1) && 1 <= num) && i < 2147483646) && C_1_i == 1)) && max_loop <= 2) && 2 <= i)) || (((((((((num <= 0 && 2 == C_1_pc) && e <= 0) && max_loop <= 2) && P_1_i == 1) && P_1_pc <= 0) && 0 <= num) && 2 <= i) && i < 2147483646) && C_1_i == 1)) || (((((((((2 == C_1_pc && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && P_1_i == 1) && i <= 2147483646) && 0 <= num) && 2 <= i) && C_1_i == 1) - InvariantResult [Line: 78]: Loop Invariant Derived loop invariant: ((((((((((((((((1 <= i && C_1_pc == 1) && e <= 0) && max_loop <= 2) && i <= 1) && 2 == P_1_st) && P_1_i == 1) && num == 0) && P_1_pc <= 0) && !(tmp___2 == 0)) && C_1_i == 1) || (((((((((((((((((((((((((((((((((0 <= tmp + 2147483648 && C_1_st == 0) && P_1_pc == 1) && tmp <= 2147483647) && tmp___2 <= 1) && i == 0) && e == 0) && kernel_st == 1) && c == data_0) && !(tmp == 0)) && \old(i___0) == i___0) && P_1_ev == 0) && count == 0) && 65 <= c) && C_1_pr == 0) && max_loop == 2) && 2 == P_1_st) && c <= 65) && P_1_i == 1) && \old(c) == 65) && 0 <= \old(i___0)) && C_1_pc == 0) && 0 <= data_1) && #NULL == 0) && !(tmp___2 == 0)) && 0 <= tmp___2) && num <= 1) && \old(i___0) <= 0) && C_1_ev == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 1 <= num) && timer == 0) && C_1_i == 1) && #NULL == 0)) || (((((((((((1 <= i && C_1_pc == 1) && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && i <= 1) && 2 == P_1_st) && P_1_i == 1) && !(tmp___2 == 0)) && 1 <= num) && C_1_i == 1)) || (((((((((((num <= 0 && 2 == C_1_pc) && e <= 0) && max_loop <= 2) && 2 == P_1_st) && P_1_i == 1) && P_1_pc <= 0) && !(tmp___2 == 0)) && 0 <= num) && 2 <= i) && i < 2147483646) && C_1_i == 1)) || (((((((((((1 <= i && 2 == C_1_pc) && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && i <= 1) && 2 == P_1_st) && P_1_i == 1) && !(tmp___2 == 0)) && 0 <= num) && C_1_i == 1)) || ((max_loop <= 2 && (((((((((C_1_pc == 1 && P_1_pc == 1) && e <= 0) && 2 == P_1_st) && P_1_i == 1) && num == 0) && !(tmp___2 == 0)) && i < 2147483646) && C_1_i == 1) || (((((((((C_1_pc == 1 && P_1_pc == 1) && e <= 0) && num < 2147483648) && 2 == P_1_st) && P_1_i == 1) && !(tmp___2 == 0)) && 1 <= num) && i < 2147483646) && C_1_i == 1))) && 2 <= i)) || ((((((((((((((((((((((((((((C_1_pc == 1 && C_1_st == 0) && tmp___2 <= 1) && e <= 0) && 0 <= e) && data_0 == 0) && 0 <= i) && kernel_st == 1) && P_1_ev == 0) && count == 0) && C_1_pr == 0) && i <= 1) && max_loop == 2) && 2 == P_1_st) && P_1_i == 1) && C_1_ev <= 0) && 0 <= data_1) && num == 0) && P_1_pc <= 0) && 0 <= C_1_ev) && 0 <= P_1_pc) && #NULL == 0) && !(tmp___2 == 0)) && 0 <= tmp___2) && 0 <= timer) && data_1 <= 0) && 0 <= unknown-#StackHeapBarrier-unknown) && C_1_i == 1) && #NULL == 0)) || (((((((((((2 == C_1_pc && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && 2 == P_1_st) && P_1_i == 1) && i <= 2147483646) && !(tmp___2 == 0)) && 0 <= num) && 2 <= i) && C_1_i == 1) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((0 <= tmp + 2147483648 && \old(c) == c) && C_1_st == 0) && tmp <= 2147483647) && tmp___2 <= 1) && i == 0) && e == 0) && kernel_st == 1) && i___0 == 0) && c == data_0) && !(tmp == 0)) && \old(i___0) == i___0) && P_1_ev == 0) && count == 0) && P_1_st == 1) && C_1_pr == 0) && max_loop == 2) && P_1_i == 1) && \old(c) == 65) && num <= i___0) && C_1_pc == 0) && 0 <= P_1_pc) && #NULL == 0) && !(tmp___2 == 0)) && 0 <= tmp___2) && 0 <= num) && C_1_ev == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && data_1 == 0) && timer == 0) && C_1_i == 1) && #NULL == 0) || ((1 <= i && max_loop <= 2) && ((((((((((num <= 0 && 2 == C_1_pc) && e <= 0) && i <= 1) && P_1_i == 1) && num <= i___0) && !(tmp___2 == 0)) && 0 <= num) && (\result == 1 || !(P_1_st == 0))) && C_1_i == 1) || ((((((((((2 == C_1_pc && P_1_pc == 1) && e <= 0) && i <= 1) && P_1_i == 1) && num <= i___0) && !(tmp___2 == 0)) && num <= 1) && 0 <= num) && (\result == 1 || !(P_1_st == 0))) && C_1_i == 1)))) || ((1 <= i && max_loop <= 2) && (((((((((C_1_pc == 1 && e <= 0) && i <= 1) && P_1_i == 1) && num <= i___0) && num == 0) && !(tmp___2 == 0)) && (\result == 1 || !(P_1_st == 0))) && C_1_i == 1) || ((((((((((C_1_pc == 1 && P_1_pc == 1) && e <= 0) && i <= 1) && P_1_i == 1) && num <= i___0) && !(tmp___2 == 0)) && num <= 1) && 1 <= num) && (\result == 1 || !(P_1_st == 0))) && C_1_i == 1))) - InvariantResult [Line: 137]: Loop Invariant Derived loop invariant: ((((((((((((((num <= 0 && 2 == C_1_st) && 2 == C_1_pc) && e <= 0) && max_loop <= 2) && P_1_i == 1) && P_1_pc <= 0) && !(tmp___2 == 0)) && 0 <= num) && 2 <= i) && i < 2147483646) && C_1_i == 1) || ((((((((((((((((((((((((((((((1 <= i && 2 == C_1_st) && C_1_pc == 1) && tmp___2 <= 1) && e <= 0) && 0 <= e) && data_0 == 0) && kernel_st == 1) && P_1_st == 0) && P_1_ev == 0) && tmp == 0) && count == 0) && timer == 1) && C_1_pr == 0) && i <= 1) && !(tmp___1 == 0)) && max_loop == 2) && P_1_i == 1) && num == 0) && P_1_pc <= 0) && 0 <= P_1_pc) && #NULL == 0) && !(tmp___2 == 0)) && 0 <= tmp___2) && C_1_ev == 0) && tmp___1 <= 2147483647) && 0 <= unknown-#StackHeapBarrier-unknown) && data_1 == 0) && 0 <= tmp___1 + 2147483648) && C_1_i == 1) && #NULL == 0)) || (((((((((((2 == C_1_st && 2 == C_1_pc) && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && P_1_i == 1) && i <= 2147483646) && !(tmp___2 == 0)) && 0 <= num) && 2 <= i) && C_1_i == 1)) || ((((((((((2 == C_1_st && C_1_pc == 1) && P_1_pc == 1) && e <= 0) && max_loop <= 2) && P_1_i == 1) && num == 0) && !(tmp___2 == 0)) && 2 <= i) && i < 2147483646) && C_1_i == 1)) || (((((((((((1 <= i && 2 == C_1_st) && 2 == C_1_pc) && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && i <= 1) && P_1_i == 1) && !(tmp___2 == 0)) && 0 <= num) && C_1_i == 1) - InvariantResult [Line: 468]: Loop Invariant Derived loop invariant: (((((((((((((1 <= i && C_1_pc == 1) && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && i <= 1) && P_1_i == 1) && 1 <= num) && C_1_i == 1) || ((((((((1 <= i && C_1_pc == 1) && e <= 0) && max_loop <= 2) && i <= 1) && P_1_i == 1) && num == 0) && P_1_pc <= 0) && C_1_i == 1)) || (((((((((1 <= i && 2 == C_1_pc) && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && i <= 1) && P_1_i == 1) && 0 <= num) && C_1_i == 1)) || (((((((((C_1_pc == 1 && P_1_pc == 1) && e <= 0) && P_1_i == 1) && num == 0) && i < 2147483646) && C_1_i == 1) || (((((((C_1_pc == 1 && P_1_pc == 1) && e <= 0) && num < 2147483648) && P_1_i == 1) && 1 <= num) && i < 2147483646) && C_1_i == 1)) && max_loop <= 2) && 2 <= i)) || (((((((((num <= 0 && 2 == C_1_pc) && e <= 0) && max_loop <= 2) && P_1_i == 1) && P_1_pc <= 0) && 0 <= num) && 2 <= i) && i < 2147483646) && C_1_i == 1)) || (((((((((2 == C_1_pc && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && P_1_i == 1) && i <= 2147483646) && 0 <= num) && 2 <= i) && C_1_i == 1) - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((num <= 0 && tmp___2 <= 1) && i == 0) && e == 0) && data_0 == 0) && kernel_st == 1) && P_1_st == 0) && P_1_ev == 0) && count == 0) && C_1_pr == 0) && !(tmp___1 == 0)) && max_loop == 2) && P_1_i == 1) && C_1_pc == 0) && P_1_pc <= 0) && 0 <= P_1_pc) && #NULL == 0) && !(tmp___2 == 0)) && 0 <= tmp___2) && 0 <= num) && C_1_ev == 0) && tmp <= 0) && tmp___1 <= 2147483647) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= tmp) && data_1 == 0) && 0 <= tmp___1 + 2147483648) && timer == 0) && C_1_st == 1) && C_1_i == 1) && #NULL == 0) || (((((((((((num <= 0 && 2 == C_1_pc) && e <= 0) && max_loop <= 2) && P_1_i == 1) && P_1_pc <= 0) && !(tmp___2 == 0)) && 0 <= num) && 2 <= i) && (\result == 1 || !(C_1_st == 0))) && i < 2147483646) && C_1_i == 1)) || (((((((((((2 == C_1_pc && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && P_1_i == 1) && i <= 2147483646) && !(tmp___2 == 0)) && 0 <= num) && 2 <= i) && (\result == 1 || !(C_1_st == 0))) && C_1_i == 1)) || (((((((((((1 <= i && 2 == C_1_pc) && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && i <= 1) && P_1_i == 1) && !(tmp___2 == 0)) && 0 <= num) && (\result == 1 || !(C_1_st == 0))) && C_1_i == 1)) || ((((((((((((((((((((((((0 <= data_0 && P_1_pc == 1) && tmp___2 <= 1) && i == 0) && e == 0) && kernel_st == 1) && P_1_ev == 0) && count == 0) && C_1_pr == 0) && max_loop == 2) && 2 == P_1_st) && P_1_i == 1) && C_1_pc == 0) && 0 <= data_1) && #NULL == 0) && !(tmp___2 == 0)) && 0 <= tmp___2) && num <= 1) && C_1_ev == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 1 <= num) && (\result == 1 || !(C_1_st == 0))) && timer == 0) && C_1_i == 1) && #NULL == 0) - InvariantResult [Line: 279]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((C_1_pc == 1 && C_1_st == 0) && tmp___2 <= 1) && e <= 0) && 0 <= e) && data_0 == 0) && 0 <= i) && kernel_st == 1) && P_1_ev == 0) && count == 0) && C_1_pr == 0) && i <= 1) && max_loop == 2) && 2 == P_1_st) && P_1_i == 1) && num == 0) && P_1_pc <= 0) && 0 <= P_1_pc) && #NULL == 0) && !(tmp___2 == 0)) && 0 <= tmp___2) && 0 <= timer) && C_1_ev == 0) && tmp___1 <= 2147483647) && 0 <= unknown-#StackHeapBarrier-unknown) && data_1 == 0) && 0 <= tmp___1 + 2147483648) && C_1_i == 1) && #NULL == 0) || (((((((((1 <= i && C_1_pc == 1) && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && i <= 1) && P_1_i == 1) && 1 <= num) && C_1_i == 1)) || ((((((((1 <= i && C_1_pc == 1) && e <= 0) && max_loop <= 2) && i <= 1) && P_1_i == 1) && num == 0) && P_1_pc <= 0) && C_1_i == 1)) || (((((((((1 <= i && 2 == C_1_pc) && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && i <= 1) && P_1_i == 1) && 0 <= num) && C_1_i == 1)) || ((((((((((((((((((((((((0 <= data_0 && C_1_st == 0) && P_1_pc == 1) && tmp___2 <= 1) && i == 0) && e == 0) && kernel_st == 1) && P_1_ev == 0) && count == 0) && C_1_pr == 0) && max_loop == 2) && 2 == P_1_st) && P_1_i == 1) && C_1_pc == 0) && 0 <= data_1) && #NULL == 0) && !(tmp___2 == 0)) && 0 <= tmp___2) && num <= 1) && C_1_ev == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 1 <= num) && timer == 0) && C_1_i == 1) && #NULL == 0)) || (((((((((((((((((((((C_1_st == 0 && i == 0) && e == 0) && data_0 == 0) && kernel_st == 1) && P_1_st == 0) && P_1_ev == 0) && count == 0) && C_1_pr == 0) && max_loop == 2) && P_1_i == 1) && C_1_pc == 0) && num == 0) && P_1_pc <= 0) && 0 <= P_1_pc) && #NULL == 0) && C_1_ev == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && data_1 == 0) && timer == 0) && C_1_i == 1) && #NULL == 0)) || (((((((((C_1_pc == 1 && P_1_pc == 1) && e <= 0) && P_1_i == 1) && num == 0) && i < 2147483646) && C_1_i == 1) || (((((((C_1_pc == 1 && P_1_pc == 1) && e <= 0) && num < 2147483648) && P_1_i == 1) && 1 <= num) && i < 2147483646) && C_1_i == 1)) && max_loop <= 2) && 2 <= i)) || (((((((((num <= 0 && 2 == C_1_pc) && e <= 0) && max_loop <= 2) && P_1_i == 1) && P_1_pc <= 0) && 0 <= num) && 2 <= i) && i < 2147483646) && C_1_i == 1)) || (((((((((2 == C_1_pc && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && P_1_i == 1) && i <= 2147483646) && 0 <= num) && 2 <= i) && C_1_i == 1) - InvariantResult [Line: 271]: Loop Invariant Derived loop invariant: (((((((((((((C_1_pc == 1 && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && P_1_i == 1) && 0 <= num) && 2 <= i) && i < 2147483646) && C_1_i == 1) || (((((((((1 <= i && C_1_pc == 1) && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && i <= 1) && P_1_i == 1) && 1 <= num) && C_1_i == 1)) || ((((((((1 <= i && C_1_pc == 1) && e <= 0) && max_loop <= 2) && i <= 1) && P_1_i == 1) && num == 0) && P_1_pc <= 0) && C_1_i == 1)) || (((((((((1 <= i && 2 == C_1_pc) && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && i <= 1) && P_1_i == 1) && 0 <= num) && C_1_i == 1)) || (((((((((num <= 0 && 2 == C_1_pc) && e <= 0) && max_loop <= 2) && P_1_i == 1) && P_1_pc <= 0) && 0 <= num) && 2 <= i) && i < 2147483646) && C_1_i == 1)) || (((((((((2 == C_1_pc && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && P_1_i == 1) && i <= 2147483646) && 0 <= num) && 2 <= i) && C_1_i == 1) - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((i <= 0 && 0 <= data_0) && P_1_pc == 1) && tmp___2 <= 1) && e == 0) && 0 <= i) && kernel_st == 1) && P_1_ev == 0) && count == 0) && C_1_pr == 0) && max_loop == 2) && 2 == P_1_st) && P_1_i == 1) && C_1_pc == 0) && 0 <= data_1) && #NULL == 0) && !(tmp___2 == 0)) && 0 <= tmp___2) && num <= 1) && C_1_ev == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 1 <= num) && (\result == 1 || !(C_1_st == 0))) && timer == 0) && C_1_i == 1) && #NULL == 0) || ((1 <= i && max_loop <= 2) && ((((((((((((C_1_pc == 1 && P_1_pc == 1) && e <= 0) && 0 <= i) && i <= 1) && P_1_i == 1) && 1 <= P_1_pc) && !(tmp___2 == 0)) && num <= 1) && 0 <= num) && (\result == 1 || !(C_1_st == 0))) && C_1_i == 1) || ((((num < 2147483648 && !(tmp___2 == 0)) && ((((((C_1_pc == 1 && P_1_pc == 1) && e <= 0) && i <= 1) && P_1_i == 1) && 1 <= num) || (((((((2 == C_1_pc && P_1_pc == 1) && e <= 0) && 0 <= i) && i <= 1) && P_1_i == 1) && 1 <= P_1_pc) && 0 <= num))) && (\result == 1 || !(C_1_st == 0))) && C_1_i == 1)))) || (((((((((((((((((((((((((((((C_1_pc == 1 && tmp___2 <= 1) && e == 0) && data_0 == 0) && 0 <= i) && kernel_st == 1) && P_1_ev == 0) && count == 0) && C_1_pr == 0) && !(tmp___1 == 0)) && max_loop == 2) && P_1_i == 1) && C_1_ev <= 0) && 0 <= data_1) && num == 0) && P_1_pc <= 0) && 0 <= C_1_ev) && 0 <= P_1_pc) && #NULL == 0) && !(tmp___2 == 0)) && 0 <= tmp___2) && 0 <= timer) && data_1 <= 0) && tmp___1 <= 2147483647) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= tmp___1 + 2147483648) && C_1_st == 1) && C_1_i == 1) && !(P_1_st == 0)) && #NULL == 0)) || ((((((((((((C_1_pc == 1 && P_1_pc == 1) && e <= 0) && P_1_i == 1) && 1 <= num) && i < 2147483646) || (((((((2 == C_1_pc && P_1_pc == 1) && e <= 0) && 0 <= i) && P_1_i == 1) && 1 <= P_1_pc) && 0 <= num) && i < 2147483646)) && num < 2147483648) && max_loop <= 2) && !(tmp___2 == 0)) && 2 <= i) && (\result == 1 || !(C_1_st == 0))) && C_1_i == 1)) || ((((((((((1 <= i && C_1_pc == 1) && e <= 0) && max_loop <= 2) && i <= 1) && P_1_i == 1) && num == 0) && P_1_pc <= 0) && !(tmp___2 == 0)) && (\result == 1 || !(C_1_st == 0))) && C_1_i == 1)) || (((((((((((((C_1_pc == 1 && P_1_pc == 1) && e <= 0) && 0 <= i) && max_loop <= 2) && P_1_i == 1) && 1 <= P_1_pc) && !(tmp___2 == 0)) && num <= 1) && 0 <= num) && 2 <= i) && (\result == 1 || !(C_1_st == 0))) && i < 2147483646) && C_1_i == 1)) || ((((((((((((((((((((((((((((0 <= tmp + 2147483648 && C_1_pc == 1) && tmp <= 2147483647) && tmp___2 <= 1) && e == 0) && data_0 == 0) && 0 <= i) && kernel_st == 1) && P_1_ev == 0) && count == 0) && C_1_pr == 0) && !(tmp___1 == 0)) && max_loop == 2) && P_1_i == 1) && num == 0) && P_1_pc <= 0) && 0 <= P_1_pc) && #NULL == 0) && !(tmp___2 == 0)) && 0 <= tmp___2) && 0 <= timer) && C_1_ev == 0) && tmp___1 <= 2147483647) && 0 <= unknown-#StackHeapBarrier-unknown) && data_1 == 0) && 0 <= tmp___1 + 2147483648) && C_1_st == 1) && C_1_i == 1) && #NULL == 0) - InvariantResult [Line: 250]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-11-22 00:39:23,157 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58e1a93-b583-473f-a44b-bddb3b2a1c59/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