./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_sub_02_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_f5a52759-628a-44cc-a06c-b607b1f3fd84/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5a52759-628a-44cc-a06c-b607b1f3fd84/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_f5a52759-628a-44cc-a06c-b607b1f3fd84/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5a52759-628a-44cc-a06c-b607b1f3fd84/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerReach.xml -i ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_sub_02_good.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5a52759-628a-44cc-a06c-b607b1f3fd84/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_f5a52759-628a-44cc-a06c-b607b1f3fd84/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 d929aa7bcd2a44ead1b8717a92f971e5f5d30472bc7f5adfbdd096a88b0dbff7 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:24:54,112 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:24:54,234 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5a52759-628a-44cc-a06c-b607b1f3fd84/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Overflow-64bit-Automizer_Default.epf [2023-11-12 02:24:54,246 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:24:54,247 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:24:54,286 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:24:54,287 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:24:54,287 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:24:54,288 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:24:54,293 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:24:54,294 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:24:54,295 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:24:54,295 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:24:54,297 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:24:54,297 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 02:24:54,298 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:24:54,298 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:24:54,298 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 02:24:54,299 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:24:54,299 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 02:24:54,300 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-12 02:24:54,300 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 02:24:54,301 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:24:54,301 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:24:54,302 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:24:54,303 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:24:54,303 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:24:54,304 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:24:54,304 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:24:54,305 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:24:54,306 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 02:24:54,306 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:24:54,306 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:24:54,307 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:24:54,307 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 02:24:54,307 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:24:54,307 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:24:54,308 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:24:54,308 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_f5a52759-628a-44cc-a06c-b607b1f3fd84/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_f5a52759-628a-44cc-a06c-b607b1f3fd84/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 -> d929aa7bcd2a44ead1b8717a92f971e5f5d30472bc7f5adfbdd096a88b0dbff7 [2023-11-12 02:24:54,615 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:24:54,649 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:24:54,652 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:24:54,653 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:24:54,654 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:24:54,655 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5a52759-628a-44cc-a06c-b607b1f3fd84/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_sub_02_good.i [2023-11-12 02:24:57,818 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:24:58,237 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:24:58,240 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5a52759-628a-44cc-a06c-b607b1f3fd84/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_sub_02_good.i [2023-11-12 02:24:58,277 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5a52759-628a-44cc-a06c-b607b1f3fd84/bin/uautomizer-verify-uTZkv6EMXl/data/4b5e5e7fa/c869205a110a4bdc99e48477f1e9af2b/FLAG222f0525c [2023-11-12 02:24:58,297 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5a52759-628a-44cc-a06c-b607b1f3fd84/bin/uautomizer-verify-uTZkv6EMXl/data/4b5e5e7fa/c869205a110a4bdc99e48477f1e9af2b [2023-11-12 02:24:58,299 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:24:58,301 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:24:58,303 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:24:58,303 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:24:58,309 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:24:58,310 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:24:58" (1/1) ... [2023-11-12 02:24:58,312 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9fd89d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:24:58, skipping insertion in model container [2023-11-12 02:24:58,312 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:24:58" (1/1) ... [2023-11-12 02:24:58,401 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:24:58,800 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-12 02:24:59,426 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:24:59,439 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:24:59,461 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-12 02:24:59,610 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:24:59,776 WARN L672 CHandler]: The function puts is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:24:59,776 WARN L672 CHandler]: The function __ctype_b_loc is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:24:59,777 WARN L672 CHandler]: The function iswxdigit is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:24:59,777 WARN L672 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:24:59,777 WARN L672 CHandler]: The function time is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:24:59,777 WARN L672 CHandler]: The function fgets is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:24:59,786 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:24:59,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:24:59 WrapperNode [2023-11-12 02:24:59,786 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:24:59,788 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:24:59,788 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:24:59,788 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:24:59,796 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:24:59" (1/1) ... [2023-11-12 02:24:59,841 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:24:59" (1/1) ... [2023-11-12 02:24:59,870 INFO L138 Inliner]: procedures = 504, calls = 87, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 112 [2023-11-12 02:24:59,872 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:24:59,873 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:24:59,873 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:24:59,873 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:24:59,884 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:24:59" (1/1) ... [2023-11-12 02:24:59,884 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:24:59" (1/1) ... [2023-11-12 02:24:59,902 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:24:59" (1/1) ... [2023-11-12 02:24:59,904 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:24:59" (1/1) ... [2023-11-12 02:24:59,912 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:24:59" (1/1) ... [2023-11-12 02:24:59,932 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:24:59" (1/1) ... [2023-11-12 02:24:59,934 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:24:59" (1/1) ... [2023-11-12 02:24:59,943 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:24:59" (1/1) ... [2023-11-12 02:24:59,946 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:24:59,947 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:24:59,947 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:24:59,947 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:24:59,948 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:24:59" (1/1) ... [2023-11-12 02:24:59,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:24:59,974 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5a52759-628a-44cc-a06c-b607b1f3fd84/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:24:59,992 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5a52759-628a-44cc-a06c-b607b1f3fd84/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:25:00,031 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5a52759-628a-44cc-a06c-b607b1f3fd84/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:25:00,046 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2023-11-12 02:25:00,047 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2023-11-12 02:25:00,047 INFO L130 BoogieDeclarations]: Found specification of procedure fgets [2023-11-12 02:25:00,047 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2023-11-12 02:25:00,047 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2023-11-12 02:25:00,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 02:25:00,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2023-11-12 02:25:00,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:25:00,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:25:00,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:25:00,051 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 02:25:00,051 INFO L130 BoogieDeclarations]: Found specification of procedure time [2023-11-12 02:25:00,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:25:00,231 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:25:00,233 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:25:00,550 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:25:00,561 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:25:00,561 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-11-12 02:25:00,563 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:25:00 BoogieIcfgContainer [2023-11-12 02:25:00,563 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:25:00,566 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:25:00,566 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:25:00,570 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:25:00,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:24:58" (1/3) ... [2023-11-12 02:25:00,571 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e04c4ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:25:00, skipping insertion in model container [2023-11-12 02:25:00,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:24:59" (2/3) ... [2023-11-12 02:25:00,572 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e04c4ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:25:00, skipping insertion in model container [2023-11-12 02:25:00,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:25:00" (3/3) ... [2023-11-12 02:25:00,573 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_fgets_sub_02_good.i [2023-11-12 02:25:00,594 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:25:00,594 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-11-12 02:25:00,646 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:25:00,654 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;@3cfb0176, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:25:00,654 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2023-11-12 02:25:00,658 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 39 states have (on average 1.5384615384615385) internal successors, (60), 53 states have internal predecessors, (60), 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:25:00,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-12 02:25:00,667 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:25:00,668 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:25:00,668 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:25:00,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:25:00,674 INFO L85 PathProgramCache]: Analyzing trace with hash -171296224, now seen corresponding path program 1 times [2023-11-12 02:25:00,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:25:00,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738480957] [2023-11-12 02:25:00,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:00,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:25:00,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:00,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:25:00,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:01,033 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:25:01,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:25:01,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738480957] [2023-11-12 02:25:01,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738480957] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:25:01,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:25:01,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:25:01,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033265470] [2023-11-12 02:25:01,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:25:01,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-12 02:25:01,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:25:01,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-12 02:25:01,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 02:25:01,100 INFO L87 Difference]: Start difference. First operand has 62 states, 39 states have (on average 1.5384615384615385) internal successors, (60), 53 states have internal predecessors, (60), 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) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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:25:01,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:25:01,140 INFO L93 Difference]: Finished difference Result 114 states and 152 transitions. [2023-11-12 02:25:01,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-12 02:25:01,142 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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 12 [2023-11-12 02:25:01,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:25:01,151 INFO L225 Difference]: With dead ends: 114 [2023-11-12 02:25:01,151 INFO L226 Difference]: Without dead ends: 51 [2023-11-12 02:25:01,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 02:25:01,160 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 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:25:01,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:25:01,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-11-12 02:25:01,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-11-12 02:25:01,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 44 states have internal predecessors, (45), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-12 02:25:01,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2023-11-12 02:25:01,216 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 12 [2023-11-12 02:25:01,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:25:01,217 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2023-11-12 02:25:01,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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:25:01,218 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2023-11-12 02:25:01,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-12 02:25:01,219 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:25:01,219 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:25:01,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:25:01,220 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:25:01,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:25:01,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1706494971, now seen corresponding path program 1 times [2023-11-12 02:25:01,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:25:01,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404450895] [2023-11-12 02:25:01,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:01,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:25:01,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:01,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:25:01,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:01,369 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:25:01,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:25:01,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404450895] [2023-11-12 02:25:01,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404450895] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:25:01,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:25:01,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:25:01,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906586499] [2023-11-12 02:25:01,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:25:01,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:25:01,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:25:01,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:25:01,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:25:01,373 INFO L87 Difference]: Start difference. First operand 51 states and 61 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-12 02:25:01,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:25:01,403 INFO L93 Difference]: Finished difference Result 90 states and 106 transitions. [2023-11-12 02:25:01,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:25:01,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2023-11-12 02:25:01,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:25:01,405 INFO L225 Difference]: With dead ends: 90 [2023-11-12 02:25:01,405 INFO L226 Difference]: Without dead ends: 54 [2023-11-12 02:25:01,406 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:25:01,407 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 8 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 106 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:25:01,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 106 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:25:01,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-11-12 02:25:01,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2023-11-12 02:25:01,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 45 states have internal predecessors, (47), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-12 02:25:01,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2023-11-12 02:25:01,418 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 14 [2023-11-12 02:25:01,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:25:01,418 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2023-11-12 02:25:01,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-12 02:25:01,419 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2023-11-12 02:25:01,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-12 02:25:01,419 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:25:01,420 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:25:01,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:25:01,420 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:25:01,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:25:01,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1361736478, now seen corresponding path program 1 times [2023-11-12 02:25:01,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:25:01,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411551092] [2023-11-12 02:25:01,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:01,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:25:01,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:01,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:25:01,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:01,557 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:25:01,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:25:01,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411551092] [2023-11-12 02:25:01,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411551092] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:25:01,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:25:01,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:25:01,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126644273] [2023-11-12 02:25:01,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:25:01,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:25:01,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:25:01,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:25:01,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:25:01,560 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand has 3 states, 2 states have (on average 6.5) 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:25:01,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:25:01,578 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2023-11-12 02:25:01,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:25:01,579 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) 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:25:01,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:25:01,580 INFO L225 Difference]: With dead ends: 53 [2023-11-12 02:25:01,580 INFO L226 Difference]: Without dead ends: 52 [2023-11-12 02:25:01,581 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:25:01,582 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 5 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 99 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:25:01,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 99 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:25:01,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-11-12 02:25:01,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2023-11-12 02:25:01,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 44 states have internal predecessors, (46), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-12 02:25:01,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2023-11-12 02:25:01,592 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 15 [2023-11-12 02:25:01,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:25:01,612 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2023-11-12 02:25:01,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) 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:25:01,613 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2023-11-12 02:25:01,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-12 02:25:01,616 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:25:01,616 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] [2023-11-12 02:25:01,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 02:25:01,617 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:25:01,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:25:01,618 INFO L85 PathProgramCache]: Analyzing trace with hash 614410729, now seen corresponding path program 1 times [2023-11-12 02:25:01,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:25:01,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036640975] [2023-11-12 02:25:01,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:01,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:25:01,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:01,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:25:01,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:01,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-12 02:25:01,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:01,726 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:25:01,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:25:01,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036640975] [2023-11-12 02:25:01,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036640975] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:25:01,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:25:01,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:25:01,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196695305] [2023-11-12 02:25:01,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:25:01,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:25:01,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:25:01,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:25:01,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:25:01,730 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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:25:01,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:25:01,751 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2023-11-12 02:25:01,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:25:01,752 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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 24 [2023-11-12 02:25:01,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:25:01,754 INFO L225 Difference]: With dead ends: 77 [2023-11-12 02:25:01,754 INFO L226 Difference]: Without dead ends: 54 [2023-11-12 02:25:01,754 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:25:01,756 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 7 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 101 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:25:01,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 101 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:25:01,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-11-12 02:25:01,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2023-11-12 02:25:01,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 38 states have (on average 1.236842105263158) internal successors, (47), 44 states have internal predecessors, (47), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-12 02:25:01,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2023-11-12 02:25:01,767 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 24 [2023-11-12 02:25:01,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:25:01,768 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2023-11-12 02:25:01,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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:25:01,768 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2023-11-12 02:25:01,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-12 02:25:01,769 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:25:01,770 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] [2023-11-12 02:25:01,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 02:25:01,770 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-12 02:25:01,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:25:01,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1866863516, now seen corresponding path program 1 times [2023-11-12 02:25:01,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:25:01,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112314019] [2023-11-12 02:25:01,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:01,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:25:01,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:01,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:25:01,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:01,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-12 02:25:01,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:01,926 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:25:01,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:25:01,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112314019] [2023-11-12 02:25:01,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112314019] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:25:01,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:25:01,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:25:01,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412843204] [2023-11-12 02:25:01,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:25:01,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:25:01,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:25:01,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:25:01,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:25:01,935 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-12 02:25:01,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:25:01,976 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2023-11-12 02:25:01,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:25:01,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2023-11-12 02:25:01,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:25:01,981 INFO L225 Difference]: With dead ends: 53 [2023-11-12 02:25:01,983 INFO L226 Difference]: Without dead ends: 52 [2023-11-12 02:25:01,983 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:25:01,985 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 5 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 96 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:25:01,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 96 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:25:01,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-11-12 02:25:02,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2023-11-12 02:25:02,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 43 states have internal predecessors, (46), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-12 02:25:02,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2023-11-12 02:25:02,011 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 25 [2023-11-12 02:25:02,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:25:02,012 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2023-11-12 02:25:02,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-12 02:25:02,013 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2023-11-12 02:25:02,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-12 02:25:02,014 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:25:02,015 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] [2023-11-12 02:25:02,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 02:25:02,015 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-12 02:25:02,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:25:02,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1243797917, now seen corresponding path program 1 times [2023-11-12 02:25:02,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:25:02,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622919204] [2023-11-12 02:25:02,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:02,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:25:02,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:02,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:25:02,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:02,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-12 02:25:02,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:02,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:25:02,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:02,102 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:25:02,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:25:02,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622919204] [2023-11-12 02:25:02,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622919204] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:25:02,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:25:02,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:25:02,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767211813] [2023-11-12 02:25:02,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:25:02,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:25:02,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:25:02,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:25:02,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:25:02,106 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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:25:02,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:25:02,119 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2023-11-12 02:25:02,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:25:02,125 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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 31 [2023-11-12 02:25:02,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:25:02,126 INFO L225 Difference]: With dead ends: 52 [2023-11-12 02:25:02,126 INFO L226 Difference]: Without dead ends: 51 [2023-11-12 02:25:02,126 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:25:02,128 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 4 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 101 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:25:02,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 101 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:25:02,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-11-12 02:25:02,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-11-12 02:25:02,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 42 states have internal predecessors, (45), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-12 02:25:02,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2023-11-12 02:25:02,137 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 31 [2023-11-12 02:25:02,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:25:02,137 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2023-11-12 02:25:02,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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:25:02,138 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2023-11-12 02:25:02,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-12 02:25:02,143 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:25:02,144 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] [2023-11-12 02:25:02,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 02:25:02,144 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-12 02:25:02,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:25:02,145 INFO L85 PathProgramCache]: Analyzing trace with hash 96970361, now seen corresponding path program 1 times [2023-11-12 02:25:02,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:25:02,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335139539] [2023-11-12 02:25:02,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:02,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:25:02,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:02,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:25:02,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:02,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-12 02:25:02,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:02,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:25:02,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:02,294 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:25:02,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:25:02,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335139539] [2023-11-12 02:25:02,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335139539] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:25:02,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:25:02,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:25:02,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821202310] [2023-11-12 02:25:02,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:25:02,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:25:02,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:25:02,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:25:02,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:25:02,298 INFO L87 Difference]: Start difference. First operand 51 states and 61 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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:25:02,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:25:02,321 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2023-11-12 02:25:02,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:25:02,322 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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 32 [2023-11-12 02:25:02,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:25:02,326 INFO L225 Difference]: With dead ends: 51 [2023-11-12 02:25:02,326 INFO L226 Difference]: Without dead ends: 50 [2023-11-12 02:25:02,327 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:25:02,330 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 2 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 101 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:25:02,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 101 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:25:02,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-11-12 02:25:02,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2023-11-12 02:25:02,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 41 states have internal predecessors, (44), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-12 02:25:02,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2023-11-12 02:25:02,347 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 32 [2023-11-12 02:25:02,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:25:02,347 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2023-11-12 02:25:02,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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:25:02,348 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2023-11-12 02:25:02,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-11-12 02:25:02,349 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:25:02,349 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:25:02,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 02:25:02,350 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-12 02:25:02,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:25:02,350 INFO L85 PathProgramCache]: Analyzing trace with hash -2067940988, now seen corresponding path program 1 times [2023-11-12 02:25:02,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:25:02,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132498693] [2023-11-12 02:25:02,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:02,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:25:02,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:02,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:25:02,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:02,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-12 02:25:02,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:02,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:25:02,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:02,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:25:02,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:02,474 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:25:02,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:25:02,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132498693] [2023-11-12 02:25:02,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132498693] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:25:02,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:25:02,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:25:02,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615247101] [2023-11-12 02:25:02,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:25:02,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:25:02,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:25:02,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:25:02,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:25:02,478 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (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:25:02,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:25:02,496 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2023-11-12 02:25:02,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:25:02,498 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (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 40 [2023-11-12 02:25:02,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:25:02,499 INFO L225 Difference]: With dead ends: 50 [2023-11-12 02:25:02,499 INFO L226 Difference]: Without dead ends: 49 [2023-11-12 02:25:02,500 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:25:02,501 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 2 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:25:02,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 102 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:25:02,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-11-12 02:25:02,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-11-12 02:25:02,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 38 states have (on average 1.131578947368421) internal successors, (43), 40 states have internal predecessors, (43), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-12 02:25:02,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 59 transitions. [2023-11-12 02:25:02,517 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 59 transitions. Word has length 40 [2023-11-12 02:25:02,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:25:02,517 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 59 transitions. [2023-11-12 02:25:02,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (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:25:02,518 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2023-11-12 02:25:02,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-12 02:25:02,519 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:25:02,520 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] [2023-11-12 02:25:02,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-12 02:25:02,520 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-12 02:25:02,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:25:02,520 INFO L85 PathProgramCache]: Analyzing trace with hash 318338954, now seen corresponding path program 1 times [2023-11-12 02:25:02,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:25:02,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172776493] [2023-11-12 02:25:02,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:02,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:25:02,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:02,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:25:02,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:02,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-12 02:25:02,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:02,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:25:02,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:02,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:25:02,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:02,634 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:25:02,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:25:02,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172776493] [2023-11-12 02:25:02,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172776493] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:25:02,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:25:02,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:25:02,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947306882] [2023-11-12 02:25:02,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:25:02,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:25:02,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:25:02,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:25:02,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:25:02,638 INFO L87 Difference]: Start difference. First operand 49 states and 59 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (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:25:02,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:25:02,657 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2023-11-12 02:25:02,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:25:02,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (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 41 [2023-11-12 02:25:02,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:25:02,660 INFO L225 Difference]: With dead ends: 49 [2023-11-12 02:25:02,660 INFO L226 Difference]: Without dead ends: 0 [2023-11-12 02:25:02,662 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:25:02,664 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:25:02,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:25:02,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-12 02:25:02,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-12 02:25:02,667 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:25:02,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-12 02:25:02,668 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2023-11-12 02:25:02,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:25:02,668 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-12 02:25:02,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (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:25:02,668 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-12 02:25:02,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-12 02:25:02,671 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2023-11-12 02:25:02,672 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2023-11-12 02:25:02,672 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2023-11-12 02:25:02,672 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2023-11-12 02:25:02,672 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2023-11-12 02:25:02,672 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2023-11-12 02:25:02,673 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2023-11-12 02:25:02,673 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2023-11-12 02:25:02,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-12 02:25:02,675 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-12 02:25:02,731 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1412 1418) the Hoare annotation is: true [2023-11-12 02:25:02,731 INFO L899 garLoopResultBuilder]: For program point printLineEXIT(lines 1412 1418) no Hoare annotation was computed. [2023-11-12 02:25:02,731 INFO L899 garLoopResultBuilder]: For program point L1414(lines 1414 1417) no Hoare annotation was computed. [2023-11-12 02:25:02,732 INFO L899 garLoopResultBuilder]: For program point L1414-2(lines 1412 1418) no Hoare annotation was computed. [2023-11-12 02:25:02,732 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1426 1429) the Hoare annotation is: true [2023-11-12 02:25:02,732 INFO L899 garLoopResultBuilder]: For program point printIntLineEXIT(lines 1426 1429) no Hoare annotation was computed. [2023-11-12 02:25:02,733 INFO L899 garLoopResultBuilder]: For program point printIntLineFINAL(lines 1426 1429) no Hoare annotation was computed. [2023-11-12 02:25:02,733 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1605) no Hoare annotation was computed. [2023-11-12 02:25:02,733 INFO L902 garLoopResultBuilder]: At program point L1662(line 1662) the Hoare annotation is: true [2023-11-12 02:25:02,733 INFO L899 garLoopResultBuilder]: For program point L1629(line 1629) no Hoare annotation was computed. [2023-11-12 02:25:02,733 INFO L899 garLoopResultBuilder]: For program point L1662-1(line 1662) no Hoare annotation was computed. [2023-11-12 02:25:02,734 INFO L902 garLoopResultBuilder]: At program point L1646(line 1646) the Hoare annotation is: true [2023-11-12 02:25:02,734 INFO L899 garLoopResultBuilder]: For program point L1646-1(line 1646) no Hoare annotation was computed. [2023-11-12 02:25:02,734 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 1657 1664) no Hoare annotation was computed. [2023-11-12 02:25:02,734 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1645) no Hoare annotation was computed. [2023-11-12 02:25:02,735 INFO L899 garLoopResultBuilder]: For program point L1638(lines 1638 1641) no Hoare annotation was computed. [2023-11-12 02:25:02,735 INFO L899 garLoopResultBuilder]: For program point L1605(line 1605) no Hoare annotation was computed. [2023-11-12 02:25:02,735 INFO L899 garLoopResultBuilder]: For program point L1572(lines 1572 1580) no Hoare annotation was computed. [2023-11-12 02:25:02,735 INFO L899 garLoopResultBuilder]: For program point L1605-1(line 1605) no Hoare annotation was computed. [2023-11-12 02:25:02,735 INFO L899 garLoopResultBuilder]: For program point L1638-2(lines 1635 1649) no Hoare annotation was computed. [2023-11-12 02:25:02,735 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1574) no Hoare annotation was computed. [2023-11-12 02:25:02,736 INFO L895 garLoopResultBuilder]: At program point L1630(line 1630) the Hoare annotation is: (= (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|) 0) [2023-11-12 02:25:02,737 INFO L895 garLoopResultBuilder]: At program point L1597(line 1597) the Hoare annotation is: (and (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) [2023-11-12 02:25:02,737 INFO L899 garLoopResultBuilder]: For program point L1630-1(line 1630) no Hoare annotation was computed. [2023-11-12 02:25:02,737 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-12 02:25:02,738 INFO L899 garLoopResultBuilder]: For program point L1597-1(lines 1591 1598) no Hoare annotation was computed. [2023-11-12 02:25:02,738 INFO L899 garLoopResultBuilder]: For program point L1556(lines 1556 1563) no Hoare annotation was computed. [2023-11-12 02:25:02,738 INFO L899 garLoopResultBuilder]: For program point L1614(lines 1614 1633) no Hoare annotation was computed. [2023-11-12 02:25:02,738 INFO L895 garLoopResultBuilder]: At program point L1606(line 1606) the Hoare annotation is: (and (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) [2023-11-12 02:25:02,738 INFO L899 garLoopResultBuilder]: For program point L1606-1(line 1606) no Hoare annotation was computed. [2023-11-12 02:25:02,738 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1574) no Hoare annotation was computed. [2023-11-12 02:25:02,739 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-12 02:25:02,739 INFO L899 garLoopResultBuilder]: For program point L1574(line 1574) no Hoare annotation was computed. [2023-11-12 02:25:02,739 INFO L899 garLoopResultBuilder]: For program point L1574-1(line 1574) no Hoare annotation was computed. [2023-11-12 02:25:02,739 INFO L899 garLoopResultBuilder]: For program point L1591(lines 1591 1598) no Hoare annotation was computed. [2023-11-12 02:25:02,739 INFO L899 garLoopResultBuilder]: For program point L1583(lines 1583 1613) no Hoare annotation was computed. [2023-11-12 02:25:02,739 INFO L895 garLoopResultBuilder]: At program point L1575(line 1575) the Hoare annotation is: (and (<= 0 (+ 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) [2023-11-12 02:25:02,740 INFO L899 garLoopResultBuilder]: For program point L1575-1(line 1575) no Hoare annotation was computed. [2023-11-12 02:25:02,740 INFO L899 garLoopResultBuilder]: For program point L1650(lines 1650 1656) no Hoare annotation was computed. [2023-11-12 02:25:02,740 INFO L899 garLoopResultBuilder]: For program point L1634(lines 1634 1649) no Hoare annotation was computed. [2023-11-12 02:25:02,740 INFO L895 garLoopResultBuilder]: At program point L1568(line 1568) the Hoare annotation is: false [2023-11-12 02:25:02,740 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-12 02:25:02,740 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1629) no Hoare annotation was computed. [2023-11-12 02:25:02,741 INFO L899 garLoopResultBuilder]: For program point L1618(lines 1618 1625) no Hoare annotation was computed. [2023-11-12 02:25:02,741 INFO L899 garLoopResultBuilder]: For program point L1618-1(lines 1615 1633) no Hoare annotation was computed. [2023-11-12 02:25:02,741 INFO L899 garLoopResultBuilder]: For program point L1552(lines 1552 1565) no Hoare annotation was computed. [2023-11-12 02:25:02,741 INFO L899 garLoopResultBuilder]: For program point L1552-2(lines 1549 1582) no Hoare annotation was computed. [2023-11-12 02:25:02,741 INFO L895 garLoopResultBuilder]: At program point L1610(line 1610) the Hoare annotation is: (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647) [2023-11-12 02:25:02,743 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-12 02:25:02,744 INFO L902 garLoopResultBuilder]: At program point L1660(line 1660) the Hoare annotation is: true [2023-11-12 02:25:02,744 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1629) no Hoare annotation was computed. [2023-11-12 02:25:02,744 INFO L899 garLoopResultBuilder]: For program point L1660-1(line 1660) no Hoare annotation was computed. [2023-11-12 02:25:02,744 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1605) no Hoare annotation was computed. [2023-11-12 02:25:02,745 INFO L895 garLoopResultBuilder]: At program point L1562(line 1562) the Hoare annotation is: (and (<= 0 (+ 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) [2023-11-12 02:25:02,745 INFO L899 garLoopResultBuilder]: For program point L1562-1(lines 1556 1563) no Hoare annotation was computed. [2023-11-12 02:25:02,745 INFO L895 garLoopResultBuilder]: At program point L1620(line 1620) the Hoare annotation is: false [2023-11-12 02:25:02,746 INFO L899 garLoopResultBuilder]: For program point L1587(lines 1587 1600) no Hoare annotation was computed. [2023-11-12 02:25:02,746 INFO L899 garLoopResultBuilder]: For program point L1587-2(lines 1584 1613) no Hoare annotation was computed. [2023-11-12 02:25:02,747 INFO L899 garLoopResultBuilder]: For program point L1645(line 1645) no Hoare annotation was computed. [2023-11-12 02:25:02,749 INFO L895 garLoopResultBuilder]: At program point L1579(line 1579) the Hoare annotation is: (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) [2023-11-12 02:25:02,749 INFO L899 garLoopResultBuilder]: For program point L1579-1(lines 1548 1582) no Hoare annotation was computed. [2023-11-12 02:25:02,749 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1645) no Hoare annotation was computed. [2023-11-12 02:25:02,753 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:25:02,755 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-11-12 02:25:02,761 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 02:25:02 BoogieIcfgContainer [2023-11-12 02:25:02,761 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-12 02:25:02,762 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-12 02:25:02,762 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-12 02:25:02,762 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-12 02:25:02,763 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:25:00" (3/4) ... [2023-11-12 02:25:02,767 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-12 02:25:02,772 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2023-11-12 02:25:02,772 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2023-11-12 02:25:02,781 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2023-11-12 02:25:02,781 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2023-11-12 02:25:02,781 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-12 02:25:02,783 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-12 02:25:02,783 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-12 02:25:02,883 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5a52759-628a-44cc-a06c-b607b1f3fd84/bin/uautomizer-verify-uTZkv6EMXl/witness.graphml [2023-11-12 02:25:02,883 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5a52759-628a-44cc-a06c-b607b1f3fd84/bin/uautomizer-verify-uTZkv6EMXl/witness.yml [2023-11-12 02:25:02,883 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-12 02:25:02,884 INFO L158 Benchmark]: Toolchain (without parser) took 4582.93ms. Allocated memory was 117.4MB in the beginning and 144.7MB in the end (delta: 27.3MB). Free memory was 68.7MB in the beginning and 53.6MB in the end (delta: 15.0MB). Peak memory consumption was 44.2MB. Max. memory is 16.1GB. [2023-11-12 02:25:02,884 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 117.4MB. Free memory was 89.1MB in the beginning and 89.0MB in the end (delta: 71.8kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:25:02,885 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1484.08ms. Allocated memory was 117.4MB in the beginning and 144.7MB in the end (delta: 27.3MB). Free memory was 68.7MB in the beginning and 75.0MB in the end (delta: -6.3MB). Peak memory consumption was 36.2MB. Max. memory is 16.1GB. [2023-11-12 02:25:02,885 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.65ms. Allocated memory is still 144.7MB. Free memory was 75.0MB in the beginning and 71.5MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-12 02:25:02,886 INFO L158 Benchmark]: Boogie Preprocessor took 73.24ms. Allocated memory is still 144.7MB. Free memory was 71.5MB in the beginning and 70.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:25:02,886 INFO L158 Benchmark]: RCFGBuilder took 616.57ms. Allocated memory is still 144.7MB. Free memory was 70.1MB in the beginning and 103.9MB in the end (delta: -33.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-12 02:25:02,886 INFO L158 Benchmark]: TraceAbstraction took 2195.35ms. Allocated memory is still 144.7MB. Free memory was 103.7MB in the beginning and 58.9MB in the end (delta: 44.8MB). Peak memory consumption was 47.9MB. Max. memory is 16.1GB. [2023-11-12 02:25:02,887 INFO L158 Benchmark]: Witness Printer took 121.41ms. Allocated memory is still 144.7MB. Free memory was 58.9MB in the beginning and 53.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-12 02:25:02,889 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.27ms. Allocated memory is still 117.4MB. Free memory was 89.1MB in the beginning and 89.0MB in the end (delta: 71.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1484.08ms. Allocated memory was 117.4MB in the beginning and 144.7MB in the end (delta: 27.3MB). Free memory was 68.7MB in the beginning and 75.0MB in the end (delta: -6.3MB). Peak memory consumption was 36.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.65ms. Allocated memory is still 144.7MB. Free memory was 75.0MB in the beginning and 71.5MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.24ms. Allocated memory is still 144.7MB. Free memory was 71.5MB in the beginning and 70.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 616.57ms. Allocated memory is still 144.7MB. Free memory was 70.1MB in the beginning and 103.9MB in the end (delta: -33.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2195.35ms. Allocated memory is still 144.7MB. Free memory was 103.7MB in the beginning and 58.9MB in the end (delta: 44.8MB). Peak memory consumption was 47.9MB. Max. memory is 16.1GB. * Witness Printer took 121.41ms. Allocated memory is still 144.7MB. Free memory was 58.9MB in the beginning and 53.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1574]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1574]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1605]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1605]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1629]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1629]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1645]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1645]: 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, 62 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 9, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 45 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 33 mSDsluCounter, 880 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 375 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36 IncrementalHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 505 mSDtfsCounter, 36 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=0, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 39 PreInvPairs, 47 NumberOfFragments, 54 HoareAnnotationTreeSize, 39 FomulaSimplifications, 6 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 14 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 234 NumberOfCodeBlocks, 234 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 225 ConstructedInterpolants, 0 QuantifiedInterpolants, 275 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 56/56 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:25:02,929 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5a52759-628a-44cc-a06c-b607b1f3fd84/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