./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/systemc/token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c461d7e3-2d2c-481b-a26f-957b11ac19a8/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c461d7e3-2d2c-481b-a26f-957b11ac19a8/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c461d7e3-2d2c-481b-a26f-957b11ac19a8/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c461d7e3-2d2c-481b-a26f-957b11ac19a8/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.01.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c461d7e3-2d2c-481b-a26f-957b11ac19a8/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c461d7e3-2d2c-481b-a26f-957b11ac19a8/bin/uautomizer-ZsLfNo2U6R --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 327bb4ad7f981d20a6e5212aac300a9249d1857b0280531d57d587d5a0195c5f --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 16:51:38,457 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 16:51:38,459 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 16:51:38,488 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 16:51:38,488 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 16:51:38,492 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 16:51:38,494 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 16:51:38,498 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 16:51:38,500 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 16:51:38,506 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 16:51:38,507 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 16:51:38,509 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 16:51:38,510 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 16:51:38,515 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 16:51:38,517 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 16:51:38,519 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 16:51:38,521 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 16:51:38,522 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 16:51:38,523 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 16:51:38,530 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 16:51:38,532 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 16:51:38,534 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 16:51:38,535 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 16:51:38,536 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 16:51:38,547 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 16:51:38,547 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 16:51:38,548 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 16:51:38,550 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 16:51:38,551 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 16:51:38,552 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 16:51:38,553 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 16:51:38,554 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 16:51:38,556 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 16:51:38,557 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 16:51:38,558 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 16:51:38,558 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 16:51:38,559 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 16:51:38,559 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 16:51:38,560 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 16:51:38,561 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 16:51:38,578 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 16:51:38,579 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c461d7e3-2d2c-481b-a26f-957b11ac19a8/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-11-25 16:51:38,642 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 16:51:38,642 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 16:51:38,643 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 16:51:38,643 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 16:51:38,644 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 16:51:38,644 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 16:51:38,644 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 16:51:38,645 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 16:51:38,645 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 16:51:38,645 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 16:51:38,645 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 16:51:38,646 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 16:51:38,646 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 16:51:38,646 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 16:51:38,646 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 16:51:38,647 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 16:51:38,647 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 16:51:38,647 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 16:51:38,647 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-25 16:51:38,648 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 16:51:38,648 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 16:51:38,648 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 16:51:38,648 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 16:51:38,649 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 16:51:38,649 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 16:51:38,649 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 16:51:38,649 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:51:38,650 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 16:51:38,650 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 16:51:38,650 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 16:51:38,650 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 16:51:38,651 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 16:51:38,651 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 16:51:38,651 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 16:51:38,651 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 16:51:38,652 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 16:51:38,652 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_c461d7e3-2d2c-481b-a26f-957b11ac19a8/bin/uautomizer-ZsLfNo2U6R/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_c461d7e3-2d2c-481b-a26f-957b11ac19a8/bin/uautomizer-ZsLfNo2U6R 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 -> Automizer 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 -> 327bb4ad7f981d20a6e5212aac300a9249d1857b0280531d57d587d5a0195c5f [2022-11-25 16:51:38,918 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 16:51:38,974 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 16:51:38,978 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 16:51:38,979 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 16:51:38,980 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 16:51:38,981 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c461d7e3-2d2c-481b-a26f-957b11ac19a8/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2022-11-25 16:51:42,180 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 16:51:42,410 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 16:51:42,411 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c461d7e3-2d2c-481b-a26f-957b11ac19a8/sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2022-11-25 16:51:42,421 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c461d7e3-2d2c-481b-a26f-957b11ac19a8/bin/uautomizer-ZsLfNo2U6R/data/c996b2fd3/98e8cdc613f540d996ec4efd709a2430/FLAG67facd2b0 [2022-11-25 16:51:42,440 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c461d7e3-2d2c-481b-a26f-957b11ac19a8/bin/uautomizer-ZsLfNo2U6R/data/c996b2fd3/98e8cdc613f540d996ec4efd709a2430 [2022-11-25 16:51:42,443 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 16:51:42,445 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 16:51:42,447 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 16:51:42,447 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 16:51:42,452 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 16:51:42,453 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:51:42" (1/1) ... [2022-11-25 16:51:42,454 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dae65fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:51:42, skipping insertion in model container [2022-11-25 16:51:42,455 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:51:42" (1/1) ... [2022-11-25 16:51:42,464 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 16:51:42,519 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 16:51:42,718 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_c461d7e3-2d2c-481b-a26f-957b11ac19a8/sv-benchmarks/c/systemc/token_ring.01.cil-2.c[671,684] [2022-11-25 16:51:42,771 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:51:42,784 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 16:51:42,796 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_c461d7e3-2d2c-481b-a26f-957b11ac19a8/sv-benchmarks/c/systemc/token_ring.01.cil-2.c[671,684] [2022-11-25 16:51:42,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:51:42,846 INFO L208 MainTranslator]: Completed translation [2022-11-25 16:51:42,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:51:42 WrapperNode [2022-11-25 16:51:42,847 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 16:51:42,848 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 16:51:42,849 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 16:51:42,849 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 16:51:42,856 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:51:42" (1/1) ... [2022-11-25 16:51:42,865 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:51:42" (1/1) ... [2022-11-25 16:51:42,896 INFO L138 Inliner]: procedures = 30, calls = 35, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 224 [2022-11-25 16:51:42,896 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 16:51:42,898 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 16:51:42,898 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 16:51:42,898 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 16:51:42,914 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:51:42" (1/1) ... [2022-11-25 16:51:42,914 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:51:42" (1/1) ... [2022-11-25 16:51:42,917 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:51:42" (1/1) ... [2022-11-25 16:51:42,917 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:51:42" (1/1) ... [2022-11-25 16:51:42,925 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:51:42" (1/1) ... [2022-11-25 16:51:42,932 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:51:42" (1/1) ... [2022-11-25 16:51:42,934 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:51:42" (1/1) ... [2022-11-25 16:51:42,936 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:51:42" (1/1) ... [2022-11-25 16:51:42,939 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 16:51:42,941 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 16:51:42,941 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 16:51:42,941 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 16:51:42,943 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:51:42" (1/1) ... [2022-11-25 16:51:42,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:51:42,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c461d7e3-2d2c-481b-a26f-957b11ac19a8/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:51:42,983 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c461d7e3-2d2c-481b-a26f-957b11ac19a8/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 16:51:43,023 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c461d7e3-2d2c-481b-a26f-957b11ac19a8/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 16:51:43,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 16:51:43,048 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-11-25 16:51:43,050 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-11-25 16:51:43,050 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-11-25 16:51:43,052 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-11-25 16:51:43,053 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-11-25 16:51:43,054 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-11-25 16:51:43,054 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-11-25 16:51:43,054 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-11-25 16:51:43,054 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-11-25 16:51:43,055 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-11-25 16:51:43,055 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-11-25 16:51:43,055 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-11-25 16:51:43,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 16:51:43,056 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-11-25 16:51:43,057 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-11-25 16:51:43,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 16:51:43,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 16:51:43,149 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 16:51:43,152 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 16:51:43,514 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 16:51:43,524 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 16:51:43,525 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-25 16:51:43,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:51:43 BoogieIcfgContainer [2022-11-25 16:51:43,528 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 16:51:43,531 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 16:51:43,532 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 16:51:43,536 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 16:51:43,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 04:51:42" (1/3) ... [2022-11-25 16:51:43,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f5cdbcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:51:43, skipping insertion in model container [2022-11-25 16:51:43,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:51:42" (2/3) ... [2022-11-25 16:51:43,538 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f5cdbcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:51:43, skipping insertion in model container [2022-11-25 16:51:43,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:51:43" (3/3) ... [2022-11-25 16:51:43,540 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-2.c [2022-11-25 16:51:43,597 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 16:51:43,611 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-11-25 16:51:43,766 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 16:51:43,778 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=PETRI_NET, 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;@4aae1ef9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 16:51:43,779 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-25 16:51:43,785 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 92 states have (on average 1.565217391304348) internal successors, (144), 99 states have internal predecessors, (144), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-11-25 16:51:43,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-25 16:51:43,805 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:51:43,806 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:51:43,807 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 16:51:43,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:51:43,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1554820752, now seen corresponding path program 1 times [2022-11-25 16:51:43,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:51:43,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328204853] [2022-11-25 16:51:43,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:51:43,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:51:44,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:44,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 16:51:44,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:44,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 16:51:44,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:44,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 16:51:44,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:44,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 16:51:44,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:44,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-25 16:51:44,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:44,521 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-25 16:51:44,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:51:44,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328204853] [2022-11-25 16:51:44,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328204853] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:51:44,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:51:44,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 16:51:44,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898482883] [2022-11-25 16:51:44,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:51:44,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 16:51:44,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:51:44,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 16:51:44,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 16:51:44,601 INFO L87 Difference]: Start difference. First operand has 121 states, 92 states have (on average 1.565217391304348) internal successors, (144), 99 states have internal predecessors, (144), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 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-25 16:51:45,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:51:45,706 INFO L93 Difference]: Finished difference Result 379 states and 571 transitions. [2022-11-25 16:51:45,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 16:51:45,710 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 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 55 [2022-11-25 16:51:45,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:51:45,725 INFO L225 Difference]: With dead ends: 379 [2022-11-25 16:51:45,725 INFO L226 Difference]: Without dead ends: 253 [2022-11-25 16:51:45,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-11-25 16:51:45,735 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 319 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-25 16:51:45,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 480 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-25 16:51:45,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-11-25 16:51:45,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 210. [2022-11-25 16:51:45,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 168 states have (on average 1.4761904761904763) internal successors, (248), 173 states have internal predecessors, (248), 25 states have call successors, (25), 12 states have call predecessors, (25), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2022-11-25 16:51:45,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 301 transitions. [2022-11-25 16:51:45,828 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 301 transitions. Word has length 55 [2022-11-25 16:51:45,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:51:45,829 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 301 transitions. [2022-11-25 16:51:45,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 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-25 16:51:45,830 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 301 transitions. [2022-11-25 16:51:45,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-25 16:51:45,832 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:51:45,833 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:51:45,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 16:51:45,833 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 16:51:45,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:51:45,835 INFO L85 PathProgramCache]: Analyzing trace with hash -275712372, now seen corresponding path program 1 times [2022-11-25 16:51:45,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:51:45,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066901661] [2022-11-25 16:51:45,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:51:45,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:51:45,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:46,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 16:51:46,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:46,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 16:51:46,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:46,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 16:51:46,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:46,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 16:51:46,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:46,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-25 16:51:46,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:46,213 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-25 16:51:46,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:51:46,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066901661] [2022-11-25 16:51:46,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066901661] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:51:46,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:51:46,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 16:51:46,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234750540] [2022-11-25 16:51:46,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:51:46,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 16:51:46,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:51:46,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 16:51:46,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:51:46,219 INFO L87 Difference]: Start difference. First operand 210 states and 301 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 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-25 16:51:47,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:51:47,203 INFO L93 Difference]: Finished difference Result 570 states and 818 transitions. [2022-11-25 16:51:47,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 16:51:47,206 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 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 55 [2022-11-25 16:51:47,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:51:47,223 INFO L225 Difference]: With dead ends: 570 [2022-11-25 16:51:47,223 INFO L226 Difference]: Without dead ends: 369 [2022-11-25 16:51:47,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-11-25 16:51:47,232 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 300 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 16:51:47,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 777 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 16:51:47,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2022-11-25 16:51:47,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 303. [2022-11-25 16:51:47,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 244 states have (on average 1.4672131147540983) internal successors, (358), 250 states have internal predecessors, (358), 35 states have call successors, (35), 18 states have call predecessors, (35), 20 states have return successors, (40), 36 states have call predecessors, (40), 35 states have call successors, (40) [2022-11-25 16:51:47,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 433 transitions. [2022-11-25 16:51:47,294 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 433 transitions. Word has length 55 [2022-11-25 16:51:47,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:51:47,294 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 433 transitions. [2022-11-25 16:51:47,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 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-25 16:51:47,295 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 433 transitions. [2022-11-25 16:51:47,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-25 16:51:47,297 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:51:47,298 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:51:47,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 16:51:47,298 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 16:51:47,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:51:47,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1173105650, now seen corresponding path program 1 times [2022-11-25 16:51:47,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:51:47,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473310738] [2022-11-25 16:51:47,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:51:47,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:51:47,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:47,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 16:51:47,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:47,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 16:51:47,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:47,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 16:51:47,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:47,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 16:51:47,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:47,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-25 16:51:47,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:47,534 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-25 16:51:47,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:51:47,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473310738] [2022-11-25 16:51:47,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473310738] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:51:47,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:51:47,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 16:51:47,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87269150] [2022-11-25 16:51:47,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:51:47,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 16:51:47,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:51:47,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 16:51:47,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:51:47,540 INFO L87 Difference]: Start difference. First operand 303 states and 433 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 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-25 16:51:48,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:51:48,533 INFO L93 Difference]: Finished difference Result 930 states and 1330 transitions. [2022-11-25 16:51:48,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 16:51:48,534 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 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 55 [2022-11-25 16:51:48,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:51:48,544 INFO L225 Difference]: With dead ends: 930 [2022-11-25 16:51:48,544 INFO L226 Difference]: Without dead ends: 636 [2022-11-25 16:51:48,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-11-25 16:51:48,559 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 355 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 16:51:48,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 765 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 16:51:48,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2022-11-25 16:51:48,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 482. [2022-11-25 16:51:48,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 391 states have (on average 1.4552429667519182) internal successors, (569), 399 states have internal predecessors, (569), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2022-11-25 16:51:48,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 688 transitions. [2022-11-25 16:51:48,654 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 688 transitions. Word has length 55 [2022-11-25 16:51:48,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:51:48,655 INFO L495 AbstractCegarLoop]: Abstraction has 482 states and 688 transitions. [2022-11-25 16:51:48,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 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-25 16:51:48,656 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 688 transitions. [2022-11-25 16:51:48,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-25 16:51:48,659 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:51:48,659 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:51:48,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 16:51:48,660 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 16:51:48,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:51:48,661 INFO L85 PathProgramCache]: Analyzing trace with hash -924959156, now seen corresponding path program 1 times [2022-11-25 16:51:48,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:51:48,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504755680] [2022-11-25 16:51:48,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:51:48,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:51:48,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:48,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 16:51:48,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:48,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 16:51:48,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:48,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 16:51:48,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:48,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 16:51:48,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:48,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-25 16:51:48,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:48,840 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-25 16:51:48,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:51:48,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504755680] [2022-11-25 16:51:48,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504755680] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:51:48,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:51:48,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 16:51:48,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113477080] [2022-11-25 16:51:48,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:51:48,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 16:51:48,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:51:48,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 16:51:48,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:51:48,845 INFO L87 Difference]: Start difference. First operand 482 states and 688 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 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-25 16:51:49,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:51:49,920 INFO L93 Difference]: Finished difference Result 1494 states and 2133 transitions. [2022-11-25 16:51:49,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 16:51:49,921 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 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 55 [2022-11-25 16:51:49,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:51:49,930 INFO L225 Difference]: With dead ends: 1494 [2022-11-25 16:51:49,930 INFO L226 Difference]: Without dead ends: 1021 [2022-11-25 16:51:49,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-11-25 16:51:49,934 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 295 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 16:51:49,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 739 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 16:51:49,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2022-11-25 16:51:50,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 783. [2022-11-25 16:51:50,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 634 states have (on average 1.4369085173501577) internal successors, (911), 646 states have internal predecessors, (911), 85 states have call successors, (85), 52 states have call predecessors, (85), 60 states have return successors, (120), 92 states have call predecessors, (120), 85 states have call successors, (120) [2022-11-25 16:51:50,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1116 transitions. [2022-11-25 16:51:50,041 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1116 transitions. Word has length 55 [2022-11-25 16:51:50,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:51:50,042 INFO L495 AbstractCegarLoop]: Abstraction has 783 states and 1116 transitions. [2022-11-25 16:51:50,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 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-25 16:51:50,043 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1116 transitions. [2022-11-25 16:51:50,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-25 16:51:50,046 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:51:50,046 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:51:50,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 16:51:50,046 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 16:51:50,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:51:50,047 INFO L85 PathProgramCache]: Analyzing trace with hash -501312434, now seen corresponding path program 1 times [2022-11-25 16:51:50,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:51:50,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684811026] [2022-11-25 16:51:50,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:51:50,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:51:50,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:50,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 16:51:50,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:50,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 16:51:50,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:50,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 16:51:50,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:50,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 16:51:50,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:50,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-25 16:51:50,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:50,152 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-25 16:51:50,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:51:50,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684811026] [2022-11-25 16:51:50,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684811026] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:51:50,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:51:50,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 16:51:50,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853657742] [2022-11-25 16:51:50,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:51:50,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 16:51:50,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:51:50,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 16:51:50,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 16:51:50,155 INFO L87 Difference]: Start difference. First operand 783 states and 1116 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 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-25 16:51:51,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:51:51,107 INFO L93 Difference]: Finished difference Result 2167 states and 3093 transitions. [2022-11-25 16:51:51,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 16:51:51,108 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 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 55 [2022-11-25 16:51:51,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:51:51,119 INFO L225 Difference]: With dead ends: 2167 [2022-11-25 16:51:51,119 INFO L226 Difference]: Without dead ends: 1394 [2022-11-25 16:51:51,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-11-25 16:51:51,124 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 416 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 16:51:51,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 522 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 16:51:51,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2022-11-25 16:51:51,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1187. [2022-11-25 16:51:51,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1187 states, 955 states have (on average 1.4094240837696335) internal successors, (1346), 976 states have internal predecessors, (1346), 134 states have call successors, (134), 82 states have call predecessors, (134), 94 states have return successors, (179), 136 states have call predecessors, (179), 134 states have call successors, (179) [2022-11-25 16:51:51,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 1187 states and 1659 transitions. [2022-11-25 16:51:51,271 INFO L78 Accepts]: Start accepts. Automaton has 1187 states and 1659 transitions. Word has length 55 [2022-11-25 16:51:51,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:51:51,271 INFO L495 AbstractCegarLoop]: Abstraction has 1187 states and 1659 transitions. [2022-11-25 16:51:51,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 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-25 16:51:51,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1187 states and 1659 transitions. [2022-11-25 16:51:51,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-25 16:51:51,282 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:51:51,282 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:51:51,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 16:51:51,283 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 16:51:51,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:51:51,286 INFO L85 PathProgramCache]: Analyzing trace with hash 777880458, now seen corresponding path program 1 times [2022-11-25 16:51:51,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:51:51,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034430477] [2022-11-25 16:51:51,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:51:51,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:51:51,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:51,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 16:51:51,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:51,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 16:51:51,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:51,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 16:51:51,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:51,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 16:51:51,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:51,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-25 16:51:51,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:51,501 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-25 16:51:51,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:51:51,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034430477] [2022-11-25 16:51:51,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034430477] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:51:51,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:51:51,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 16:51:51,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572506099] [2022-11-25 16:51:51,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:51:51,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 16:51:51,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:51:51,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 16:51:51,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:51:51,507 INFO L87 Difference]: Start difference. First operand 1187 states and 1659 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 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-25 16:51:52,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:51:52,313 INFO L93 Difference]: Finished difference Result 2581 states and 3659 transitions. [2022-11-25 16:51:52,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 16:51:52,314 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 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 56 [2022-11-25 16:51:52,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:51:52,325 INFO L225 Difference]: With dead ends: 2581 [2022-11-25 16:51:52,325 INFO L226 Difference]: Without dead ends: 1404 [2022-11-25 16:51:52,330 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-11-25 16:51:52,332 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 170 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 16:51:52,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 530 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 16:51:52,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2022-11-25 16:51:52,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 1202. [2022-11-25 16:51:52,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1202 states, 970 states have (on average 1.3938144329896907) internal successors, (1352), 991 states have internal predecessors, (1352), 134 states have call successors, (134), 82 states have call predecessors, (134), 94 states have return successors, (179), 136 states have call predecessors, (179), 134 states have call successors, (179) [2022-11-25 16:51:52,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 1202 states and 1665 transitions. [2022-11-25 16:51:52,486 INFO L78 Accepts]: Start accepts. Automaton has 1202 states and 1665 transitions. Word has length 56 [2022-11-25 16:51:52,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:51:52,489 INFO L495 AbstractCegarLoop]: Abstraction has 1202 states and 1665 transitions. [2022-11-25 16:51:52,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 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-25 16:51:52,490 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1665 transitions. [2022-11-25 16:51:52,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-25 16:51:52,492 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:51:52,493 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:51:52,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 16:51:52,494 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 16:51:52,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:51:52,496 INFO L85 PathProgramCache]: Analyzing trace with hash 705493900, now seen corresponding path program 1 times [2022-11-25 16:51:52,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:51:52,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314508465] [2022-11-25 16:51:52,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:51:52,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:51:52,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:52,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 16:51:52,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:52,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 16:51:52,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:52,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 16:51:52,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:52,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 16:51:52,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:52,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-25 16:51:52,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:52,714 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-25 16:51:52,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:51:52,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314508465] [2022-11-25 16:51:52,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314508465] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:51:52,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:51:52,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 16:51:52,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455718441] [2022-11-25 16:51:52,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:51:52,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 16:51:52,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:51:52,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 16:51:52,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:51:52,722 INFO L87 Difference]: Start difference. First operand 1202 states and 1665 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 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-25 16:51:53,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:51:53,494 INFO L93 Difference]: Finished difference Result 2636 states and 3704 transitions. [2022-11-25 16:51:53,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 16:51:53,496 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 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 56 [2022-11-25 16:51:53,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:51:53,505 INFO L225 Difference]: With dead ends: 2636 [2022-11-25 16:51:53,506 INFO L226 Difference]: Without dead ends: 1444 [2022-11-25 16:51:53,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-11-25 16:51:53,514 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 135 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 16:51:53,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 525 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 16:51:53,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2022-11-25 16:51:53,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 1244. [2022-11-25 16:51:53,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1244 states, 1012 states have (on average 1.3774703557312253) internal successors, (1394), 1033 states have internal predecessors, (1394), 134 states have call successors, (134), 82 states have call predecessors, (134), 94 states have return successors, (179), 136 states have call predecessors, (179), 134 states have call successors, (179) [2022-11-25 16:51:53,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1244 states to 1244 states and 1707 transitions. [2022-11-25 16:51:53,673 INFO L78 Accepts]: Start accepts. Automaton has 1244 states and 1707 transitions. Word has length 56 [2022-11-25 16:51:53,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:51:53,673 INFO L495 AbstractCegarLoop]: Abstraction has 1244 states and 1707 transitions. [2022-11-25 16:51:53,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 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-25 16:51:53,674 INFO L276 IsEmpty]: Start isEmpty. Operand 1244 states and 1707 transitions. [2022-11-25 16:51:53,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-25 16:51:53,676 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:51:53,676 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:51:53,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 16:51:53,677 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 16:51:53,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:51:53,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1666245362, now seen corresponding path program 1 times [2022-11-25 16:51:53,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:51:53,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850861069] [2022-11-25 16:51:53,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:51:53,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:51:53,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:53,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 16:51:53,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:53,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 16:51:53,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:53,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 16:51:53,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:53,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 16:51:53,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:53,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-25 16:51:53,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:53,939 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-25 16:51:53,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:51:53,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850861069] [2022-11-25 16:51:53,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850861069] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:51:53,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:51:53,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 16:51:53,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120661986] [2022-11-25 16:51:53,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:51:53,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 16:51:53,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:51:53,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 16:51:53,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-25 16:51:53,943 INFO L87 Difference]: Start difference. First operand 1244 states and 1707 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-25 16:51:54,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:51:54,826 INFO L93 Difference]: Finished difference Result 1802 states and 2473 transitions. [2022-11-25 16:51:54,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 16:51:54,827 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2022-11-25 16:51:54,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:51:54,834 INFO L225 Difference]: With dead ends: 1802 [2022-11-25 16:51:54,835 INFO L226 Difference]: Without dead ends: 1068 [2022-11-25 16:51:54,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2022-11-25 16:51:54,839 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 372 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 16:51:54,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 585 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 16:51:54,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2022-11-25 16:51:54,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 898. [2022-11-25 16:51:54,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 898 states, 729 states have (on average 1.3662551440329218) internal successors, (996), 743 states have internal predecessors, (996), 100 states have call successors, (100), 59 states have call predecessors, (100), 65 states have return successors, (115), 99 states have call predecessors, (115), 100 states have call successors, (115) [2022-11-25 16:51:54,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 1211 transitions. [2022-11-25 16:51:54,942 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 1211 transitions. Word has length 56 [2022-11-25 16:51:54,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:51:54,943 INFO L495 AbstractCegarLoop]: Abstraction has 898 states and 1211 transitions. [2022-11-25 16:51:54,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-25 16:51:54,943 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1211 transitions. [2022-11-25 16:51:54,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-25 16:51:54,945 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:51:54,945 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:51:54,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 16:51:54,945 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 16:51:54,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:51:54,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1447390644, now seen corresponding path program 1 times [2022-11-25 16:51:54,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:51:54,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674013986] [2022-11-25 16:51:54,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:51:54,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:51:54,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:55,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 16:51:55,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:55,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 16:51:55,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:55,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 16:51:55,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:55,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 16:51:55,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:55,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-25 16:51:55,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:55,181 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-25 16:51:55,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:51:55,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674013986] [2022-11-25 16:51:55,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674013986] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:51:55,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:51:55,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 16:51:55,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574474467] [2022-11-25 16:51:55,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:51:55,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 16:51:55,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:51:55,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 16:51:55,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-25 16:51:55,185 INFO L87 Difference]: Start difference. First operand 898 states and 1211 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-25 16:51:56,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:51:56,149 INFO L93 Difference]: Finished difference Result 1745 states and 2359 transitions. [2022-11-25 16:51:56,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-25 16:51:56,150 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2022-11-25 16:51:56,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:51:56,159 INFO L225 Difference]: With dead ends: 1745 [2022-11-25 16:51:56,159 INFO L226 Difference]: Without dead ends: 1096 [2022-11-25 16:51:56,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2022-11-25 16:51:56,165 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 369 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 16:51:56,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 579 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 16:51:56,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1096 states. [2022-11-25 16:51:56,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1096 to 892. [2022-11-25 16:51:56,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 725 states have (on average 1.3613793103448275) internal successors, (987), 737 states have internal predecessors, (987), 100 states have call successors, (100), 59 states have call predecessors, (100), 63 states have return successors, (107), 97 states have call predecessors, (107), 100 states have call successors, (107) [2022-11-25 16:51:56,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1194 transitions. [2022-11-25 16:51:56,278 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1194 transitions. Word has length 56 [2022-11-25 16:51:56,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:51:56,279 INFO L495 AbstractCegarLoop]: Abstraction has 892 states and 1194 transitions. [2022-11-25 16:51:56,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-25 16:51:56,279 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1194 transitions. [2022-11-25 16:51:56,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-25 16:51:56,281 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:51:56,281 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:51:56,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 16:51:56,282 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 16:51:56,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:51:56,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1024688818, now seen corresponding path program 1 times [2022-11-25 16:51:56,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:51:56,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937003364] [2022-11-25 16:51:56,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:51:56,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:51:56,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:56,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 16:51:56,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:56,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 16:51:56,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:56,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 16:51:56,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:56,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 16:51:56,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:56,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-25 16:51:56,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:56,518 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-25 16:51:56,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:51:56,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937003364] [2022-11-25 16:51:56,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937003364] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:51:56,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:51:56,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 16:51:56,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559369595] [2022-11-25 16:51:56,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:51:56,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 16:51:56,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:51:56,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 16:51:56,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-25 16:51:56,522 INFO L87 Difference]: Start difference. First operand 892 states and 1194 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-25 16:51:57,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:51:57,442 INFO L93 Difference]: Finished difference Result 1689 states and 2257 transitions. [2022-11-25 16:51:57,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 16:51:57,443 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2022-11-25 16:51:57,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:51:57,449 INFO L225 Difference]: With dead ends: 1689 [2022-11-25 16:51:57,449 INFO L226 Difference]: Without dead ends: 952 [2022-11-25 16:51:57,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2022-11-25 16:51:57,453 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 409 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 16:51:57,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 537 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 16:51:57,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2022-11-25 16:51:57,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 780. [2022-11-25 16:51:57,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 780 states, 638 states have (on average 1.3573667711598747) internal successors, (866), 648 states have internal predecessors, (866), 85 states have call successors, (85), 51 states have call predecessors, (85), 53 states have return successors, (87), 81 states have call predecessors, (87), 85 states have call successors, (87) [2022-11-25 16:51:57,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1038 transitions. [2022-11-25 16:51:57,549 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1038 transitions. Word has length 56 [2022-11-25 16:51:57,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:51:57,550 INFO L495 AbstractCegarLoop]: Abstraction has 780 states and 1038 transitions. [2022-11-25 16:51:57,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-25 16:51:57,550 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1038 transitions. [2022-11-25 16:51:57,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-25 16:51:57,559 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:51:57,559 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:51:57,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 16:51:57,560 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 16:51:57,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:51:57,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1842337268, now seen corresponding path program 1 times [2022-11-25 16:51:57,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:51:57,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6246246] [2022-11-25 16:51:57,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:51:57,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:51:57,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:57,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 16:51:57,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:57,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 16:51:57,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:57,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 16:51:57,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:57,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 16:51:57,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:57,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-25 16:51:57,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:57,674 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-25 16:51:57,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:51:57,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6246246] [2022-11-25 16:51:57,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6246246] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:51:57,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:51:57,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 16:51:57,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734054712] [2022-11-25 16:51:57,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:51:57,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 16:51:57,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:51:57,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 16:51:57,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 16:51:57,678 INFO L87 Difference]: Start difference. First operand 780 states and 1038 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-25 16:51:58,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:51:58,448 INFO L93 Difference]: Finished difference Result 2410 states and 3254 transitions. [2022-11-25 16:51:58,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 16:51:58,449 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2022-11-25 16:51:58,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:51:58,461 INFO L225 Difference]: With dead ends: 2410 [2022-11-25 16:51:58,461 INFO L226 Difference]: Without dead ends: 1641 [2022-11-25 16:51:58,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-11-25 16:51:58,466 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 418 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 16:51:58,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 338 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 16:51:58,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1641 states. [2022-11-25 16:51:58,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1641 to 1467. [2022-11-25 16:51:58,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1467 states, 1197 states have (on average 1.3350041771094403) internal successors, (1598), 1214 states have internal predecessors, (1598), 158 states have call successors, (158), 97 states have call predecessors, (158), 108 states have return successors, (201), 157 states have call predecessors, (201), 158 states have call successors, (201) [2022-11-25 16:51:58,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1467 states to 1467 states and 1957 transitions. [2022-11-25 16:51:58,650 INFO L78 Accepts]: Start accepts. Automaton has 1467 states and 1957 transitions. Word has length 56 [2022-11-25 16:51:58,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:51:58,650 INFO L495 AbstractCegarLoop]: Abstraction has 1467 states and 1957 transitions. [2022-11-25 16:51:58,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-25 16:51:58,651 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 1957 transitions. [2022-11-25 16:51:58,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-25 16:51:58,652 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:51:58,652 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:51:58,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 16:51:58,653 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 16:51:58,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:51:58,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1987017488, now seen corresponding path program 1 times [2022-11-25 16:51:58,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:51:58,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924634323] [2022-11-25 16:51:58,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:51:58,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:51:58,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:58,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 16:51:58,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:58,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 16:51:58,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:58,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 16:51:58,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:58,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 16:51:58,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:58,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-25 16:51:58,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:58,734 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-25 16:51:58,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:51:58,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924634323] [2022-11-25 16:51:58,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924634323] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:51:58,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:51:58,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 16:51:58,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888117711] [2022-11-25 16:51:58,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:51:58,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:51:58,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:51:58,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:51:58,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:51:58,750 INFO L87 Difference]: Start difference. First operand 1467 states and 1957 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (5), 3 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-25 16:51:59,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:51:59,493 INFO L93 Difference]: Finished difference Result 4191 states and 5620 transitions. [2022-11-25 16:51:59,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 16:51:59,494 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (5), 3 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 57 [2022-11-25 16:51:59,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:51:59,515 INFO L225 Difference]: With dead ends: 4191 [2022-11-25 16:51:59,515 INFO L226 Difference]: Without dead ends: 2738 [2022-11-25 16:51:59,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-25 16:51:59,524 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 329 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 16:51:59,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 386 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 16:51:59,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2738 states. [2022-11-25 16:51:59,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2738 to 2392. [2022-11-25 16:51:59,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2392 states, 1948 states have (on average 1.320328542094456) internal successors, (2572), 1975 states have internal predecessors, (2572), 258 states have call successors, (258), 164 states have call predecessors, (258), 182 states have return successors, (330), 254 states have call predecessors, (330), 258 states have call successors, (330) [2022-11-25 16:51:59,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2392 states to 2392 states and 3160 transitions. [2022-11-25 16:51:59,847 INFO L78 Accepts]: Start accepts. Automaton has 2392 states and 3160 transitions. Word has length 57 [2022-11-25 16:51:59,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:51:59,849 INFO L495 AbstractCegarLoop]: Abstraction has 2392 states and 3160 transitions. [2022-11-25 16:51:59,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (5), 3 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-25 16:51:59,850 INFO L276 IsEmpty]: Start isEmpty. Operand 2392 states and 3160 transitions. [2022-11-25 16:51:59,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-25 16:51:59,852 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:51:59,852 INFO L195 NwaCegarLoop]: trace histogram [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-25 16:51:59,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 16:51:59,853 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 16:51:59,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:51:59,854 INFO L85 PathProgramCache]: Analyzing trace with hash 772242277, now seen corresponding path program 1 times [2022-11-25 16:51:59,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:51:59,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75306527] [2022-11-25 16:51:59,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:51:59,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:51:59,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:59,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 16:51:59,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:59,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 16:51:59,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:59,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 16:51:59,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:59,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 16:51:59,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:59,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-25 16:51:59,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:59,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-25 16:51:59,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:51:59,992 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 16:51:59,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:51:59,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75306527] [2022-11-25 16:51:59,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75306527] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:51:59,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:51:59,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 16:51:59,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413618473] [2022-11-25 16:51:59,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:51:59,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 16:51:59,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:51:59,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 16:51:59,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 16:51:59,997 INFO L87 Difference]: Start difference. First operand 2392 states and 3160 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-25 16:52:01,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:52:01,572 INFO L93 Difference]: Finished difference Result 7577 states and 10103 transitions. [2022-11-25 16:52:01,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-25 16:52:01,573 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 74 [2022-11-25 16:52:01,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:52:01,607 INFO L225 Difference]: With dead ends: 7577 [2022-11-25 16:52:01,608 INFO L226 Difference]: Without dead ends: 5201 [2022-11-25 16:52:01,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-11-25 16:52:01,619 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 739 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 753 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-25 16:52:01,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [753 Valid, 530 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-25 16:52:01,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5201 states. [2022-11-25 16:52:02,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5201 to 4675. [2022-11-25 16:52:02,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4675 states, 3792 states have (on average 1.298259493670886) internal successors, (4923), 3861 states have internal predecessors, (4923), 496 states have call successors, (496), 321 states have call predecessors, (496), 383 states have return successors, (778), 496 states have call predecessors, (778), 496 states have call successors, (778) [2022-11-25 16:52:02,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4675 states to 4675 states and 6197 transitions. [2022-11-25 16:52:02,282 INFO L78 Accepts]: Start accepts. Automaton has 4675 states and 6197 transitions. Word has length 74 [2022-11-25 16:52:02,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:52:02,283 INFO L495 AbstractCegarLoop]: Abstraction has 4675 states and 6197 transitions. [2022-11-25 16:52:02,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-25 16:52:02,284 INFO L276 IsEmpty]: Start isEmpty. Operand 4675 states and 6197 transitions. [2022-11-25 16:52:02,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-11-25 16:52:02,286 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:52:02,287 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1] [2022-11-25 16:52:02,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 16:52:02,287 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 16:52:02,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:52:02,288 INFO L85 PathProgramCache]: Analyzing trace with hash 237737077, now seen corresponding path program 1 times [2022-11-25 16:52:02,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:52:02,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671259152] [2022-11-25 16:52:02,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:52:02,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:52:02,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:52:02,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 16:52:02,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:52:02,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 16:52:02,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:52:02,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 16:52:02,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:52:02,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 16:52:02,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:52:02,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-25 16:52:02,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:52:02,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-25 16:52:02,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:52:02,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-25 16:52:02,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:52:02,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-25 16:52:02,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:52:02,631 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-25 16:52:02,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:52:02,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671259152] [2022-11-25 16:52:02,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671259152] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:52:02,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:52:02,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 16:52:02,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4647358] [2022-11-25 16:52:02,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:52:02,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 16:52:02,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:52:02,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 16:52:02,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:52:02,635 INFO L87 Difference]: Start difference. First operand 4675 states and 6197 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-25 16:52:03,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:52:03,754 INFO L93 Difference]: Finished difference Result 8997 states and 11865 transitions. [2022-11-25 16:52:03,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 16:52:03,755 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 90 [2022-11-25 16:52:03,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:52:03,789 INFO L225 Difference]: With dead ends: 8997 [2022-11-25 16:52:03,789 INFO L226 Difference]: Without dead ends: 5271 [2022-11-25 16:52:03,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2022-11-25 16:52:03,801 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 459 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 16:52:03,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 423 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 16:52:03,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5271 states. [2022-11-25 16:52:04,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5271 to 4643. [2022-11-25 16:52:04,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4643 states, 3756 states have (on average 1.286741214057508) internal successors, (4833), 3829 states have internal predecessors, (4833), 496 states have call successors, (496), 321 states have call predecessors, (496), 387 states have return successors, (697), 496 states have call predecessors, (697), 496 states have call successors, (697) [2022-11-25 16:52:04,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4643 states to 4643 states and 6026 transitions. [2022-11-25 16:52:04,428 INFO L78 Accepts]: Start accepts. Automaton has 4643 states and 6026 transitions. Word has length 90 [2022-11-25 16:52:04,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:52:04,429 INFO L495 AbstractCegarLoop]: Abstraction has 4643 states and 6026 transitions. [2022-11-25 16:52:04,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-25 16:52:04,431 INFO L276 IsEmpty]: Start isEmpty. Operand 4643 states and 6026 transitions. [2022-11-25 16:52:04,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-11-25 16:52:04,433 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:52:04,434 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1] [2022-11-25 16:52:04,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 16:52:04,434 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 16:52:04,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:52:04,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1804495027, now seen corresponding path program 1 times [2022-11-25 16:52:04,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:52:04,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857667734] [2022-11-25 16:52:04,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:52:04,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:52:04,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:52:04,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 16:52:04,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:52:04,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 16:52:04,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:52:04,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 16:52:04,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:52:04,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 16:52:04,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:52:04,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-25 16:52:04,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:52:04,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-25 16:52:04,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:52:04,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-25 16:52:04,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:52:04,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-25 16:52:04,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:52:04,528 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-25 16:52:04,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:52:04,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857667734] [2022-11-25 16:52:04,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857667734] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:52:04,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:52:04,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 16:52:04,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471567034] [2022-11-25 16:52:04,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:52:04,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:52:04,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:52:04,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:52:04,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:52:04,531 INFO L87 Difference]: Start difference. First operand 4643 states and 6026 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-25 16:52:05,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:52:05,315 INFO L93 Difference]: Finished difference Result 5107 states and 6643 transitions. [2022-11-25 16:52:05,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 16:52:05,316 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 90 [2022-11-25 16:52:05,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:52:05,400 INFO L225 Difference]: With dead ends: 5107 [2022-11-25 16:52:05,404 INFO L226 Difference]: Without dead ends: 4196 [2022-11-25 16:52:05,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-25 16:52:05,416 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 274 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 16:52:05,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 238 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 16:52:05,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4196 states. [2022-11-25 16:52:06,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4196 to 3734. [2022-11-25 16:52:06,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3734 states, 3027 states have (on average 1.2913776015857283) internal successors, (3909), 3088 states have internal predecessors, (3909), 390 states have call successors, (390), 254 states have call predecessors, (390), 313 states have return successors, (562), 393 states have call predecessors, (562), 390 states have call successors, (562) [2022-11-25 16:52:06,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3734 states to 3734 states and 4861 transitions. [2022-11-25 16:52:06,037 INFO L78 Accepts]: Start accepts. Automaton has 3734 states and 4861 transitions. Word has length 90 [2022-11-25 16:52:06,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:52:06,038 INFO L495 AbstractCegarLoop]: Abstraction has 3734 states and 4861 transitions. [2022-11-25 16:52:06,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-25 16:52:06,038 INFO L276 IsEmpty]: Start isEmpty. Operand 3734 states and 4861 transitions. [2022-11-25 16:52:06,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-11-25 16:52:06,040 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:52:06,041 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:52:06,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 16:52:06,041 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 16:52:06,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:52:06,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1432721063, now seen corresponding path program 1 times [2022-11-25 16:52:06,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:52:06,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674311414] [2022-11-25 16:52:06,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:52:06,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:52:06,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:52:06,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 16:52:06,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:52:06,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 16:52:06,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:52:06,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 16:52:06,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:52:06,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 16:52:06,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:52:06,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-25 16:52:06,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:52:06,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-25 16:52:06,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:52:06,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-25 16:52:06,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:52:06,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-25 16:52:06,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:52:06,187 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-25 16:52:06,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:52:06,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674311414] [2022-11-25 16:52:06,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674311414] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:52:06,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:52:06,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 16:52:06,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011309312] [2022-11-25 16:52:06,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:52:06,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 16:52:06,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:52:06,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 16:52:06,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:52:06,194 INFO L87 Difference]: Start difference. First operand 3734 states and 4861 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-25 16:52:07,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:52:07,855 INFO L93 Difference]: Finished difference Result 7161 states and 9288 transitions. [2022-11-25 16:52:07,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 16:52:07,855 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 91 [2022-11-25 16:52:07,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:52:07,918 INFO L225 Difference]: With dead ends: 7161 [2022-11-25 16:52:07,918 INFO L226 Difference]: Without dead ends: 4113 [2022-11-25 16:52:07,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2022-11-25 16:52:07,928 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 1052 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1066 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-25 16:52:07,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1066 Valid, 610 Invalid, 987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-25 16:52:07,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4113 states. [2022-11-25 16:52:08,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4113 to 3734. [2022-11-25 16:52:08,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3734 states, 3027 states have (on average 1.276841757515692) internal successors, (3865), 3088 states have internal predecessors, (3865), 390 states have call successors, (390), 254 states have call predecessors, (390), 313 states have return successors, (496), 393 states have call predecessors, (496), 390 states have call successors, (496) [2022-11-25 16:52:08,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3734 states to 3734 states and 4751 transitions. [2022-11-25 16:52:08,393 INFO L78 Accepts]: Start accepts. Automaton has 3734 states and 4751 transitions. Word has length 91 [2022-11-25 16:52:08,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:52:08,394 INFO L495 AbstractCegarLoop]: Abstraction has 3734 states and 4751 transitions. [2022-11-25 16:52:08,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-25 16:52:08,394 INFO L276 IsEmpty]: Start isEmpty. Operand 3734 states and 4751 transitions. [2022-11-25 16:52:08,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-11-25 16:52:08,396 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:52:08,397 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:52:08,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 16:52:08,397 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 16:52:08,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:52:08,398 INFO L85 PathProgramCache]: Analyzing trace with hash 578901004, now seen corresponding path program 1 times [2022-11-25 16:52:08,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:52:08,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419143501] [2022-11-25 16:52:08,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:52:08,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:52:08,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:52:08,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 16:52:08,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:52:08,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 16:52:08,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:52:08,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 16:52:08,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:52:08,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 16:52:08,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:52:08,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-25 16:52:08,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:52:08,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-25 16:52:08,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:52:08,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-25 16:52:08,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:52:08,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-25 16:52:08,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:52:08,511 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-25 16:52:08,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:52:08,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419143501] [2022-11-25 16:52:08,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419143501] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:52:08,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:52:08,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:52:08,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489647922] [2022-11-25 16:52:08,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:52:08,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:52:08,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:52:08,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:52:08,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:52:08,515 INFO L87 Difference]: Start difference. First operand 3734 states and 4751 transitions. Second operand has 5 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-25 16:52:09,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:52:09,285 INFO L93 Difference]: Finished difference Result 4196 states and 5368 transitions. [2022-11-25 16:52:09,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 16:52:09,286 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 97 [2022-11-25 16:52:09,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:52:09,311 INFO L225 Difference]: With dead ends: 4196 [2022-11-25 16:52:09,312 INFO L226 Difference]: Without dead ends: 4195 [2022-11-25 16:52:09,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-25 16:52:09,316 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 269 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 16:52:09,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 226 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 16:52:09,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4195 states. [2022-11-25 16:52:09,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4195 to 3733. [2022-11-25 16:52:09,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3733 states, 3027 states have (on average 1.2728774364056823) internal successors, (3853), 3087 states have internal predecessors, (3853), 390 states have call successors, (390), 254 states have call predecessors, (390), 313 states have return successors, (496), 393 states have call predecessors, (496), 390 states have call successors, (496) [2022-11-25 16:52:09,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3733 states to 3733 states and 4739 transitions. [2022-11-25 16:52:09,973 INFO L78 Accepts]: Start accepts. Automaton has 3733 states and 4739 transitions. Word has length 97 [2022-11-25 16:52:09,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:52:09,974 INFO L495 AbstractCegarLoop]: Abstraction has 3733 states and 4739 transitions. [2022-11-25 16:52:09,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-25 16:52:09,974 INFO L276 IsEmpty]: Start isEmpty. Operand 3733 states and 4739 transitions. [2022-11-25 16:52:09,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-11-25 16:52:09,977 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:52:09,978 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:52:09,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-25 16:52:09,980 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 16:52:09,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:52:09,981 INFO L85 PathProgramCache]: Analyzing trace with hash 766062250, now seen corresponding path program 1 times [2022-11-25 16:52:09,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:52:09,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781139985] [2022-11-25 16:52:09,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:52:09,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:52:10,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:52:10,013 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:52:10,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:52:10,082 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:52:10,082 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 16:52:10,084 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2022-11-25 16:52:10,087 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2022-11-25 16:52:10,087 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2022-11-25 16:52:10,088 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2022-11-25 16:52:10,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-25 16:52:10,093 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:52:10,099 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 16:52:10,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 04:52:10 BoogieIcfgContainer [2022-11-25 16:52:10,249 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 16:52:10,250 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 16:52:10,250 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 16:52:10,250 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 16:52:10,251 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:51:43" (3/4) ... [2022-11-25 16:52:10,254 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-25 16:52:10,352 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c461d7e3-2d2c-481b-a26f-957b11ac19a8/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 16:52:10,353 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 16:52:10,354 INFO L158 Benchmark]: Toolchain (without parser) took 27908.73ms. Allocated memory was 134.2MB in the beginning and 746.6MB in the end (delta: 612.4MB). Free memory was 68.9MB in the beginning and 565.2MB in the end (delta: -496.3MB). Peak memory consumption was 118.6MB. Max. memory is 16.1GB. [2022-11-25 16:52:10,354 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 134.2MB. Free memory is still 108.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 16:52:10,355 INFO L158 Benchmark]: CACSL2BoogieTranslator took 400.44ms. Allocated memory was 134.2MB in the beginning and 188.7MB in the end (delta: 54.5MB). Free memory was 68.7MB in the beginning and 154.1MB in the end (delta: -85.4MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. [2022-11-25 16:52:10,355 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.34ms. Allocated memory is still 188.7MB. Free memory was 154.1MB in the beginning and 152.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 16:52:10,356 INFO L158 Benchmark]: Boogie Preprocessor took 42.27ms. Allocated memory is still 188.7MB. Free memory was 152.0MB in the beginning and 151.1MB in the end (delta: 902.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 16:52:10,356 INFO L158 Benchmark]: RCFGBuilder took 587.38ms. Allocated memory is still 188.7MB. Free memory was 151.1MB in the beginning and 132.2MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-25 16:52:10,357 INFO L158 Benchmark]: TraceAbstraction took 26718.06ms. Allocated memory was 188.7MB in the beginning and 746.6MB in the end (delta: 557.8MB). Free memory was 131.9MB in the beginning and 572.6MB in the end (delta: -440.7MB). Peak memory consumption was 117.1MB. Max. memory is 16.1GB. [2022-11-25 16:52:10,357 INFO L158 Benchmark]: Witness Printer took 102.99ms. Allocated memory is still 746.6MB. Free memory was 572.6MB in the beginning and 565.2MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-25 16:52:10,359 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.27ms. Allocated memory is still 134.2MB. Free memory is still 108.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 400.44ms. Allocated memory was 134.2MB in the beginning and 188.7MB in the end (delta: 54.5MB). Free memory was 68.7MB in the beginning and 154.1MB in the end (delta: -85.4MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.34ms. Allocated memory is still 188.7MB. Free memory was 154.1MB in the beginning and 152.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.27ms. Allocated memory is still 188.7MB. Free memory was 152.0MB in the beginning and 151.1MB in the end (delta: 902.2kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 587.38ms. Allocated memory is still 188.7MB. Free memory was 151.1MB in the beginning and 132.2MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 26718.06ms. Allocated memory was 188.7MB in the beginning and 746.6MB in the end (delta: 557.8MB). Free memory was 131.9MB in the beginning and 572.6MB in the end (delta: -440.7MB). Peak memory consumption was 117.1MB. Max. memory is 16.1GB. * Witness Printer took 102.99ms. Allocated memory is still 746.6MB. Free memory was 572.6MB in the beginning and 565.2MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. 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 - CounterExampleResult [Line: 119]: integer overflow possible integer overflow possible We found a FailurePath: [L24] int m_pc = 0; [L25] int t1_pc = 0; [L26] int m_st ; [L27] int t1_st ; [L28] int m_i ; [L29] int t1_i ; [L30] int M_E = 2; [L31] int T1_E = 2; [L32] int E_M = 2; [L33] int E_1 = 2; [L37] int token ; [L39] int local ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L485] int __retres1 ; [L489] CALL init_model() [L400] m_i = 1 [L401] t1_i = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L489] RET init_model() [L490] CALL start_simulation() [L426] int kernel_st ; [L427] int tmp ; [L428] int tmp___0 ; [L432] kernel_st = 0 VAL [E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L433] FCALL update_channels() VAL [E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L434] CALL init_threads() [L182] COND TRUE m_i == 1 [L183] m_st = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L187] COND TRUE t1_i == 1 [L188] t1_st = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L434] RET init_threads() [L435] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L271] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L276] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L281] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L286] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L435] RET fire_delta_events() VAL [E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L436] CALL activate_threads() VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L324] int tmp ; [L325] int tmp___0 ; [L329] CALL, EXPR is_master_triggered() [L133] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L136] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L146] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L148] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L329] RET, EXPR is_master_triggered() [L329] tmp = is_master_triggered() [L331] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, token=0] [L337] CALL, EXPR is_transmit1_triggered() [L152] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L155] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L165] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L167] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L337] RET, EXPR is_transmit1_triggered() [L337] tmp___0 = is_transmit1_triggered() [L339] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0, token=0] [L436] RET activate_threads() VAL [E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L437] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L299] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L304] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L309] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L314] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L437] RET reset_delta_events() VAL [E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L440] COND TRUE 1 VAL [E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L443] kernel_st = 1 [L444] CALL eval() [L218] int tmp ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L222] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L225] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L197] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L200] COND TRUE m_st == 0 [L201] __retres1 = 1 VAL [__retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L213] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L225] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L225] tmp = exists_runnable_thread() [L227] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L232] COND TRUE m_st == 0 [L233] int tmp_ndt_1; [L234] tmp_ndt_1 = __VERIFIER_nondet_int() [L235] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, token=0] [L246] COND TRUE t1_st == 0 [L247] int tmp_ndt_2; [L248] tmp_ndt_2 = __VERIFIER_nondet_int() [L249] COND TRUE \read(tmp_ndt_2) [L251] t1_st = 1 [L252] CALL transmit1() [L100] COND TRUE t1_pc == 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L111] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L113] t1_pc = 1 [L114] t1_st = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L252] RET transmit1() [L222] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, token=0] [L225] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L197] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L200] COND TRUE m_st == 0 [L201] __retres1 = 1 VAL [__retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L213] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L225] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, token=0] [L225] tmp = exists_runnable_thread() [L227] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, token=0] [L232] COND TRUE m_st == 0 [L233] int tmp_ndt_1; [L234] tmp_ndt_1 = __VERIFIER_nondet_int() [L235] COND TRUE \read(tmp_ndt_1) [L237] m_st = 1 [L238] CALL master() [L42] int tmp_var = __VERIFIER_nondet_int(); [L44] COND TRUE m_pc == 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L55] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L58] token = __VERIFIER_nondet_int() [L59] local = token [L60] E_1 = 1 VAL [E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=2147483647] [L61] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L353] CALL activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L324] int tmp ; [L325] int tmp___0 ; [L329] CALL, EXPR is_master_triggered() [L133] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L136] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L146] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=0, E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L148] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=0, __retres1=0, E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L329] RET, EXPR is_master_triggered() [L329] tmp = is_master_triggered() [L331] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0, token=2147483647] [L337] CALL, EXPR is_transmit1_triggered() [L152] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L155] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L156] COND TRUE E_1 == 1 [L157] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=1, E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L167] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=1, __retres1=1, E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L337] RET, EXPR is_transmit1_triggered() [L337] tmp___0 = is_transmit1_triggered() [L339] COND TRUE \read(tmp___0) [L340] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=0, tmp___0=1, token=2147483647] [L353] RET activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=2147483647] [L61] RET immediate_notify() VAL [E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=2147483647] [L62] E_1 = 2 [L63] m_pc = 1 [L64] m_st = 2 VAL [E_1=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=2147483647] [L238] RET master() [L246] COND TRUE t1_st == 0 [L247] int tmp_ndt_2; [L248] tmp_ndt_2 = __VERIFIER_nondet_int() [L249] COND TRUE \read(tmp_ndt_2) [L251] t1_st = 1 [L252] CALL transmit1() [L100] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=2147483647] [L103] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=2147483647] [L119] token += 1 VAL [E_1=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=2147483647] - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 119]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 121 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 26.4s, OverallIterations: 18, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 17.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6847 SdHoareTripleChecker+Valid, 9.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6680 mSDsluCounter, 8790 SdHoareTripleChecker+Invalid, 8.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6431 mSDsCounter, 1315 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8018 IncrementalHoareTripleChecker+Invalid, 9333 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1315 mSolverCounterUnsat, 2359 mSDtfsCounter, 8018 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 479 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4675occurred in iteration=13, InterpolantAutomatonStates: 213, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.6s AutomataMinimizationTime, 17 MinimizatonAttempts, 4633 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1208 NumberOfCodeBlocks, 1208 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1093 ConstructedInterpolants, 0 QuantifiedInterpolants, 2434 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 119/119 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-25 16:52:10,393 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c461d7e3-2d2c-481b-a26f-957b11ac19a8/bin/uautomizer-ZsLfNo2U6R/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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)