./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_add_15_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version cf1a7837 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_a0747e29-be18-4705-b142-a2241287366f/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0747e29-be18-4705-b142-a2241287366f/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0747e29-be18-4705-b142-a2241287366f/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0747e29-be18-4705-b142-a2241287366f/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerReach.xml -i ../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_add_15_good.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0747e29-be18-4705-b142-a2241287366f/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0747e29-be18-4705-b142-a2241287366f/bin/uautomizer-verify-uTZkv6EMXl --witnessprinter.witness.filename witness --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 7a91a43dabf08728aa1c777480ae74ba97759d8b76938ed83c53d35ac672a135 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:05:16,303 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:05:16,394 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0747e29-be18-4705-b142-a2241287366f/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Overflow-64bit-Automizer_Default.epf [2023-11-12 02:05:16,401 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:05:16,402 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:05:16,435 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:05:16,435 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:05:16,436 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:05:16,437 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:05:16,438 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:05:16,439 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:05:16,439 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:05:16,440 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:05:16,441 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:05:16,441 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 02:05:16,442 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:05:16,443 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:05:16,443 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 02:05:16,444 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:05:16,445 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 02:05:16,445 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-12 02:05:16,446 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 02:05:16,447 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:05:16,447 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:05:16,448 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:05:16,449 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:05:16,449 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:05:16,450 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:05:16,450 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:05:16,451 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:05:16,451 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 02:05:16,452 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:05:16,452 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:05:16,453 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:05:16,453 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 02:05:16,454 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:05:16,454 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:05:16,454 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:05:16,455 INFO L153 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_a0747e29-be18-4705-b142-a2241287366f/bin/uautomizer-verify-uTZkv6EMXl/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_a0747e29-be18-4705-b142-a2241287366f/bin/uautomizer-verify-uTZkv6EMXl Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 7a91a43dabf08728aa1c777480ae74ba97759d8b76938ed83c53d35ac672a135 [2023-11-12 02:05:16,810 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:05:16,848 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:05:16,853 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:05:16,855 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:05:16,857 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:05:16,859 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0747e29-be18-4705-b142-a2241287366f/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_add_15_good.i [2023-11-12 02:05:20,307 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:05:20,914 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:05:20,916 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0747e29-be18-4705-b142-a2241287366f/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_add_15_good.i [2023-11-12 02:05:20,961 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0747e29-be18-4705-b142-a2241287366f/bin/uautomizer-verify-uTZkv6EMXl/data/539d8c892/3e111a1379ee4b089c989c8c08dcb5c6/FLAG9ec7016db [2023-11-12 02:05:20,982 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0747e29-be18-4705-b142-a2241287366f/bin/uautomizer-verify-uTZkv6EMXl/data/539d8c892/3e111a1379ee4b089c989c8c08dcb5c6 [2023-11-12 02:05:20,990 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:05:20,993 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:05:20,997 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:05:20,997 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:05:21,004 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:05:21,005 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:05:20" (1/1) ... [2023-11-12 02:05:21,007 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b5019a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:05:21, skipping insertion in model container [2023-11-12 02:05:21,007 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:05:20" (1/1) ... [2023-11-12 02:05:21,116 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:05:21,700 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-12 02:05:22,412 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:05:22,429 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:05:22,464 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-12 02:05:22,556 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:05:22,739 WARN L672 CHandler]: The function puts is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:05:22,739 WARN L672 CHandler]: The function __ctype_b_loc is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:05:22,740 WARN L672 CHandler]: The function iswxdigit is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:05:22,740 WARN L672 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:05:22,740 WARN L672 CHandler]: The function time is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:05:22,740 WARN L672 CHandler]: The function fgets is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:05:22,749 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:05:22,750 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:05:22 WrapperNode [2023-11-12 02:05:22,750 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:05:22,751 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:05:22,752 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:05:22,752 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:05:22,760 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:05:22" (1/1) ... [2023-11-12 02:05:22,797 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:05:22" (1/1) ... [2023-11-12 02:05:22,834 INFO L138 Inliner]: procedures = 504, calls = 99, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 180 [2023-11-12 02:05:22,838 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:05:22,839 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:05:22,839 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:05:22,839 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:05:22,848 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:05:22" (1/1) ... [2023-11-12 02:05:22,849 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:05:22" (1/1) ... [2023-11-12 02:05:22,855 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:05:22" (1/1) ... [2023-11-12 02:05:22,856 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:05:22" (1/1) ... [2023-11-12 02:05:22,866 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:05:22" (1/1) ... [2023-11-12 02:05:22,870 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:05:22" (1/1) ... [2023-11-12 02:05:22,873 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:05:22" (1/1) ... [2023-11-12 02:05:22,875 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:05:22" (1/1) ... [2023-11-12 02:05:22,880 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:05:22,881 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:05:22,881 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:05:22,882 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:05:22,882 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:05:22" (1/1) ... [2023-11-12 02:05:22,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:05:22,921 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0747e29-be18-4705-b142-a2241287366f/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:05:22,942 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0747e29-be18-4705-b142-a2241287366f/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 02:05:22,965 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0747e29-be18-4705-b142-a2241287366f/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 02:05:22,982 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2023-11-12 02:05:22,982 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2023-11-12 02:05:22,983 INFO L130 BoogieDeclarations]: Found specification of procedure fgets [2023-11-12 02:05:22,983 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2023-11-12 02:05:22,983 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2023-11-12 02:05:22,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 02:05:22,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2023-11-12 02:05:22,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:05:22,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:05:22,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:05:22,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 02:05:22,987 INFO L130 BoogieDeclarations]: Found specification of procedure time [2023-11-12 02:05:22,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:05:23,144 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:05:23,145 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:05:23,383 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:05:23,391 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:05:23,391 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-12 02:05:23,393 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:05:23 BoogieIcfgContainer [2023-11-12 02:05:23,396 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:05:23,399 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:05:23,400 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:05:23,404 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:05:23,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:05:20" (1/3) ... [2023-11-12 02:05:23,405 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27803de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:05:23, skipping insertion in model container [2023-11-12 02:05:23,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:05:22" (2/3) ... [2023-11-12 02:05:23,405 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27803de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:05:23, skipping insertion in model container [2023-11-12 02:05:23,406 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:05:23" (3/3) ... [2023-11-12 02:05:23,407 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_add_15_good.i [2023-11-12 02:05:23,431 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:05:23,432 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-11-12 02:05:23,487 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:05:23,494 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=LoopHeads, 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;@733677ec, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:05:23,495 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2023-11-12 02:05:23,499 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 58 states have (on average 1.5) internal successors, (87), 78 states have internal predecessors, (87), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-12 02:05:23,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-12 02:05:23,508 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:05:23,509 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:05:23,509 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)] === [2023-11-12 02:05:23,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:05:23,515 INFO L85 PathProgramCache]: Analyzing trace with hash -2099148827, now seen corresponding path program 1 times [2023-11-12 02:05:23,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:05:23,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116441677] [2023-11-12 02:05:23,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:05:23,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:05:23,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:23,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:05:23,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:23,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:05:23,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:05:23,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116441677] [2023-11-12 02:05:23,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116441677] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:05:23,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:05:23,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:05:23,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206773991] [2023-11-12 02:05:23,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:05:23,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:05:23,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:05:23,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:05:23,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:05:23,981 INFO L87 Difference]: Start difference. First operand has 87 states, 58 states have (on average 1.5) internal successors, (87), 78 states have internal predecessors, (87), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-12 02:05:24,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:05:24,073 INFO L93 Difference]: Finished difference Result 164 states and 230 transitions. [2023-11-12 02:05:24,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:05:24,077 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2023-11-12 02:05:24,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:05:24,088 INFO L225 Difference]: With dead ends: 164 [2023-11-12 02:05:24,089 INFO L226 Difference]: Without dead ends: 73 [2023-11-12 02:05:24,094 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 [2023-11-12 02:05:24,099 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 4 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 227 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 [2023-11-12 02:05:24,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 227 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:05:24,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-11-12 02:05:24,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2023-11-12 02:05:24,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 49 states have (on average 1.489795918367347) internal successors, (73), 66 states have internal predecessors, (73), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-12 02:05:24,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 101 transitions. [2023-11-12 02:05:24,166 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 101 transitions. Word has length 15 [2023-11-12 02:05:24,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:05:24,168 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 101 transitions. [2023-11-12 02:05:24,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-12 02:05:24,168 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 101 transitions. [2023-11-12 02:05:24,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-12 02:05:24,170 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:05:24,170 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:05:24,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:05:24,171 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-12 02:05:24,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:05:24,172 INFO L85 PathProgramCache]: Analyzing trace with hash 158090797, now seen corresponding path program 1 times [2023-11-12 02:05:24,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:05:24,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121692264] [2023-11-12 02:05:24,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:05:24,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:05:24,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:24,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:05:24,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:24,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:05:24,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:05:24,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121692264] [2023-11-12 02:05:24,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121692264] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:05:24,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:05:24,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:05:24,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461440388] [2023-11-12 02:05:24,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:05:24,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:05:24,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:05:24,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:05:24,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:05:24,342 INFO L87 Difference]: Start difference. First operand 73 states and 101 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-12 02:05:24,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:05:24,384 INFO L93 Difference]: Finished difference Result 73 states and 101 transitions. [2023-11-12 02:05:24,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:05:24,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2023-11-12 02:05:24,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:05:24,386 INFO L225 Difference]: With dead ends: 73 [2023-11-12 02:05:24,387 INFO L226 Difference]: Without dead ends: 72 [2023-11-12 02:05:24,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:05:24,389 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 10 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:05:24,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 173 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:05:24,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-11-12 02:05:24,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2023-11-12 02:05:24,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 49 states have (on average 1.469387755102041) internal successors, (72), 65 states have internal predecessors, (72), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-12 02:05:24,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 100 transitions. [2023-11-12 02:05:24,403 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 100 transitions. Word has length 16 [2023-11-12 02:05:24,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:05:24,404 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 100 transitions. [2023-11-12 02:05:24,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-12 02:05:24,404 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 100 transitions. [2023-11-12 02:05:24,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-12 02:05:24,406 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:05:24,406 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:05:24,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:05:24,406 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-12 02:05:24,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:05:24,407 INFO L85 PathProgramCache]: Analyzing trace with hash 605847492, now seen corresponding path program 1 times [2023-11-12 02:05:24,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:05:24,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391810812] [2023-11-12 02:05:24,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:05:24,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:05:24,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:24,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:05:24,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:24,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:05:24,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:05:24,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391810812] [2023-11-12 02:05:24,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391810812] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:05:24,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:05:24,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:05:24,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30362284] [2023-11-12 02:05:24,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:05:24,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:05:24,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:05:24,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:05:24,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:05:24,497 INFO L87 Difference]: Start difference. First operand 72 states and 100 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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) [2023-11-12 02:05:24,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:05:24,529 INFO L93 Difference]: Finished difference Result 134 states and 186 transitions. [2023-11-12 02:05:24,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:05:24,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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 17 [2023-11-12 02:05:24,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:05:24,532 INFO L225 Difference]: With dead ends: 134 [2023-11-12 02:05:24,532 INFO L226 Difference]: Without dead ends: 79 [2023-11-12 02:05:24,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:05:24,535 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 11 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:05:24,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 195 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:05:24,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-11-12 02:05:24,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2023-11-12 02:05:24,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 68 states have internal predecessors, (78), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-12 02:05:24,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 106 transitions. [2023-11-12 02:05:24,550 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 106 transitions. Word has length 17 [2023-11-12 02:05:24,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:05:24,550 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 106 transitions. [2023-11-12 02:05:24,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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) [2023-11-12 02:05:24,551 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 106 transitions. [2023-11-12 02:05:24,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-12 02:05:24,552 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:05:24,553 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:05:24,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 02:05:24,553 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)] === [2023-11-12 02:05:24,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:05:24,554 INFO L85 PathProgramCache]: Analyzing trace with hash -2025589241, now seen corresponding path program 1 times [2023-11-12 02:05:24,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:05:24,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213816972] [2023-11-12 02:05:24,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:05:24,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:05:24,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:24,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:05:24,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:24,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:05:24,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:05:24,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213816972] [2023-11-12 02:05:24,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213816972] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:05:24,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:05:24,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:05:24,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799870793] [2023-11-12 02:05:24,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:05:24,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:05:24,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:05:24,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:05:24,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:05:24,622 INFO L87 Difference]: Start difference. First operand 76 states and 106 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (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) [2023-11-12 02:05:24,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:05:24,643 INFO L93 Difference]: Finished difference Result 129 states and 178 transitions. [2023-11-12 02:05:24,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:05:24,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2023-11-12 02:05:24,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:05:24,650 INFO L225 Difference]: With dead ends: 129 [2023-11-12 02:05:24,651 INFO L226 Difference]: Without dead ends: 76 [2023-11-12 02:05:24,651 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 [2023-11-12 02:05:24,653 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 6 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:05:24,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 180 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:05:24,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-11-12 02:05:24,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2023-11-12 02:05:24,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 68 states have internal predecessors, (76), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-12 02:05:24,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 104 transitions. [2023-11-12 02:05:24,675 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 104 transitions. Word has length 22 [2023-11-12 02:05:24,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:05:24,676 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 104 transitions. [2023-11-12 02:05:24,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (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) [2023-11-12 02:05:24,677 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 104 transitions. [2023-11-12 02:05:24,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-12 02:05:24,679 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:05:24,680 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] [2023-11-12 02:05:24,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 02:05:24,680 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)] === [2023-11-12 02:05:24,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:05:24,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1453989776, now seen corresponding path program 1 times [2023-11-12 02:05:24,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:05:24,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119563346] [2023-11-12 02:05:24,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:05:24,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:05:24,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:24,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:05:24,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:24,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-12 02:05:24,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:24,792 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-12 02:05:24,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:05:24,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119563346] [2023-11-12 02:05:24,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119563346] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:05:24,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:05:24,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:05:24,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115876255] [2023-11-12 02:05:24,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:05:24,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:05:24,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:05:24,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:05:24,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:05:24,796 INFO L87 Difference]: Start difference. First operand 76 states and 104 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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) [2023-11-12 02:05:24,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:05:24,817 INFO L93 Difference]: Finished difference Result 129 states and 176 transitions. [2023-11-12 02:05:24,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:05:24,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 26 [2023-11-12 02:05:24,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:05:24,820 INFO L225 Difference]: With dead ends: 129 [2023-11-12 02:05:24,820 INFO L226 Difference]: Without dead ends: 75 [2023-11-12 02:05:24,821 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 [2023-11-12 02:05:24,823 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:05:24,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 183 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:05:24,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-11-12 02:05:24,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2023-11-12 02:05:24,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 67 states have internal predecessors, (74), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-12 02:05:24,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 100 transitions. [2023-11-12 02:05:24,836 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 100 transitions. Word has length 26 [2023-11-12 02:05:24,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:05:24,837 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 100 transitions. [2023-11-12 02:05:24,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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) [2023-11-12 02:05:24,837 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 100 transitions. [2023-11-12 02:05:24,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-12 02:05:24,839 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:05:24,839 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] [2023-11-12 02:05:24,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 02:05:24,840 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-12 02:05:24,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:05:24,841 INFO L85 PathProgramCache]: Analyzing trace with hash -780296502, now seen corresponding path program 1 times [2023-11-12 02:05:24,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:05:24,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048619906] [2023-11-12 02:05:24,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:05:24,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:05:24,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:24,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:05:24,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:24,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-12 02:05:24,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:24,906 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-12 02:05:24,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:05:24,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048619906] [2023-11-12 02:05:24,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048619906] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:05:24,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:05:24,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:05:24,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051579165] [2023-11-12 02:05:24,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:05:24,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:05:24,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:05:24,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:05:24,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:05:24,910 INFO L87 Difference]: Start difference. First operand 75 states and 100 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-12 02:05:24,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:05:24,926 INFO L93 Difference]: Finished difference Result 120 states and 159 transitions. [2023-11-12 02:05:24,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:05:24,926 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2023-11-12 02:05:24,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:05:24,928 INFO L225 Difference]: With dead ends: 120 [2023-11-12 02:05:24,928 INFO L226 Difference]: Without dead ends: 73 [2023-11-12 02:05:24,929 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 [2023-11-12 02:05:24,931 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 4 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 171 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 [2023-11-12 02:05:24,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 171 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:05:24,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-11-12 02:05:24,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2023-11-12 02:05:24,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 65 states have internal predecessors, (71), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-12 02:05:24,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 95 transitions. [2023-11-12 02:05:24,943 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 95 transitions. Word has length 28 [2023-11-12 02:05:24,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:05:24,943 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 95 transitions. [2023-11-12 02:05:24,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-12 02:05:24,944 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 95 transitions. [2023-11-12 02:05:24,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-12 02:05:24,945 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:05:24,946 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] [2023-11-12 02:05:24,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 02:05:24,946 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-12 02:05:24,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:05:24,947 INFO L85 PathProgramCache]: Analyzing trace with hash 914003627, now seen corresponding path program 1 times [2023-11-12 02:05:24,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:05:24,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764380593] [2023-11-12 02:05:24,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:05:24,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:05:24,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:25,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:05:25,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:25,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-12 02:05:25,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:25,049 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-12 02:05:25,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:05:25,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764380593] [2023-11-12 02:05:25,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764380593] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:05:25,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:05:25,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:05:25,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685068956] [2023-11-12 02:05:25,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:05:25,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:05:25,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:05:25,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:05:25,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:05:25,057 INFO L87 Difference]: Start difference. First operand 73 states and 95 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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) [2023-11-12 02:05:25,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:05:25,091 INFO L93 Difference]: Finished difference Result 73 states and 95 transitions. [2023-11-12 02:05:25,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:05:25,092 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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 29 [2023-11-12 02:05:25,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:05:25,095 INFO L225 Difference]: With dead ends: 73 [2023-11-12 02:05:25,096 INFO L226 Difference]: Without dead ends: 72 [2023-11-12 02:05:25,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:05:25,100 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 11 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:05:25,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 151 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:05:25,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-11-12 02:05:25,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2023-11-12 02:05:25,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 53 states have (on average 1.320754716981132) internal successors, (70), 64 states have internal predecessors, (70), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-12 02:05:25,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 94 transitions. [2023-11-12 02:05:25,122 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 94 transitions. Word has length 29 [2023-11-12 02:05:25,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:05:25,124 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 94 transitions. [2023-11-12 02:05:25,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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) [2023-11-12 02:05:25,125 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 94 transitions. [2023-11-12 02:05:25,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-12 02:05:25,130 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:05:25,130 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] [2023-11-12 02:05:25,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 02:05:25,132 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-12 02:05:25,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:05:25,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1730658511, now seen corresponding path program 1 times [2023-11-12 02:05:25,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:05:25,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545603334] [2023-11-12 02:05:25,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:05:25,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:05:25,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:25,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:05:25,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:25,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-12 02:05:25,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:25,249 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-12 02:05:25,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:05:25,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545603334] [2023-11-12 02:05:25,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545603334] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:05:25,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:05:25,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:05:25,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772238382] [2023-11-12 02:05:25,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:05:25,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:05:25,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:05:25,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:05:25,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:05:25,254 INFO L87 Difference]: Start difference. First operand 72 states and 94 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 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) [2023-11-12 02:05:25,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:05:25,291 INFO L93 Difference]: Finished difference Result 114 states and 149 transitions. [2023-11-12 02:05:25,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:05:25,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 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 30 [2023-11-12 02:05:25,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:05:25,296 INFO L225 Difference]: With dead ends: 114 [2023-11-12 02:05:25,296 INFO L226 Difference]: Without dead ends: 79 [2023-11-12 02:05:25,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:05:25,302 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 11 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:05:25,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 173 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:05:25,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-11-12 02:05:25,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2023-11-12 02:05:25,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 66 states have internal predecessors, (74), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-12 02:05:25,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 98 transitions. [2023-11-12 02:05:25,328 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 98 transitions. Word has length 30 [2023-11-12 02:05:25,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:05:25,329 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 98 transitions. [2023-11-12 02:05:25,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 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) [2023-11-12 02:05:25,329 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 98 transitions. [2023-11-12 02:05:25,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-12 02:05:25,334 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:05:25,335 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:05:25,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-12 02:05:25,342 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)] === [2023-11-12 02:05:25,343 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:05:25,343 INFO L85 PathProgramCache]: Analyzing trace with hash -532661722, now seen corresponding path program 1 times [2023-11-12 02:05:25,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:05:25,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156240009] [2023-11-12 02:05:25,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:05:25,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:05:25,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:25,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:05:25,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:25,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-12 02:05:25,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:25,426 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-12 02:05:25,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:05:25,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156240009] [2023-11-12 02:05:25,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156240009] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:05:25,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:05:25,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:05:25,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035894375] [2023-11-12 02:05:25,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:05:25,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:05:25,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:05:25,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:05:25,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:05:25,429 INFO L87 Difference]: Start difference. First operand 75 states and 98 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (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) [2023-11-12 02:05:25,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:05:25,447 INFO L93 Difference]: Finished difference Result 108 states and 139 transitions. [2023-11-12 02:05:25,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:05:25,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (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 35 [2023-11-12 02:05:25,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:05:25,449 INFO L225 Difference]: With dead ends: 108 [2023-11-12 02:05:25,449 INFO L226 Difference]: Without dead ends: 73 [2023-11-12 02:05:25,450 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 [2023-11-12 02:05:25,451 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 6 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 153 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 [2023-11-12 02:05:25,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 153 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:05:25,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-11-12 02:05:25,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2023-11-12 02:05:25,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 56 states have (on average 1.25) internal successors, (70), 64 states have internal predecessors, (70), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-12 02:05:25,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 92 transitions. [2023-11-12 02:05:25,460 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 92 transitions. Word has length 35 [2023-11-12 02:05:25,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:05:25,460 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 92 transitions. [2023-11-12 02:05:25,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (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) [2023-11-12 02:05:25,461 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 92 transitions. [2023-11-12 02:05:25,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-11-12 02:05:25,462 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:05:25,462 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] [2023-11-12 02:05:25,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-12 02:05:25,463 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)] === [2023-11-12 02:05:25,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:05:25,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1733114360, now seen corresponding path program 1 times [2023-11-12 02:05:25,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:05:25,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841845757] [2023-11-12 02:05:25,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:05:25,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:05:25,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:25,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:05:25,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:25,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-12 02:05:25,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:25,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-12 02:05:25,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:25,550 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-12 02:05:25,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:05:25,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841845757] [2023-11-12 02:05:25,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841845757] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:05:25,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:05:25,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:05:25,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479401618] [2023-11-12 02:05:25,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:05:25,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:05:25,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:05:25,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:05:25,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:05:25,553 INFO L87 Difference]: Start difference. First operand 73 states and 92 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-12 02:05:25,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:05:25,572 INFO L93 Difference]: Finished difference Result 85 states and 108 transitions. [2023-11-12 02:05:25,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:05:25,573 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2023-11-12 02:05:25,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:05:25,574 INFO L225 Difference]: With dead ends: 85 [2023-11-12 02:05:25,574 INFO L226 Difference]: Without dead ends: 83 [2023-11-12 02:05:25,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:05:25,576 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 7 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:05:25,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 159 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:05:25,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-11-12 02:05:25,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2023-11-12 02:05:25,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 60 states have (on average 1.25) internal successors, (75), 68 states have internal predecessors, (75), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-12 02:05:25,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 97 transitions. [2023-11-12 02:05:25,584 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 97 transitions. Word has length 40 [2023-11-12 02:05:25,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:05:25,585 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 97 transitions. [2023-11-12 02:05:25,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-12 02:05:25,585 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 97 transitions. [2023-11-12 02:05:25,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-11-12 02:05:25,587 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:05:25,587 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] [2023-11-12 02:05:25,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-12 02:05:25,588 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-12 02:05:25,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:05:25,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1733173942, now seen corresponding path program 1 times [2023-11-12 02:05:25,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:05:25,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958146999] [2023-11-12 02:05:25,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:05:25,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:05:25,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:25,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:05:25,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:25,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-12 02:05:25,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:25,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-12 02:05:25,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:25,653 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-12 02:05:25,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:05:25,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958146999] [2023-11-12 02:05:25,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958146999] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:05:25,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:05:25,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:05:25,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106011109] [2023-11-12 02:05:25,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:05:25,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:05:25,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:05:25,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:05:25,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:05:25,657 INFO L87 Difference]: Start difference. First operand 77 states and 97 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-12 02:05:25,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:05:25,668 INFO L93 Difference]: Finished difference Result 105 states and 130 transitions. [2023-11-12 02:05:25,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:05:25,669 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2023-11-12 02:05:25,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:05:25,671 INFO L225 Difference]: With dead ends: 105 [2023-11-12 02:05:25,671 INFO L226 Difference]: Without dead ends: 77 [2023-11-12 02:05:25,671 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 [2023-11-12 02:05:25,672 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 1 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 156 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 [2023-11-12 02:05:25,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 156 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:05:25,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-11-12 02:05:25,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2023-11-12 02:05:25,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 67 states have internal predecessors, (74), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-12 02:05:25,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 96 transitions. [2023-11-12 02:05:25,680 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 96 transitions. Word has length 40 [2023-11-12 02:05:25,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:05:25,681 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 96 transitions. [2023-11-12 02:05:25,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-12 02:05:25,681 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 96 transitions. [2023-11-12 02:05:25,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-12 02:05:25,682 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:05:25,683 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:05:25,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-12 02:05:25,683 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-12 02:05:25,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:05:25,684 INFO L85 PathProgramCache]: Analyzing trace with hash -635653587, now seen corresponding path program 1 times [2023-11-12 02:05:25,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:05:25,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241810310] [2023-11-12 02:05:25,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:05:25,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:05:25,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:25,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:05:25,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:25,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-12 02:05:25,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:25,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-12 02:05:25,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:25,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-12 02:05:25,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:25,800 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-12 02:05:25,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:05:25,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241810310] [2023-11-12 02:05:25,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241810310] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:05:25,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:05:25,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:05:25,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547719307] [2023-11-12 02:05:25,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:05:25,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:05:25,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:05:25,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:05:25,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:05:25,803 INFO L87 Difference]: Start difference. First operand 77 states and 96 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-12 02:05:25,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:05:25,814 INFO L93 Difference]: Finished difference Result 99 states and 122 transitions. [2023-11-12 02:05:25,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:05:25,815 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 44 [2023-11-12 02:05:25,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:05:25,816 INFO L225 Difference]: With dead ends: 99 [2023-11-12 02:05:25,816 INFO L226 Difference]: Without dead ends: 70 [2023-11-12 02:05:25,816 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 [2023-11-12 02:05:25,817 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 148 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 [2023-11-12 02:05:25,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 148 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:05:25,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-11-12 02:05:25,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2023-11-12 02:05:25,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 56 states have (on average 1.1785714285714286) internal successors, (66), 61 states have internal predecessors, (66), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-12 02:05:25,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 86 transitions. [2023-11-12 02:05:25,824 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 86 transitions. Word has length 44 [2023-11-12 02:05:25,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:05:25,825 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 86 transitions. [2023-11-12 02:05:25,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-12 02:05:25,825 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 86 transitions. [2023-11-12 02:05:25,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-12 02:05:25,826 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:05:25,826 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] [2023-11-12 02:05:25,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-12 02:05:25,827 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)] === [2023-11-12 02:05:25,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:05:25,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1753984682, now seen corresponding path program 1 times [2023-11-12 02:05:25,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:05:25,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873377730] [2023-11-12 02:05:25,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:05:25,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:05:25,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:25,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:05:25,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:25,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-12 02:05:25,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:25,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-12 02:05:25,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:25,923 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-12 02:05:25,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:05:25,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873377730] [2023-11-12 02:05:25,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873377730] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:05:25,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:05:25,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:05:25,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36554157] [2023-11-12 02:05:25,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:05:25,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:05:25,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:05:25,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:05:25,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:05:25,926 INFO L87 Difference]: Start difference. First operand 70 states and 86 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, (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) [2023-11-12 02:05:25,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:05:25,936 INFO L93 Difference]: Finished difference Result 85 states and 103 transitions. [2023-11-12 02:05:25,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:05:25,936 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, (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 46 [2023-11-12 02:05:25,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:05:25,937 INFO L225 Difference]: With dead ends: 85 [2023-11-12 02:05:25,938 INFO L226 Difference]: Without dead ends: 68 [2023-11-12 02:05:25,938 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 [2023-11-12 02:05:25,939 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 4 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 134 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 [2023-11-12 02:05:25,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 134 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:05:25,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-11-12 02:05:25,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2023-11-12 02:05:25,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 59 states have internal predecessors, (63), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-12 02:05:25,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 81 transitions. [2023-11-12 02:05:25,946 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 81 transitions. Word has length 46 [2023-11-12 02:05:25,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:05:25,946 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 81 transitions. [2023-11-12 02:05:25,947 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, (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) [2023-11-12 02:05:25,947 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 81 transitions. [2023-11-12 02:05:25,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-12 02:05:25,948 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:05:25,948 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:05:25,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-12 02:05:25,948 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-12 02:05:25,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:05:25,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1078495304, now seen corresponding path program 1 times [2023-11-12 02:05:25,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:05:25,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262278598] [2023-11-12 02:05:25,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:05:25,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:05:25,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:26,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:05:26,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:26,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-12 02:05:26,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:26,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-12 02:05:26,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:26,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:05:26,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:26,053 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-12 02:05:26,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:05:26,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262278598] [2023-11-12 02:05:26,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262278598] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:05:26,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:05:26,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:05:26,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088343922] [2023-11-12 02:05:26,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:05:26,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:05:26,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:05:26,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:05:26,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:05:26,056 INFO L87 Difference]: Start difference. First operand 68 states and 81 transitions. Second operand has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-12 02:05:26,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:05:26,068 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2023-11-12 02:05:26,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:05:26,069 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 52 [2023-11-12 02:05:26,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:05:26,070 INFO L225 Difference]: With dead ends: 74 [2023-11-12 02:05:26,070 INFO L226 Difference]: Without dead ends: 68 [2023-11-12 02:05:26,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:05:26,071 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 1 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:05:26,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 138 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:05:26,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-11-12 02:05:26,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2023-11-12 02:05:26,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 59 states have internal predecessors, (62), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-12 02:05:26,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 80 transitions. [2023-11-12 02:05:26,078 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 80 transitions. Word has length 52 [2023-11-12 02:05:26,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:05:26,078 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 80 transitions. [2023-11-12 02:05:26,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-12 02:05:26,079 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 80 transitions. [2023-11-12 02:05:26,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-12 02:05:26,080 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:05:26,080 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:05:26,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-12 02:05:26,081 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-12 02:05:26,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:05:26,081 INFO L85 PathProgramCache]: Analyzing trace with hash -924599235, now seen corresponding path program 1 times [2023-11-12 02:05:26,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:05:26,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928505674] [2023-11-12 02:05:26,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:05:26,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:05:26,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:26,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:05:26,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:26,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-12 02:05:26,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:26,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-12 02:05:26,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:26,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:05:26,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:26,156 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-12 02:05:26,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:05:26,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928505674] [2023-11-12 02:05:26,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928505674] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:05:26,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:05:26,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:05:26,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237729679] [2023-11-12 02:05:26,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:05:26,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:05:26,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:05:26,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:05:26,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:05:26,160 INFO L87 Difference]: Start difference. First operand 68 states and 80 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-12 02:05:26,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:05:26,165 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2023-11-12 02:05:26,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:05:26,165 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 53 [2023-11-12 02:05:26,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:05:26,166 INFO L225 Difference]: With dead ends: 72 [2023-11-12 02:05:26,166 INFO L226 Difference]: Without dead ends: 0 [2023-11-12 02:05:26,167 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 [2023-11-12 02:05:26,167 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 121 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 [2023-11-12 02:05:26,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:05:26,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-12 02:05:26,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-12 02:05:26,169 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) [2023-11-12 02:05:26,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-12 02:05:26,170 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 53 [2023-11-12 02:05:26,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:05:26,170 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-12 02:05:26,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-12 02:05:26,170 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-12 02:05:26,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-12 02:05:26,173 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2023-11-12 02:05:26,174 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2023-11-12 02:05:26,175 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2023-11-12 02:05:26,175 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2023-11-12 02:05:26,175 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2023-11-12 02:05:26,175 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2023-11-12 02:05:26,176 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2023-11-12 02:05:26,176 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2023-11-12 02:05:26,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-12 02:05:26,179 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-12 02:05:26,253 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1412 1418) the Hoare annotation is: true [2023-11-12 02:05:26,253 INFO L899 garLoopResultBuilder]: For program point printLineEXIT(lines 1412 1418) no Hoare annotation was computed. [2023-11-12 02:05:26,254 INFO L899 garLoopResultBuilder]: For program point L1414(lines 1414 1417) no Hoare annotation was computed. [2023-11-12 02:05:26,254 INFO L899 garLoopResultBuilder]: For program point L1414-2(lines 1412 1418) no Hoare annotation was computed. [2023-11-12 02:05:26,254 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1426 1429) the Hoare annotation is: true [2023-11-12 02:05:26,254 INFO L899 garLoopResultBuilder]: For program point printIntLineEXIT(lines 1426 1429) no Hoare annotation was computed. [2023-11-12 02:05:26,254 INFO L899 garLoopResultBuilder]: For program point printIntLineFINAL(lines 1426 1429) no Hoare annotation was computed. [2023-11-12 02:05:26,255 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1617) no Hoare annotation was computed. [2023-11-12 02:05:26,255 INFO L899 garLoopResultBuilder]: For program point L1662(line 1662) no Hoare annotation was computed. [2023-11-12 02:05:26,255 INFO L895 garLoopResultBuilder]: At program point L1563(line 1563) the Hoare annotation is: (and (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483646) |ULTIMATE.start_goodB2G1_#t~switch98#1| (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) [2023-11-12 02:05:26,255 INFO L899 garLoopResultBuilder]: For program point L1563-1(lines 1557 1564) no Hoare annotation was computed. [2023-11-12 02:05:26,256 INFO L895 garLoopResultBuilder]: At program point L1580(line 1580) the Hoare annotation is: (and |ULTIMATE.start_goodB2G1_#t~switch101#1| (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483646) (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) [2023-11-12 02:05:26,256 INFO L899 garLoopResultBuilder]: For program point L1580-1(line 1580) no Hoare annotation was computed. [2023-11-12 02:05:26,256 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 1689 1696) no Hoare annotation was computed. [2023-11-12 02:05:26,256 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1673) no Hoare annotation was computed. [2023-11-12 02:05:26,257 INFO L899 garLoopResultBuilder]: For program point L1671(line 1671) no Hoare annotation was computed. [2023-11-12 02:05:26,257 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1579) no Hoare annotation was computed. [2023-11-12 02:05:26,257 INFO L899 garLoopResultBuilder]: For program point L1630(lines 1630 1655) no Hoare annotation was computed. [2023-11-12 02:05:26,257 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-12 02:05:26,257 INFO L895 garLoopResultBuilder]: At program point L1622(line 1622) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch105#1| (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) [2023-11-12 02:05:26,258 INFO L899 garLoopResultBuilder]: For program point L1589(lines 1589 1629) no Hoare annotation was computed. [2023-11-12 02:05:26,258 INFO L899 garLoopResultBuilder]: For program point L1647(line 1647) no Hoare annotation was computed. [2023-11-12 02:05:26,258 INFO L899 garLoopResultBuilder]: For program point L1614(line 1614) no Hoare annotation was computed. [2023-11-12 02:05:26,258 INFO L899 garLoopResultBuilder]: For program point L1647-1(line 1647) no Hoare annotation was computed. [2023-11-12 02:05:26,258 INFO L899 garLoopResultBuilder]: For program point L1548(lines 1548 1588) no Hoare annotation was computed. [2023-11-12 02:05:26,259 INFO L899 garLoopResultBuilder]: For program point L1639(line 1639) no Hoare annotation was computed. [2023-11-12 02:05:26,259 INFO L899 garLoopResultBuilder]: For program point L1573(line 1573) no Hoare annotation was computed. [2023-11-12 02:05:26,259 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1579) no Hoare annotation was computed. [2023-11-12 02:05:26,259 INFO L899 garLoopResultBuilder]: For program point L1598(lines 1598 1605) no Hoare annotation was computed. [2023-11-12 02:05:26,260 INFO L899 garLoopResultBuilder]: For program point L1656(lines 1656 1681) no Hoare annotation was computed. [2023-11-12 02:05:26,260 INFO L899 garLoopResultBuilder]: For program point L1557(lines 1557 1564) no Hoare annotation was computed. [2023-11-12 02:05:26,260 INFO L895 garLoopResultBuilder]: At program point L1648(line 1648) the Hoare annotation is: |ULTIMATE.start_goodG2B1_#t~switch107#1| [2023-11-12 02:05:26,260 INFO L899 garLoopResultBuilder]: For program point L1615(lines 1615 1623) no Hoare annotation was computed. [2023-11-12 02:05:26,260 INFO L899 garLoopResultBuilder]: For program point L1648-1(line 1648) no Hoare annotation was computed. [2023-11-12 02:05:26,260 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-12 02:05:26,261 INFO L899 garLoopResultBuilder]: For program point L1673(line 1673) no Hoare annotation was computed. [2023-11-12 02:05:26,261 INFO L899 garLoopResultBuilder]: For program point L1673-1(line 1673) no Hoare annotation was computed. [2023-11-12 02:05:26,261 INFO L895 garLoopResultBuilder]: At program point L1574(line 1574) the Hoare annotation is: false [2023-11-12 02:05:26,261 INFO L899 garLoopResultBuilder]: For program point L1665(line 1665) no Hoare annotation was computed. [2023-11-12 02:05:26,261 INFO L899 garLoopResultBuilder]: For program point L1682(lines 1682 1688) no Hoare annotation was computed. [2023-11-12 02:05:26,262 INFO L902 garLoopResultBuilder]: At program point L1674(line 1674) the Hoare annotation is: true [2023-11-12 02:05:26,262 INFO L899 garLoopResultBuilder]: For program point L1674-1(line 1674) no Hoare annotation was computed. [2023-11-12 02:05:26,262 INFO L899 garLoopResultBuilder]: For program point L1608(line 1608) no Hoare annotation was computed. [2023-11-12 02:05:26,262 INFO L895 garLoopResultBuilder]: At program point L1666(line 1666) the Hoare annotation is: false [2023-11-12 02:05:26,262 INFO L899 garLoopResultBuilder]: For program point L1567(line 1567) no Hoare annotation was computed. [2023-11-12 02:05:26,263 INFO L899 garLoopResultBuilder]: For program point L1625(line 1625) no Hoare annotation was computed. [2023-11-12 02:05:26,263 INFO L899 garLoopResultBuilder]: For program point L1617(line 1617) no Hoare annotation was computed. [2023-11-12 02:05:26,263 INFO L895 garLoopResultBuilder]: At program point L1584(line 1584) the Hoare annotation is: (and |ULTIMATE.start_goodB2G1_#t~switch101#1| (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) [2023-11-12 02:05:26,263 INFO L899 garLoopResultBuilder]: For program point L1617-1(line 1617) no Hoare annotation was computed. [2023-11-12 02:05:26,263 INFO L895 garLoopResultBuilder]: At program point L1609(line 1609) the Hoare annotation is: false [2023-11-12 02:05:26,264 INFO L899 garLoopResultBuilder]: For program point L1576(line 1576) no Hoare annotation was computed. [2023-11-12 02:05:26,264 INFO L899 garLoopResultBuilder]: For program point L1634(lines 1634 1642) no Hoare annotation was computed. [2023-11-12 02:05:26,264 INFO L895 garLoopResultBuilder]: At program point L1568(line 1568) the Hoare annotation is: false [2023-11-12 02:05:26,264 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-12 02:05:26,264 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1647) no Hoare annotation was computed. [2023-11-12 02:05:26,265 INFO L902 garLoopResultBuilder]: At program point L1692(line 1692) the Hoare annotation is: true [2023-11-12 02:05:26,265 INFO L899 garLoopResultBuilder]: For program point L1692-1(line 1692) no Hoare annotation was computed. [2023-11-12 02:05:26,265 INFO L895 garLoopResultBuilder]: At program point L1626(line 1626) the Hoare annotation is: false [2023-11-12 02:05:26,265 INFO L899 garLoopResultBuilder]: For program point L1593(lines 1593 1611) no Hoare annotation was computed. [2023-11-12 02:05:26,265 INFO L899 garLoopResultBuilder]: For program point L1651(line 1651) no Hoare annotation was computed. [2023-11-12 02:05:26,266 INFO L895 garLoopResultBuilder]: At program point L1618(line 1618) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch105#1| (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483646) (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) [2023-11-12 02:05:26,266 INFO L899 garLoopResultBuilder]: For program point L1618-1(line 1618) no Hoare annotation was computed. [2023-11-12 02:05:26,266 INFO L899 garLoopResultBuilder]: For program point L1552(lines 1552 1570) no Hoare annotation was computed. [2023-11-12 02:05:26,266 INFO L899 garLoopResultBuilder]: For program point L1643(lines 1643 1654) no Hoare annotation was computed. [2023-11-12 02:05:26,267 INFO L899 garLoopResultBuilder]: For program point L1577(lines 1577 1585) no Hoare annotation was computed. [2023-11-12 02:05:26,267 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-12 02:05:26,267 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1647) no Hoare annotation was computed. [2023-11-12 02:05:26,267 INFO L899 garLoopResultBuilder]: For program point L1660(lines 1660 1668) no Hoare annotation was computed. [2023-11-12 02:05:26,267 INFO L895 garLoopResultBuilder]: At program point L1652(line 1652) the Hoare annotation is: false [2023-11-12 02:05:26,268 INFO L899 garLoopResultBuilder]: For program point L1677(line 1677) no Hoare annotation was computed. [2023-11-12 02:05:26,268 INFO L899 garLoopResultBuilder]: For program point L1669(lines 1669 1680) no Hoare annotation was computed. [2023-11-12 02:05:26,268 INFO L899 garLoopResultBuilder]: For program point L1636(line 1636) no Hoare annotation was computed. [2023-11-12 02:05:26,268 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1617) no Hoare annotation was computed. [2023-11-12 02:05:26,269 INFO L902 garLoopResultBuilder]: At program point L1694(line 1694) the Hoare annotation is: true [2023-11-12 02:05:26,269 INFO L899 garLoopResultBuilder]: For program point L1694-1(line 1694) no Hoare annotation was computed. [2023-11-12 02:05:26,269 INFO L899 garLoopResultBuilder]: For program point L1595(line 1595) no Hoare annotation was computed. [2023-11-12 02:05:26,269 INFO L899 garLoopResultBuilder]: For program point L1554(line 1554) no Hoare annotation was computed. [2023-11-12 02:05:26,269 INFO L902 garLoopResultBuilder]: At program point L1678(line 1678) the Hoare annotation is: true [2023-11-12 02:05:26,269 INFO L899 garLoopResultBuilder]: For program point L1645(line 1645) no Hoare annotation was computed. [2023-11-12 02:05:26,270 INFO L899 garLoopResultBuilder]: For program point L1612(lines 1612 1628) no Hoare annotation was computed. [2023-11-12 02:05:26,270 INFO L899 garLoopResultBuilder]: For program point L1579(line 1579) no Hoare annotation was computed. [2023-11-12 02:05:26,270 INFO L899 garLoopResultBuilder]: For program point L1579-1(line 1579) no Hoare annotation was computed. [2023-11-12 02:05:26,270 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1673) no Hoare annotation was computed. [2023-11-12 02:05:26,271 INFO L895 garLoopResultBuilder]: At program point L1637(line 1637) the Hoare annotation is: false [2023-11-12 02:05:26,271 INFO L895 garLoopResultBuilder]: At program point L1604(line 1604) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch102#1| (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483646) (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) [2023-11-12 02:05:26,271 INFO L899 garLoopResultBuilder]: For program point L1571(lines 1571 1587) no Hoare annotation was computed. [2023-11-12 02:05:26,271 INFO L899 garLoopResultBuilder]: For program point L1604-1(lines 1598 1605) no Hoare annotation was computed. [2023-11-12 02:05:26,275 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:05:26,278 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-11-12 02:05:26,284 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 02:05:26 BoogieIcfgContainer [2023-11-12 02:05:26,284 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-12 02:05:26,285 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-12 02:05:26,285 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-12 02:05:26,285 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-12 02:05:26,286 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:05:23" (3/4) ... [2023-11-12 02:05:26,288 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-12 02:05:26,294 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2023-11-12 02:05:26,294 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2023-11-12 02:05:26,302 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2023-11-12 02:05:26,303 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2023-11-12 02:05:26,304 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-11-12 02:05:26,304 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-11-12 02:05:26,305 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-12 02:05:26,425 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0747e29-be18-4705-b142-a2241287366f/bin/uautomizer-verify-uTZkv6EMXl/witness.graphml [2023-11-12 02:05:26,426 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0747e29-be18-4705-b142-a2241287366f/bin/uautomizer-verify-uTZkv6EMXl/witness.yml [2023-11-12 02:05:26,426 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-12 02:05:26,427 INFO L158 Benchmark]: Toolchain (without parser) took 5433.96ms. Allocated memory was 127.9MB in the beginning and 182.5MB in the end (delta: 54.5MB). Free memory was 85.5MB in the beginning and 80.3MB in the end (delta: 5.3MB). Peak memory consumption was 61.7MB. Max. memory is 16.1GB. [2023-11-12 02:05:26,427 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 127.9MB. Free memory is still 99.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:05:26,428 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1753.94ms. Allocated memory was 127.9MB in the beginning and 182.5MB in the end (delta: 54.5MB). Free memory was 85.5MB in the beginning and 123.4MB in the end (delta: -37.9MB). Peak memory consumption was 50.1MB. Max. memory is 16.1GB. [2023-11-12 02:05:26,428 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.92ms. Allocated memory is still 182.5MB. Free memory was 123.4MB in the beginning and 120.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 02:05:26,428 INFO L158 Benchmark]: Boogie Preprocessor took 41.36ms. Allocated memory is still 182.5MB. Free memory was 120.4MB in the beginning and 118.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 02:05:26,429 INFO L158 Benchmark]: RCFGBuilder took 515.59ms. Allocated memory is still 182.5MB. Free memory was 118.4MB in the beginning and 100.4MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-12 02:05:26,429 INFO L158 Benchmark]: TraceAbstraction took 2884.78ms. Allocated memory is still 182.5MB. Free memory was 99.5MB in the beginning and 86.6MB in the end (delta: 12.9MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. [2023-11-12 02:05:26,430 INFO L158 Benchmark]: Witness Printer took 141.87ms. Allocated memory is still 182.5MB. Free memory was 86.6MB in the beginning and 80.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-12 02:05:26,432 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36ms. Allocated memory is still 127.9MB. Free memory is still 99.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1753.94ms. Allocated memory was 127.9MB in the beginning and 182.5MB in the end (delta: 54.5MB). Free memory was 85.5MB in the beginning and 123.4MB in the end (delta: -37.9MB). Peak memory consumption was 50.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 86.92ms. Allocated memory is still 182.5MB. Free memory was 123.4MB in the beginning and 120.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.36ms. Allocated memory is still 182.5MB. Free memory was 120.4MB in the beginning and 118.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 515.59ms. Allocated memory is still 182.5MB. Free memory was 118.4MB in the beginning and 100.4MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2884.78ms. Allocated memory is still 182.5MB. Free memory was 99.5MB in the beginning and 86.6MB in the end (delta: 12.9MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. * Witness Printer took 141.87ms. Allocated memory is still 182.5MB. Free memory was 86.6MB in the beginning and 80.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. 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: 1579]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1579]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1617]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1617]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1647]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1647]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1673]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1673]: 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, 87 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 15, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 101 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 76 mSDsluCounter, 2462 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1158 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 73 IncrementalHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 1304 mSDtfsCounter, 73 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 109 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred 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, 15 MinimizatonAttempts, 13 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 102 PreInvPairs, 111 NumberOfFragments, 68 HoareAnnotationTreeSize, 102 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 20 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 493 NumberOfCodeBlocks, 493 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 478 ConstructedInterpolants, 0 QuantifiedInterpolants, 544 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 104/104 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 RESULT: Ultimate proved your program to be correct! [2023-11-12 02:05:26,453 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0747e29-be18-4705-b142-a2241287366f/bin/uautomizer-verify-uTZkv6EMXl/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