./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_postinc_15_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb20ae6-f38d-4296-a7e7-869d4a422e67/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb20ae6-f38d-4296-a7e7-869d4a422e67/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb20ae6-f38d-4296-a7e7-869d4a422e67/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb20ae6-f38d-4296-a7e7-869d4a422e67/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_postinc_15_good.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb20ae6-f38d-4296-a7e7-869d4a422e67/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb20ae6-f38d-4296-a7e7-869d4a422e67/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash aa9f39e01a170e3a12e1ce2d761b331c4bdb8c400cf580500138f9c10d8cb063 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 17:06:50,194 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:06:50,196 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:06:50,229 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:06:50,232 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:06:50,254 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:06:50,257 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:06:50,261 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:06:50,263 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:06:50,269 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:06:50,271 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:06:50,274 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:06:50,274 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:06:50,279 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:06:50,280 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:06:50,282 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:06:50,284 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:06:50,285 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:06:50,287 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:06:50,293 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:06:50,295 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:06:50,297 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:06:50,299 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:06:50,300 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:06:50,309 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:06:50,310 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:06:50,311 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:06:50,311 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:06:50,313 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:06:50,314 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:06:50,314 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:06:50,315 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:06:50,317 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:06:50,319 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:06:50,320 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:06:50,320 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:06:50,321 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:06:50,321 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:06:50,321 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:06:50,323 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:06:50,324 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:06:50,325 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb20ae6-f38d-4296-a7e7-869d4a422e67/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-11-25 17:06:50,364 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:06:50,365 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:06:50,365 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:06:50,366 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:06:50,367 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:06:50,367 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:06:50,368 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:06:50,368 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:06:50,368 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:06:50,368 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:06:50,370 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 17:06:50,370 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:06:50,370 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:06:50,371 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 17:06:50,371 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:06:50,371 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 17:06:50,371 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-25 17:06:50,371 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 17:06:50,372 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:06:50,372 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 17:06:50,372 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:06:50,372 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:06:50,372 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:06:50,373 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:06:50,373 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:06:50,373 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:06:50,373 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 17:06:50,374 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 17:06:50,374 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 17:06:50,375 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:06:50,375 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 17:06:50,375 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:06:50,376 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:06:50,376 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_9bb20ae6-f38d-4296-a7e7-869d4a422e67/bin/uautomizer-ZsLfNo2U6R/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb20ae6-f38d-4296-a7e7-869d4a422e67/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> aa9f39e01a170e3a12e1ce2d761b331c4bdb8c400cf580500138f9c10d8cb063 [2022-11-25 17:06:50,636 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:06:50,664 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:06:50,666 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:06:50,668 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:06:50,668 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:06:50,670 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb20ae6-f38d-4296-a7e7-869d4a422e67/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_postinc_15_good.i [2022-11-25 17:06:53,767 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:06:54,297 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:06:54,298 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb20ae6-f38d-4296-a7e7-869d4a422e67/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_postinc_15_good.i [2022-11-25 17:06:54,324 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb20ae6-f38d-4296-a7e7-869d4a422e67/bin/uautomizer-ZsLfNo2U6R/data/6fa829337/a2828f0ac6ca479e85a01e001c298ba9/FLAG5a6da7e98 [2022-11-25 17:06:54,339 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb20ae6-f38d-4296-a7e7-869d4a422e67/bin/uautomizer-ZsLfNo2U6R/data/6fa829337/a2828f0ac6ca479e85a01e001c298ba9 [2022-11-25 17:06:54,341 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:06:54,343 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:06:54,345 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:06:54,345 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:06:54,357 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:06:54,358 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:06:54" (1/1) ... [2022-11-25 17:06:54,359 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71a47a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:06:54, skipping insertion in model container [2022-11-25 17:06:54,359 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:06:54" (1/1) ... [2022-11-25 17:06:54,367 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:06:54,425 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:06:54,838 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-25 17:06:55,333 WARN L623 FunctionHandler]: Unknown extern function puts [2022-11-25 17:06:55,339 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-25 17:06:55,341 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-25 17:06:55,344 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-25 17:06:55,345 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-25 17:06:55,384 WARN L623 FunctionHandler]: Unknown extern function time [2022-11-25 17:06:55,393 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:06:55,405 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:06:55,428 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-25 17:06:55,483 WARN L623 FunctionHandler]: Unknown extern function puts [2022-11-25 17:06:55,485 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-25 17:06:55,486 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-25 17:06:55,488 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-25 17:06:55,489 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-25 17:06:55,511 WARN L623 FunctionHandler]: Unknown extern function time [2022-11-25 17:06:55,512 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:06:55,679 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:06:55,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:06:55 WrapperNode [2022-11-25 17:06:55,679 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:06:55,680 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:06:55,680 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:06:55,681 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:06:55,716 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:06:55" (1/1) ... [2022-11-25 17:06:55,748 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:06:55" (1/1) ... [2022-11-25 17:06:55,780 INFO L138 Inliner]: procedures = 503, calls = 97, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 179 [2022-11-25 17:06:55,780 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:06:55,781 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:06:55,781 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:06:55,781 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:06:55,790 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:06:55" (1/1) ... [2022-11-25 17:06:55,791 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:06:55" (1/1) ... [2022-11-25 17:06:55,794 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:06:55" (1/1) ... [2022-11-25 17:06:55,795 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:06:55" (1/1) ... [2022-11-25 17:06:55,802 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:06:55" (1/1) ... [2022-11-25 17:06:55,804 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:06:55" (1/1) ... [2022-11-25 17:06:55,806 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:06:55" (1/1) ... [2022-11-25 17:06:55,808 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:06:55" (1/1) ... [2022-11-25 17:06:55,810 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:06:55,811 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:06:55,812 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:06:55,812 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:06:55,813 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:06:55" (1/1) ... [2022-11-25 17:06:55,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:06:55,831 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb20ae6-f38d-4296-a7e7-869d4a422e67/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:06:55,848 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb20ae6-f38d-4296-a7e7-869d4a422e67/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:06:55,868 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb20ae6-f38d-4296-a7e7-869d4a422e67/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:06:55,896 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2022-11-25 17:06:55,897 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2022-11-25 17:06:55,897 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2022-11-25 17:06:55,897 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2022-11-25 17:06:55,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 17:06:55,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 17:06:55,898 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:06:55,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:06:55,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:06:55,898 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 17:06:55,898 INFO L130 BoogieDeclarations]: Found specification of procedure time [2022-11-25 17:06:55,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 17:06:55,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 17:06:56,101 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:06:56,103 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:06:56,383 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:06:56,391 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:06:56,391 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 17:06:56,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:06:56 BoogieIcfgContainer [2022-11-25 17:06:56,393 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:06:56,396 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:06:56,396 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:06:56,404 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:06:56,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:06:54" (1/3) ... [2022-11-25 17:06:56,406 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@527e763 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:06:56, skipping insertion in model container [2022-11-25 17:06:56,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:06:55" (2/3) ... [2022-11-25 17:06:56,406 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@527e763 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:06:56, skipping insertion in model container [2022-11-25 17:06:56,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:06:56" (3/3) ... [2022-11-25 17:06:56,410 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fscanf_postinc_15_good.i [2022-11-25 17:06:56,435 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:06:56,436 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-11-25 17:06:56,504 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:06:56,511 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;@55bd58e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:06:56,511 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-11-25 17:06:56,516 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 50 states have (on average 1.54) internal successors, (77), 72 states have internal predecessors, (77), 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-11-25 17:06:56,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-25 17:06:56,526 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:06:56,527 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:06:56,527 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 17:06:56,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:06:56,533 INFO L85 PathProgramCache]: Analyzing trace with hash -389693070, now seen corresponding path program 1 times [2022-11-25 17:06:56,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:06:56,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774393784] [2022-11-25 17:06:56,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:06:56,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:06:56,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:57,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:06:57,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:57,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:06:57,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:06:57,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774393784] [2022-11-25 17:06:57,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774393784] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:06:57,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:06:57,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:06:57,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456711044] [2022-11-25 17:06:57,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:06:57,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:06:57,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:06:57,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:06:57,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:06:57,194 INFO L87 Difference]: Start difference. First operand has 77 states, 50 states have (on average 1.54) internal successors, (77), 72 states have internal predecessors, (77), 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.0) internal successors, (12), 4 states have internal predecessors, (12), 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-11-25 17:06:57,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:06:57,323 INFO L93 Difference]: Finished difference Result 77 states and 109 transitions. [2022-11-25 17:06:57,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:06:57,325 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 14 [2022-11-25 17:06:57,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:06:57,336 INFO L225 Difference]: With dead ends: 77 [2022-11-25 17:06:57,336 INFO L226 Difference]: Without dead ends: 65 [2022-11-25 17:06:57,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:06:57,346 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 11 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:06:57,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 279 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:06:57,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-25 17:06:57,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-11-25 17:06:57,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 61 states have internal predecessors, (66), 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-11-25 17:06:57,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 92 transitions. [2022-11-25 17:06:57,408 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 92 transitions. Word has length 14 [2022-11-25 17:06:57,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:06:57,410 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 92 transitions. [2022-11-25 17:06:57,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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-11-25 17:06:57,412 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 92 transitions. [2022-11-25 17:06:57,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-25 17:06:57,414 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:06:57,414 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:06:57,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 17:06:57,415 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-11-25 17:06:57,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:06:57,417 INFO L85 PathProgramCache]: Analyzing trace with hash 804416791, now seen corresponding path program 1 times [2022-11-25 17:06:57,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:06:57,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288665125] [2022-11-25 17:06:57,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:06:57,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:06:57,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:57,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:06:57,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:57,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:06:57,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:06:57,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288665125] [2022-11-25 17:06:57,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288665125] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:06:57,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:06:57,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:06:57,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462369395] [2022-11-25 17:06:57,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:06:57,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:06:57,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:06:57,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:06:57,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:06:57,673 INFO L87 Difference]: Start difference. First operand 65 states and 92 transitions. 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-11-25 17:06:57,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:06:57,718 INFO L93 Difference]: Finished difference Result 65 states and 92 transitions. [2022-11-25 17:06:57,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:06:57,719 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-11-25 17:06:57,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:06:57,720 INFO L225 Difference]: With dead ends: 65 [2022-11-25 17:06:57,720 INFO L226 Difference]: Without dead ends: 64 [2022-11-25 17:06:57,721 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-11-25 17:06:57,722 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:06:57,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 250 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:06:57,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-25 17:06:57,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-11-25 17:06:57,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 43 states have (on average 1.5116279069767442) internal successors, (65), 60 states have internal predecessors, (65), 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-11-25 17:06:57,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 91 transitions. [2022-11-25 17:06:57,734 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 91 transitions. Word has length 15 [2022-11-25 17:06:57,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:06:57,734 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 91 transitions. [2022-11-25 17:06:57,735 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-11-25 17:06:57,735 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 91 transitions. [2022-11-25 17:06:57,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-25 17:06:57,736 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:06:57,736 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:06:57,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 17:06:57,737 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-11-25 17:06:57,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:06:57,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1566270844, now seen corresponding path program 1 times [2022-11-25 17:06:57,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:06:57,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189471487] [2022-11-25 17:06:57,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:06:57,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:06:57,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:57,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:06:57,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:57,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:06:57,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:06:57,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189471487] [2022-11-25 17:06:57,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189471487] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:06:57,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:06:57,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:06:57,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788775147] [2022-11-25 17:06:57,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:06:57,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:06:57,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:06:57,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:06:57,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:06:57,801 INFO L87 Difference]: Start difference. First operand 64 states and 91 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-11-25 17:06:57,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:06:57,820 INFO L93 Difference]: Finished difference Result 112 states and 156 transitions. [2022-11-25 17:06:57,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:06:57,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 19 [2022-11-25 17:06:57,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:06:57,822 INFO L225 Difference]: With dead ends: 112 [2022-11-25 17:06:57,822 INFO L226 Difference]: Without dead ends: 64 [2022-11-25 17:06:57,823 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-11-25 17:06:57,824 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 5 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 166 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-11-25 17:06:57,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 166 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:06:57,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-25 17:06:57,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-11-25 17:06:57,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 59 states have internal predecessors, (64), 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-11-25 17:06:57,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 90 transitions. [2022-11-25 17:06:57,835 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 90 transitions. Word has length 19 [2022-11-25 17:06:57,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:06:57,835 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 90 transitions. [2022-11-25 17:06:57,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-11-25 17:06:57,836 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 90 transitions. [2022-11-25 17:06:57,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 17:06:57,837 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:06:57,837 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] [2022-11-25 17:06:57,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 17:06:57,838 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 17:06:57,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:06:57,838 INFO L85 PathProgramCache]: Analyzing trace with hash -126826538, now seen corresponding path program 1 times [2022-11-25 17:06:57,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:06:57,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174591994] [2022-11-25 17:06:57,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:06:57,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:06:57,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:57,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:06:57,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:57,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 17:06:57,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:57,894 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 17:06:57,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:06:57,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174591994] [2022-11-25 17:06:57,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174591994] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:06:57,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:06:57,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:06:57,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204923194] [2022-11-25 17:06:57,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:06:57,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:06:57,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:06:57,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:06:57,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:06:57,897 INFO L87 Difference]: Start difference. First operand 64 states and 90 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-11-25 17:06:57,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:06:57,913 INFO L93 Difference]: Finished difference Result 112 states and 155 transitions. [2022-11-25 17:06:57,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:06:57,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 23 [2022-11-25 17:06:57,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:06:57,915 INFO L225 Difference]: With dead ends: 112 [2022-11-25 17:06:57,915 INFO L226 Difference]: Without dead ends: 63 [2022-11-25 17:06:57,916 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-11-25 17:06:57,917 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 0 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:06:57,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:06:57,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-25 17:06:57,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-11-25 17:06:57,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 58 states have internal predecessors, (63), 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-11-25 17:06:57,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 87 transitions. [2022-11-25 17:06:57,927 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 87 transitions. Word has length 23 [2022-11-25 17:06:57,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:06:57,927 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 87 transitions. [2022-11-25 17:06:57,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-11-25 17:06:57,928 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 87 transitions. [2022-11-25 17:06:57,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-25 17:06:57,928 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:06:57,929 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] [2022-11-25 17:06:57,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 17:06:57,929 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 17:06:57,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:06:57,930 INFO L85 PathProgramCache]: Analyzing trace with hash 745548059, now seen corresponding path program 1 times [2022-11-25 17:06:57,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:06:57,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637861798] [2022-11-25 17:06:57,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:06:57,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:06:57,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:58,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:06:58,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:58,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:06:58,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:58,077 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 17:06:58,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:06:58,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637861798] [2022-11-25 17:06:58,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637861798] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:06:58,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:06:58,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:06:58,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614185508] [2022-11-25 17:06:58,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:06:58,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:06:58,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:06:58,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:06:58,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:06:58,080 INFO L87 Difference]: Start difference. First operand 63 states and 87 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-11-25 17:06:58,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:06:58,132 INFO L93 Difference]: Finished difference Result 63 states and 87 transitions. [2022-11-25 17:06:58,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:06:58,132 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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 25 [2022-11-25 17:06:58,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:06:58,134 INFO L225 Difference]: With dead ends: 63 [2022-11-25 17:06:58,134 INFO L226 Difference]: Without dead ends: 62 [2022-11-25 17:06:58,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:06:58,135 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 12 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:06:58,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 213 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:06:58,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-25 17:06:58,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-11-25 17:06:58,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 43 states have (on average 1.441860465116279) internal successors, (62), 57 states have internal predecessors, (62), 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-11-25 17:06:58,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 86 transitions. [2022-11-25 17:06:58,144 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 86 transitions. Word has length 25 [2022-11-25 17:06:58,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:06:58,145 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 86 transitions. [2022-11-25 17:06:58,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-11-25 17:06:58,145 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 86 transitions. [2022-11-25 17:06:58,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-25 17:06:58,146 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:06:58,146 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] [2022-11-25 17:06:58,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 17:06:58,146 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 17:06:58,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:06:58,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1637153456, now seen corresponding path program 1 times [2022-11-25 17:06:58,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:06:58,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581794741] [2022-11-25 17:06:58,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:06:58,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:06:58,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:58,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:06:58,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:58,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:06:58,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:58,249 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 17:06:58,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:06:58,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581794741] [2022-11-25 17:06:58,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581794741] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:06:58,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:06:58,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:06:58,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014779367] [2022-11-25 17:06:58,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:06:58,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:06:58,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:06:58,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:06:58,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:06:58,252 INFO L87 Difference]: Start difference. First operand 62 states and 86 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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-11-25 17:06:58,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:06:58,287 INFO L93 Difference]: Finished difference Result 62 states and 86 transitions. [2022-11-25 17:06:58,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:06:58,288 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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 26 [2022-11-25 17:06:58,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:06:58,289 INFO L225 Difference]: With dead ends: 62 [2022-11-25 17:06:58,289 INFO L226 Difference]: Without dead ends: 61 [2022-11-25 17:06:58,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:06:58,291 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:06:58,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 232 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:06:58,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-25 17:06:58,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-11-25 17:06:58,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 43 states have (on average 1.4186046511627908) internal successors, (61), 56 states have internal predecessors, (61), 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-11-25 17:06:58,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 85 transitions. [2022-11-25 17:06:58,298 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 85 transitions. Word has length 26 [2022-11-25 17:06:58,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:06:58,298 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 85 transitions. [2022-11-25 17:06:58,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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-11-25 17:06:58,299 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 85 transitions. [2022-11-25 17:06:58,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-25 17:06:58,300 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:06:58,300 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] [2022-11-25 17:06:58,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 17:06:58,301 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-11-25 17:06:58,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:06:58,301 INFO L85 PathProgramCache]: Analyzing trace with hash -332330315, now seen corresponding path program 1 times [2022-11-25 17:06:58,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:06:58,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739248005] [2022-11-25 17:06:58,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:06:58,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:06:58,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:58,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:06:58,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:58,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:06:58,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:58,388 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 17:06:58,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:06:58,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739248005] [2022-11-25 17:06:58,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739248005] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:06:58,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:06:58,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:06:58,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784843147] [2022-11-25 17:06:58,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:06:58,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:06:58,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:06:58,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:06:58,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:06:58,392 INFO L87 Difference]: Start difference. First operand 61 states and 85 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-11-25 17:06:58,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:06:58,410 INFO L93 Difference]: Finished difference Result 93 states and 125 transitions. [2022-11-25 17:06:58,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:06:58,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 31 [2022-11-25 17:06:58,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:06:58,413 INFO L225 Difference]: With dead ends: 93 [2022-11-25 17:06:58,413 INFO L226 Difference]: Without dead ends: 59 [2022-11-25 17:06:58,414 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-11-25 17:06:58,415 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 5 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 149 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-11-25 17:06:58,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 149 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:06:58,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-11-25 17:06:58,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-11-25 17:06:58,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 42 states have (on average 1.380952380952381) internal successors, (58), 53 states have internal predecessors, (58), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-25 17:06:58,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 80 transitions. [2022-11-25 17:06:58,439 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 80 transitions. Word has length 31 [2022-11-25 17:06:58,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:06:58,444 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 80 transitions. [2022-11-25 17:06:58,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-11-25 17:06:58,444 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 80 transitions. [2022-11-25 17:06:58,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-25 17:06:58,447 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:06:58,447 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:06:58,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 17:06:58,448 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 17:06:58,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:06:58,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1965523148, now seen corresponding path program 1 times [2022-11-25 17:06:58,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:06:58,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619319398] [2022-11-25 17:06:58,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:06:58,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:06:58,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:58,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:06:58,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:58,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:06:58,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:58,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-25 17:06:58,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:58,567 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 17:06:58,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:06:58,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619319398] [2022-11-25 17:06:58,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619319398] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:06:58,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:06:58,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:06:58,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583166750] [2022-11-25 17:06:58,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:06:58,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:06:58,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:06:58,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:06:58,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:06:58,571 INFO L87 Difference]: Start difference. First operand 59 states and 80 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 17:06:58,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:06:58,607 INFO L93 Difference]: Finished difference Result 78 states and 104 transitions. [2022-11-25 17:06:58,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:06:58,608 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2022-11-25 17:06:58,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:06:58,610 INFO L225 Difference]: With dead ends: 78 [2022-11-25 17:06:58,610 INFO L226 Difference]: Without dead ends: 76 [2022-11-25 17:06:58,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:06:58,614 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 17 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:06:58,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 231 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:06:58,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-25 17:06:58,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 63. [2022-11-25 17:06:58,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 57 states have internal predecessors, (63), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-25 17:06:58,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 85 transitions. [2022-11-25 17:06:58,634 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 85 transitions. Word has length 36 [2022-11-25 17:06:58,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:06:58,635 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 85 transitions. [2022-11-25 17:06:58,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 17:06:58,638 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 85 transitions. [2022-11-25 17:06:58,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-25 17:06:58,642 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:06:58,643 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:06:58,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 17:06:58,643 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 17:06:58,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:06:58,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1965463566, now seen corresponding path program 1 times [2022-11-25 17:06:58,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:06:58,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720599005] [2022-11-25 17:06:58,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:06:58,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:06:58,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:58,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:06:58,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:58,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:06:58,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:58,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-25 17:06:58,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:58,734 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 17:06:58,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:06:58,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720599005] [2022-11-25 17:06:58,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720599005] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:06:58,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:06:58,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:06:58,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428165945] [2022-11-25 17:06:58,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:06:58,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:06:58,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:06:58,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:06:58,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:06:58,739 INFO L87 Difference]: Start difference. First operand 63 states and 85 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 17:06:58,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:06:58,756 INFO L93 Difference]: Finished difference Result 90 states and 117 transitions. [2022-11-25 17:06:58,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:06:58,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2022-11-25 17:06:58,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:06:58,759 INFO L225 Difference]: With dead ends: 90 [2022-11-25 17:06:58,759 INFO L226 Difference]: Without dead ends: 63 [2022-11-25 17:06:58,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:06:58,763 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 1 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 151 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-11-25 17:06:58,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 151 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:06:58,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-25 17:06:58,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-11-25 17:06:58,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 56 states have internal predecessors, (62), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-25 17:06:58,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 84 transitions. [2022-11-25 17:06:58,777 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 84 transitions. Word has length 36 [2022-11-25 17:06:58,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:06:58,778 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 84 transitions. [2022-11-25 17:06:58,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 17:06:58,778 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 84 transitions. [2022-11-25 17:06:58,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-25 17:06:58,785 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:06:58,785 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:06:58,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 17:06:58,785 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 17:06:58,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:06:58,786 INFO L85 PathProgramCache]: Analyzing trace with hash 2019412551, now seen corresponding path program 1 times [2022-11-25 17:06:58,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:06:58,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792205396] [2022-11-25 17:06:58,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:06:58,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:06:58,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:58,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:06:58,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:58,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:06:58,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:58,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-25 17:06:58,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:58,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 17:06:58,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:58,870 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-25 17:06:58,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:06:58,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792205396] [2022-11-25 17:06:58,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792205396] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:06:58,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:06:58,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:06:58,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776918587] [2022-11-25 17:06:58,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:06:58,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:06:58,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:06:58,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:06:58,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:06:58,873 INFO L87 Difference]: Start difference. First operand 63 states and 84 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 17:06:58,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:06:58,882 INFO L93 Difference]: Finished difference Result 84 states and 109 transitions. [2022-11-25 17:06:58,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:06:58,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2022-11-25 17:06:58,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:06:58,884 INFO L225 Difference]: With dead ends: 84 [2022-11-25 17:06:58,884 INFO L226 Difference]: Without dead ends: 56 [2022-11-25 17:06:58,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:06:58,885 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 143 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-11-25 17:06:58,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 143 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:06:58,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-11-25 17:06:58,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-11-25 17:06:58,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 50 states have internal predecessors, (54), 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-11-25 17:06:58,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 74 transitions. [2022-11-25 17:06:58,891 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 74 transitions. Word has length 40 [2022-11-25 17:06:58,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:06:58,891 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 74 transitions. [2022-11-25 17:06:58,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 17:06:58,892 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 74 transitions. [2022-11-25 17:06:58,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-25 17:06:58,893 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:06:58,893 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:06:58,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 17:06:58,893 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-11-25 17:06:58,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:06:58,894 INFO L85 PathProgramCache]: Analyzing trace with hash 763162534, now seen corresponding path program 1 times [2022-11-25 17:06:58,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:06:58,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056794868] [2022-11-25 17:06:58,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:06:58,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:06:58,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:58,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:06:58,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:58,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:06:58,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:58,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-25 17:06:58,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:58,956 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 17:06:58,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:06:58,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056794868] [2022-11-25 17:06:58,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056794868] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:06:58,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:06:58,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:06:58,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925994471] [2022-11-25 17:06:58,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:06:58,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:06:58,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:06:58,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:06:58,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:06:58,959 INFO L87 Difference]: Start difference. First operand 56 states and 74 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 17:06:58,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:06:58,967 INFO L93 Difference]: Finished difference Result 71 states and 91 transitions. [2022-11-25 17:06:58,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:06:58,967 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2022-11-25 17:06:58,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:06:58,968 INFO L225 Difference]: With dead ends: 71 [2022-11-25 17:06:58,968 INFO L226 Difference]: Without dead ends: 54 [2022-11-25 17:06:58,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:06:58,969 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 3 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 130 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-11-25 17:06:58,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 130 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:06:58,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-11-25 17:06:58,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-11-25 17:06:58,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 47 states have internal predecessors, (51), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-25 17:06:58,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2022-11-25 17:06:58,975 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 42 [2022-11-25 17:06:58,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:06:58,975 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2022-11-25 17:06:58,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 17:06:58,976 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2022-11-25 17:06:58,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-25 17:06:58,976 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:06:58,977 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:06:58,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 17:06:58,977 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-11-25 17:06:58,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:06:58,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1582332810, now seen corresponding path program 1 times [2022-11-25 17:06:58,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:06:58,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875320642] [2022-11-25 17:06:58,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:06:58,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:06:58,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:59,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:06:59,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:59,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:06:59,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:59,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-25 17:06:59,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:59,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 17:06:59,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:59,076 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 17:06:59,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:06:59,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875320642] [2022-11-25 17:06:59,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875320642] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:06:59,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:06:59,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:06:59,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101951151] [2022-11-25 17:06:59,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:06:59,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:06:59,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:06:59,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:06:59,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:06:59,079 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 17:06:59,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:06:59,098 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2022-11-25 17:06:59,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:06:59,098 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 47 [2022-11-25 17:06:59,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:06:59,099 INFO L225 Difference]: With dead ends: 60 [2022-11-25 17:06:59,099 INFO L226 Difference]: Without dead ends: 54 [2022-11-25 17:06:59,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:06:59,100 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 3 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 197 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-11-25 17:06:59,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 197 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:06:59,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-11-25 17:06:59,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-11-25 17:06:59,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 47 states have internal predecessors, (50), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-25 17:06:59,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 68 transitions. [2022-11-25 17:06:59,105 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 68 transitions. Word has length 47 [2022-11-25 17:06:59,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:06:59,106 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 68 transitions. [2022-11-25 17:06:59,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 17:06:59,106 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 68 transitions. [2022-11-25 17:06:59,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-25 17:06:59,107 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:06:59,107 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:06:59,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 17:06:59,107 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 17:06:59,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:06:59,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1809461544, now seen corresponding path program 1 times [2022-11-25 17:06:59,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:06:59,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874515067] [2022-11-25 17:06:59,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:06:59,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:06:59,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:59,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:06:59,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:59,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:06:59,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:59,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-25 17:06:59,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:59,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 17:06:59,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:59,189 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 17:06:59,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:06:59,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874515067] [2022-11-25 17:06:59,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874515067] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:06:59,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:06:59,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:06:59,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87385547] [2022-11-25 17:06:59,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:06:59,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:06:59,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:06:59,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:06:59,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:06:59,192 INFO L87 Difference]: Start difference. First operand 54 states and 68 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 17:06:59,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:06:59,196 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2022-11-25 17:06:59,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:06:59,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 48 [2022-11-25 17:06:59,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:06:59,197 INFO L225 Difference]: With dead ends: 58 [2022-11-25 17:06:59,197 INFO L226 Difference]: Without dead ends: 0 [2022-11-25 17:06:59,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:06:59,198 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 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-11-25 17:06:59,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:06:59,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-25 17:06:59,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-25 17:06:59,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:06:59,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-25 17:06:59,200 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2022-11-25 17:06:59,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:06:59,200 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-25 17:06:59,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 17:06:59,201 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-25 17:06:59,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-25 17:06:59,204 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-11-25 17:06:59,204 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-11-25 17:06:59,204 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-11-25 17:06:59,205 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-11-25 17:06:59,205 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-11-25 17:06:59,205 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-11-25 17:06:59,205 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-11-25 17:06:59,206 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-11-25 17:06:59,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 17:06:59,208 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-25 17:06:59,285 INFO L902 garLoopResultBuilder]: At program point printLineENTRY(lines 1412 1418) the Hoare annotation is: true [2022-11-25 17:06:59,285 INFO L899 garLoopResultBuilder]: For program point printLineEXIT(lines 1412 1418) no Hoare annotation was computed. [2022-11-25 17:06:59,285 INFO L899 garLoopResultBuilder]: For program point L1414(lines 1414 1417) no Hoare annotation was computed. [2022-11-25 17:06:59,285 INFO L899 garLoopResultBuilder]: For program point L1414-2(lines 1412 1418) no Hoare annotation was computed. [2022-11-25 17:06:59,285 INFO L899 garLoopResultBuilder]: For program point printIntLineEXIT(lines 1426 1429) no Hoare annotation was computed. [2022-11-25 17:06:59,286 INFO L902 garLoopResultBuilder]: At program point printIntLineENTRY(lines 1426 1429) the Hoare annotation is: true [2022-11-25 17:06:59,286 INFO L899 garLoopResultBuilder]: For program point printIntLineFINAL(lines 1426 1429) no Hoare annotation was computed. [2022-11-25 17:06:59,286 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1598) no Hoare annotation was computed. [2022-11-25 17:06:59,286 INFO L902 garLoopResultBuilder]: At program point L1662(line 1662) the Hoare annotation is: true [2022-11-25 17:06:59,286 INFO L899 garLoopResultBuilder]: For program point L1629(line 1629) no Hoare annotation was computed. [2022-11-25 17:06:59,287 INFO L899 garLoopResultBuilder]: For program point L1596(lines 1596 1605) no Hoare annotation was computed. [2022-11-25 17:06:59,287 INFO L899 garLoopResultBuilder]: For program point L1629-1(line 1629) no Hoare annotation was computed. [2022-11-25 17:06:59,287 INFO L899 garLoopResultBuilder]: For program point L1563(line 1563) no Hoare annotation was computed. [2022-11-25 17:06:59,287 INFO L899 garLoopResultBuilder]: For program point L1654(line 1654) no Hoare annotation was computed. [2022-11-25 17:06:59,287 INFO L899 garLoopResultBuilder]: For program point L1621(line 1621) no Hoare annotation was computed. [2022-11-25 17:06:59,287 INFO L902 garLoopResultBuilder]: At program point L1679(lines 1673 1680) the Hoare annotation is: true [2022-11-25 17:06:59,288 INFO L899 garLoopResultBuilder]: For program point L1580(lines 1580 1611) no Hoare annotation was computed. [2022-11-25 17:06:59,288 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1656) no Hoare annotation was computed. [2022-11-25 17:06:59,288 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1569) no Hoare annotation was computed. [2022-11-25 17:06:59,288 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-25 17:06:59,288 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-25 17:06:59,289 INFO L895 garLoopResultBuilder]: At program point L1564(line 1564) the Hoare annotation is: false [2022-11-25 17:06:59,289 INFO L899 garLoopResultBuilder]: For program point L1589(line 1589) no Hoare annotation was computed. [2022-11-25 17:06:59,289 INFO L899 garLoopResultBuilder]: For program point L1548(lines 1548 1579) no Hoare annotation was computed. [2022-11-25 17:06:59,289 INFO L899 garLoopResultBuilder]: For program point L1639(lines 1639 1665) no Hoare annotation was computed. [2022-11-25 17:06:59,289 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1569) no Hoare annotation was computed. [2022-11-25 17:06:59,290 INFO L895 garLoopResultBuilder]: At program point L1631(line 1631) the Hoare annotation is: |ULTIMATE.start_goodG2B1_#t~switch107#1| [2022-11-25 17:06:59,290 INFO L899 garLoopResultBuilder]: For program point L1598(line 1598) no Hoare annotation was computed. [2022-11-25 17:06:59,290 INFO L899 garLoopResultBuilder]: For program point L1598-1(line 1598) no Hoare annotation was computed. [2022-11-25 17:06:59,290 INFO L899 garLoopResultBuilder]: For program point L1656(line 1656) no Hoare annotation was computed. [2022-11-25 17:06:59,290 INFO L899 garLoopResultBuilder]: For program point L1656-1(line 1656) no Hoare annotation was computed. [2022-11-25 17:06:59,291 INFO L895 garLoopResultBuilder]: At program point L1590(line 1590) the Hoare annotation is: (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_goodB2G2_~#data~1#1.base|) |ULTIMATE.start_goodB2G2_~#data~1#1.offset|) 2147483648)) [2022-11-25 17:06:59,291 INFO L899 garLoopResultBuilder]: For program point L1557(line 1557) no Hoare annotation was computed. [2022-11-25 17:06:59,291 INFO L899 garLoopResultBuilder]: For program point L1648(line 1648) no Hoare annotation was computed. [2022-11-25 17:06:59,291 INFO L899 garLoopResultBuilder]: For program point L1607(line 1607) no Hoare annotation was computed. [2022-11-25 17:06:59,291 INFO L899 garLoopResultBuilder]: For program point L1566(line 1566) no Hoare annotation was computed. [2022-11-25 17:06:59,291 INFO L895 garLoopResultBuilder]: At program point L1558(line 1558) the Hoare annotation is: (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_goodB2G1_~#data~0#1.base|) |ULTIMATE.start_goodB2G1_~#data~0#1.offset|) 2147483648)) [2022-11-25 17:06:59,292 INFO L895 garLoopResultBuilder]: At program point L1649(line 1649) the Hoare annotation is: false [2022-11-25 17:06:59,292 INFO L895 garLoopResultBuilder]: At program point L1616(lines 1616 1624) the Hoare annotation is: (and (= 2 |ULTIMATE.start_goodG2B1_~data~2#1|) |ULTIMATE.start_goodG2B1_#t~switch106#1|) [2022-11-25 17:06:59,292 INFO L895 garLoopResultBuilder]: At program point L1608(line 1608) the Hoare annotation is: false [2022-11-25 17:06:59,292 INFO L895 garLoopResultBuilder]: At program point L1575(line 1575) the Hoare annotation is: (and (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_goodB2G1_~#data~0#1.base|) |ULTIMATE.start_goodB2G1_~#data~0#1.offset|) 2147483648)) |ULTIMATE.start_goodB2G1_#t~switch94#1|) [2022-11-25 17:06:59,292 INFO L899 garLoopResultBuilder]: For program point L1666(lines 1666 1672) no Hoare annotation was computed. [2022-11-25 17:06:59,293 INFO L895 garLoopResultBuilder]: At program point L1600(line 1600) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch101#1| (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_goodB2G2_~#data~1#1.base|) |ULTIMATE.start_goodB2G2_~#data~1#1.offset|) 2147483648))) [2022-11-25 17:06:59,293 INFO L899 garLoopResultBuilder]: For program point L1567(lines 1567 1576) no Hoare annotation was computed. [2022-11-25 17:06:59,293 INFO L902 garLoopResultBuilder]: At program point L1658(line 1658) the Hoare annotation is: true [2022-11-25 17:06:59,293 INFO L895 garLoopResultBuilder]: At program point L1625(lines 1625 1637) the Hoare annotation is: |ULTIMATE.start_goodG2B1_#t~switch107#1| [2022-11-25 17:06:59,293 INFO L895 garLoopResultBuilder]: At program point L1584(lines 1584 1592) the Hoare annotation is: (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_goodB2G2_~#data~1#1.base|) |ULTIMATE.start_goodB2G2_~#data~1#1.offset|) 2147483648)) [2022-11-25 17:06:59,294 INFO L899 garLoopResultBuilder]: For program point L1634(line 1634) no Hoare annotation was computed. [2022-11-25 17:06:59,294 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-25 17:06:59,294 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1629) no Hoare annotation was computed. [2022-11-25 17:06:59,294 INFO L895 garLoopResultBuilder]: At program point L1593(lines 1593 1610) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch101#1| (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_goodB2G2_~#data~1#1.base|) |ULTIMATE.start_goodB2G2_~#data~1#1.offset|) 2147483648))) [2022-11-25 17:06:59,294 INFO L899 garLoopResultBuilder]: For program point L1618(line 1618) no Hoare annotation was computed. [2022-11-25 17:06:59,295 INFO L895 garLoopResultBuilder]: At program point L1552(lines 1552 1560) the Hoare annotation is: (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_goodB2G1_~#data~0#1.base|) |ULTIMATE.start_goodB2G1_~#data~0#1.offset|) 2147483648)) [2022-11-25 17:06:59,295 INFO L902 garLoopResultBuilder]: At program point L1676(line 1676) the Hoare annotation is: true [2022-11-25 17:06:59,295 INFO L899 garLoopResultBuilder]: For program point L1676-1(line 1676) no Hoare annotation was computed. [2022-11-25 17:06:59,295 INFO L895 garLoopResultBuilder]: At program point L1643(lines 1643 1651) the Hoare annotation is: (= |ULTIMATE.start_goodG2B2_~data~3#1| 2) [2022-11-25 17:06:59,295 INFO L895 garLoopResultBuilder]: At program point L1635(line 1635) the Hoare annotation is: false [2022-11-25 17:06:59,296 INFO L899 garLoopResultBuilder]: For program point L1569(line 1569) no Hoare annotation was computed. [2022-11-25 17:06:59,296 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-25 17:06:59,296 INFO L899 garLoopResultBuilder]: For program point L1569-1(line 1569) no Hoare annotation was computed. [2022-11-25 17:06:59,296 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1629) no Hoare annotation was computed. [2022-11-25 17:06:59,296 INFO L899 garLoopResultBuilder]: For program point L1627(line 1627) no Hoare annotation was computed. [2022-11-25 17:06:59,296 INFO L895 garLoopResultBuilder]: At program point L1561(lines 1561 1578) the Hoare annotation is: (and (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_goodB2G1_~#data~0#1.base|) |ULTIMATE.start_goodB2G1_~#data~0#1.offset|) 2147483648)) |ULTIMATE.start_goodB2G1_#t~switch94#1|) [2022-11-25 17:06:59,297 INFO L902 garLoopResultBuilder]: At program point L1652(lines 1652 1664) the Hoare annotation is: true [2022-11-25 17:06:59,297 INFO L895 garLoopResultBuilder]: At program point L1619(line 1619) the Hoare annotation is: false [2022-11-25 17:06:59,297 INFO L899 garLoopResultBuilder]: For program point L1586(line 1586) no Hoare annotation was computed. [2022-11-25 17:06:59,297 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1598) no Hoare annotation was computed. [2022-11-25 17:06:59,297 INFO L899 garLoopResultBuilder]: For program point L1661(line 1661) no Hoare annotation was computed. [2022-11-25 17:06:59,298 INFO L899 garLoopResultBuilder]: For program point L1595(line 1595) no Hoare annotation was computed. [2022-11-25 17:06:59,298 INFO L899 garLoopResultBuilder]: For program point L1554(line 1554) no Hoare annotation was computed. [2022-11-25 17:06:59,298 INFO L902 garLoopResultBuilder]: At program point L1678(line 1678) the Hoare annotation is: true [2022-11-25 17:06:59,298 INFO L899 garLoopResultBuilder]: For program point L1645(line 1645) no Hoare annotation was computed. [2022-11-25 17:06:59,298 INFO L899 garLoopResultBuilder]: For program point L1678-1(line 1678) no Hoare annotation was computed. [2022-11-25 17:06:59,298 INFO L899 garLoopResultBuilder]: For program point L1612(lines 1612 1638) no Hoare annotation was computed. [2022-11-25 17:06:59,299 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1656) no Hoare annotation was computed. [2022-11-25 17:06:59,299 INFO L895 garLoopResultBuilder]: At program point L1604(line 1604) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch101#1| (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_goodB2G2_~#data~1#1.base|) |ULTIMATE.start_goodB2G2_~#data~1#1.offset|) 2147483648))) [2022-11-25 17:06:59,299 INFO L895 garLoopResultBuilder]: At program point L1571(line 1571) the Hoare annotation is: (and (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_goodB2G1_~#data~0#1.base|) |ULTIMATE.start_goodB2G1_~#data~0#1.offset|) 2147483648)) |ULTIMATE.start_goodB2G1_#t~switch94#1|) [2022-11-25 17:06:59,303 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:06:59,305 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 17:06:59,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:06:59 BoogieIcfgContainer [2022-11-25 17:06:59,324 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 17:06:59,325 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 17:06:59,325 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 17:06:59,325 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 17:06:59,326 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:06:56" (3/4) ... [2022-11-25 17:06:59,329 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-25 17:06:59,336 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2022-11-25 17:06:59,337 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2022-11-25 17:06:59,343 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2022-11-25 17:06:59,343 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2022-11-25 17:06:59,344 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-25 17:06:59,344 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 17:06:59,344 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 17:06:59,393 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb20ae6-f38d-4296-a7e7-869d4a422e67/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 17:06:59,393 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 17:06:59,394 INFO L158 Benchmark]: Toolchain (without parser) took 5051.13ms. Allocated memory was 174.1MB in the beginning and 216.0MB in the end (delta: 41.9MB). Free memory was 141.4MB in the beginning and 160.7MB in the end (delta: -19.3MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. [2022-11-25 17:06:59,394 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 121.6MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:06:59,395 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1335.01ms. Allocated memory is still 174.1MB. Free memory was 141.0MB in the beginning and 138.9MB in the end (delta: 2.1MB). Peak memory consumption was 71.7MB. Max. memory is 16.1GB. [2022-11-25 17:06:59,395 INFO L158 Benchmark]: Boogie Procedure Inliner took 99.90ms. Allocated memory is still 174.1MB. Free memory was 138.9MB in the beginning and 136.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:06:59,395 INFO L158 Benchmark]: Boogie Preprocessor took 29.98ms. Allocated memory is still 174.1MB. Free memory was 136.0MB in the beginning and 133.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:06:59,396 INFO L158 Benchmark]: RCFGBuilder took 582.17ms. Allocated memory is still 174.1MB. Free memory was 133.9MB in the beginning and 115.9MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-25 17:06:59,396 INFO L158 Benchmark]: TraceAbstraction took 2928.14ms. Allocated memory was 174.1MB in the beginning and 216.0MB in the end (delta: 41.9MB). Free memory was 115.1MB in the beginning and 164.9MB in the end (delta: -49.8MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:06:59,397 INFO L158 Benchmark]: Witness Printer took 68.75ms. Allocated memory is still 216.0MB. Free memory was 164.9MB in the beginning and 160.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 17:06:59,398 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.21ms. Allocated memory is still 121.6MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1335.01ms. Allocated memory is still 174.1MB. Free memory was 141.0MB in the beginning and 138.9MB in the end (delta: 2.1MB). Peak memory consumption was 71.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 99.90ms. Allocated memory is still 174.1MB. Free memory was 138.9MB in the beginning and 136.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.98ms. Allocated memory is still 174.1MB. Free memory was 136.0MB in the beginning and 133.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 582.17ms. Allocated memory is still 174.1MB. Free memory was 133.9MB in the beginning and 115.9MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2928.14ms. Allocated memory was 174.1MB in the beginning and 216.0MB in the end (delta: 41.9MB). Free memory was 115.1MB in the beginning and 164.9MB in the end (delta: -49.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 68.75ms. Allocated memory is still 216.0MB. Free memory was 164.9MB in the beginning and 160.7MB 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: 1569]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1569]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1598]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1598]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1629]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1629]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1656]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1656]: 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, 77 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 13, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 74 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 57 mSDsluCounter, 2424 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1399 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 129 IncrementalHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 1025 mSDtfsCounter, 129 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77occurred in iteration=0, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 13 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 27 LocationsWithAnnotation, 68 PreInvPairs, 78 NumberOfFragments, 125 HoareAnnotationTreeSize, 68 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 27 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 402 NumberOfCodeBlocks, 402 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 389 ConstructedInterpolants, 0 QuantifiedInterpolants, 487 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 100/100 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: 1616]: Loop Invariant Derived loop invariant: 2 == data && aux-switch(5) { case 6: printLine("Benign, fixed string"); break; default: data = 2; break; }-aux - InvariantResult [Line: 1652]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1673]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1561]: Loop Invariant Derived loop invariant: 0 <= unknown-#memory_int-unknown[data][data] + 2147483648 && aux-switch(8) { case 7: printLine("Benign, fixed string"); break; default: if (data < 0x7fffffff) { data++; int result = data; printIntLine(result); } else { printLine("data value is too large to perform arithmetic safely."); } break; }-aux - InvariantResult [Line: 1552]: Loop Invariant Derived loop invariant: 0 <= unknown-#memory_int-unknown[data][data] + 2147483648 - InvariantResult [Line: 1593]: Loop Invariant Derived loop invariant: aux-switch(7) { case 7: if (data < 0x7fffffff) { data++; int result = data; printIntLine(result); } else { printLine("data value is too large to perform arithmetic safely."); } break; default: printLine("Benign, fixed string"); break; }-aux && 0 <= unknown-#memory_int-unknown[data][data] + 2147483648 - InvariantResult [Line: 1643]: Loop Invariant Derived loop invariant: data == 2 - InvariantResult [Line: 1584]: Loop Invariant Derived loop invariant: 0 <= unknown-#memory_int-unknown[data][data] + 2147483648 - InvariantResult [Line: 1625]: Loop Invariant Derived loop invariant: NULL RESULT: Ultimate proved your program to be correct! [2022-11-25 17:06:59,427 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb20ae6-f38d-4296-a7e7-869d4a422e67/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE