./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_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_35b59bcf-d706-434c-87f4-bfbd602fc43e/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b59bcf-d706-434c-87f4-bfbd602fc43e/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_35b59bcf-d706-434c-87f4-bfbd602fc43e/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b59bcf-d706-434c-87f4-bfbd602fc43e/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_multiply_15_good.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b59bcf-d706-434c-87f4-bfbd602fc43e/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_35b59bcf-d706-434c-87f4-bfbd602fc43e/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 f866e88c723a0d278811cf67ea20623190aee0ecc7d8411898ae16553e842654 --- 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 18:31:09,974 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 18:31:09,975 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 18:31:09,993 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 18:31:09,993 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 18:31:09,994 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 18:31:09,995 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 18:31:09,997 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 18:31:09,998 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 18:31:09,999 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 18:31:10,000 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 18:31:10,001 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 18:31:10,001 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 18:31:10,002 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 18:31:10,003 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 18:31:10,004 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 18:31:10,005 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 18:31:10,006 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 18:31:10,008 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 18:31:10,010 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 18:31:10,011 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 18:31:10,012 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 18:31:10,013 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 18:31:10,014 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 18:31:10,017 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 18:31:10,017 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 18:31:10,018 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 18:31:10,019 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 18:31:10,019 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 18:31:10,020 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 18:31:10,020 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 18:31:10,021 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 18:31:10,021 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 18:31:10,022 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 18:31:10,023 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 18:31:10,023 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 18:31:10,024 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 18:31:10,024 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 18:31:10,024 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 18:31:10,025 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 18:31:10,026 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 18:31:10,026 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b59bcf-d706-434c-87f4-bfbd602fc43e/bin/uautomizer-uyxdKDjOR8/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-12-13 18:31:10,046 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 18:31:10,046 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 18:31:10,046 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 18:31:10,046 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 18:31:10,047 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 18:31:10,047 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 18:31:10,048 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 18:31:10,048 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 18:31:10,048 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 18:31:10,048 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 18:31:10,048 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 18:31:10,048 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 18:31:10,049 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 18:31:10,049 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 18:31:10,049 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 18:31:10,049 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 18:31:10,049 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-12-13 18:31:10,049 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 18:31:10,050 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 18:31:10,050 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 18:31:10,050 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 18:31:10,050 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 18:31:10,050 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 18:31:10,050 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 18:31:10,051 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 18:31:10,051 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 18:31:10,051 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 18:31:10,051 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 18:31:10,051 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 18:31:10,051 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 18:31:10,052 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 18:31:10,052 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 18:31:10,052 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 18:31:10,052 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 18:31:10,052 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_35b59bcf-d706-434c-87f4-bfbd602fc43e/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_35b59bcf-d706-434c-87f4-bfbd602fc43e/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 -> f866e88c723a0d278811cf67ea20623190aee0ecc7d8411898ae16553e842654 [2022-12-13 18:31:10,233 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 18:31:10,253 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 18:31:10,255 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 18:31:10,256 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 18:31:10,256 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 18:31:10,257 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b59bcf-d706-434c-87f4-bfbd602fc43e/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_multiply_15_good.i [2022-12-13 18:31:12,765 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 18:31:12,994 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 18:31:12,995 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b59bcf-d706-434c-87f4-bfbd602fc43e/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_multiply_15_good.i [2022-12-13 18:31:13,007 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b59bcf-d706-434c-87f4-bfbd602fc43e/bin/uautomizer-uyxdKDjOR8/data/59b477aa8/282c9d2bd3a14a2bb7c040927206f33b/FLAGb4216d6b0 [2022-12-13 18:31:13,361 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b59bcf-d706-434c-87f4-bfbd602fc43e/bin/uautomizer-uyxdKDjOR8/data/59b477aa8/282c9d2bd3a14a2bb7c040927206f33b [2022-12-13 18:31:13,366 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 18:31:13,367 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 18:31:13,369 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 18:31:13,369 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 18:31:13,374 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 18:31:13,374 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:31:13" (1/1) ... [2022-12-13 18:31:13,375 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7859fbab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:31:13, skipping insertion in model container [2022-12-13 18:31:13,376 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:31:13" (1/1) ... [2022-12-13 18:31:13,383 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 18:31:13,417 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 18:31:13,644 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-13 18:31:13,939 WARN L623 FunctionHandler]: Unknown extern function puts [2022-12-13 18:31:13,943 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-12-13 18:31:13,944 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-12-13 18:31:13,946 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-12-13 18:31:13,947 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-12-13 18:31:13,975 WARN L623 FunctionHandler]: Unknown extern function time [2022-12-13 18:31:13,976 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 18:31:13,983 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 18:31:13,996 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-13 18:31:14,030 WARN L623 FunctionHandler]: Unknown extern function puts [2022-12-13 18:31:14,032 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-12-13 18:31:14,032 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-12-13 18:31:14,034 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-12-13 18:31:14,035 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-12-13 18:31:14,042 WARN L623 FunctionHandler]: Unknown extern function time [2022-12-13 18:31:14,043 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 18:31:14,144 INFO L208 MainTranslator]: Completed translation [2022-12-13 18:31:14,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:31:14 WrapperNode [2022-12-13 18:31:14,144 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 18:31:14,145 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 18:31:14,145 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 18:31:14,145 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 18:31:14,152 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:31:14" (1/1) ... [2022-12-13 18:31:14,171 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:31:14" (1/1) ... [2022-12-13 18:31:14,194 INFO L138 Inliner]: procedures = 503, calls = 95, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 173 [2022-12-13 18:31:14,195 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 18:31:14,195 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 18:31:14,196 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 18:31:14,196 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 18:31:14,202 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:31:14" (1/1) ... [2022-12-13 18:31:14,202 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:31:14" (1/1) ... [2022-12-13 18:31:14,204 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:31:14" (1/1) ... [2022-12-13 18:31:14,205 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:31:14" (1/1) ... [2022-12-13 18:31:14,209 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:31:14" (1/1) ... [2022-12-13 18:31:14,210 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:31:14" (1/1) ... [2022-12-13 18:31:14,212 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:31:14" (1/1) ... [2022-12-13 18:31:14,212 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:31:14" (1/1) ... [2022-12-13 18:31:14,214 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 18:31:14,215 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 18:31:14,215 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 18:31:14,215 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 18:31:14,215 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:31:14" (1/1) ... [2022-12-13 18:31:14,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 18:31:14,229 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b59bcf-d706-434c-87f4-bfbd602fc43e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:31:14,238 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b59bcf-d706-434c-87f4-bfbd602fc43e/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 18:31:14,240 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b59bcf-d706-434c-87f4-bfbd602fc43e/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 18:31:14,271 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2022-12-13 18:31:14,272 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2022-12-13 18:31:14,272 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2022-12-13 18:31:14,272 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2022-12-13 18:31:14,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 18:31:14,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 18:31:14,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 18:31:14,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 18:31:14,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 18:31:14,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 18:31:14,272 INFO L130 BoogieDeclarations]: Found specification of procedure time [2022-12-13 18:31:14,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 18:31:14,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 18:31:14,381 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 18:31:14,383 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 18:31:14,556 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 18:31:14,562 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 18:31:14,562 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 18:31:14,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:31:14 BoogieIcfgContainer [2022-12-13 18:31:14,564 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 18:31:14,565 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 18:31:14,565 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 18:31:14,568 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 18:31:14,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 06:31:13" (1/3) ... [2022-12-13 18:31:14,568 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47d72b0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:31:14, skipping insertion in model container [2022-12-13 18:31:14,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:31:14" (2/3) ... [2022-12-13 18:31:14,569 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47d72b0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:31:14, skipping insertion in model container [2022-12-13 18:31:14,569 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:31:14" (3/3) ... [2022-12-13 18:31:14,570 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_fscanf_multiply_15_good.i [2022-12-13 18:31:14,583 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 18:31:14,583 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-12-13 18:31:14,618 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 18:31:14,623 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;@48dc0d96, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 18:31:14,623 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-12-13 18:31:14,626 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 18:31:14,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-13 18:31:14,632 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:31:14,632 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:31:14,633 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 18:31:14,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:31:14,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1923445095, now seen corresponding path program 1 times [2022-12-13 18:31:14,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:31:14,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748252453] [2022-12-13 18:31:14,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:31:14,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:31:14,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:31:15,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:31:15,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:31:15,019 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 18:31:15,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:31:15,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748252453] [2022-12-13 18:31:15,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748252453] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:31:15,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:31:15,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 18:31:15,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846096863] [2022-12-13 18:31:15,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:31:15,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 18:31:15,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:31:15,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 18:31:15,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 18:31:15,050 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 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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 18:31:15,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:31:15,108 INFO L93 Difference]: Finished difference Result 81 states and 117 transitions. [2022-12-13 18:31:15,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 18:31:15,110 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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 18:31:15,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:31:15,120 INFO L225 Difference]: With dead ends: 81 [2022-12-13 18:31:15,120 INFO L226 Difference]: Without dead ends: 69 [2022-12-13 18:31:15,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 18:31:15,125 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 2 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:31:15,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 321 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:31:15,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-12-13 18:31:15,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-12-13 18:31:15,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 47 states have (on average 1.553191489361702) internal successors, (73), 65 states have internal predecessors, (73), 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 18:31:15,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 99 transitions. [2022-12-13 18:31:15,158 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 99 transitions. Word has length 15 [2022-12-13 18:31:15,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:31:15,159 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 99 transitions. [2022-12-13 18:31:15,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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 18:31:15,160 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 99 transitions. [2022-12-13 18:31:15,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-13 18:31:15,161 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:31:15,161 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:31:15,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 18:31:15,161 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 18:31:15,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:31:15,162 INFO L85 PathProgramCache]: Analyzing trace with hash -502744123, now seen corresponding path program 1 times [2022-12-13 18:31:15,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:31:15,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261281007] [2022-12-13 18:31:15,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:31:15,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:31:15,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:31:15,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:31:15,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:31:15,268 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 18:31:15,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:31:15,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261281007] [2022-12-13 18:31:15,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261281007] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:31:15,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:31:15,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 18:31:15,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375527132] [2022-12-13 18:31:15,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:31:15,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 18:31:15,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:31:15,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 18:31:15,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 18:31:15,271 INFO L87 Difference]: Start difference. First operand 69 states and 99 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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 18:31:15,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:31:15,335 INFO L93 Difference]: Finished difference Result 70 states and 100 transitions. [2022-12-13 18:31:15,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 18:31:15,336 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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 18:31:15,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:31:15,338 INFO L225 Difference]: With dead ends: 70 [2022-12-13 18:31:15,338 INFO L226 Difference]: Without dead ends: 69 [2022-12-13 18:31:15,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 18:31:15,340 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 4 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:31:15,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 342 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:31:15,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-12-13 18:31:15,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2022-12-13 18:31:15,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 47 states have (on average 1.5319148936170213) internal successors, (72), 64 states have internal predecessors, (72), 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 18:31:15,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 98 transitions. [2022-12-13 18:31:15,348 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 98 transitions. Word has length 16 [2022-12-13 18:31:15,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:31:15,349 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 98 transitions. [2022-12-13 18:31:15,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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 18:31:15,349 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 98 transitions. [2022-12-13 18:31:15,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-13 18:31:15,350 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:31:15,350 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 18:31:15,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 18:31:15,350 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 18:31:15,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:31:15,351 INFO L85 PathProgramCache]: Analyzing trace with hash 426041701, now seen corresponding path program 1 times [2022-12-13 18:31:15,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:31:15,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597028346] [2022-12-13 18:31:15,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:31:15,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:31:15,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:31:15,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:31:15,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:31:15,398 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 18:31:15,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:31:15,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597028346] [2022-12-13 18:31:15,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597028346] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:31:15,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:31:15,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 18:31:15,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089089803] [2022-12-13 18:31:15,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:31:15,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:31:15,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:31:15,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:31:15,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:31:15,400 INFO L87 Difference]: Start difference. First operand 68 states and 98 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 18:31:15,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:31:15,416 INFO L93 Difference]: Finished difference Result 119 states and 168 transitions. [2022-12-13 18:31:15,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:31:15,416 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 18:31:15,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:31:15,417 INFO L225 Difference]: With dead ends: 119 [2022-12-13 18:31:15,417 INFO L226 Difference]: Without dead ends: 68 [2022-12-13 18:31:15,418 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 18:31:15,418 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 7 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 178 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 18:31:15,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 178 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:31:15,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-12-13 18:31:15,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-12-13 18:31:15,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 47 states have (on average 1.5106382978723405) internal successors, (71), 64 states have internal predecessors, (71), 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 18:31:15,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 97 transitions. [2022-12-13 18:31:15,425 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 97 transitions. Word has length 20 [2022-12-13 18:31:15,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:31:15,426 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 97 transitions. [2022-12-13 18:31:15,426 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 18:31:15,426 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 97 transitions. [2022-12-13 18:31:15,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-13 18:31:15,426 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:31:15,427 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:31:15,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 18:31:15,427 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 18:31:15,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:31:15,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1737287324, now seen corresponding path program 1 times [2022-12-13 18:31:15,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:31:15,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367964075] [2022-12-13 18:31:15,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:31:15,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:31:15,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:31:15,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:31:15,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:31:15,510 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 18:31:15,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:31:15,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367964075] [2022-12-13 18:31:15,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367964075] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:31:15,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:31:15,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 18:31:15,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283617007] [2022-12-13 18:31:15,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:31:15,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 18:31:15,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:31:15,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 18:31:15,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 18:31:15,512 INFO L87 Difference]: Start difference. First operand 68 states and 97 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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 18:31:15,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:31:15,555 INFO L93 Difference]: Finished difference Result 68 states and 97 transitions. [2022-12-13 18:31:15,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 18:31:15,556 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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 21 [2022-12-13 18:31:15,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:31:15,557 INFO L225 Difference]: With dead ends: 68 [2022-12-13 18:31:15,557 INFO L226 Difference]: Without dead ends: 67 [2022-12-13 18:31:15,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 18:31:15,558 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 2 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:31:15,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 335 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:31:15,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-12-13 18:31:15,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-12-13 18:31:15,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 63 states have internal predecessors, (70), 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 18:31:15,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 96 transitions. [2022-12-13 18:31:15,566 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 96 transitions. Word has length 21 [2022-12-13 18:31:15,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:31:15,566 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 96 transitions. [2022-12-13 18:31:15,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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 18:31:15,567 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 96 transitions. [2022-12-13 18:31:15,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-13 18:31:15,568 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:31:15,568 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:31:15,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 18:31:15,568 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 18:31:15,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:31:15,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1978667920, now seen corresponding path program 1 times [2022-12-13 18:31:15,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:31:15,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930170133] [2022-12-13 18:31:15,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:31:15,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:31:15,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:31:15,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:31:15,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:31:15,640 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 18:31:15,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:31:15,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930170133] [2022-12-13 18:31:15,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930170133] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:31:15,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:31:15,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 18:31:15,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491437222] [2022-12-13 18:31:15,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:31:15,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 18:31:15,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:31:15,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 18:31:15,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 18:31:15,642 INFO L87 Difference]: Start difference. First operand 67 states and 96 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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 18:31:15,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:31:15,691 INFO L93 Difference]: Finished difference Result 68 states and 97 transitions. [2022-12-13 18:31:15,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 18:31:15,692 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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 22 [2022-12-13 18:31:15,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:31:15,693 INFO L225 Difference]: With dead ends: 68 [2022-12-13 18:31:15,693 INFO L226 Difference]: Without dead ends: 67 [2022-12-13 18:31:15,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 18:31:15,694 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 4 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:31:15,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 330 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:31:15,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-12-13 18:31:15,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2022-12-13 18:31:15,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 62 states have internal predecessors, (69), 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 18:31:15,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 95 transitions. [2022-12-13 18:31:15,701 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 95 transitions. Word has length 22 [2022-12-13 18:31:15,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:31:15,702 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 95 transitions. [2022-12-13 18:31:15,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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 18:31:15,702 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 95 transitions. [2022-12-13 18:31:15,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-13 18:31:15,703 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:31:15,703 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:31:15,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 18:31:15,703 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 18:31:15,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:31:15,704 INFO L85 PathProgramCache]: Analyzing trace with hash 931316271, now seen corresponding path program 1 times [2022-12-13 18:31:15,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:31:15,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626420470] [2022-12-13 18:31:15,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:31:15,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:31:15,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:31:15,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:31:15,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:31:15,760 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 18:31:15,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:31:15,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626420470] [2022-12-13 18:31:15,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626420470] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:31:15,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:31:15,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 18:31:15,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361845297] [2022-12-13 18:31:15,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:31:15,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:31:15,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:31:15,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:31:15,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:31:15,762 INFO L87 Difference]: Start difference. First operand 66 states and 95 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 18:31:15,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:31:15,772 INFO L93 Difference]: Finished difference Result 100 states and 138 transitions. [2022-12-13 18:31:15,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:31:15,772 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 27 [2022-12-13 18:31:15,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:31:15,773 INFO L225 Difference]: With dead ends: 100 [2022-12-13 18:31:15,773 INFO L226 Difference]: Without dead ends: 64 [2022-12-13 18:31:15,774 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 18:31:15,774 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 7 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 167 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 18:31:15,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 167 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:31:15,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-12-13 18:31:15,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-12-13 18:31:15,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 46 states have (on average 1.434782608695652) internal successors, (66), 60 states have internal predecessors, (66), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) [2022-12-13 18:31:15,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 90 transitions. [2022-12-13 18:31:15,781 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 90 transitions. Word has length 27 [2022-12-13 18:31:15,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:31:15,781 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 90 transitions. [2022-12-13 18:31:15,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 18:31:15,782 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 90 transitions. [2022-12-13 18:31:15,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-13 18:31:15,782 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:31:15,783 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:31:15,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 18:31:15,783 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 18:31:15,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:31:15,783 INFO L85 PathProgramCache]: Analyzing trace with hash -346159942, now seen corresponding path program 1 times [2022-12-13 18:31:15,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:31:15,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285357597] [2022-12-13 18:31:15,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:31:15,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:31:15,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:31:15,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:31:15,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:31:15,838 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 18:31:15,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:31:15,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285357597] [2022-12-13 18:31:15,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285357597] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:31:15,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:31:15,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 18:31:15,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614338279] [2022-12-13 18:31:15,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:31:15,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:31:15,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:31:15,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:31:15,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:31:15,840 INFO L87 Difference]: Start difference. First operand 64 states and 90 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (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 18:31:15,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:31:15,851 INFO L93 Difference]: Finished difference Result 64 states and 90 transitions. [2022-12-13 18:31:15,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:31:15,851 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (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 27 [2022-12-13 18:31:15,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:31:15,853 INFO L225 Difference]: With dead ends: 64 [2022-12-13 18:31:15,853 INFO L226 Difference]: Without dead ends: 63 [2022-12-13 18:31:15,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 18:31:15,854 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 22 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 142 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 18:31:15,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 142 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:31:15,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-12-13 18:31:15,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-12-13 18:31:15,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 46 states have (on average 1.4130434782608696) internal successors, (65), 59 states have internal predecessors, (65), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) [2022-12-13 18:31:15,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 89 transitions. [2022-12-13 18:31:15,861 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 89 transitions. Word has length 27 [2022-12-13 18:31:15,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:31:15,861 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 89 transitions. [2022-12-13 18:31:15,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (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 18:31:15,862 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 89 transitions. [2022-12-13 18:31:15,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-13 18:31:15,863 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:31:15,863 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:31:15,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 18:31:15,864 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 18:31:15,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:31:15,864 INFO L85 PathProgramCache]: Analyzing trace with hash -2141023451, now seen corresponding path program 1 times [2022-12-13 18:31:15,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:31:15,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131025391] [2022-12-13 18:31:15,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:31:15,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:31:15,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:31:15,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:31:15,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:31:15,906 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 18:31:15,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:31:15,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131025391] [2022-12-13 18:31:15,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131025391] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:31:15,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:31:15,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 18:31:15,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396529838] [2022-12-13 18:31:15,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:31:15,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:31:15,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:31:15,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:31:15,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:31:15,907 INFO L87 Difference]: Start difference. First operand 63 states and 89 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (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 18:31:15,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:31:15,922 INFO L93 Difference]: Finished difference Result 100 states and 135 transitions. [2022-12-13 18:31:15,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:31:15,923 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (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 28 [2022-12-13 18:31:15,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:31:15,924 INFO L225 Difference]: With dead ends: 100 [2022-12-13 18:31:15,924 INFO L226 Difference]: Without dead ends: 83 [2022-12-13 18:31:15,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 18:31:15,925 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 16 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 171 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 18:31:15,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 171 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:31:15,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-12-13 18:31:15,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 68. [2022-12-13 18:31:15,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 51 states have (on average 1.392156862745098) internal successors, (71), 64 states have internal predecessors, (71), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) [2022-12-13 18:31:15,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 95 transitions. [2022-12-13 18:31:15,932 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 95 transitions. Word has length 28 [2022-12-13 18:31:15,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:31:15,932 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 95 transitions. [2022-12-13 18:31:15,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (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 18:31:15,932 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 95 transitions. [2022-12-13 18:31:15,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-13 18:31:15,933 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:31:15,933 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:31:15,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 18:31:15,933 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 18:31:15,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:31:15,933 INFO L85 PathProgramCache]: Analyzing trace with hash -2083765149, now seen corresponding path program 1 times [2022-12-13 18:31:15,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:31:15,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172556210] [2022-12-13 18:31:15,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:31:15,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:31:15,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:31:15,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:31:15,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:31:15,964 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 18:31:15,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:31:15,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172556210] [2022-12-13 18:31:15,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172556210] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:31:15,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:31:15,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 18:31:15,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565977655] [2022-12-13 18:31:15,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:31:15,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:31:15,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:31:15,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:31:15,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:31:15,966 INFO L87 Difference]: Start difference. First operand 68 states and 95 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, (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 18:31:15,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:31:15,975 INFO L93 Difference]: Finished difference Result 96 states and 129 transitions. [2022-12-13 18:31:15,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:31:15,975 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, (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 28 [2022-12-13 18:31:15,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:31:15,976 INFO L225 Difference]: With dead ends: 96 [2022-12-13 18:31:15,976 INFO L226 Difference]: Without dead ends: 68 [2022-12-13 18:31:15,976 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 18:31:15,977 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 1 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 169 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 18:31:15,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 169 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:31:15,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-12-13 18:31:15,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-12-13 18:31:15,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 63 states have internal predecessors, (70), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) [2022-12-13 18:31:15,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 94 transitions. [2022-12-13 18:31:15,981 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 94 transitions. Word has length 28 [2022-12-13 18:31:15,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:31:15,981 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 94 transitions. [2022-12-13 18:31:15,981 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, (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 18:31:15,982 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 94 transitions. [2022-12-13 18:31:15,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-13 18:31:15,982 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:31:15,982 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] [2022-12-13 18:31:15,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 18:31:15,982 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 18:31:15,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:31:15,983 INFO L85 PathProgramCache]: Analyzing trace with hash 2029269204, now seen corresponding path program 1 times [2022-12-13 18:31:15,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:31:15,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363314342] [2022-12-13 18:31:15,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:31:15,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:31:15,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:31:16,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:31:16,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:31:16,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-12-13 18:31:16,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:31:16,020 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 18:31:16,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:31:16,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363314342] [2022-12-13 18:31:16,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363314342] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:31:16,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:31:16,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 18:31:16,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129162741] [2022-12-13 18:31:16,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:31:16,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:31:16,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:31:16,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:31:16,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:31:16,021 INFO L87 Difference]: Start difference. First operand 68 states and 94 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 18:31:16,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:31:16,028 INFO L93 Difference]: Finished difference Result 90 states and 120 transitions. [2022-12-13 18:31:16,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:31:16,028 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 32 [2022-12-13 18:31:16,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:31:16,029 INFO L225 Difference]: With dead ends: 90 [2022-12-13 18:31:16,029 INFO L226 Difference]: Without dead ends: 61 [2022-12-13 18:31:16,029 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 18:31:16,030 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 161 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 18:31:16,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 161 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:31:16,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-12-13 18:31:16,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-12-13 18:31:16,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 46 states have (on average 1.326086956521739) internal successors, (61), 57 states have internal predecessors, (61), 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 18:31:16,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 83 transitions. [2022-12-13 18:31:16,034 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 83 transitions. Word has length 32 [2022-12-13 18:31:16,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:31:16,034 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 83 transitions. [2022-12-13 18:31:16,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 18:31:16,034 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 83 transitions. [2022-12-13 18:31:16,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-12-13 18:31:16,035 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:31:16,035 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:31:16,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 18:31:16,035 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 18:31:16,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:31:16,035 INFO L85 PathProgramCache]: Analyzing trace with hash -37290577, now seen corresponding path program 1 times [2022-12-13 18:31:16,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:31:16,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988701550] [2022-12-13 18:31:16,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:31:16,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:31:16,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:31:16,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:31:16,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:31:16,072 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 18:31:16,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:31:16,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988701550] [2022-12-13 18:31:16,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988701550] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:31:16,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:31:16,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 18:31:16,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126388041] [2022-12-13 18:31:16,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:31:16,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:31:16,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:31:16,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:31:16,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:31:16,074 INFO L87 Difference]: Start difference. First operand 61 states and 83 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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 18:31:16,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:31:16,081 INFO L93 Difference]: Finished difference Result 77 states and 101 transitions. [2022-12-13 18:31:16,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:31:16,082 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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 33 [2022-12-13 18:31:16,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:31:16,083 INFO L225 Difference]: With dead ends: 77 [2022-12-13 18:31:16,083 INFO L226 Difference]: Without dead ends: 59 [2022-12-13 18:31:16,083 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 18:31:16,083 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 4 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 147 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 18:31:16,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 147 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:31:16,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-12-13 18:31:16,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-12-13 18:31:16,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 45 states have (on average 1.288888888888889) internal successors, (58), 54 states have internal predecessors, (58), 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 18:31:16,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 78 transitions. [2022-12-13 18:31:16,087 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 78 transitions. Word has length 33 [2022-12-13 18:31:16,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:31:16,087 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 78 transitions. [2022-12-13 18:31:16,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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 18:31:16,087 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 78 transitions. [2022-12-13 18:31:16,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-13 18:31:16,088 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:31:16,088 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:31:16,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 18:31:16,088 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 18:31:16,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:31:16,088 INFO L85 PathProgramCache]: Analyzing trace with hash 362646512, now seen corresponding path program 1 times [2022-12-13 18:31:16,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:31:16,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793440717] [2022-12-13 18:31:16,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:31:16,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:31:16,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:31:16,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:31:16,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:31:16,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 18:31:16,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:31:16,136 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 18:31:16,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:31:16,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793440717] [2022-12-13 18:31:16,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793440717] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:31:16,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:31:16,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 18:31:16,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908948777] [2022-12-13 18:31:16,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:31:16,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:31:16,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:31:16,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:31:16,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:31:16,138 INFO L87 Difference]: Start difference. First operand 59 states and 78 transitions. Second operand has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 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 18:31:16,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:31:16,145 INFO L93 Difference]: Finished difference Result 59 states and 78 transitions. [2022-12-13 18:31:16,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:31:16,145 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 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 39 [2022-12-13 18:31:16,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:31:16,146 INFO L225 Difference]: With dead ends: 59 [2022-12-13 18:31:16,146 INFO L226 Difference]: Without dead ends: 58 [2022-12-13 18:31:16,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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 18:31:16,147 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 5 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 140 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 18:31:16,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 140 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:31:16,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-12-13 18:31:16,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-12-13 18:31:16,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 53 states have internal predecessors, (57), 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 18:31:16,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 77 transitions. [2022-12-13 18:31:16,152 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 77 transitions. Word has length 39 [2022-12-13 18:31:16,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:31:16,153 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 77 transitions. [2022-12-13 18:31:16,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 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 18:31:16,153 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 77 transitions. [2022-12-13 18:31:16,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-13 18:31:16,154 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:31:16,154 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:31:16,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 18:31:16,154 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 18:31:16,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:31:16,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1642859818, now seen corresponding path program 1 times [2022-12-13 18:31:16,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:31:16,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872507734] [2022-12-13 18:31:16,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:31:16,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:31:16,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:31:16,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:31:16,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:31:16,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 18:31:16,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:31:16,198 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 18:31:16,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:31:16,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872507734] [2022-12-13 18:31:16,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872507734] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:31:16,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:31:16,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 18:31:16,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344077928] [2022-12-13 18:31:16,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:31:16,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:31:16,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:31:16,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:31:16,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:31:16,200 INFO L87 Difference]: Start difference. First operand 58 states and 77 transitions. Second operand has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 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 18:31:16,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:31:16,207 INFO L93 Difference]: Finished difference Result 64 states and 82 transitions. [2022-12-13 18:31:16,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:31:16,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 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 40 [2022-12-13 18:31:16,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:31:16,208 INFO L225 Difference]: With dead ends: 64 [2022-12-13 18:31:16,208 INFO L226 Difference]: Without dead ends: 58 [2022-12-13 18:31:16,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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 18:31:16,209 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 147 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 18:31:16,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 147 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:31:16,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-12-13 18:31:16,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-12-13 18:31:16,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 53 states have internal predecessors, (56), 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 18:31:16,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 76 transitions. [2022-12-13 18:31:16,214 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 76 transitions. Word has length 40 [2022-12-13 18:31:16,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:31:16,214 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 76 transitions. [2022-12-13 18:31:16,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 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 18:31:16,215 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 76 transitions. [2022-12-13 18:31:16,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-12-13 18:31:16,215 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:31:16,215 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:31:16,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 18:31:16,216 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 18:31:16,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:31:16,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1969126764, now seen corresponding path program 1 times [2022-12-13 18:31:16,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:31:16,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768299806] [2022-12-13 18:31:16,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:31:16,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:31:16,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:31:16,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:31:16,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:31:16,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 18:31:16,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:31:16,249 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 18:31:16,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:31:16,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768299806] [2022-12-13 18:31:16,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768299806] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:31:16,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:31:16,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 18:31:16,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689944636] [2022-12-13 18:31:16,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:31:16,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:31:16,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:31:16,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:31:16,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:31:16,251 INFO L87 Difference]: Start difference. First operand 58 states and 76 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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 18:31:16,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:31:16,254 INFO L93 Difference]: Finished difference Result 62 states and 80 transitions. [2022-12-13 18:31:16,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:31:16,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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 41 [2022-12-13 18:31:16,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:31:16,254 INFO L225 Difference]: With dead ends: 62 [2022-12-13 18:31:16,254 INFO L226 Difference]: Without dead ends: 0 [2022-12-13 18:31:16,255 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 18:31:16,255 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 131 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 18:31:16,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:31:16,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-13 18:31:16,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-13 18:31:16,256 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 18:31:16,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-13 18:31:16,256 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2022-12-13 18:31:16,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:31:16,256 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-13 18:31:16,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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 18:31:16,256 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-13 18:31:16,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-13 18:31:16,258 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-12-13 18:31:16,259 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-12-13 18:31:16,259 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-12-13 18:31:16,259 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-12-13 18:31:16,259 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-12-13 18:31:16,259 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-12-13 18:31:16,259 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-12-13 18:31:16,259 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-12-13 18:31:16,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 18:31:16,261 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-13 18:31:16,312 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1412 1418) the Hoare annotation is: true [2022-12-13 18:31:16,312 INFO L899 garLoopResultBuilder]: For program point printLineEXIT(lines 1412 1418) no Hoare annotation was computed. [2022-12-13 18:31:16,312 INFO L899 garLoopResultBuilder]: For program point L1414(lines 1414 1417) no Hoare annotation was computed. [2022-12-13 18:31:16,312 INFO L899 garLoopResultBuilder]: For program point L1414-2(lines 1412 1418) no Hoare annotation was computed. [2022-12-13 18:31:16,312 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1426 1429) the Hoare annotation is: true [2022-12-13 18:31:16,312 INFO L899 garLoopResultBuilder]: For program point printIntLineEXIT(lines 1426 1429) no Hoare annotation was computed. [2022-12-13 18:31:16,312 INFO L899 garLoopResultBuilder]: For program point printIntLineFINAL(lines 1426 1429) no Hoare annotation was computed. [2022-12-13 18:31:16,312 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1602) no Hoare annotation was computed. [2022-12-13 18:31:16,312 INFO L902 garLoopResultBuilder]: At program point L1662(line 1662) the Hoare annotation is: true [2022-12-13 18:31:16,312 INFO L895 garLoopResultBuilder]: At program point L1629(lines 1629 1641) the Hoare annotation is: (and |ULTIMATE.start_goodG2B1_#t~switch105#1| (<= 0 (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|))) [2022-12-13 18:31:16,312 INFO L899 garLoopResultBuilder]: For program point L1563(line 1563) no Hoare annotation was computed. [2022-12-13 18:31:16,312 INFO L899 garLoopResultBuilder]: For program point L1588(line 1588) no Hoare annotation was computed. [2022-12-13 18:31:16,312 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 1677 1684) the Hoare annotation is: true [2022-12-13 18:31:16,313 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1661) no Hoare annotation was computed. [2022-12-13 18:31:16,313 INFO L899 garLoopResultBuilder]: For program point L1638(line 1638) no Hoare annotation was computed. [2022-12-13 18:31:16,313 INFO L895 garLoopResultBuilder]: At program point L1572(line 1572) the Hoare annotation is: (and (<= (+ (select (select |#memory_int| |ULTIMATE.start_goodB2G1_~#data~0#1.base|) |ULTIMATE.start_goodB2G1_~#data~0#1.offset|) 1) 0) |ULTIMATE.start_goodB2G1_#t~switch94#1|) [2022-12-13 18:31:16,313 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1571) no Hoare annotation was computed. [2022-12-13 18:31:16,313 INFO L899 garLoopResultBuilder]: For program point L1597(line 1597) no Hoare annotation was computed. [2022-12-13 18:31:16,313 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-12-13 18:31:16,313 INFO L895 garLoopResultBuilder]: At program point L1564(line 1564) the Hoare annotation is: |ULTIMATE.start_goodB2G1_#t~switch94#1| [2022-12-13 18:31:16,313 INFO L899 garLoopResultBuilder]: For program point L1622(line 1622) no Hoare annotation was computed. [2022-12-13 18:31:16,313 INFO L902 garLoopResultBuilder]: At program point L1680(line 1680) the Hoare annotation is: true [2022-12-13 18:31:16,313 INFO L899 garLoopResultBuilder]: For program point L1680-1(line 1680) no Hoare annotation was computed. [2022-12-13 18:31:16,313 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 18:31:16,313 INFO L899 garLoopResultBuilder]: For program point L1548(lines 1548 1581) no Hoare annotation was computed. [2022-12-13 18:31:16,313 INFO L895 garLoopResultBuilder]: At program point L1639(line 1639) the Hoare annotation is: false [2022-12-13 18:31:16,313 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1571) no Hoare annotation was computed. [2022-12-13 18:31:16,314 INFO L899 garLoopResultBuilder]: For program point L1631(line 1631) no Hoare annotation was computed. [2022-12-13 18:31:16,314 INFO L899 garLoopResultBuilder]: For program point L1598(lines 1598 1609) no Hoare annotation was computed. [2022-12-13 18:31:16,314 INFO L902 garLoopResultBuilder]: At program point L1656(lines 1656 1668) the Hoare annotation is: true [2022-12-13 18:31:16,314 INFO L895 garLoopResultBuilder]: At program point L1623(line 1623) the Hoare annotation is: false [2022-12-13 18:31:16,314 INFO L899 garLoopResultBuilder]: For program point L1557(line 1557) no Hoare annotation was computed. [2022-12-13 18:31:16,314 INFO L899 garLoopResultBuilder]: For program point L1582(lines 1582 1615) no Hoare annotation was computed. [2022-12-13 18:31:16,314 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2022-12-13 18:31:16,314 INFO L895 garLoopResultBuilder]: At program point L1607(line 1607) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch100#1| (<= (+ (select (select |#memory_int| |ULTIMATE.start_goodB2G2_~#data~1#1.base|) |ULTIMATE.start_goodB2G2_~#data~1#1.offset|) 1) 0)) [2022-12-13 18:31:16,314 INFO L899 garLoopResultBuilder]: For program point L1665(line 1665) no Hoare annotation was computed. [2022-12-13 18:31:16,314 INFO L899 garLoopResultBuilder]: For program point L1632(lines 1632 1636) no Hoare annotation was computed. [2022-12-13 18:31:16,314 INFO L899 garLoopResultBuilder]: For program point L1566(line 1566) no Hoare annotation was computed. [2022-12-13 18:31:16,315 INFO L899 garLoopResultBuilder]: For program point L1591(line 1591) no Hoare annotation was computed. [2022-12-13 18:31:16,315 INFO L902 garLoopResultBuilder]: At program point L1558(line 1558) the Hoare annotation is: true [2022-12-13 18:31:16,315 INFO L902 garLoopResultBuilder]: At program point L1682(line 1682) the Hoare annotation is: true [2022-12-13 18:31:16,315 INFO L899 garLoopResultBuilder]: For program point L1649(line 1649) no Hoare annotation was computed. [2022-12-13 18:31:16,315 INFO L899 garLoopResultBuilder]: For program point L1682-1(line 1682) no Hoare annotation was computed. [2022-12-13 18:31:16,315 INFO L899 garLoopResultBuilder]: For program point L1616(lines 1616 1642) no Hoare annotation was computed. [2022-12-13 18:31:16,315 INFO L902 garLoopResultBuilder]: At program point L1666(line 1666) the Hoare annotation is: true [2022-12-13 18:31:16,315 INFO L899 garLoopResultBuilder]: For program point L1600(lines 1600 1608) no Hoare annotation was computed. [2022-12-13 18:31:16,315 INFO L899 garLoopResultBuilder]: For program point L1567(lines 1567 1578) no Hoare annotation was computed. [2022-12-13 18:31:16,315 INFO L899 garLoopResultBuilder]: For program point L1658(line 1658) no Hoare annotation was computed. [2022-12-13 18:31:16,315 INFO L899 garLoopResultBuilder]: For program point L1625(line 1625) no Hoare annotation was computed. [2022-12-13 18:31:16,316 INFO L902 garLoopResultBuilder]: At program point L1592(line 1592) the Hoare annotation is: true [2022-12-13 18:31:16,316 INFO L895 garLoopResultBuilder]: At program point L1576(line 1576) the Hoare annotation is: (and (<= (+ (select (select |#memory_int| |ULTIMATE.start_goodB2G1_~#data~0#1.base|) |ULTIMATE.start_goodB2G1_~#data~0#1.offset|) 1) 0) |ULTIMATE.start_goodB2G1_#t~switch94#1|) [2022-12-13 18:31:16,316 INFO L899 garLoopResultBuilder]: For program point L1634(line 1634) no Hoare annotation was computed. [2022-12-13 18:31:16,316 INFO L899 garLoopResultBuilder]: For program point L1634-1(line 1634) no Hoare annotation was computed. [2022-12-13 18:31:16,316 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-12-13 18:31:16,316 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1634) no Hoare annotation was computed. [2022-12-13 18:31:16,316 INFO L899 garLoopResultBuilder]: For program point L1659(lines 1659 1663) no Hoare annotation was computed. [2022-12-13 18:31:16,316 INFO L902 garLoopResultBuilder]: At program point L1552(lines 1552 1560) the Hoare annotation is: true [2022-12-13 18:31:16,316 INFO L899 garLoopResultBuilder]: For program point L1643(lines 1643 1669) no Hoare annotation was computed. [2022-12-13 18:31:16,317 INFO L895 garLoopResultBuilder]: At program point L1635(line 1635) the Hoare annotation is: (and |ULTIMATE.start_goodG2B1_#t~switch105#1| (<= 0 (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|))) [2022-12-13 18:31:16,317 INFO L899 garLoopResultBuilder]: For program point L1602(line 1602) no Hoare annotation was computed. [2022-12-13 18:31:16,317 INFO L899 garLoopResultBuilder]: For program point L1569(lines 1569 1577) no Hoare annotation was computed. [2022-12-13 18:31:16,317 INFO L899 garLoopResultBuilder]: For program point L1602-1(line 1602) no Hoare annotation was computed. [2022-12-13 18:31:16,317 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-13 18:31:16,317 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1634) no Hoare annotation was computed. [2022-12-13 18:31:16,317 INFO L895 garLoopResultBuilder]: At program point L1561(lines 1561 1580) the Hoare annotation is: |ULTIMATE.start_goodB2G1_#t~switch94#1| [2022-12-13 18:31:16,317 INFO L899 garLoopResultBuilder]: For program point L1652(line 1652) no Hoare annotation was computed. [2022-12-13 18:31:16,317 INFO L902 garLoopResultBuilder]: At program point L1586(lines 1586 1594) the Hoare annotation is: true [2022-12-13 18:31:16,317 INFO L899 garLoopResultBuilder]: For program point L1611(line 1611) no Hoare annotation was computed. [2022-12-13 18:31:16,317 INFO L895 garLoopResultBuilder]: At program point L1603(line 1603) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch100#1| (<= (+ (select (select |#memory_int| |ULTIMATE.start_goodB2G2_~#data~1#1.base|) |ULTIMATE.start_goodB2G2_~#data~1#1.offset|) 1) 0)) [2022-12-13 18:31:16,317 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1602) no Hoare annotation was computed. [2022-12-13 18:31:16,317 INFO L899 garLoopResultBuilder]: For program point L1661(line 1661) no Hoare annotation was computed. [2022-12-13 18:31:16,317 INFO L899 garLoopResultBuilder]: For program point L1661-1(line 1661) no Hoare annotation was computed. [2022-12-13 18:31:16,317 INFO L895 garLoopResultBuilder]: At program point L1595(lines 1595 1614) the Hoare annotation is: |ULTIMATE.start_goodB2G2_#t~switch100#1| [2022-12-13 18:31:16,318 INFO L895 garLoopResultBuilder]: At program point L1653(line 1653) the Hoare annotation is: false [2022-12-13 18:31:16,318 INFO L895 garLoopResultBuilder]: At program point L1620(lines 1620 1628) the Hoare annotation is: (let ((.cse0 (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|))) (and (<= .cse0 0) |ULTIMATE.start_goodG2B1_#t~switch104#1| (<= 0 .cse0))) [2022-12-13 18:31:16,318 INFO L899 garLoopResultBuilder]: For program point L1554(line 1554) no Hoare annotation was computed. [2022-12-13 18:31:16,318 INFO L895 garLoopResultBuilder]: At program point L1612(line 1612) the Hoare annotation is: false [2022-12-13 18:31:16,318 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1661) no Hoare annotation was computed. [2022-12-13 18:31:16,318 INFO L899 garLoopResultBuilder]: For program point L1670(lines 1670 1676) no Hoare annotation was computed. [2022-12-13 18:31:16,318 INFO L899 garLoopResultBuilder]: For program point L1571(line 1571) no Hoare annotation was computed. [2022-12-13 18:31:16,318 INFO L899 garLoopResultBuilder]: For program point L1571-1(line 1571) no Hoare annotation was computed. [2022-12-13 18:31:16,321 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:31:16,323 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 18:31:16,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 06:31:16 BoogieIcfgContainer [2022-12-13 18:31:16,335 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 18:31:16,336 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 18:31:16,336 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 18:31:16,336 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 18:31:16,336 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:31:14" (3/4) ... [2022-12-13 18:31:16,339 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-13 18:31:16,344 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2022-12-13 18:31:16,344 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2022-12-13 18:31:16,349 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2022-12-13 18:31:16,349 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2022-12-13 18:31:16,349 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-12-13 18:31:16,350 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-13 18:31:16,350 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-13 18:31:16,391 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b59bcf-d706-434c-87f4-bfbd602fc43e/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 18:31:16,391 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 18:31:16,392 INFO L158 Benchmark]: Toolchain (without parser) took 3024.87ms. Allocated memory was 142.6MB in the beginning and 172.0MB in the end (delta: 29.4MB). Free memory was 103.4MB in the beginning and 64.1MB in the end (delta: 39.3MB). Peak memory consumption was 70.1MB. Max. memory is 16.1GB. [2022-12-13 18:31:16,392 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 142.6MB. Free memory is still 117.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 18:31:16,392 INFO L158 Benchmark]: CACSL2BoogieTranslator took 775.53ms. Allocated memory is still 142.6MB. Free memory was 103.4MB in the beginning and 92.7MB in the end (delta: 10.7MB). Peak memory consumption was 57.3MB. Max. memory is 16.1GB. [2022-12-13 18:31:16,393 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.84ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 89.1MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 18:31:16,393 INFO L158 Benchmark]: Boogie Preprocessor took 19.02ms. Allocated memory is still 142.6MB. Free memory was 89.1MB in the beginning and 87.8MB in the end (delta: 1.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 18:31:16,393 INFO L158 Benchmark]: RCFGBuilder took 348.83ms. Allocated memory is still 142.6MB. Free memory was 87.8MB in the beginning and 69.6MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-13 18:31:16,394 INFO L158 Benchmark]: TraceAbstraction took 1769.89ms. Allocated memory was 142.6MB in the beginning and 172.0MB in the end (delta: 29.4MB). Free memory was 69.6MB in the beginning and 68.3MB in the end (delta: 1.2MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. [2022-12-13 18:31:16,394 INFO L158 Benchmark]: Witness Printer took 55.75ms. Allocated memory is still 172.0MB. Free memory was 68.3MB in the beginning and 64.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 18:31:16,395 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.13ms. Allocated memory is still 142.6MB. Free memory is still 117.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 775.53ms. Allocated memory is still 142.6MB. Free memory was 103.4MB in the beginning and 92.7MB in the end (delta: 10.7MB). Peak memory consumption was 57.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.84ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 89.1MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.02ms. Allocated memory is still 142.6MB. Free memory was 89.1MB in the beginning and 87.8MB in the end (delta: 1.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 348.83ms. Allocated memory is still 142.6MB. Free memory was 87.8MB in the beginning and 69.6MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1769.89ms. Allocated memory was 142.6MB in the beginning and 172.0MB in the end (delta: 29.4MB). Free memory was 69.6MB in the beginning and 68.3MB in the end (delta: 1.2MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. * Witness Printer took 55.75ms. Allocated memory is still 172.0MB. Free memory was 68.3MB in the beginning and 64.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 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.7s, OverallIterations: 14, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 93 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 74 mSDsluCounter, 2881 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1679 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 195 IncrementalHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 1202 mSDtfsCounter, 195 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=0, InterpolantAutomatonStates: 49, 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, 14 MinimizatonAttempts, 17 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 27 LocationsWithAnnotation, 61 PreInvPairs, 71 NumberOfFragments, 105 HoareAnnotationTreeSize, 61 FomulaSimplifications, 36 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 27 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 389 NumberOfCodeBlocks, 389 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 375 ConstructedInterpolants, 0 QuantifiedInterpolants, 518 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 4/4 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: 1 - InvariantResult [Line: 1586]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1620]: Loop Invariant Derived loop invariant: (2 + data <= 0 && aux-switch(5) { case 6: printLine("Benign, fixed string"); break; default: data = -2; break; }-aux) && 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 18:31:16,412 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b59bcf-d706-434c-87f4-bfbd602fc43e/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