./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 6b4ec56b 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_bcb1fed2-d12d-4fa3-bea9-13dbe49c9dda/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcb1fed2-d12d-4fa3-bea9-13dbe49c9dda/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcb1fed2-d12d-4fa3-bea9-13dbe49c9dda/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcb1fed2-d12d-4fa3-bea9-13dbe49c9dda/bin/uautomizer-ug76WZFUDN/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_bcb1fed2-d12d-4fa3-bea9-13dbe49c9dda/bin/uautomizer-ug76WZFUDN/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcb1fed2-d12d-4fa3-bea9-13dbe49c9dda/bin/uautomizer-ug76WZFUDN --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-6b4ec56 [2022-11-20 09:27:26,640 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 09:27:26,642 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 09:27:26,663 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 09:27:26,664 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 09:27:26,665 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 09:27:26,666 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 09:27:26,668 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 09:27:26,670 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 09:27:26,671 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 09:27:26,672 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 09:27:26,673 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 09:27:26,674 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 09:27:26,675 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 09:27:26,676 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 09:27:26,677 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 09:27:26,678 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 09:27:26,679 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 09:27:26,681 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 09:27:26,683 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 09:27:26,684 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 09:27:26,686 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 09:27:26,687 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 09:27:26,688 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 09:27:26,691 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 09:27:26,692 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 09:27:26,692 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 09:27:26,693 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 09:27:26,694 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 09:27:26,695 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 09:27:26,696 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 09:27:26,697 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 09:27:26,697 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 09:27:26,698 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 09:27:26,700 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 09:27:26,700 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 09:27:26,701 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 09:27:26,701 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 09:27:26,702 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 09:27:26,703 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 09:27:26,704 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 09:27:26,713 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcb1fed2-d12d-4fa3-bea9-13dbe49c9dda/bin/uautomizer-ug76WZFUDN/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-11-20 09:27:26,756 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 09:27:26,756 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 09:27:26,757 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 09:27:26,757 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 09:27:26,758 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 09:27:26,758 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 09:27:26,759 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 09:27:26,759 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 09:27:26,760 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 09:27:26,760 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 09:27:26,761 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 09:27:26,761 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 09:27:26,762 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 09:27:26,762 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 09:27:26,762 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 09:27:26,763 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 09:27:26,763 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 09:27:26,763 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 09:27:26,764 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-20 09:27:26,764 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 09:27:26,764 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 09:27:26,764 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 09:27:26,765 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 09:27:26,765 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 09:27:26,765 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 09:27:26,766 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 09:27:26,766 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 09:27:26,766 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 09:27:26,767 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 09:27:26,768 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 09:27:26,768 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 09:27:26,769 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 09:27:26,769 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 09:27:26,770 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 09:27:26,770 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 09:27:26,770 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcb1fed2-d12d-4fa3-bea9-13dbe49c9dda/bin/uautomizer-ug76WZFUDN/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_bcb1fed2-d12d-4fa3-bea9-13dbe49c9dda/bin/uautomizer-ug76WZFUDN 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-20 09:27:27,073 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 09:27:27,105 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 09:27:27,108 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 09:27:27,109 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 09:27:27,109 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 09:27:27,110 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcb1fed2-d12d-4fa3-bea9-13dbe49c9dda/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2022-11-20 09:27:30,227 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 09:27:30,495 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 09:27:30,496 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcb1fed2-d12d-4fa3-bea9-13dbe49c9dda/sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2022-11-20 09:27:30,505 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcb1fed2-d12d-4fa3-bea9-13dbe49c9dda/bin/uautomizer-ug76WZFUDN/data/8effef2ee/bc80fbae5a4e44578da3d2c9eb0b86f3/FLAG941c1098c [2022-11-20 09:27:30,534 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcb1fed2-d12d-4fa3-bea9-13dbe49c9dda/bin/uautomizer-ug76WZFUDN/data/8effef2ee/bc80fbae5a4e44578da3d2c9eb0b86f3 [2022-11-20 09:27:30,540 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 09:27:30,543 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 09:27:30,547 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 09:27:30,548 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 09:27:30,552 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 09:27:30,553 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:27:30" (1/1) ... [2022-11-20 09:27:30,554 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48bcc828 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:30, skipping insertion in model container [2022-11-20 09:27:30,555 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:27:30" (1/1) ... [2022-11-20 09:27:30,563 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 09:27:30,590 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 09:27:30,772 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_bcb1fed2-d12d-4fa3-bea9-13dbe49c9dda/sv-benchmarks/c/systemc/token_ring.01.cil-2.c[671,684] [2022-11-20 09:27:30,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:27:30,842 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 09:27:30,854 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_bcb1fed2-d12d-4fa3-bea9-13dbe49c9dda/sv-benchmarks/c/systemc/token_ring.01.cil-2.c[671,684] [2022-11-20 09:27:30,893 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:27:30,918 INFO L208 MainTranslator]: Completed translation [2022-11-20 09:27:30,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:30 WrapperNode [2022-11-20 09:27:30,918 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 09:27:30,919 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 09:27:30,920 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 09:27:30,920 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 09:27:30,927 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:30" (1/1) ... [2022-11-20 09:27:30,935 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:30" (1/1) ... [2022-11-20 09:27:30,966 INFO L138 Inliner]: procedures = 30, calls = 35, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 224 [2022-11-20 09:27:30,966 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 09:27:30,967 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 09:27:30,967 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 09:27:30,968 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 09:27:30,978 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:30" (1/1) ... [2022-11-20 09:27:30,979 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:30" (1/1) ... [2022-11-20 09:27:30,981 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:30" (1/1) ... [2022-11-20 09:27:30,982 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:30" (1/1) ... [2022-11-20 09:27:30,987 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:30" (1/1) ... [2022-11-20 09:27:30,994 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:30" (1/1) ... [2022-11-20 09:27:30,996 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:30" (1/1) ... [2022-11-20 09:27:30,997 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:30" (1/1) ... [2022-11-20 09:27:31,009 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 09:27:31,010 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 09:27:31,010 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 09:27:31,011 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 09:27:31,012 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:30" (1/1) ... [2022-11-20 09:27:31,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 09:27:31,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcb1fed2-d12d-4fa3-bea9-13dbe49c9dda/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:27:31,060 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcb1fed2-d12d-4fa3-bea9-13dbe49c9dda/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 09:27:31,063 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcb1fed2-d12d-4fa3-bea9-13dbe49c9dda/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 09:27:31,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 09:27:31,105 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-11-20 09:27:31,105 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-11-20 09:27:31,105 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-11-20 09:27:31,105 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-11-20 09:27:31,106 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-11-20 09:27:31,106 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-11-20 09:27:31,106 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-11-20 09:27:31,106 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-11-20 09:27:31,107 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-11-20 09:27:31,107 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-11-20 09:27:31,107 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-11-20 09:27:31,108 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-11-20 09:27:31,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 09:27:31,108 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-11-20 09:27:31,108 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-11-20 09:27:31,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 09:27:31,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 09:27:31,213 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 09:27:31,216 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 09:27:31,652 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 09:27:31,660 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 09:27:31,661 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-20 09:27:31,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:27:31 BoogieIcfgContainer [2022-11-20 09:27:31,664 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 09:27:31,667 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 09:27:31,667 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 09:27:31,671 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 09:27:31,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:27:30" (1/3) ... [2022-11-20 09:27:31,672 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f42e3dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:27:31, skipping insertion in model container [2022-11-20 09:27:31,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:30" (2/3) ... [2022-11-20 09:27:31,673 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f42e3dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:27:31, skipping insertion in model container [2022-11-20 09:27:31,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:27:31" (3/3) ... [2022-11-20 09:27:31,687 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-2.c [2022-11-20 09:27:31,708 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 09:27:31,708 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-11-20 09:27:31,768 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 09:27:31,774 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;@6002f71a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 09:27:31,775 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-20 09:27:31,780 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-20 09:27:31,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-20 09:27:31,790 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:31,791 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-20 09:27:31,792 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-20 09:27:31,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:31,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1554820752, now seen corresponding path program 1 times [2022-11-20 09:27:31,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:31,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307910576] [2022-11-20 09:27:31,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:31,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:31,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:32,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 09:27:32,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:32,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 09:27:32,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:32,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 09:27:32,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:32,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 09:27:32,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:32,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 09:27:32,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:32,349 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-20 09:27:32,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:32,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307910576] [2022-11-20 09:27:32,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307910576] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:32,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:32,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 09:27:32,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195458486] [2022-11-20 09:27:32,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:32,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 09:27:32,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:32,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 09:27:32,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 09:27:32,395 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-20 09:27:33,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:33,327 INFO L93 Difference]: Finished difference Result 379 states and 571 transitions. [2022-11-20 09:27:33,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 09:27:33,330 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-20 09:27:33,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:33,356 INFO L225 Difference]: With dead ends: 379 [2022-11-20 09:27:33,358 INFO L226 Difference]: Without dead ends: 253 [2022-11-20 09:27:33,365 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-20 09:27:33,370 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 319 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.7s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:33,371 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.7s Time] [2022-11-20 09:27:33,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-11-20 09:27:33,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 210. [2022-11-20 09:27:33,444 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-20 09:27:33,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 301 transitions. [2022-11-20 09:27:33,447 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 301 transitions. Word has length 55 [2022-11-20 09:27:33,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:33,448 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 301 transitions. [2022-11-20 09:27:33,448 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-20 09:27:33,448 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 301 transitions. [2022-11-20 09:27:33,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-20 09:27:33,451 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:33,451 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-20 09:27:33,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 09:27:33,452 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-20 09:27:33,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:33,453 INFO L85 PathProgramCache]: Analyzing trace with hash -275712372, now seen corresponding path program 1 times [2022-11-20 09:27:33,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:33,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426510726] [2022-11-20 09:27:33,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:33,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:33,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:33,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 09:27:33,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:33,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 09:27:33,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:33,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 09:27:33,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:33,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 09:27:33,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:33,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 09:27:33,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:33,733 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-20 09:27:33,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:33,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426510726] [2022-11-20 09:27:33,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426510726] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:33,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:33,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 09:27:33,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470219671] [2022-11-20 09:27:33,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:33,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 09:27:33,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:33,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 09:27:33,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:27:33,738 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-20 09:27:34,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:34,586 INFO L93 Difference]: Finished difference Result 570 states and 818 transitions. [2022-11-20 09:27:34,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 09:27:34,589 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-20 09:27:34,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:34,599 INFO L225 Difference]: With dead ends: 570 [2022-11-20 09:27:34,599 INFO L226 Difference]: Without dead ends: 369 [2022-11-20 09:27:34,608 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-20 09:27:34,609 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 300 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:34,610 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.6s Time] [2022-11-20 09:27:34,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2022-11-20 09:27:34,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 303. [2022-11-20 09:27:34,685 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-20 09:27:34,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 433 transitions. [2022-11-20 09:27:34,688 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 433 transitions. Word has length 55 [2022-11-20 09:27:34,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:34,689 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 433 transitions. [2022-11-20 09:27:34,689 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-20 09:27:34,689 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 433 transitions. [2022-11-20 09:27:34,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-20 09:27:34,698 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:34,698 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-20 09:27:34,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 09:27:34,699 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-20 09:27:34,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:34,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1173105650, now seen corresponding path program 1 times [2022-11-20 09:27:34,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:34,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537940290] [2022-11-20 09:27:34,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:34,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:34,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:34,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 09:27:34,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:34,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 09:27:34,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:34,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 09:27:34,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:34,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 09:27:34,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:34,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 09:27:34,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:34,919 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-20 09:27:34,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:34,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537940290] [2022-11-20 09:27:34,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537940290] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:34,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:34,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 09:27:34,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260460710] [2022-11-20 09:27:34,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:34,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 09:27:34,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:34,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 09:27:34,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:27:34,923 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-20 09:27:35,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:35,696 INFO L93 Difference]: Finished difference Result 930 states and 1330 transitions. [2022-11-20 09:27:35,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 09:27:35,697 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-20 09:27:35,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:35,703 INFO L225 Difference]: With dead ends: 930 [2022-11-20 09:27:35,703 INFO L226 Difference]: Without dead ends: 636 [2022-11-20 09:27:35,707 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-20 09:27:35,712 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 355 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:35,713 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.6s Time] [2022-11-20 09:27:35,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2022-11-20 09:27:35,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 482. [2022-11-20 09:27:35,783 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-20 09:27:35,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 688 transitions. [2022-11-20 09:27:35,788 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 688 transitions. Word has length 55 [2022-11-20 09:27:35,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:35,789 INFO L495 AbstractCegarLoop]: Abstraction has 482 states and 688 transitions. [2022-11-20 09:27:35,789 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-20 09:27:35,789 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 688 transitions. [2022-11-20 09:27:35,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-20 09:27:35,792 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:35,792 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-20 09:27:35,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 09:27:35,792 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-20 09:27:35,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:35,793 INFO L85 PathProgramCache]: Analyzing trace with hash -924959156, now seen corresponding path program 1 times [2022-11-20 09:27:35,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:35,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061227246] [2022-11-20 09:27:35,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:35,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:35,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:35,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 09:27:35,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:35,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 09:27:35,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:35,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 09:27:35,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:35,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 09:27:35,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:35,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 09:27:35,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:36,003 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-20 09:27:36,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:36,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061227246] [2022-11-20 09:27:36,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061227246] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:36,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:36,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 09:27:36,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068956773] [2022-11-20 09:27:36,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:36,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 09:27:36,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:36,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 09:27:36,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:27:36,009 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-20 09:27:36,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:36,835 INFO L93 Difference]: Finished difference Result 1494 states and 2133 transitions. [2022-11-20 09:27:36,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 09:27:36,836 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-20 09:27:36,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:36,845 INFO L225 Difference]: With dead ends: 1494 [2022-11-20 09:27:36,848 INFO L226 Difference]: Without dead ends: 1021 [2022-11-20 09:27:36,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-11-20 09:27:36,858 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 295 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:36,860 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.6s Time] [2022-11-20 09:27:36,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2022-11-20 09:27:36,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 783. [2022-11-20 09:27:36,943 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-20 09:27:36,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1116 transitions. [2022-11-20 09:27:36,948 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1116 transitions. Word has length 55 [2022-11-20 09:27:36,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:36,955 INFO L495 AbstractCegarLoop]: Abstraction has 783 states and 1116 transitions. [2022-11-20 09:27:36,955 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-20 09:27:36,956 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1116 transitions. [2022-11-20 09:27:36,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-20 09:27:36,959 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:36,960 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-20 09:27:36,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 09:27:36,960 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-20 09:27:36,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:36,961 INFO L85 PathProgramCache]: Analyzing trace with hash -501312434, now seen corresponding path program 1 times [2022-11-20 09:27:36,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:36,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130363670] [2022-11-20 09:27:36,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:36,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:36,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:37,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 09:27:37,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:37,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 09:27:37,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:37,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 09:27:37,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:37,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 09:27:37,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:37,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 09:27:37,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:37,131 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-20 09:27:37,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:37,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130363670] [2022-11-20 09:27:37,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130363670] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:37,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:37,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 09:27:37,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975414865] [2022-11-20 09:27:37,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:37,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 09:27:37,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:37,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 09:27:37,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 09:27:37,135 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-20 09:27:37,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:37,834 INFO L93 Difference]: Finished difference Result 2167 states and 3093 transitions. [2022-11-20 09:27:37,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 09:27:37,834 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-20 09:27:37,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:37,842 INFO L225 Difference]: With dead ends: 2167 [2022-11-20 09:27:37,843 INFO L226 Difference]: Without dead ends: 1394 [2022-11-20 09:27:37,846 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-20 09:27:37,847 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 416 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:37,847 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.5s Time] [2022-11-20 09:27:37,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2022-11-20 09:27:37,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1187. [2022-11-20 09:27:37,991 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-20 09:27:37,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 1187 states and 1659 transitions. [2022-11-20 09:27:37,998 INFO L78 Accepts]: Start accepts. Automaton has 1187 states and 1659 transitions. Word has length 55 [2022-11-20 09:27:37,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:37,998 INFO L495 AbstractCegarLoop]: Abstraction has 1187 states and 1659 transitions. [2022-11-20 09:27:37,998 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-20 09:27:37,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1187 states and 1659 transitions. [2022-11-20 09:27:38,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-20 09:27:38,001 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:38,001 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-20 09:27:38,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 09:27:38,002 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-20 09:27:38,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:38,003 INFO L85 PathProgramCache]: Analyzing trace with hash 777880458, now seen corresponding path program 1 times [2022-11-20 09:27:38,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:38,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737652061] [2022-11-20 09:27:38,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:38,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:38,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:38,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 09:27:38,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:38,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 09:27:38,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:38,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 09:27:38,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:38,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 09:27:38,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:38,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 09:27:38,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:38,149 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-20 09:27:38,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:38,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737652061] [2022-11-20 09:27:38,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737652061] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:38,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:38,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 09:27:38,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67614487] [2022-11-20 09:27:38,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:38,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 09:27:38,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:38,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 09:27:38,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:27:38,153 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-20 09:27:38,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:38,753 INFO L93 Difference]: Finished difference Result 2581 states and 3659 transitions. [2022-11-20 09:27:38,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 09:27:38,754 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-20 09:27:38,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:38,780 INFO L225 Difference]: With dead ends: 2581 [2022-11-20 09:27:38,781 INFO L226 Difference]: Without dead ends: 1404 [2022-11-20 09:27:38,784 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-20 09:27:38,785 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 170 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:38,786 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.3s Time] [2022-11-20 09:27:38,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2022-11-20 09:27:38,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 1202. [2022-11-20 09:27:38,885 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-20 09:27:38,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 1202 states and 1665 transitions. [2022-11-20 09:27:38,892 INFO L78 Accepts]: Start accepts. Automaton has 1202 states and 1665 transitions. Word has length 56 [2022-11-20 09:27:38,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:38,893 INFO L495 AbstractCegarLoop]: Abstraction has 1202 states and 1665 transitions. [2022-11-20 09:27:38,893 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-20 09:27:38,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1665 transitions. [2022-11-20 09:27:38,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-20 09:27:38,894 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:38,895 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-20 09:27:38,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 09:27:38,895 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-20 09:27:38,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:38,899 INFO L85 PathProgramCache]: Analyzing trace with hash 705493900, now seen corresponding path program 1 times [2022-11-20 09:27:38,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:38,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911797646] [2022-11-20 09:27:38,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:38,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:38,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:38,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 09:27:38,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:38,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 09:27:38,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:38,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 09:27:38,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:39,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 09:27:39,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:39,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 09:27:39,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:39,039 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-20 09:27:39,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:39,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911797646] [2022-11-20 09:27:39,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911797646] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:39,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:39,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 09:27:39,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777667547] [2022-11-20 09:27:39,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:39,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 09:27:39,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:39,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 09:27:39,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:27:39,043 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-20 09:27:39,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:39,747 INFO L93 Difference]: Finished difference Result 2636 states and 3704 transitions. [2022-11-20 09:27:39,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 09:27:39,748 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-20 09:27:39,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:39,758 INFO L225 Difference]: With dead ends: 2636 [2022-11-20 09:27:39,758 INFO L226 Difference]: Without dead ends: 1444 [2022-11-20 09:27:39,762 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-20 09:27:39,763 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-20 09:27:39,764 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-20 09:27:39,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2022-11-20 09:27:39,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 1244. [2022-11-20 09:27:39,880 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-20 09:27:39,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1244 states to 1244 states and 1707 transitions. [2022-11-20 09:27:39,886 INFO L78 Accepts]: Start accepts. Automaton has 1244 states and 1707 transitions. Word has length 56 [2022-11-20 09:27:39,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:39,886 INFO L495 AbstractCegarLoop]: Abstraction has 1244 states and 1707 transitions. [2022-11-20 09:27:39,887 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-20 09:27:39,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1244 states and 1707 transitions. [2022-11-20 09:27:39,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-20 09:27:39,888 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:39,888 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-20 09:27:39,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 09:27:39,888 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-20 09:27:39,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:39,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1666245362, now seen corresponding path program 1 times [2022-11-20 09:27:39,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:39,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866866081] [2022-11-20 09:27:39,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:39,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:39,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:39,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 09:27:39,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:39,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 09:27:39,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:39,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 09:27:39,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:39,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 09:27:39,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:40,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 09:27:40,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:40,025 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-20 09:27:40,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:40,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866866081] [2022-11-20 09:27:40,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866866081] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:40,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:40,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 09:27:40,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247629923] [2022-11-20 09:27:40,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:40,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 09:27:40,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:40,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 09:27:40,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-20 09:27:40,028 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-20 09:27:40,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:40,785 INFO L93 Difference]: Finished difference Result 1802 states and 2473 transitions. [2022-11-20 09:27:40,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 09:27:40,786 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-20 09:27:40,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:40,791 INFO L225 Difference]: With dead ends: 1802 [2022-11-20 09:27:40,791 INFO L226 Difference]: Without dead ends: 1068 [2022-11-20 09:27:40,794 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-20 09:27:40,794 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 372 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:40,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 585 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 09:27:40,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2022-11-20 09:27:40,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 898. [2022-11-20 09:27:40,868 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-20 09:27:40,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 1211 transitions. [2022-11-20 09:27:40,873 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 1211 transitions. Word has length 56 [2022-11-20 09:27:40,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:40,873 INFO L495 AbstractCegarLoop]: Abstraction has 898 states and 1211 transitions. [2022-11-20 09:27:40,873 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-20 09:27:40,874 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1211 transitions. [2022-11-20 09:27:40,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-20 09:27:40,874 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:40,875 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-20 09:27:40,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 09:27:40,875 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-20 09:27:40,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:40,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1447390644, now seen corresponding path program 1 times [2022-11-20 09:27:40,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:40,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732016041] [2022-11-20 09:27:40,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:40,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:40,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:40,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 09:27:40,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:40,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 09:27:40,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:40,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 09:27:40,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:40,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 09:27:40,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:41,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 09:27:41,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:41,009 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-20 09:27:41,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:41,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732016041] [2022-11-20 09:27:41,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732016041] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:41,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:41,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 09:27:41,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661182500] [2022-11-20 09:27:41,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:41,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 09:27:41,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:41,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 09:27:41,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-20 09:27:41,012 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-20 09:27:41,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:41,771 INFO L93 Difference]: Finished difference Result 1745 states and 2359 transitions. [2022-11-20 09:27:41,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 09:27:41,771 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-20 09:27:41,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:41,777 INFO L225 Difference]: With dead ends: 1745 [2022-11-20 09:27:41,777 INFO L226 Difference]: Without dead ends: 1096 [2022-11-20 09:27:41,780 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-20 09:27:41,780 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 369 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:41,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 580 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 09:27:41,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1096 states. [2022-11-20 09:27:41,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1096 to 892. [2022-11-20 09:27:41,856 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-20 09:27:41,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1194 transitions. [2022-11-20 09:27:41,861 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1194 transitions. Word has length 56 [2022-11-20 09:27:41,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:41,861 INFO L495 AbstractCegarLoop]: Abstraction has 892 states and 1194 transitions. [2022-11-20 09:27:41,862 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-20 09:27:41,862 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1194 transitions. [2022-11-20 09:27:41,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-20 09:27:41,863 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:41,863 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-20 09:27:41,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 09:27:41,863 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-20 09:27:41,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:41,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1024688818, now seen corresponding path program 1 times [2022-11-20 09:27:41,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:41,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813349998] [2022-11-20 09:27:41,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:41,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:41,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:41,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 09:27:41,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:41,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 09:27:41,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:41,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 09:27:41,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:41,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 09:27:42,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:42,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 09:27:42,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:42,030 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-20 09:27:42,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:42,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813349998] [2022-11-20 09:27:42,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813349998] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:42,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:42,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 09:27:42,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71226893] [2022-11-20 09:27:42,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:42,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 09:27:42,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:42,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 09:27:42,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-20 09:27:42,033 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-20 09:27:42,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:42,722 INFO L93 Difference]: Finished difference Result 1689 states and 2257 transitions. [2022-11-20 09:27:42,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 09:27:42,723 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-20 09:27:42,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:42,727 INFO L225 Difference]: With dead ends: 1689 [2022-11-20 09:27:42,728 INFO L226 Difference]: Without dead ends: 952 [2022-11-20 09:27:42,730 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-20 09:27:42,731 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 409 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:42,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 537 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 09:27:42,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2022-11-20 09:27:42,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 780. [2022-11-20 09:27:42,813 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-20 09:27:42,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1038 transitions. [2022-11-20 09:27:42,817 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1038 transitions. Word has length 56 [2022-11-20 09:27:42,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:42,818 INFO L495 AbstractCegarLoop]: Abstraction has 780 states and 1038 transitions. [2022-11-20 09:27:42,818 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-20 09:27:42,818 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1038 transitions. [2022-11-20 09:27:42,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-20 09:27:42,824 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:42,824 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-20 09:27:42,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 09:27:42,825 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-20 09:27:42,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:42,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1842337268, now seen corresponding path program 1 times [2022-11-20 09:27:42,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:42,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015531544] [2022-11-20 09:27:42,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:42,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:42,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:42,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 09:27:42,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:42,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 09:27:42,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:42,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 09:27:42,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:42,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 09:27:42,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:42,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 09:27:42,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:42,911 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-20 09:27:42,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:42,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015531544] [2022-11-20 09:27:42,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015531544] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:42,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:42,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 09:27:42,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894433849] [2022-11-20 09:27:42,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:42,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 09:27:42,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:42,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 09:27:42,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 09:27:42,913 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-20 09:27:43,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:43,538 INFO L93 Difference]: Finished difference Result 2410 states and 3254 transitions. [2022-11-20 09:27:43,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 09:27:43,539 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-20 09:27:43,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:43,547 INFO L225 Difference]: With dead ends: 2410 [2022-11-20 09:27:43,547 INFO L226 Difference]: Without dead ends: 1641 [2022-11-20 09:27:43,550 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-20 09:27:43,551 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 418 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:43,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 338 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 09:27:43,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1641 states. [2022-11-20 09:27:43,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1641 to 1467. [2022-11-20 09:27:43,685 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-20 09:27:43,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1467 states to 1467 states and 1957 transitions. [2022-11-20 09:27:43,691 INFO L78 Accepts]: Start accepts. Automaton has 1467 states and 1957 transitions. Word has length 56 [2022-11-20 09:27:43,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:43,692 INFO L495 AbstractCegarLoop]: Abstraction has 1467 states and 1957 transitions. [2022-11-20 09:27:43,692 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-20 09:27:43,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 1957 transitions. [2022-11-20 09:27:43,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-20 09:27:43,693 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:43,693 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-20 09:27:43,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 09:27:43,694 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-20 09:27:43,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:43,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1987017488, now seen corresponding path program 1 times [2022-11-20 09:27:43,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:43,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464622418] [2022-11-20 09:27:43,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:43,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:43,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:43,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 09:27:43,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:43,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 09:27:43,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:43,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 09:27:43,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:43,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 09:27:43,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:43,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 09:27:43,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:43,752 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-20 09:27:43,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:43,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464622418] [2022-11-20 09:27:43,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464622418] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:43,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:43,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 09:27:43,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269937461] [2022-11-20 09:27:43,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:43,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:27:43,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:43,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:27:43,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:27:43,755 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-20 09:27:44,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:44,321 INFO L93 Difference]: Finished difference Result 4191 states and 5620 transitions. [2022-11-20 09:27:44,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 09:27:44,321 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-20 09:27:44,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:44,335 INFO L225 Difference]: With dead ends: 4191 [2022-11-20 09:27:44,335 INFO L226 Difference]: Without dead ends: 2738 [2022-11-20 09:27:44,340 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-20 09:27:44,341 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 329 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:44,341 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.3s Time] [2022-11-20 09:27:44,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2738 states. [2022-11-20 09:27:44,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2738 to 2392. [2022-11-20 09:27:44,571 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-20 09:27:44,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2392 states to 2392 states and 3160 transitions. [2022-11-20 09:27:44,581 INFO L78 Accepts]: Start accepts. Automaton has 2392 states and 3160 transitions. Word has length 57 [2022-11-20 09:27:44,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:44,582 INFO L495 AbstractCegarLoop]: Abstraction has 2392 states and 3160 transitions. [2022-11-20 09:27:44,582 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-20 09:27:44,582 INFO L276 IsEmpty]: Start isEmpty. Operand 2392 states and 3160 transitions. [2022-11-20 09:27:44,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-20 09:27:44,583 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:44,584 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-20 09:27:44,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 09:27:44,584 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-20 09:27:44,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:44,585 INFO L85 PathProgramCache]: Analyzing trace with hash 772242277, now seen corresponding path program 1 times [2022-11-20 09:27:44,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:44,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853131324] [2022-11-20 09:27:44,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:44,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:44,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:44,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 09:27:44,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:44,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 09:27:44,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:44,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 09:27:44,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:44,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 09:27:44,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:44,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 09:27:44,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:44,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-20 09:27:44,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:44,705 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-20 09:27:44,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:44,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853131324] [2022-11-20 09:27:44,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853131324] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:44,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:44,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 09:27:44,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387195726] [2022-11-20 09:27:44,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:44,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 09:27:44,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:44,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 09:27:44,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 09:27:44,708 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-20 09:27:46,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:46,078 INFO L93 Difference]: Finished difference Result 7577 states and 10103 transitions. [2022-11-20 09:27:46,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 09:27:46,079 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-20 09:27:46,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:46,111 INFO L225 Difference]: With dead ends: 7577 [2022-11-20 09:27:46,112 INFO L226 Difference]: Without dead ends: 5201 [2022-11-20 09:27:46,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-11-20 09:27:46,122 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 739 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 753 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:46,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [753 Valid, 529 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-20 09:27:46,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5201 states. [2022-11-20 09:27:46,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5201 to 4675. [2022-11-20 09:27:46,688 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-20 09:27:46,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4675 states to 4675 states and 6197 transitions. [2022-11-20 09:27:46,708 INFO L78 Accepts]: Start accepts. Automaton has 4675 states and 6197 transitions. Word has length 74 [2022-11-20 09:27:46,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:46,709 INFO L495 AbstractCegarLoop]: Abstraction has 4675 states and 6197 transitions. [2022-11-20 09:27:46,709 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-20 09:27:46,709 INFO L276 IsEmpty]: Start isEmpty. Operand 4675 states and 6197 transitions. [2022-11-20 09:27:46,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-11-20 09:27:46,712 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:46,713 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-20 09:27:46,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 09:27:46,713 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-20 09:27:46,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:46,714 INFO L85 PathProgramCache]: Analyzing trace with hash 237737077, now seen corresponding path program 1 times [2022-11-20 09:27:46,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:46,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419322469] [2022-11-20 09:27:46,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:46,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:46,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:46,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 09:27:46,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:46,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 09:27:46,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:46,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 09:27:46,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:46,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 09:27:46,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:46,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 09:27:46,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:46,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-20 09:27:46,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:46,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 09:27:46,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:46,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-20 09:27:46,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:46,922 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-20 09:27:46,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:46,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419322469] [2022-11-20 09:27:46,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419322469] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:46,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:46,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 09:27:46,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857888811] [2022-11-20 09:27:46,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:46,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 09:27:46,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:46,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 09:27:46,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:27:46,926 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-20 09:27:47,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:47,895 INFO L93 Difference]: Finished difference Result 8997 states and 11865 transitions. [2022-11-20 09:27:47,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 09:27:47,896 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-20 09:27:47,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:47,919 INFO L225 Difference]: With dead ends: 8997 [2022-11-20 09:27:47,920 INFO L226 Difference]: Without dead ends: 5271 [2022-11-20 09:27:47,929 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-20 09:27:47,930 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 505 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:47,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 423 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 09:27:47,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5271 states. [2022-11-20 09:27:48,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5271 to 4643. [2022-11-20 09:27:48,414 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-20 09:27:48,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4643 states to 4643 states and 6026 transitions. [2022-11-20 09:27:48,489 INFO L78 Accepts]: Start accepts. Automaton has 4643 states and 6026 transitions. Word has length 90 [2022-11-20 09:27:48,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:48,490 INFO L495 AbstractCegarLoop]: Abstraction has 4643 states and 6026 transitions. [2022-11-20 09:27:48,491 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-20 09:27:48,491 INFO L276 IsEmpty]: Start isEmpty. Operand 4643 states and 6026 transitions. [2022-11-20 09:27:48,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-11-20 09:27:48,495 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:48,495 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-20 09:27:48,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 09:27:48,495 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-20 09:27:48,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:48,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1804495027, now seen corresponding path program 1 times [2022-11-20 09:27:48,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:48,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611511596] [2022-11-20 09:27:48,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:48,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:48,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:48,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 09:27:48,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:48,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 09:27:48,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:48,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 09:27:48,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:48,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 09:27:48,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:48,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 09:27:48,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:48,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-20 09:27:48,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:48,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 09:27:48,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:48,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-20 09:27:48,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:48,572 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-20 09:27:48,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:48,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611511596] [2022-11-20 09:27:48,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611511596] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:48,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:48,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 09:27:48,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086911843] [2022-11-20 09:27:48,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:48,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:27:48,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:48,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:27:48,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:27:48,575 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-20 09:27:49,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:49,269 INFO L93 Difference]: Finished difference Result 5107 states and 6643 transitions. [2022-11-20 09:27:49,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 09:27:49,270 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-20 09:27:49,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:49,297 INFO L225 Difference]: With dead ends: 5107 [2022-11-20 09:27:49,297 INFO L226 Difference]: Without dead ends: 4196 [2022-11-20 09:27:49,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-20 09:27:49,303 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-20 09:27:49,303 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-20 09:27:49,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4196 states. [2022-11-20 09:27:49,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4196 to 3734. [2022-11-20 09:27:49,676 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-20 09:27:49,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3734 states to 3734 states and 4861 transitions. [2022-11-20 09:27:49,690 INFO L78 Accepts]: Start accepts. Automaton has 3734 states and 4861 transitions. Word has length 90 [2022-11-20 09:27:49,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:49,691 INFO L495 AbstractCegarLoop]: Abstraction has 3734 states and 4861 transitions. [2022-11-20 09:27:49,691 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-20 09:27:49,691 INFO L276 IsEmpty]: Start isEmpty. Operand 3734 states and 4861 transitions. [2022-11-20 09:27:49,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-11-20 09:27:49,693 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:49,693 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-20 09:27:49,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 09:27:49,694 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-20 09:27:49,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:49,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1432721063, now seen corresponding path program 1 times [2022-11-20 09:27:49,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:49,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733040603] [2022-11-20 09:27:49,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:49,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:49,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:49,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 09:27:49,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:49,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 09:27:49,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:49,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 09:27:49,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:49,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 09:27:49,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:49,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 09:27:49,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:49,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-20 09:27:49,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:49,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 09:27:49,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:49,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-20 09:27:49,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:49,800 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-20 09:27:49,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:49,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733040603] [2022-11-20 09:27:49,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733040603] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:49,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:49,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 09:27:49,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300812188] [2022-11-20 09:27:49,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:49,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 09:27:49,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:49,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 09:27:49,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:27:49,803 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-20 09:27:51,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:51,201 INFO L93 Difference]: Finished difference Result 7161 states and 9288 transitions. [2022-11-20 09:27:51,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-20 09:27:51,202 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-20 09:27:51,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:51,228 INFO L225 Difference]: With dead ends: 7161 [2022-11-20 09:27:51,229 INFO L226 Difference]: Without dead ends: 4113 [2022-11-20 09:27:51,236 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-20 09:27:51,237 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 1052 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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, 0.8s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:51,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1066 Valid, 610 Invalid, 987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-20 09:27:51,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4113 states. [2022-11-20 09:27:51,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4113 to 3734. [2022-11-20 09:27:51,664 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-20 09:27:51,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3734 states to 3734 states and 4751 transitions. [2022-11-20 09:27:51,678 INFO L78 Accepts]: Start accepts. Automaton has 3734 states and 4751 transitions. Word has length 91 [2022-11-20 09:27:51,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:51,678 INFO L495 AbstractCegarLoop]: Abstraction has 3734 states and 4751 transitions. [2022-11-20 09:27:51,678 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-20 09:27:51,679 INFO L276 IsEmpty]: Start isEmpty. Operand 3734 states and 4751 transitions. [2022-11-20 09:27:51,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-11-20 09:27:51,681 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:51,681 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-20 09:27:51,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-20 09:27:51,681 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-20 09:27:51,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:51,682 INFO L85 PathProgramCache]: Analyzing trace with hash 578901004, now seen corresponding path program 1 times [2022-11-20 09:27:51,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:51,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303957377] [2022-11-20 09:27:51,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:51,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:51,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:27:51,696 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 09:27:51,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:27:51,742 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 09:27:51,742 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 09:27:51,743 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2022-11-20 09:27:51,746 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2022-11-20 09:27:51,746 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2022-11-20 09:27:51,747 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2022-11-20 09:27:51,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-20 09:27:51,751 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:51,756 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 09:27:51,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 09:27:51 BoogieIcfgContainer [2022-11-20 09:27:51,835 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 09:27:51,835 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 09:27:51,836 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 09:27:51,836 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 09:27:51,836 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:27:31" (3/4) ... [2022-11-20 09:27:51,839 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-20 09:27:51,932 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcb1fed2-d12d-4fa3-bea9-13dbe49c9dda/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 09:27:51,932 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 09:27:51,933 INFO L158 Benchmark]: Toolchain (without parser) took 21390.43ms. Allocated memory was 176.2MB in the beginning and 585.1MB in the end (delta: 408.9MB). Free memory was 143.8MB in the beginning and 488.0MB in the end (delta: -344.2MB). Peak memory consumption was 66.3MB. Max. memory is 16.1GB. [2022-11-20 09:27:51,933 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 132.1MB. Free memory is still 73.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 09:27:51,933 INFO L158 Benchmark]: CACSL2BoogieTranslator took 371.45ms. Allocated memory is still 176.2MB. Free memory was 143.8MB in the beginning and 130.7MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-20 09:27:51,934 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.25ms. Allocated memory is still 176.2MB. Free memory was 130.7MB in the beginning and 128.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 09:27:51,934 INFO L158 Benchmark]: Boogie Preprocessor took 42.21ms. Allocated memory is still 176.2MB. Free memory was 128.6MB in the beginning and 127.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 09:27:51,934 INFO L158 Benchmark]: RCFGBuilder took 653.67ms. Allocated memory is still 176.2MB. Free memory was 127.0MB in the beginning and 109.2MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-20 09:27:51,935 INFO L158 Benchmark]: TraceAbstraction took 20168.42ms. Allocated memory was 176.2MB in the beginning and 585.1MB in the end (delta: 408.9MB). Free memory was 108.2MB in the beginning and 496.4MB in the end (delta: -388.3MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. [2022-11-20 09:27:51,935 INFO L158 Benchmark]: Witness Printer took 96.80ms. Allocated memory is still 585.1MB. Free memory was 496.4MB in the beginning and 488.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-20 09:27:51,937 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.24ms. Allocated memory is still 132.1MB. Free memory is still 73.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 371.45ms. Allocated memory is still 176.2MB. Free memory was 143.8MB in the beginning and 130.7MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.25ms. Allocated memory is still 176.2MB. Free memory was 130.7MB in the beginning and 128.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.21ms. Allocated memory is still 176.2MB. Free memory was 128.6MB in the beginning and 127.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 653.67ms. Allocated memory is still 176.2MB. Free memory was 127.0MB in the beginning and 109.2MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 20168.42ms. Allocated memory was 176.2MB in the beginning and 585.1MB in the end (delta: 408.9MB). Free memory was 108.2MB in the beginning and 496.4MB in the end (delta: -388.3MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. * Witness Printer took 96.80ms. Allocated memory is still 585.1MB. Free memory was 496.4MB in the beginning and 488.0MB in the end (delta: 8.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: 20.0s, OverallIterations: 17, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 13.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6607 SdHoareTripleChecker+Valid, 7.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6457 mSDsluCounter, 8564 SdHoareTripleChecker+Invalid, 6.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6307 mSDsCounter, 1303 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7877 IncrementalHoareTripleChecker+Invalid, 9180 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1303 mSolverCounterUnsat, 2257 mSDtfsCounter, 7877 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 455 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4675occurred in iteration=13, InterpolantAutomatonStates: 207, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 4171 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1110 NumberOfCodeBlocks, 1110 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 997 ConstructedInterpolants, 0 QuantifiedInterpolants, 2264 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 92/92 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-20 09:27:51,974 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcb1fed2-d12d-4fa3-bea9-13dbe49c9dda/bin/uautomizer-ug76WZFUDN/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)