./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_multiply_15_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42dedb30-828d-42b9-b1ce-097026e876e8/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42dedb30-828d-42b9-b1ce-097026e876e8/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42dedb30-828d-42b9-b1ce-097026e876e8/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42dedb30-828d-42b9-b1ce-097026e876e8/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_multiply_15_good.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42dedb30-828d-42b9-b1ce-097026e876e8/bin/uautomizer-uyxdKDjOR8/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42dedb30-828d-42b9-b1ce-097026e876e8/bin/uautomizer-uyxdKDjOR8 --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 64bit --witnessprinter.graph.data.programhash b4fc024eb4a291394a4ae1b1322682ed27f27b7bc4916ad7f6f7dabc24e8b4cb --- 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-2329fc7 [2022-12-13 19:00:59,640 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 19:00:59,642 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 19:00:59,659 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 19:00:59,660 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 19:00:59,661 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 19:00:59,662 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 19:00:59,664 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 19:00:59,665 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 19:00:59,666 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 19:00:59,667 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 19:00:59,668 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 19:00:59,668 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 19:00:59,669 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 19:00:59,670 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 19:00:59,671 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 19:00:59,672 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 19:00:59,673 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 19:00:59,674 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 19:00:59,676 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 19:00:59,677 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 19:00:59,678 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 19:00:59,679 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 19:00:59,680 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 19:00:59,683 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 19:00:59,683 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 19:00:59,684 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 19:00:59,684 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 19:00:59,685 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 19:00:59,686 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 19:00:59,686 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 19:00:59,686 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 19:00:59,687 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 19:00:59,688 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 19:00:59,689 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 19:00:59,689 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 19:00:59,689 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 19:00:59,690 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 19:00:59,690 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 19:00:59,690 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 19:00:59,691 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 19:00:59,692 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42dedb30-828d-42b9-b1ce-097026e876e8/bin/uautomizer-uyxdKDjOR8/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-12-13 19:00:59,721 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 19:00:59,721 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 19:00:59,721 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 19:00:59,721 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 19:00:59,722 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 19:00:59,722 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 19:00:59,723 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 19:00:59,723 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 19:00:59,723 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 19:00:59,723 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 19:00:59,724 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 19:00:59,724 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 19:00:59,724 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 19:00:59,724 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 19:00:59,724 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 19:00:59,724 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 19:00:59,725 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-12-13 19:00:59,725 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 19:00:59,725 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 19:00:59,725 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 19:00:59,725 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 19:00:59,725 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 19:00:59,726 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 19:00:59,726 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 19:00:59,726 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 19:00:59,726 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 19:00:59,726 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 19:00:59,726 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 19:00:59,727 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 19:00:59,727 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 19:00:59,727 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 19:00:59,727 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 19:00:59,727 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 19:00:59,727 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 19:00:59,728 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42dedb30-828d-42b9-b1ce-097026e876e8/bin/uautomizer-uyxdKDjOR8/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_42dedb30-828d-42b9-b1ce-097026e876e8/bin/uautomizer-uyxdKDjOR8 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b4fc024eb4a291394a4ae1b1322682ed27f27b7bc4916ad7f6f7dabc24e8b4cb [2022-12-13 19:00:59,912 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 19:00:59,932 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 19:00:59,934 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 19:00:59,935 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 19:00:59,935 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 19:00:59,936 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42dedb30-828d-42b9-b1ce-097026e876e8/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_multiply_15_good.i [2022-12-13 19:01:02,584 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 19:01:02,890 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 19:01:02,890 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42dedb30-828d-42b9-b1ce-097026e876e8/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_multiply_15_good.i [2022-12-13 19:01:02,905 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42dedb30-828d-42b9-b1ce-097026e876e8/bin/uautomizer-uyxdKDjOR8/data/9f18b646c/2973161071ae4805862c6b5ff81555c1/FLAG0ae98e7af [2022-12-13 19:01:02,918 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42dedb30-828d-42b9-b1ce-097026e876e8/bin/uautomizer-uyxdKDjOR8/data/9f18b646c/2973161071ae4805862c6b5ff81555c1 [2022-12-13 19:01:02,921 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 19:01:02,922 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 19:01:02,924 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 19:01:02,924 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 19:01:02,926 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 19:01:02,927 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:01:02" (1/1) ... [2022-12-13 19:01:02,928 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73217556 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:01:02, skipping insertion in model container [2022-12-13 19:01:02,928 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:01:02" (1/1) ... [2022-12-13 19:01:02,934 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 19:01:02,989 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 19:01:03,271 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-13 19:01:03,615 WARN L623 FunctionHandler]: Unknown extern function puts [2022-12-13 19:01:03,619 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-12-13 19:01:03,621 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-12-13 19:01:03,622 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-12-13 19:01:03,623 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-12-13 19:01:03,648 WARN L623 FunctionHandler]: Unknown extern function time [2022-12-13 19:01:03,649 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 19:01:03,656 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 19:01:03,670 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-13 19:01:03,702 WARN L623 FunctionHandler]: Unknown extern function puts [2022-12-13 19:01:03,703 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-12-13 19:01:03,704 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-12-13 19:01:03,705 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-12-13 19:01:03,706 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-12-13 19:01:03,713 WARN L623 FunctionHandler]: Unknown extern function time [2022-12-13 19:01:03,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 19:01:03,805 INFO L208 MainTranslator]: Completed translation [2022-12-13 19:01:03,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:01:03 WrapperNode [2022-12-13 19:01:03,805 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 19:01:03,806 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 19:01:03,806 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 19:01:03,806 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 19:01:03,811 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:01:03" (1/1) ... [2022-12-13 19:01:03,837 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:01:03" (1/1) ... [2022-12-13 19:01:03,854 INFO L138 Inliner]: procedures = 503, calls = 81, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 149 [2022-12-13 19:01:03,855 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 19:01:03,855 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 19:01:03,855 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 19:01:03,855 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 19:01:03,862 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:01:03" (1/1) ... [2022-12-13 19:01:03,863 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:01:03" (1/1) ... [2022-12-13 19:01:03,865 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:01:03" (1/1) ... [2022-12-13 19:01:03,865 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:01:03" (1/1) ... [2022-12-13 19:01:03,869 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:01:03" (1/1) ... [2022-12-13 19:01:03,870 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:01:03" (1/1) ... [2022-12-13 19:01:03,871 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:01:03" (1/1) ... [2022-12-13 19:01:03,872 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:01:03" (1/1) ... [2022-12-13 19:01:03,874 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 19:01:03,875 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 19:01:03,875 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 19:01:03,875 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 19:01:03,875 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:01:03" (1/1) ... [2022-12-13 19:01:03,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 19:01:03,889 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42dedb30-828d-42b9-b1ce-097026e876e8/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:01:03,900 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42dedb30-828d-42b9-b1ce-097026e876e8/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 19:01:03,903 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42dedb30-828d-42b9-b1ce-097026e876e8/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 19:01:03,936 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2022-12-13 19:01:03,936 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2022-12-13 19:01:03,936 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2022-12-13 19:01:03,936 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2022-12-13 19:01:03,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 19:01:03,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 19:01:03,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 19:01:03,937 INFO L130 BoogieDeclarations]: Found specification of procedure time [2022-12-13 19:01:03,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 19:01:04,050 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 19:01:04,052 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 19:01:04,225 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 19:01:04,232 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 19:01:04,232 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 19:01:04,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:01:04 BoogieIcfgContainer [2022-12-13 19:01:04,234 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 19:01:04,237 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 19:01:04,237 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 19:01:04,240 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 19:01:04,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 07:01:02" (1/3) ... [2022-12-13 19:01:04,241 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d7e00f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:01:04, skipping insertion in model container [2022-12-13 19:01:04,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:01:03" (2/3) ... [2022-12-13 19:01:04,241 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d7e00f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:01:04, skipping insertion in model container [2022-12-13 19:01:04,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:01:04" (3/3) ... [2022-12-13 19:01:04,243 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_min_multiply_15_good.i [2022-12-13 19:01:04,262 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 19:01:04,262 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-12-13 19:01:04,304 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 19:01:04,310 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;@16c203da, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 19:01:04,310 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-12-13 19:01:04,313 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 54 states have (on average 1.5740740740740742) internal successors, (85), 76 states have internal predecessors, (85), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 10 states have call predecessors, (16), 16 states have call successors, (16) [2022-12-13 19:01:04,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-13 19:01:04,319 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:01:04,320 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:01:04,320 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 19:01:04,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:01:04,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1923445095, now seen corresponding path program 1 times [2022-12-13 19:01:04,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:01:04,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826113313] [2022-12-13 19:01:04,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:01:04,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:01:04,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:01:04,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 19:01:04,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:01:04,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:01:04,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:01:04,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826113313] [2022-12-13 19:01:04,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826113313] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:01:04,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:01:04,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 19:01:04,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025515150] [2022-12-13 19:01:04,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:01:04,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:01:04,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:01:04,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:01:04,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:01:04,599 INFO L87 Difference]: Start difference. First operand has 81 states, 54 states have (on average 1.5740740740740742) internal successors, (85), 76 states have internal predecessors, (85), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 10 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 19:01:04,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:01:04,649 INFO L93 Difference]: Finished difference Result 210 states and 304 transitions. [2022-12-13 19:01:04,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:01:04,650 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-12-13 19:01:04,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:01:04,657 INFO L225 Difference]: With dead ends: 210 [2022-12-13 19:01:04,657 INFO L226 Difference]: Without dead ends: 121 [2022-12-13 19:01:04,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:01:04,661 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 62 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 19:01:04,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 235 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 19:01:04,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-12-13 19:01:04,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 75. [2022-12-13 19:01:04,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 52 states have (on average 1.5576923076923077) internal successors, (81), 71 states have internal predecessors, (81), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 8 states have call predecessors, (13), 13 states have call successors, (13) [2022-12-13 19:01:04,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 107 transitions. [2022-12-13 19:01:04,694 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 107 transitions. Word has length 15 [2022-12-13 19:01:04,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:01:04,694 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 107 transitions. [2022-12-13 19:01:04,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 19:01:04,695 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 107 transitions. [2022-12-13 19:01:04,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-13 19:01:04,696 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:01:04,696 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:01:04,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 19:01:04,696 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 19:01:04,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:01:04,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1033231396, now seen corresponding path program 1 times [2022-12-13 19:01:04,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:01:04,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155310191] [2022-12-13 19:01:04,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:01:04,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:01:04,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:01:04,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 19:01:04,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:01:04,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:01:04,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:01:04,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155310191] [2022-12-13 19:01:04,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155310191] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:01:04,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:01:04,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 19:01:04,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458111919] [2022-12-13 19:01:04,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:01:04,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:01:04,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:01:04,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:01:04,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:01:04,746 INFO L87 Difference]: Start difference. First operand 75 states and 107 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 19:01:04,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:01:04,757 INFO L93 Difference]: Finished difference Result 128 states and 181 transitions. [2022-12-13 19:01:04,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:01:04,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-12-13 19:01:04,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:01:04,758 INFO L225 Difference]: With dead ends: 128 [2022-12-13 19:01:04,758 INFO L226 Difference]: Without dead ends: 63 [2022-12-13 19:01:04,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:01:04,760 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 1 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 19:01:04,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 170 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 19:01:04,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-12-13 19:01:04,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-12-13 19:01:04,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 44 states have (on average 1.4772727272727273) internal successors, (65), 59 states have internal predecessors, (65), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-13 19:01:04,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 87 transitions. [2022-12-13 19:01:04,765 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 87 transitions. Word has length 16 [2022-12-13 19:01:04,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:01:04,766 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 87 transitions. [2022-12-13 19:01:04,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 19:01:04,766 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 87 transitions. [2022-12-13 19:01:04,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-13 19:01:04,766 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:01:04,766 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] [2022-12-13 19:01:04,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 19:01:04,767 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 19:01:04,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:01:04,767 INFO L85 PathProgramCache]: Analyzing trace with hash 426041701, now seen corresponding path program 1 times [2022-12-13 19:01:04,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:01:04,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848068879] [2022-12-13 19:01:04,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:01:04,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:01:04,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:01:04,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 19:01:04,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:01:04,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:01:04,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:01:04,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848068879] [2022-12-13 19:01:04,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848068879] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:01:04,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:01:04,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 19:01:04,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279972169] [2022-12-13 19:01:04,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:01:04,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:01:04,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:01:04,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:01:04,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:01:04,806 INFO L87 Difference]: Start difference. First operand 63 states and 87 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 19:01:04,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:01:04,821 INFO L93 Difference]: Finished difference Result 114 states and 157 transitions. [2022-12-13 19:01:04,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:01:04,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-12-13 19:01:04,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:01:04,823 INFO L225 Difference]: With dead ends: 114 [2022-12-13 19:01:04,823 INFO L226 Difference]: Without dead ends: 63 [2022-12-13 19:01:04,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:01:04,825 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 3 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 19:01:04,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 161 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 19:01:04,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-12-13 19:01:04,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-12-13 19:01:04,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 58 states have internal predecessors, (64), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-13 19:01:04,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 86 transitions. [2022-12-13 19:01:04,835 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 86 transitions. Word has length 20 [2022-12-13 19:01:04,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:01:04,835 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 86 transitions. [2022-12-13 19:01:04,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 19:01:04,836 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 86 transitions. [2022-12-13 19:01:04,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-13 19:01:04,836 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:01:04,836 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:01:04,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 19:01:04,837 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 19:01:04,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:01:04,837 INFO L85 PathProgramCache]: Analyzing trace with hash 433245301, now seen corresponding path program 1 times [2022-12-13 19:01:04,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:01:04,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480493920] [2022-12-13 19:01:04,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:01:04,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:01:04,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:01:04,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 19:01:04,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:01:04,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 19:01:04,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:01:04,890 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 19:01:04,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:01:04,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480493920] [2022-12-13 19:01:04,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480493920] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:01:04,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:01:04,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 19:01:04,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937847037] [2022-12-13 19:01:04,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:01:04,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:01:04,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:01:04,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:01:04,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:01:04,893 INFO L87 Difference]: Start difference. First operand 63 states and 86 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 19:01:04,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:01:04,907 INFO L93 Difference]: Finished difference Result 114 states and 156 transitions. [2022-12-13 19:01:04,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:01:04,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-12-13 19:01:04,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:01:04,908 INFO L225 Difference]: With dead ends: 114 [2022-12-13 19:01:04,908 INFO L226 Difference]: Without dead ends: 62 [2022-12-13 19:01:04,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:01:04,911 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 19:01:04,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 160 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 19:01:04,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-12-13 19:01:04,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-12-13 19:01:04,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 57 states have internal predecessors, (63), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-12-13 19:01:04,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 83 transitions. [2022-12-13 19:01:04,920 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 83 transitions. Word has length 24 [2022-12-13 19:01:04,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:01:04,920 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 83 transitions. [2022-12-13 19:01:04,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 19:01:04,921 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 83 transitions. [2022-12-13 19:01:04,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-13 19:01:04,922 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:01:04,922 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:01:04,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 19:01:04,922 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 19:01:04,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:01:04,923 INFO L85 PathProgramCache]: Analyzing trace with hash 406206194, now seen corresponding path program 1 times [2022-12-13 19:01:04,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:01:04,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652488374] [2022-12-13 19:01:04,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:01:04,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:01:04,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:01:04,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 19:01:04,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:01:04,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 19:01:04,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:01:04,983 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 19:01:04,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:01:04,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652488374] [2022-12-13 19:01:04,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652488374] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:01:04,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:01:04,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 19:01:04,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565264987] [2022-12-13 19:01:04,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:01:04,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:01:04,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:01:04,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:01:04,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:01:04,985 INFO L87 Difference]: Start difference. First operand 62 states and 83 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 19:01:05,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:01:05,008 INFO L93 Difference]: Finished difference Result 135 states and 182 transitions. [2022-12-13 19:01:05,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:01:05,008 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2022-12-13 19:01:05,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:01:05,010 INFO L225 Difference]: With dead ends: 135 [2022-12-13 19:01:05,010 INFO L226 Difference]: Without dead ends: 96 [2022-12-13 19:01:05,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:01:05,011 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 33 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 19:01:05,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 160 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 19:01:05,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-12-13 19:01:05,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 66. [2022-12-13 19:01:05,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 61 states have internal predecessors, (68), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-12-13 19:01:05,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 88 transitions. [2022-12-13 19:01:05,020 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 88 transitions. Word has length 27 [2022-12-13 19:01:05,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:01:05,020 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 88 transitions. [2022-12-13 19:01:05,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 19:01:05,021 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 88 transitions. [2022-12-13 19:01:05,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-13 19:01:05,021 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:01:05,021 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-13 19:01:05,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 19:01:05,022 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 19:01:05,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:01:05,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1422376419, now seen corresponding path program 1 times [2022-12-13 19:01:05,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:01:05,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012849431] [2022-12-13 19:01:05,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:01:05,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:01:05,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:01:05,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 19:01:05,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:01:05,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 19:01:05,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:01:05,065 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 19:01:05,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:01:05,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012849431] [2022-12-13 19:01:05,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012849431] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:01:05,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:01:05,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 19:01:05,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426125281] [2022-12-13 19:01:05,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:01:05,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:01:05,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:01:05,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:01:05,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:01:05,068 INFO L87 Difference]: Start difference. First operand 66 states and 88 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 19:01:05,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:01:05,075 INFO L93 Difference]: Finished difference Result 103 states and 137 transitions. [2022-12-13 19:01:05,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:01:05,075 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2022-12-13 19:01:05,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:01:05,076 INFO L225 Difference]: With dead ends: 103 [2022-12-13 19:01:05,076 INFO L226 Difference]: Without dead ends: 55 [2022-12-13 19:01:05,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:01:05,078 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 1 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 19:01:05,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 136 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 19:01:05,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-12-13 19:01:05,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-12-13 19:01:05,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 50 states have internal predecessors, (54), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-12-13 19:01:05,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 70 transitions. [2022-12-13 19:01:05,084 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 70 transitions. Word has length 28 [2022-12-13 19:01:05,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:01:05,084 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 70 transitions. [2022-12-13 19:01:05,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 19:01:05,084 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-12-13 19:01:05,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-12-13 19:01:05,085 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:01:05,085 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-13 19:01:05,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 19:01:05,086 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 19:01:05,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:01:05,086 INFO L85 PathProgramCache]: Analyzing trace with hash 91290941, now seen corresponding path program 1 times [2022-12-13 19:01:05,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:01:05,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989245583] [2022-12-13 19:01:05,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:01:05,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:01:05,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:01:05,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 19:01:05,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:01:05,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 19:01:05,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:01:05,127 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 19:01:05,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:01:05,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989245583] [2022-12-13 19:01:05,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989245583] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:01:05,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:01:05,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 19:01:05,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703142169] [2022-12-13 19:01:05,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:01:05,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:01:05,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:01:05,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:01:05,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:01:05,129 INFO L87 Difference]: Start difference. First operand 55 states and 70 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 19:01:05,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:01:05,137 INFO L93 Difference]: Finished difference Result 89 states and 113 transitions. [2022-12-13 19:01:05,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:01:05,137 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2022-12-13 19:01:05,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:01:05,138 INFO L225 Difference]: With dead ends: 89 [2022-12-13 19:01:05,138 INFO L226 Difference]: Without dead ends: 53 [2022-12-13 19:01:05,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:01:05,139 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 3 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 19:01:05,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 122 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 19:01:05,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-12-13 19:01:05,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-12-13 19:01:05,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 40 states have (on average 1.275) internal successors, (51), 47 states have internal predecessors, (51), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-12-13 19:01:05,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2022-12-13 19:01:05,145 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 65 transitions. Word has length 33 [2022-12-13 19:01:05,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:01:05,145 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 65 transitions. [2022-12-13 19:01:05,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 19:01:05,146 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2022-12-13 19:01:05,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-13 19:01:05,147 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:01:05,147 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 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-12-13 19:01:05,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 19:01:05,147 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 19:01:05,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:01:05,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1997145350, now seen corresponding path program 1 times [2022-12-13 19:01:05,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:01:05,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016397617] [2022-12-13 19:01:05,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:01:05,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:01:05,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:01:05,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 19:01:05,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:01:05,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 19:01:05,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:01:05,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 19:01:05,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:01:05,203 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 19:01:05,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:01:05,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016397617] [2022-12-13 19:01:05,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016397617] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:01:05,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:01:05,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 19:01:05,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093944428] [2022-12-13 19:01:05,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:01:05,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:01:05,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:01:05,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:01:05,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:01:05,205 INFO L87 Difference]: Start difference. First operand 53 states and 65 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 19:01:05,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:01:05,217 INFO L93 Difference]: Finished difference Result 53 states and 65 transitions. [2022-12-13 19:01:05,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:01:05,218 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2022-12-13 19:01:05,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:01:05,219 INFO L225 Difference]: With dead ends: 53 [2022-12-13 19:01:05,219 INFO L226 Difference]: Without dead ends: 52 [2022-12-13 19:01:05,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:01:05,220 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 22 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 19:01:05,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 92 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 19:01:05,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-12-13 19:01:05,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-12-13 19:01:05,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 40 states have (on average 1.25) internal successors, (50), 46 states have internal predecessors, (50), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-12-13 19:01:05,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 64 transitions. [2022-12-13 19:01:05,225 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 64 transitions. Word has length 39 [2022-12-13 19:01:05,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:01:05,226 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 64 transitions. [2022-12-13 19:01:05,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 19:01:05,226 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 64 transitions. [2022-12-13 19:01:05,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-13 19:01:05,227 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:01:05,227 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 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-12-13 19:01:05,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 19:01:05,227 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 19:01:05,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:01:05,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1781963547, now seen corresponding path program 1 times [2022-12-13 19:01:05,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:01:05,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966875788] [2022-12-13 19:01:05,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:01:05,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:01:05,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:01:05,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 19:01:05,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:01:05,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 19:01:05,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:01:05,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 19:01:05,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:01:05,283 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 19:01:05,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:01:05,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966875788] [2022-12-13 19:01:05,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966875788] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:01:05,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:01:05,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 19:01:05,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861177833] [2022-12-13 19:01:05,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:01:05,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:01:05,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:01:05,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:01:05,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:01:05,285 INFO L87 Difference]: Start difference. First operand 52 states and 64 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 19:01:05,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:01:05,300 INFO L93 Difference]: Finished difference Result 89 states and 110 transitions. [2022-12-13 19:01:05,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:01:05,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2022-12-13 19:01:05,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:01:05,301 INFO L225 Difference]: With dead ends: 89 [2022-12-13 19:01:05,301 INFO L226 Difference]: Without dead ends: 72 [2022-12-13 19:01:05,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:01:05,302 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 16 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 19:01:05,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 121 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 19:01:05,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-12-13 19:01:05,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 57. [2022-12-13 19:01:05,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 51 states have internal predecessors, (56), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-12-13 19:01:05,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 70 transitions. [2022-12-13 19:01:05,308 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 70 transitions. Word has length 40 [2022-12-13 19:01:05,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:01:05,309 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 70 transitions. [2022-12-13 19:01:05,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 19:01:05,309 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2022-12-13 19:01:05,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-13 19:01:05,310 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:01:05,310 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 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-12-13 19:01:05,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 19:01:05,310 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 19:01:05,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:01:05,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1724705245, now seen corresponding path program 1 times [2022-12-13 19:01:05,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:01:05,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395197666] [2022-12-13 19:01:05,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:01:05,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:01:05,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:01:05,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 19:01:05,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:01:05,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 19:01:05,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:01:05,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 19:01:05,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:01:05,351 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 19:01:05,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:01:05,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395197666] [2022-12-13 19:01:05,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395197666] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:01:05,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:01:05,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 19:01:05,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597401673] [2022-12-13 19:01:05,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:01:05,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:01:05,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:01:05,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:01:05,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:01:05,353 INFO L87 Difference]: Start difference. First operand 57 states and 70 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 19:01:05,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:01:05,363 INFO L93 Difference]: Finished difference Result 85 states and 104 transitions. [2022-12-13 19:01:05,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:01:05,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2022-12-13 19:01:05,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:01:05,364 INFO L225 Difference]: With dead ends: 85 [2022-12-13 19:01:05,364 INFO L226 Difference]: Without dead ends: 57 [2022-12-13 19:01:05,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:01:05,365 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 1 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 19:01:05,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 119 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 19:01:05,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-12-13 19:01:05,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-12-13 19:01:05,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 50 states have internal predecessors, (55), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-12-13 19:01:05,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2022-12-13 19:01:05,371 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 40 [2022-12-13 19:01:05,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:01:05,371 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2022-12-13 19:01:05,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 19:01:05,371 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2022-12-13 19:01:05,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-12-13 19:01:05,372 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:01:05,372 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:01:05,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 19:01:05,373 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 19:01:05,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:01:05,373 INFO L85 PathProgramCache]: Analyzing trace with hash -149151084, now seen corresponding path program 1 times [2022-12-13 19:01:05,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:01:05,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157161261] [2022-12-13 19:01:05,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:01:05,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:01:05,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:01:05,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 19:01:05,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:01:05,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 19:01:05,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:01:05,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 19:01:05,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:01:05,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 19:01:05,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:01:05,421 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-13 19:01:05,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:01:05,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157161261] [2022-12-13 19:01:05,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157161261] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:01:05,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:01:05,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 19:01:05,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675789104] [2022-12-13 19:01:05,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:01:05,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:01:05,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:01:05,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:01:05,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:01:05,423 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 19:01:05,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:01:05,430 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2022-12-13 19:01:05,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:01:05,430 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 44 [2022-12-13 19:01:05,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:01:05,431 INFO L225 Difference]: With dead ends: 79 [2022-12-13 19:01:05,431 INFO L226 Difference]: Without dead ends: 50 [2022-12-13 19:01:05,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:01:05,432 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 19:01:05,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 19:01:05,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-12-13 19:01:05,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-12-13 19:01:05,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 40 states have (on average 1.15) internal successors, (46), 44 states have internal predecessors, (46), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 19:01:05,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2022-12-13 19:01:05,436 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 44 [2022-12-13 19:01:05,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:01:05,437 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2022-12-13 19:01:05,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 19:01:05,437 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2022-12-13 19:01:05,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-13 19:01:05,437 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:01:05,437 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 19:01:05,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 19:01:05,438 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 19:01:05,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:01:05,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1151157231, now seen corresponding path program 1 times [2022-12-13 19:01:05,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:01:05,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744300515] [2022-12-13 19:01:05,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:01:05,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:01:05,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:01:05,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 19:01:05,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:01:05,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 19:01:05,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:01:05,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 19:01:05,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:01:05,478 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 19:01:05,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:01:05,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744300515] [2022-12-13 19:01:05,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744300515] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:01:05,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:01:05,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 19:01:05,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971551441] [2022-12-13 19:01:05,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:01:05,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:01:05,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:01:05,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:01:05,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:01:05,480 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 19:01:05,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:01:05,486 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2022-12-13 19:01:05,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:01:05,487 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2022-12-13 19:01:05,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:01:05,487 INFO L225 Difference]: With dead ends: 66 [2022-12-13 19:01:05,487 INFO L226 Difference]: Without dead ends: 48 [2022-12-13 19:01:05,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:01:05,488 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 4 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 19:01:05,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 97 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 19:01:05,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-12-13 19:01:05,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-12-13 19:01:05,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 41 states have internal predecessors, (43), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 19:01:05,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2022-12-13 19:01:05,492 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 45 [2022-12-13 19:01:05,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:01:05,493 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2022-12-13 19:01:05,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 19:01:05,493 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2022-12-13 19:01:05,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-12-13 19:01:05,493 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:01:05,494 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 19:01:05,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 19:01:05,494 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 19:01:05,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:01:05,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1850334672, now seen corresponding path program 1 times [2022-12-13 19:01:05,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:01:05,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449988211] [2022-12-13 19:01:05,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:01:05,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:01:05,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:01:05,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 19:01:05,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:01:05,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 19:01:05,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:01:05,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 19:01:05,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:01:05,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 19:01:05,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:01:05,549 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 19:01:05,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:01:05,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449988211] [2022-12-13 19:01:05,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449988211] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:01:05,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:01:05,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 19:01:05,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147173989] [2022-12-13 19:01:05,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:01:05,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:01:05,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:01:05,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:01:05,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:01:05,551 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 19:01:05,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:01:05,557 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2022-12-13 19:01:05,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:01:05,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 51 [2022-12-13 19:01:05,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:01:05,558 INFO L225 Difference]: With dead ends: 48 [2022-12-13 19:01:05,558 INFO L226 Difference]: Without dead ends: 47 [2022-12-13 19:01:05,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:01:05,559 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 5 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 19:01:05,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 90 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 19:01:05,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-12-13 19:01:05,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-12-13 19:01:05,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 40 states have internal predecessors, (42), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 19:01:05,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2022-12-13 19:01:05,563 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 51 [2022-12-13 19:01:05,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:01:05,563 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2022-12-13 19:01:05,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 19:01:05,564 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2022-12-13 19:01:05,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-12-13 19:01:05,564 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:01:05,564 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 19:01:05,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 19:01:05,565 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 19:01:05,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:01:05,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1525799786, now seen corresponding path program 1 times [2022-12-13 19:01:05,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:01:05,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424988488] [2022-12-13 19:01:05,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:01:05,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:01:05,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:01:05,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 19:01:05,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:01:05,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 19:01:05,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:01:05,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 19:01:05,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:01:05,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 19:01:05,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:01:05,615 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 19:01:05,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:01:05,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424988488] [2022-12-13 19:01:05,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424988488] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:01:05,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:01:05,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 19:01:05,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127951728] [2022-12-13 19:01:05,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:01:05,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:01:05,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:01:05,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:01:05,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:01:05,616 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 19:01:05,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:01:05,624 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2022-12-13 19:01:05,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:01:05,625 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 52 [2022-12-13 19:01:05,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:01:05,625 INFO L225 Difference]: With dead ends: 53 [2022-12-13 19:01:05,625 INFO L226 Difference]: Without dead ends: 47 [2022-12-13 19:01:05,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:01:05,626 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 19:01:05,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 97 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 19:01:05,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-12-13 19:01:05,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-12-13 19:01:05,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 40 states have internal predecessors, (41), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 19:01:05,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2022-12-13 19:01:05,630 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 52 [2022-12-13 19:01:05,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:01:05,631 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2022-12-13 19:01:05,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 19:01:05,631 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-12-13 19:01:05,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-12-13 19:01:05,631 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:01:05,631 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 19:01:05,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 19:01:05,632 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 19:01:05,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:01:05,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1659734228, now seen corresponding path program 1 times [2022-12-13 19:01:05,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:01:05,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534380186] [2022-12-13 19:01:05,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:01:05,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:01:05,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:01:05,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 19:01:05,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:01:05,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 19:01:05,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:01:05,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 19:01:05,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:01:05,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 19:01:05,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:01:05,678 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 19:01:05,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:01:05,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534380186] [2022-12-13 19:01:05,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534380186] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:01:05,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:01:05,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 19:01:05,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465274757] [2022-12-13 19:01:05,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:01:05,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:01:05,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:01:05,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:01:05,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:01:05,680 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 19:01:05,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:01:05,683 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2022-12-13 19:01:05,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:01:05,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 53 [2022-12-13 19:01:05,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:01:05,683 INFO L225 Difference]: With dead ends: 51 [2022-12-13 19:01:05,683 INFO L226 Difference]: Without dead ends: 0 [2022-12-13 19:01:05,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:01:05,684 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 19:01:05,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 19:01:05,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-13 19:01:05,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-13 19:01:05,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:01:05,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-13 19:01:05,685 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 53 [2022-12-13 19:01:05,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:01:05,686 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-13 19:01:05,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 19:01:05,686 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-13 19:01:05,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-13 19:01:05,688 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-12-13 19:01:05,689 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-12-13 19:01:05,689 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-12-13 19:01:05,689 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-12-13 19:01:05,689 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-12-13 19:01:05,689 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-12-13 19:01:05,689 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-12-13 19:01:05,689 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-12-13 19:01:05,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 19:01:05,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-13 19:01:05,751 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1412 1418) the Hoare annotation is: true [2022-12-13 19:01:05,751 INFO L899 garLoopResultBuilder]: For program point printLineEXIT(lines 1412 1418) no Hoare annotation was computed. [2022-12-13 19:01:05,752 INFO L899 garLoopResultBuilder]: For program point L1414(lines 1414 1417) no Hoare annotation was computed. [2022-12-13 19:01:05,752 INFO L899 garLoopResultBuilder]: For program point L1414-2(lines 1412 1418) no Hoare annotation was computed. [2022-12-13 19:01:05,752 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1426 1429) the Hoare annotation is: true [2022-12-13 19:01:05,752 INFO L899 garLoopResultBuilder]: For program point printIntLineEXIT(lines 1426 1429) no Hoare annotation was computed. [2022-12-13 19:01:05,752 INFO L899 garLoopResultBuilder]: For program point printIntLineFINAL(lines 1426 1429) no Hoare annotation was computed. [2022-12-13 19:01:05,752 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1602) no Hoare annotation was computed. [2022-12-13 19:01:05,752 INFO L902 garLoopResultBuilder]: At program point L1662(line 1662) the Hoare annotation is: true [2022-12-13 19:01:05,752 INFO L895 garLoopResultBuilder]: At program point L1629(lines 1629 1641) the Hoare annotation is: (and |ULTIMATE.start_goodG2B1_#t~switch97#1| (<= 0 (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|))) [2022-12-13 19:01:05,753 INFO L899 garLoopResultBuilder]: For program point L1563(line 1563) no Hoare annotation was computed. [2022-12-13 19:01:05,753 INFO L899 garLoopResultBuilder]: For program point L1588(line 1588) no Hoare annotation was computed. [2022-12-13 19:01:05,753 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 1677 1684) the Hoare annotation is: true [2022-12-13 19:01:05,753 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1661) no Hoare annotation was computed. [2022-12-13 19:01:05,753 INFO L899 garLoopResultBuilder]: For program point L1638(line 1638) no Hoare annotation was computed. [2022-12-13 19:01:05,753 INFO L895 garLoopResultBuilder]: At program point L1572(line 1572) the Hoare annotation is: false [2022-12-13 19:01:05,753 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1571) no Hoare annotation was computed. [2022-12-13 19:01:05,753 INFO L899 garLoopResultBuilder]: For program point L1597(line 1597) no Hoare annotation was computed. [2022-12-13 19:01:05,753 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-12-13 19:01:05,754 INFO L895 garLoopResultBuilder]: At program point L1564(line 1564) the Hoare annotation is: false [2022-12-13 19:01:05,754 INFO L899 garLoopResultBuilder]: For program point L1622(line 1622) no Hoare annotation was computed. [2022-12-13 19:01:05,754 INFO L902 garLoopResultBuilder]: At program point L1680(line 1680) the Hoare annotation is: true [2022-12-13 19:01:05,754 INFO L899 garLoopResultBuilder]: For program point L1680-1(line 1680) no Hoare annotation was computed. [2022-12-13 19:01:05,754 INFO L895 garLoopResultBuilder]: At program point L1647(lines 1647 1655) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_goodG2B2_~data~3#1| 2))) (and (<= 0 .cse0) (<= .cse0 0) (<= 0 (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|)))) [2022-12-13 19:01:05,754 INFO L899 garLoopResultBuilder]: For program point L1548(lines 1548 1581) no Hoare annotation was computed. [2022-12-13 19:01:05,754 INFO L895 garLoopResultBuilder]: At program point L1639(line 1639) the Hoare annotation is: false [2022-12-13 19:01:05,754 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1571) no Hoare annotation was computed. [2022-12-13 19:01:05,754 INFO L899 garLoopResultBuilder]: For program point L1631(line 1631) no Hoare annotation was computed. [2022-12-13 19:01:05,755 INFO L899 garLoopResultBuilder]: For program point L1598(lines 1598 1609) no Hoare annotation was computed. [2022-12-13 19:01:05,755 INFO L902 garLoopResultBuilder]: At program point L1656(lines 1656 1668) the Hoare annotation is: true [2022-12-13 19:01:05,755 INFO L895 garLoopResultBuilder]: At program point L1623(line 1623) the Hoare annotation is: false [2022-12-13 19:01:05,755 INFO L899 garLoopResultBuilder]: For program point L1557(line 1557) no Hoare annotation was computed. [2022-12-13 19:01:05,755 INFO L899 garLoopResultBuilder]: For program point L1582(lines 1582 1615) no Hoare annotation was computed. [2022-12-13 19:01:05,755 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2022-12-13 19:01:05,755 INFO L895 garLoopResultBuilder]: At program point L1607(line 1607) the Hoare annotation is: |ULTIMATE.start_goodB2G2_#t~switch95#1| [2022-12-13 19:01:05,755 INFO L899 garLoopResultBuilder]: For program point L1665(line 1665) no Hoare annotation was computed. [2022-12-13 19:01:05,755 INFO L899 garLoopResultBuilder]: For program point L1632(lines 1632 1636) no Hoare annotation was computed. [2022-12-13 19:01:05,755 INFO L899 garLoopResultBuilder]: For program point L1566(line 1566) no Hoare annotation was computed. [2022-12-13 19:01:05,755 INFO L899 garLoopResultBuilder]: For program point L1591(line 1591) no Hoare annotation was computed. [2022-12-13 19:01:05,756 INFO L895 garLoopResultBuilder]: At program point L1558(line 1558) the Hoare annotation is: false [2022-12-13 19:01:05,756 INFO L902 garLoopResultBuilder]: At program point L1682(line 1682) the Hoare annotation is: true [2022-12-13 19:01:05,756 INFO L899 garLoopResultBuilder]: For program point L1649(line 1649) no Hoare annotation was computed. [2022-12-13 19:01:05,756 INFO L899 garLoopResultBuilder]: For program point L1682-1(line 1682) no Hoare annotation was computed. [2022-12-13 19:01:05,756 INFO L899 garLoopResultBuilder]: For program point L1616(lines 1616 1642) no Hoare annotation was computed. [2022-12-13 19:01:05,756 INFO L902 garLoopResultBuilder]: At program point L1666(line 1666) the Hoare annotation is: true [2022-12-13 19:01:05,756 INFO L899 garLoopResultBuilder]: For program point L1600(lines 1600 1608) no Hoare annotation was computed. [2022-12-13 19:01:05,756 INFO L899 garLoopResultBuilder]: For program point L1567(lines 1567 1578) no Hoare annotation was computed. [2022-12-13 19:01:05,756 INFO L899 garLoopResultBuilder]: For program point L1658(line 1658) no Hoare annotation was computed. [2022-12-13 19:01:05,756 INFO L899 garLoopResultBuilder]: For program point L1625(line 1625) no Hoare annotation was computed. [2022-12-13 19:01:05,756 INFO L895 garLoopResultBuilder]: At program point L1592(line 1592) the Hoare annotation is: false [2022-12-13 19:01:05,757 INFO L895 garLoopResultBuilder]: At program point L1576(line 1576) the Hoare annotation is: |ULTIMATE.start_goodB2G1_#t~switch93#1| [2022-12-13 19:01:05,757 INFO L899 garLoopResultBuilder]: For program point L1634(line 1634) no Hoare annotation was computed. [2022-12-13 19:01:05,757 INFO L899 garLoopResultBuilder]: For program point L1634-1(line 1634) no Hoare annotation was computed. [2022-12-13 19:01:05,757 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-12-13 19:01:05,757 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1634) no Hoare annotation was computed. [2022-12-13 19:01:05,757 INFO L899 garLoopResultBuilder]: For program point L1659(lines 1659 1663) no Hoare annotation was computed. [2022-12-13 19:01:05,757 INFO L895 garLoopResultBuilder]: At program point L1552(lines 1552 1560) the Hoare annotation is: (and |ULTIMATE.start_goodB2G1_#t~switch92#1| (<= (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648) 0)) [2022-12-13 19:01:05,757 INFO L899 garLoopResultBuilder]: For program point L1643(lines 1643 1669) no Hoare annotation was computed. [2022-12-13 19:01:05,757 INFO L895 garLoopResultBuilder]: At program point L1635(line 1635) the Hoare annotation is: (and |ULTIMATE.start_goodG2B1_#t~switch97#1| (<= 0 (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|))) [2022-12-13 19:01:05,758 INFO L899 garLoopResultBuilder]: For program point L1602(line 1602) no Hoare annotation was computed. [2022-12-13 19:01:05,758 INFO L899 garLoopResultBuilder]: For program point L1569(lines 1569 1577) no Hoare annotation was computed. [2022-12-13 19:01:05,758 INFO L899 garLoopResultBuilder]: For program point L1602-1(line 1602) no Hoare annotation was computed. [2022-12-13 19:01:05,758 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-13 19:01:05,758 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1634) no Hoare annotation was computed. [2022-12-13 19:01:05,758 INFO L895 garLoopResultBuilder]: At program point L1561(lines 1561 1580) the Hoare annotation is: |ULTIMATE.start_goodB2G1_#t~switch93#1| [2022-12-13 19:01:05,758 INFO L899 garLoopResultBuilder]: For program point L1652(line 1652) no Hoare annotation was computed. [2022-12-13 19:01:05,758 INFO L895 garLoopResultBuilder]: At program point L1586(lines 1586 1594) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch94#1| (<= (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648) 0)) [2022-12-13 19:01:05,758 INFO L899 garLoopResultBuilder]: For program point L1611(line 1611) no Hoare annotation was computed. [2022-12-13 19:01:05,759 INFO L895 garLoopResultBuilder]: At program point L1603(line 1603) the Hoare annotation is: false [2022-12-13 19:01:05,759 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1602) no Hoare annotation was computed. [2022-12-13 19:01:05,759 INFO L899 garLoopResultBuilder]: For program point L1661(line 1661) no Hoare annotation was computed. [2022-12-13 19:01:05,759 INFO L899 garLoopResultBuilder]: For program point L1661-1(line 1661) no Hoare annotation was computed. [2022-12-13 19:01:05,759 INFO L895 garLoopResultBuilder]: At program point L1595(lines 1595 1614) the Hoare annotation is: |ULTIMATE.start_goodB2G2_#t~switch95#1| [2022-12-13 19:01:05,759 INFO L895 garLoopResultBuilder]: At program point L1653(line 1653) the Hoare annotation is: false [2022-12-13 19:01:05,759 INFO L895 garLoopResultBuilder]: At program point L1620(lines 1620 1628) the Hoare annotation is: (let ((.cse0 (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|))) (and |ULTIMATE.start_goodG2B1_#t~switch96#1| (<= .cse0 0) (<= 0 .cse0))) [2022-12-13 19:01:05,759 INFO L899 garLoopResultBuilder]: For program point L1554(line 1554) no Hoare annotation was computed. [2022-12-13 19:01:05,760 INFO L895 garLoopResultBuilder]: At program point L1612(line 1612) the Hoare annotation is: false [2022-12-13 19:01:05,760 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1661) no Hoare annotation was computed. [2022-12-13 19:01:05,760 INFO L899 garLoopResultBuilder]: For program point L1670(lines 1670 1676) no Hoare annotation was computed. [2022-12-13 19:01:05,760 INFO L899 garLoopResultBuilder]: For program point L1571(line 1571) no Hoare annotation was computed. [2022-12-13 19:01:05,760 INFO L899 garLoopResultBuilder]: For program point L1571-1(line 1571) no Hoare annotation was computed. [2022-12-13 19:01:05,763 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:01:05,765 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 19:01:05,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 07:01:05 BoogieIcfgContainer [2022-12-13 19:01:05,781 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 19:01:05,781 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 19:01:05,781 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 19:01:05,782 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 19:01:05,782 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:01:04" (3/4) ... [2022-12-13 19:01:05,785 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-13 19:01:05,795 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2022-12-13 19:01:05,795 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2022-12-13 19:01:05,799 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2022-12-13 19:01:05,799 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-12-13 19:01:05,799 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-12-13 19:01:05,799 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-13 19:01:05,799 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-13 19:01:05,834 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42dedb30-828d-42b9-b1ce-097026e876e8/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 19:01:05,834 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 19:01:05,834 INFO L158 Benchmark]: Toolchain (without parser) took 2912.62ms. Allocated memory is still 182.5MB. Free memory was 150.8MB in the beginning and 147.4MB in the end (delta: 3.4MB). Peak memory consumption was 104.8MB. Max. memory is 16.1GB. [2022-12-13 19:01:05,835 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 107.0MB. Free memory is still 72.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 19:01:05,835 INFO L158 Benchmark]: CACSL2BoogieTranslator took 882.00ms. Allocated memory is still 182.5MB. Free memory was 150.8MB in the beginning and 86.5MB in the end (delta: 64.3MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. [2022-12-13 19:01:05,835 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.66ms. Allocated memory is still 182.5MB. Free memory was 86.5MB in the beginning and 83.0MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 19:01:05,835 INFO L158 Benchmark]: Boogie Preprocessor took 19.15ms. Allocated memory is still 182.5MB. Free memory was 83.0MB in the beginning and 81.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 19:01:05,835 INFO L158 Benchmark]: RCFGBuilder took 359.52ms. Allocated memory is still 182.5MB. Free memory was 81.6MB in the beginning and 65.5MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-13 19:01:05,836 INFO L158 Benchmark]: TraceAbstraction took 1544.02ms. Allocated memory is still 182.5MB. Free memory was 64.8MB in the beginning and 50.2MB in the end (delta: 14.6MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. [2022-12-13 19:01:05,836 INFO L158 Benchmark]: Witness Printer took 52.90ms. Allocated memory is still 182.5MB. Free memory was 50.2MB in the beginning and 147.4MB in the end (delta: -97.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 19:01:05,837 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.15ms. Allocated memory is still 107.0MB. Free memory is still 72.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 882.00ms. Allocated memory is still 182.5MB. Free memory was 150.8MB in the beginning and 86.5MB in the end (delta: 64.3MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.66ms. Allocated memory is still 182.5MB. Free memory was 86.5MB in the beginning and 83.0MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.15ms. Allocated memory is still 182.5MB. Free memory was 83.0MB in the beginning and 81.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 359.52ms. Allocated memory is still 182.5MB. Free memory was 81.6MB in the beginning and 65.5MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1544.02ms. Allocated memory is still 182.5MB. Free memory was 64.8MB in the beginning and 50.2MB in the end (delta: 14.6MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. * Witness Printer took 52.90ms. Allocated memory is still 182.5MB. Free memory was 50.2MB in the beginning and 147.4MB in the end (delta: -97.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1571]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1571]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1602]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1602]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1634]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1634]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1661]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1661]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 81 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 15, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 183 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 151 mSDsluCounter, 1952 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 917 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 71 IncrementalHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 1035 mSDtfsCounter, 71 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 119 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=0, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 91 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 27 LocationsWithAnnotation, 105 PreInvPairs, 125 NumberOfFragments, 77 HoareAnnotationTreeSize, 105 FomulaSimplifications, 36 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 27 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 527 NumberOfCodeBlocks, 527 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 512 ConstructedInterpolants, 0 QuantifiedInterpolants, 622 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 124/124 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 - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 1595]: Loop Invariant Derived loop invariant: NULL - InvariantResult [Line: 1656]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1629]: Loop Invariant Derived loop invariant: aux-switch(7) { case 7: if(data < 0) { int result = data * 2; printIntLine(result); } break; default: printLine("Benign, fixed string"); break; }-aux && 0 <= 2 + data - InvariantResult [Line: 1677]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1561]: Loop Invariant Derived loop invariant: NULL - InvariantResult [Line: 1552]: Loop Invariant Derived loop invariant: aux-switch(6) { case 6: data = (-0x7fffffff - 1); break; default: printLine("Benign, fixed string"); break; }-aux && data + 2147483648 <= 0 - InvariantResult [Line: 1586]: Loop Invariant Derived loop invariant: aux-switch(6) { case 6: data = (-0x7fffffff - 1); break; default: printLine("Benign, fixed string"); break; }-aux && data + 2147483648 <= 0 - InvariantResult [Line: 1620]: Loop Invariant Derived loop invariant: (aux-switch(5) { case 6: printLine("Benign, fixed string"); break; default: data = -2; break; }-aux && 2 + data <= 0) && 0 <= 2 + data - InvariantResult [Line: 1647]: Loop Invariant Derived loop invariant: (0 <= data + 2 && data + 2 <= 0) && 0 <= 2 + data RESULT: Ultimate proved your program to be correct! [2022-12-13 19:01:05,852 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42dedb30-828d-42b9-b1ce-097026e876e8/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE