./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_sub_15_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f2db595-5d1f-4fca-9582-873327ceedee/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f2db595-5d1f-4fca-9582-873327ceedee/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_0f2db595-5d1f-4fca-9582-873327ceedee/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f2db595-5d1f-4fca-9582-873327ceedee/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerReach.xml -i ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_sub_15_good.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f2db595-5d1f-4fca-9582-873327ceedee/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_0f2db595-5d1f-4fca-9582-873327ceedee/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 1eee24e655db3a93554521bbdd9ede60ae87c6549a31d3535875d525cd4027a6 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:17:40,844 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:17:40,916 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f2db595-5d1f-4fca-9582-873327ceedee/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Overflow-64bit-Automizer_Default.epf [2023-11-12 02:17:40,922 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:17:40,922 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:17:40,945 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:17:40,946 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:17:40,946 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:17:40,947 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:17:40,948 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:17:40,948 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:17:40,949 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:17:40,950 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:17:40,950 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:17:40,951 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 02:17:40,952 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:17:40,952 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:17:40,953 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 02:17:40,953 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:17:40,954 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 02:17:40,954 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-12 02:17:40,955 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 02:17:40,955 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:17:40,956 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:17:40,957 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:17:40,957 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:17:40,958 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:17:40,958 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:17:40,959 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:17:40,959 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:17:40,960 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 02:17:40,960 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:17:40,961 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:17:40,961 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:17:40,961 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 02:17:40,962 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:17:40,962 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:17:40,963 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:17:40,963 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_0f2db595-5d1f-4fca-9582-873327ceedee/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_0f2db595-5d1f-4fca-9582-873327ceedee/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 -> 1eee24e655db3a93554521bbdd9ede60ae87c6549a31d3535875d525cd4027a6 [2023-11-12 02:17:41,254 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:17:41,291 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:17:41,294 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:17:41,296 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:17:41,296 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:17:41,298 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f2db595-5d1f-4fca-9582-873327ceedee/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_sub_15_good.i [2023-11-12 02:17:44,525 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:17:44,984 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:17:44,988 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f2db595-5d1f-4fca-9582-873327ceedee/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_sub_15_good.i [2023-11-12 02:17:45,019 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f2db595-5d1f-4fca-9582-873327ceedee/bin/uautomizer-verify-uTZkv6EMXl/data/d0b714455/a1cb63962af34e0aa6a16b76e4c614a3/FLAGdf5092e6e [2023-11-12 02:17:45,036 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f2db595-5d1f-4fca-9582-873327ceedee/bin/uautomizer-verify-uTZkv6EMXl/data/d0b714455/a1cb63962af34e0aa6a16b76e4c614a3 [2023-11-12 02:17:45,038 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:17:45,040 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:17:45,041 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:17:45,041 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:17:45,047 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:17:45,048 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:17:45" (1/1) ... [2023-11-12 02:17:45,049 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@677064f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:17:45, skipping insertion in model container [2023-11-12 02:17:45,049 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:17:45" (1/1) ... [2023-11-12 02:17:45,130 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:17:45,514 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-12 02:17:46,151 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:17:46,162 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:17:46,183 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-12 02:17:46,282 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:17:46,544 WARN L672 CHandler]: The function puts is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:17:46,544 WARN L672 CHandler]: The function __ctype_b_loc is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:17:46,544 WARN L672 CHandler]: The function iswxdigit is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:17:46,544 WARN L672 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:17:46,545 WARN L672 CHandler]: The function time is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:17:46,552 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:17:46,553 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:17:46 WrapperNode [2023-11-12 02:17:46,553 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:17:46,556 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:17:46,556 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:17:46,556 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:17:46,565 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:17:46" (1/1) ... [2023-11-12 02:17:46,609 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:17:46" (1/1) ... [2023-11-12 02:17:46,671 INFO L138 Inliner]: procedures = 503, calls = 83, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 248 [2023-11-12 02:17:46,673 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:17:46,674 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:17:46,674 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:17:46,674 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:17:46,689 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:17:46" (1/1) ... [2023-11-12 02:17:46,690 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:17:46" (1/1) ... [2023-11-12 02:17:46,708 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:17:46" (1/1) ... [2023-11-12 02:17:46,712 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:17:46" (1/1) ... [2023-11-12 02:17:46,719 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:17:46" (1/1) ... [2023-11-12 02:17:46,735 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:17:46" (1/1) ... [2023-11-12 02:17:46,737 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:17:46" (1/1) ... [2023-11-12 02:17:46,739 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:17:46" (1/1) ... [2023-11-12 02:17:46,754 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:17:46,755 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:17:46,756 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:17:46,756 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:17:46,757 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:17:46" (1/1) ... [2023-11-12 02:17:46,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:17:46,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f2db595-5d1f-4fca-9582-873327ceedee/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:17:46,806 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f2db595-5d1f-4fca-9582-873327ceedee/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:17:46,813 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f2db595-5d1f-4fca-9582-873327ceedee/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:17:46,841 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2023-11-12 02:17:46,842 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2023-11-12 02:17:46,842 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2023-11-12 02:17:46,842 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2023-11-12 02:17:46,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:17:46,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:17:46,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:17:46,843 INFO L130 BoogieDeclarations]: Found specification of procedure time [2023-11-12 02:17:46,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:17:46,998 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:17:47,000 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:17:47,376 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:17:47,385 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:17:47,385 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-12 02:17:47,388 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:17:47 BoogieIcfgContainer [2023-11-12 02:17:47,388 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:17:47,397 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:17:47,398 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:17:47,401 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:17:47,407 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:17:45" (1/3) ... [2023-11-12 02:17:47,408 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e97d497 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:17:47, skipping insertion in model container [2023-11-12 02:17:47,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:17:46" (2/3) ... [2023-11-12 02:17:47,408 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e97d497 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:17:47, skipping insertion in model container [2023-11-12 02:17:47,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:17:47" (3/3) ... [2023-11-12 02:17:47,410 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_rand_sub_15_good.i [2023-11-12 02:17:47,437 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:17:47,438 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-11-12 02:17:47,500 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:17:47,508 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;@1b2d4994, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:17:47,508 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2023-11-12 02:17:47,516 INFO L276 IsEmpty]: Start isEmpty. Operand has 117 states, 90 states have (on average 1.5888888888888888) internal successors, (143), 108 states have internal predecessors, (143), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-12 02:17:47,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-12 02:17:47,526 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:17:47,527 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:17:47,528 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:17:47,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:17:47,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1169087764, now seen corresponding path program 1 times [2023-11-12 02:17:47,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:17:47,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444580924] [2023-11-12 02:17:47,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:17:47,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:17:47,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:47,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:17:47,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:47,863 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:17:47,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:17:47,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444580924] [2023-11-12 02:17:47,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444580924] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:17:47,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:17:47,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:17:47,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720760079] [2023-11-12 02:17:47,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:17:47,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:17:47,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:17:47,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:17:47,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:17:47,908 INFO L87 Difference]: Start difference. First operand has 117 states, 90 states have (on average 1.5888888888888888) internal successors, (143), 108 states have internal predecessors, (143), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-12 02:17:47,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:17:47,955 INFO L93 Difference]: Finished difference Result 209 states and 308 transitions. [2023-11-12 02:17:47,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:17:47,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2023-11-12 02:17:47,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:17:47,967 INFO L225 Difference]: With dead ends: 209 [2023-11-12 02:17:47,967 INFO L226 Difference]: Without dead ends: 103 [2023-11-12 02:17:47,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:17:47,975 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 32 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:17:47,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 304 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:17:47,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-11-12 02:17:48,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2023-11-12 02:17:48,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 81 states have (on average 1.5925925925925926) internal successors, (129), 96 states have internal predecessors, (129), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-12 02:17:48,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 153 transitions. [2023-11-12 02:17:48,025 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 153 transitions. Word has length 15 [2023-11-12 02:17:48,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:17:48,027 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 153 transitions. [2023-11-12 02:17:48,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-12 02:17:48,027 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 153 transitions. [2023-11-12 02:17:48,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-12 02:17:48,029 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:17:48,030 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:17:48,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:17:48,030 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:17:48,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:17:48,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1479525187, now seen corresponding path program 1 times [2023-11-12 02:17:48,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:17:48,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933529346] [2023-11-12 02:17:48,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:17:48,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:17:48,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:48,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:17:48,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:48,187 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:17:48,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:17:48,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933529346] [2023-11-12 02:17:48,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933529346] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:17:48,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:17:48,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:17:48,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43911719] [2023-11-12 02:17:48,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:17:48,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:17:48,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:17:48,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:17:48,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:17:48,191 INFO L87 Difference]: Start difference. First operand 103 states and 153 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, (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:17:48,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:17:48,228 INFO L93 Difference]: Finished difference Result 105 states and 155 transitions. [2023-11-12 02:17:48,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:17:48,229 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2023-11-12 02:17:48,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:17:48,232 INFO L225 Difference]: With dead ends: 105 [2023-11-12 02:17:48,232 INFO L226 Difference]: Without dead ends: 104 [2023-11-12 02:17:48,233 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:17:48,234 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 36 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:17:48,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 262 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:17:48,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-11-12 02:17:48,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2023-11-12 02:17:48,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 81 states have (on average 1.5802469135802468) internal successors, (128), 95 states have internal predecessors, (128), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-12 02:17:48,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 152 transitions. [2023-11-12 02:17:48,251 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 152 transitions. Word has length 20 [2023-11-12 02:17:48,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:17:48,252 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 152 transitions. [2023-11-12 02:17:48,252 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, (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:17:48,252 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 152 transitions. [2023-11-12 02:17:48,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-12 02:17:48,254 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:17:48,254 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:17:48,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:17:48,254 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:17:48,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:17:48,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1379359607, now seen corresponding path program 1 times [2023-11-12 02:17:48,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:17:48,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931820390] [2023-11-12 02:17:48,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:17:48,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:17:48,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:48,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:17:48,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:48,468 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:17:48,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:17:48,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931820390] [2023-11-12 02:17:48,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931820390] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:17:48,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:17:48,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:17:48,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698058543] [2023-11-12 02:17:48,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:17:48,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:17:48,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:17:48,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:17:48,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:17:48,477 INFO L87 Difference]: Start difference. First operand 102 states and 152 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, (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:17:48,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:17:48,514 INFO L93 Difference]: Finished difference Result 102 states and 152 transitions. [2023-11-12 02:17:48,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:17:48,516 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2023-11-12 02:17:48,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:17:48,519 INFO L225 Difference]: With dead ends: 102 [2023-11-12 02:17:48,521 INFO L226 Difference]: Without dead ends: 101 [2023-11-12 02:17:48,522 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:17:48,524 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 37 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 250 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:17:48,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 250 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:17:48,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-11-12 02:17:48,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2023-11-12 02:17:48,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 81 states have (on average 1.5679012345679013) internal successors, (127), 94 states have internal predecessors, (127), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-12 02:17:48,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 151 transitions. [2023-11-12 02:17:48,582 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 151 transitions. Word has length 21 [2023-11-12 02:17:48,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:17:48,583 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 151 transitions. [2023-11-12 02:17:48,583 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, (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:17:48,583 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 151 transitions. [2023-11-12 02:17:48,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-12 02:17:48,585 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:17:48,585 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:17:48,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 02:17:48,586 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:17:48,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:17:48,587 INFO L85 PathProgramCache]: Analyzing trace with hash 2049008343, now seen corresponding path program 1 times [2023-11-12 02:17:48,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:17:48,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478498544] [2023-11-12 02:17:48,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:17:48,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:17:48,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:48,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:17:48,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:48,676 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:17:48,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:17:48,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478498544] [2023-11-12 02:17:48,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478498544] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:17:48,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:17:48,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:17:48,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957272295] [2023-11-12 02:17:48,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:17:48,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:17:48,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:17:48,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:17:48,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:17:48,680 INFO L87 Difference]: Start difference. First operand 101 states and 151 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (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:17:48,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:17:48,723 INFO L93 Difference]: Finished difference Result 169 states and 249 transitions. [2023-11-12 02:17:48,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:17:48,724 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (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 26 [2023-11-12 02:17:48,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:17:48,730 INFO L225 Difference]: With dead ends: 169 [2023-11-12 02:17:48,731 INFO L226 Difference]: Without dead ends: 101 [2023-11-12 02:17:48,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:17:48,734 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 6 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 284 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:17:48,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 284 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:17:48,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-11-12 02:17:48,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2023-11-12 02:17:48,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 81 states have (on average 1.5555555555555556) internal successors, (126), 94 states have internal predecessors, (126), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-12 02:17:48,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 150 transitions. [2023-11-12 02:17:48,755 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 150 transitions. Word has length 26 [2023-11-12 02:17:48,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:17:48,755 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 150 transitions. [2023-11-12 02:17:48,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (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:17:48,756 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 150 transitions. [2023-11-12 02:17:48,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-12 02:17:48,757 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:17:48,757 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:17:48,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 02:17:48,758 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-12 02:17:48,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:17:48,759 INFO L85 PathProgramCache]: Analyzing trace with hash 358930341, now seen corresponding path program 1 times [2023-11-12 02:17:48,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:17:48,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638214859] [2023-11-12 02:17:48,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:17:48,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:17:48,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:48,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:17:48,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:48,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:17:48,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:48,846 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:17:48,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:17:48,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638214859] [2023-11-12 02:17:48,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638214859] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:17:48,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:17:48,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:17:48,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676637169] [2023-11-12 02:17:48,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:17:48,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:17:48,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:17:48,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:17:48,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:17:48,851 INFO L87 Difference]: Start difference. First operand 101 states and 150 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-12 02:17:48,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:17:48,881 INFO L93 Difference]: Finished difference Result 169 states and 248 transitions. [2023-11-12 02:17:48,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:17:48,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2023-11-12 02:17:48,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:17:48,884 INFO L225 Difference]: With dead ends: 169 [2023-11-12 02:17:48,885 INFO L226 Difference]: Without dead ends: 100 [2023-11-12 02:17:48,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:17:48,891 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:17:48,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 287 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:17:48,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-11-12 02:17:48,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2023-11-12 02:17:48,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 81 states have (on average 1.5432098765432098) internal successors, (125), 93 states have internal predecessors, (125), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-12 02:17:48,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 147 transitions. [2023-11-12 02:17:48,915 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 147 transitions. Word has length 30 [2023-11-12 02:17:48,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:17:48,915 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 147 transitions. [2023-11-12 02:17:48,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-12 02:17:48,916 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 147 transitions. [2023-11-12 02:17:48,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-12 02:17:48,921 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:17:48,921 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:17:48,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 02:17:48,922 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-12 02:17:48,923 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:17:48,923 INFO L85 PathProgramCache]: Analyzing trace with hash -61144257, now seen corresponding path program 1 times [2023-11-12 02:17:48,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:17:48,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483287680] [2023-11-12 02:17:48,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:17:48,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:17:48,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:48,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:17:48,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:48,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-12 02:17:48,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:49,007 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:17:49,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:17:49,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483287680] [2023-11-12 02:17:49,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483287680] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:17:49,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:17:49,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:17:49,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370867075] [2023-11-12 02:17:49,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:17:49,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:17:49,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:17:49,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:17:49,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:17:49,016 INFO L87 Difference]: Start difference. First operand 100 states and 147 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (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:17:49,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:17:49,027 INFO L93 Difference]: Finished difference Result 145 states and 206 transitions. [2023-11-12 02:17:49,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:17:49,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (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 32 [2023-11-12 02:17:49,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:17:49,029 INFO L225 Difference]: With dead ends: 145 [2023-11-12 02:17:49,030 INFO L226 Difference]: Without dead ends: 98 [2023-11-12 02:17:49,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:17:49,038 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 32 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:17:49,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 248 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:17:49,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-11-12 02:17:49,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2023-11-12 02:17:49,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 80 states have (on average 1.525) internal successors, (122), 91 states have internal predecessors, (122), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-12 02:17:49,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 142 transitions. [2023-11-12 02:17:49,056 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 142 transitions. Word has length 32 [2023-11-12 02:17:49,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:17:49,056 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 142 transitions. [2023-11-12 02:17:49,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (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:17:49,057 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 142 transitions. [2023-11-12 02:17:49,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-12 02:17:49,058 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:17:49,058 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:17:49,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 02:17:49,058 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-12 02:17:49,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:17:49,059 INFO L85 PathProgramCache]: Analyzing trace with hash 918300096, now seen corresponding path program 1 times [2023-11-12 02:17:49,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:17:49,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251425716] [2023-11-12 02:17:49,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:17:49,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:17:49,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:49,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:17:49,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:49,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-12 02:17:49,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:49,133 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:17:49,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:17:49,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251425716] [2023-11-12 02:17:49,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251425716] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:17:49,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:17:49,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:17:49,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879278919] [2023-11-12 02:17:49,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:17:49,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:17:49,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:17:49,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:17:49,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:17:49,136 INFO L87 Difference]: Start difference. First operand 98 states and 142 transitions. Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 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:17:49,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:17:49,157 INFO L93 Difference]: Finished difference Result 100 states and 144 transitions. [2023-11-12 02:17:49,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:17:49,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 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 37 [2023-11-12 02:17:49,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:17:49,160 INFO L225 Difference]: With dead ends: 100 [2023-11-12 02:17:49,160 INFO L226 Difference]: Without dead ends: 99 [2023-11-12 02:17:49,160 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:17:49,163 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 36 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:17:49,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 240 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:17:49,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-11-12 02:17:49,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2023-11-12 02:17:49,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 80 states have (on average 1.5125) internal successors, (121), 90 states have internal predecessors, (121), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-12 02:17:49,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 141 transitions. [2023-11-12 02:17:49,179 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 141 transitions. Word has length 37 [2023-11-12 02:17:49,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:17:49,181 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 141 transitions. [2023-11-12 02:17:49,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 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:17:49,182 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 141 transitions. [2023-11-12 02:17:49,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-12 02:17:49,188 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:17:49,189 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:17:49,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 02:17:49,190 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-12 02:17:49,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:17:49,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1597467838, now seen corresponding path program 1 times [2023-11-12 02:17:49,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:17:49,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961004779] [2023-11-12 02:17:49,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:17:49,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:17:49,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:49,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:17:49,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:49,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-12 02:17:49,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:49,350 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:17:49,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:17:49,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961004779] [2023-11-12 02:17:49,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961004779] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:17:49,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:17:49,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:17:49,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133104072] [2023-11-12 02:17:49,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:17:49,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:17:49,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:17:49,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:17:49,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:17:49,353 INFO L87 Difference]: Start difference. First operand 97 states and 141 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 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:17:49,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:17:49,371 INFO L93 Difference]: Finished difference Result 97 states and 141 transitions. [2023-11-12 02:17:49,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:17:49,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 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 38 [2023-11-12 02:17:49,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:17:49,373 INFO L225 Difference]: With dead ends: 97 [2023-11-12 02:17:49,373 INFO L226 Difference]: Without dead ends: 96 [2023-11-12 02:17:49,374 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:17:49,375 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 38 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 228 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:17:49,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 228 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:17:49,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-11-12 02:17:49,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2023-11-12 02:17:49,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 80 states have (on average 1.5) internal successors, (120), 89 states have internal predecessors, (120), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-12 02:17:49,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 140 transitions. [2023-11-12 02:17:49,395 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 140 transitions. Word has length 38 [2023-11-12 02:17:49,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:17:49,397 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 140 transitions. [2023-11-12 02:17:49,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 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:17:49,400 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 140 transitions. [2023-11-12 02:17:49,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-11-12 02:17:49,401 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:17:49,401 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:17:49,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-12 02:17:49,402 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-12 02:17:49,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:17:49,402 INFO L85 PathProgramCache]: Analyzing trace with hash -905514887, now seen corresponding path program 1 times [2023-11-12 02:17:49,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:17:49,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220205013] [2023-11-12 02:17:49,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:17:49,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:17:49,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:49,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:17:49,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:49,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-12 02:17:49,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:49,495 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:17:49,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:17:49,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220205013] [2023-11-12 02:17:49,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220205013] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:17:49,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:17:49,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:17:49,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629647284] [2023-11-12 02:17:49,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:17:49,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:17:49,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:17:49,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:17:49,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:17:49,500 INFO L87 Difference]: Start difference. First operand 96 states and 140 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-12 02:17:49,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:17:49,521 INFO L93 Difference]: Finished difference Result 129 states and 181 transitions. [2023-11-12 02:17:49,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:17:49,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2023-11-12 02:17:49,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:17:49,523 INFO L225 Difference]: With dead ends: 129 [2023-11-12 02:17:49,523 INFO L226 Difference]: Without dead ends: 94 [2023-11-12 02:17:49,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:17:49,525 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 6 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 257 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:17:49,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 257 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:17:49,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-11-12 02:17:49,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2023-11-12 02:17:49,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 79 states have (on average 1.481012658227848) internal successors, (117), 87 states have internal predecessors, (117), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-12 02:17:49,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 135 transitions. [2023-11-12 02:17:49,533 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 135 transitions. Word has length 43 [2023-11-12 02:17:49,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:17:49,534 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 135 transitions. [2023-11-12 02:17:49,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-12 02:17:49,534 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 135 transitions. [2023-11-12 02:17:49,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-11-12 02:17:49,535 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:17:49,536 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:17:49,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-12 02:17:49,536 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-12 02:17:49,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:17:49,537 INFO L85 PathProgramCache]: Analyzing trace with hash 2143133321, now seen corresponding path program 1 times [2023-11-12 02:17:49,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:17:49,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114338793] [2023-11-12 02:17:49,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:17:49,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:17:49,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:49,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:17:49,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:49,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-12 02:17:49,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:49,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-12 02:17:49,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:49,623 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:17:49,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:17:49,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114338793] [2023-11-12 02:17:49,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114338793] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:17:49,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:17:49,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:17:49,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895178912] [2023-11-12 02:17:49,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:17:49,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:17:49,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:17:49,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:17:49,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:17:49,626 INFO L87 Difference]: Start difference. First operand 94 states and 135 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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:17:49,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:17:49,638 INFO L93 Difference]: Finished difference Result 122 states and 168 transitions. [2023-11-12 02:17:49,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:17:49,639 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 48 [2023-11-12 02:17:49,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:17:49,640 INFO L225 Difference]: With dead ends: 122 [2023-11-12 02:17:49,640 INFO L226 Difference]: Without dead ends: 94 [2023-11-12 02:17:49,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:17:49,641 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 1 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 260 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:17:49,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 260 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:17:49,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-11-12 02:17:49,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2023-11-12 02:17:49,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 79 states have (on average 1.4683544303797469) internal successors, (116), 87 states have internal predecessors, (116), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-12 02:17:49,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 134 transitions. [2023-11-12 02:17:49,648 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 134 transitions. Word has length 48 [2023-11-12 02:17:49,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:17:49,648 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 134 transitions. [2023-11-12 02:17:49,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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:17:49,649 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 134 transitions. [2023-11-12 02:17:49,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-11-12 02:17:49,650 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:17:49,650 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:17:49,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-12 02:17:49,650 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-12 02:17:49,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:17:49,651 INFO L85 PathProgramCache]: Analyzing trace with hash 2143073739, now seen corresponding path program 1 times [2023-11-12 02:17:49,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:17:49,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157843837] [2023-11-12 02:17:49,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:17:49,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:17:49,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:49,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:17:49,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:49,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-12 02:17:49,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:49,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-12 02:17:49,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:49,720 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:17:49,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:17:49,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157843837] [2023-11-12 02:17:49,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157843837] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:17:49,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:17:49,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:17:49,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739232754] [2023-11-12 02:17:49,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:17:49,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:17:49,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:17:49,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:17:49,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:17:49,724 INFO L87 Difference]: Start difference. First operand 94 states and 134 transitions. Second operand has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (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:17:49,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:17:49,735 INFO L93 Difference]: Finished difference Result 94 states and 134 transitions. [2023-11-12 02:17:49,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:17:49,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (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 48 [2023-11-12 02:17:49,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:17:49,737 INFO L225 Difference]: With dead ends: 94 [2023-11-12 02:17:49,737 INFO L226 Difference]: Without dead ends: 93 [2023-11-12 02:17:49,738 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:17:49,738 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 10 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 245 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:17:49,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 245 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:17:49,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-11-12 02:17:49,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2023-11-12 02:17:49,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 79 states have (on average 1.4556962025316456) internal successors, (115), 86 states have internal predecessors, (115), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-12 02:17:49,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 133 transitions. [2023-11-12 02:17:49,745 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 133 transitions. Word has length 48 [2023-11-12 02:17:49,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:17:49,745 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 133 transitions. [2023-11-12 02:17:49,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (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:17:49,746 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 133 transitions. [2023-11-12 02:17:49,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-11-12 02:17:49,747 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:17:49,747 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:17:49,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-12 02:17:49,747 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-12 02:17:49,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:17:49,748 INFO L85 PathProgramCache]: Analyzing trace with hash 2010776765, now seen corresponding path program 1 times [2023-11-12 02:17:49,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:17:49,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533835636] [2023-11-12 02:17:49,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:17:49,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:17:49,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:49,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:17:49,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:49,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-12 02:17:49,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:49,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-12 02:17:49,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:49,818 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:17:49,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:17:49,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533835636] [2023-11-12 02:17:49,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533835636] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:17:49,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:17:49,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:17:49,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027879682] [2023-11-12 02:17:49,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:17:49,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:17:49,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:17:49,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:17:49,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:17:49,821 INFO L87 Difference]: Start difference. First operand 93 states and 133 transitions. Second operand has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (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:17:49,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:17:49,837 INFO L93 Difference]: Finished difference Result 104 states and 148 transitions. [2023-11-12 02:17:49,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:17:49,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (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 49 [2023-11-12 02:17:49,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:17:49,839 INFO L225 Difference]: With dead ends: 104 [2023-11-12 02:17:49,839 INFO L226 Difference]: Without dead ends: 103 [2023-11-12 02:17:49,839 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:17:49,840 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 6 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:17:49,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 258 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:17:49,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-11-12 02:17:49,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 97. [2023-11-12 02:17:49,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 83 states have (on average 1.4457831325301205) internal successors, (120), 89 states have internal predecessors, (120), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-12 02:17:49,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 138 transitions. [2023-11-12 02:17:49,847 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 138 transitions. Word has length 49 [2023-11-12 02:17:49,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:17:49,848 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 138 transitions. [2023-11-12 02:17:49,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (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:17:49,848 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 138 transitions. [2023-11-12 02:17:49,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-12 02:17:49,849 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:17:49,849 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:17:49,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-12 02:17:49,850 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-12 02:17:49,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:17:49,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1272497446, now seen corresponding path program 1 times [2023-11-12 02:17:49,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:17:49,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178575144] [2023-11-12 02:17:49,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:17:49,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:17:49,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:49,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:17:49,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:49,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-12 02:17:49,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:49,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-12 02:17:49,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:49,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-12 02:17:49,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:49,914 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-12 02:17:49,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:17:49,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178575144] [2023-11-12 02:17:49,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178575144] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:17:49,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:17:49,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:17:49,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577476649] [2023-11-12 02:17:49,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:17:49,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:17:49,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:17:49,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:17:49,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:17:49,917 INFO L87 Difference]: Start difference. First operand 97 states and 138 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-12 02:17:49,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:17:49,928 INFO L93 Difference]: Finished difference Result 119 states and 164 transitions. [2023-11-12 02:17:49,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:17:49,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 53 [2023-11-12 02:17:49,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:17:49,930 INFO L225 Difference]: With dead ends: 119 [2023-11-12 02:17:49,930 INFO L226 Difference]: Without dead ends: 91 [2023-11-12 02:17:49,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:17:49,931 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:17:49,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 252 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:17:49,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-11-12 02:17:49,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2023-11-12 02:17:49,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 79 states have (on average 1.4303797468354431) internal successors, (113), 84 states have internal predecessors, (113), 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:17:49,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 129 transitions. [2023-11-12 02:17:49,937 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 129 transitions. Word has length 53 [2023-11-12 02:17:49,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:17:49,938 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 129 transitions. [2023-11-12 02:17:49,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-12 02:17:49,938 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 129 transitions. [2023-11-12 02:17:49,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-11-12 02:17:49,939 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:17:49,939 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:17:49,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-12 02:17:49,940 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-12 02:17:49,940 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:17:49,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1446929021, now seen corresponding path program 1 times [2023-11-12 02:17:49,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:17:49,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725651749] [2023-11-12 02:17:49,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:17:49,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:17:49,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:49,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:17:49,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:49,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-12 02:17:49,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:49,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-12 02:17:49,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:50,001 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:17:50,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:17:50,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725651749] [2023-11-12 02:17:50,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725651749] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:17:50,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:17:50,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:17:50,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841758594] [2023-11-12 02:17:50,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:17:50,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:17:50,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:17:50,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:17:50,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:17:50,004 INFO L87 Difference]: Start difference. First operand 91 states and 129 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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:17:50,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:17:50,014 INFO L93 Difference]: Finished difference Result 106 states and 146 transitions. [2023-11-12 02:17:50,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:17:50,014 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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 54 [2023-11-12 02:17:50,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:17:50,015 INFO L225 Difference]: With dead ends: 106 [2023-11-12 02:17:50,015 INFO L226 Difference]: Without dead ends: 89 [2023-11-12 02:17:50,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:17:50,017 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 4 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 238 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:17:50,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 238 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:17:50,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-11-12 02:17:50,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-11-12 02:17:50,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 78 states have (on average 1.4102564102564104) internal successors, (110), 82 states have internal predecessors, (110), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-12 02:17:50,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 124 transitions. [2023-11-12 02:17:50,022 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 124 transitions. Word has length 54 [2023-11-12 02:17:50,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:17:50,023 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 124 transitions. [2023-11-12 02:17:50,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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:17:50,023 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 124 transitions. [2023-11-12 02:17:50,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-12 02:17:50,024 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:17:50,024 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:17:50,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-12 02:17:50,025 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-12 02:17:50,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:17:50,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1264999205, now seen corresponding path program 1 times [2023-11-12 02:17:50,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:17:50,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314490892] [2023-11-12 02:17:50,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:17:50,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:17:50,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:50,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:17:50,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:50,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-12 02:17:50,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:50,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-12 02:17:50,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:50,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-12 02:17:50,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:50,098 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:17:50,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:17:50,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314490892] [2023-11-12 02:17:50,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314490892] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:17:50,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:17:50,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:17:50,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893720626] [2023-11-12 02:17:50,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:17:50,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:17:50,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:17:50,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:17:50,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:17:50,101 INFO L87 Difference]: Start difference. First operand 89 states and 124 transitions. Second operand has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 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:17:50,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:17:50,109 INFO L93 Difference]: Finished difference Result 89 states and 124 transitions. [2023-11-12 02:17:50,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:17:50,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 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 60 [2023-11-12 02:17:50,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:17:50,111 INFO L225 Difference]: With dead ends: 89 [2023-11-12 02:17:50,111 INFO L226 Difference]: Without dead ends: 88 [2023-11-12 02:17:50,112 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:17:50,112 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 5 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 234 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:17:50,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 234 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:17:50,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-11-12 02:17:50,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2023-11-12 02:17:50,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 81 states have internal predecessors, (109), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-12 02:17:50,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 123 transitions. [2023-11-12 02:17:50,118 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 123 transitions. Word has length 60 [2023-11-12 02:17:50,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:17:50,137 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 123 transitions. [2023-11-12 02:17:50,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 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:17:50,138 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 123 transitions. [2023-11-12 02:17:50,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-12 02:17:50,139 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:17:50,139 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:17:50,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-12 02:17:50,139 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-12 02:17:50,140 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:17:50,140 INFO L85 PathProgramCache]: Analyzing trace with hash -560269361, now seen corresponding path program 1 times [2023-11-12 02:17:50,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:17:50,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403149546] [2023-11-12 02:17:50,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:17:50,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:17:50,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:50,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:17:50,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:50,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-12 02:17:50,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:50,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-12 02:17:50,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:50,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-12 02:17:50,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:50,211 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:17:50,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:17:50,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403149546] [2023-11-12 02:17:50,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403149546] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:17:50,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:17:50,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:17:50,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009055634] [2023-11-12 02:17:50,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:17:50,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:17:50,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:17:50,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:17:50,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:17:50,214 INFO L87 Difference]: Start difference. First operand 88 states and 123 transitions. Second operand has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 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:17:50,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:17:50,223 INFO L93 Difference]: Finished difference Result 93 states and 127 transitions. [2023-11-12 02:17:50,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:17:50,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 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 61 [2023-11-12 02:17:50,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:17:50,225 INFO L225 Difference]: With dead ends: 93 [2023-11-12 02:17:50,225 INFO L226 Difference]: Without dead ends: 88 [2023-11-12 02:17:50,225 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:17:50,226 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 241 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:17:50,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 241 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:17:50,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-11-12 02:17:50,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2023-11-12 02:17:50,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 81 states have internal predecessors, (108), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-12 02:17:50,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 122 transitions. [2023-11-12 02:17:50,231 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 122 transitions. Word has length 61 [2023-11-12 02:17:50,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:17:50,232 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 122 transitions. [2023-11-12 02:17:50,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 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:17:50,232 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 122 transitions. [2023-11-12 02:17:50,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-11-12 02:17:50,233 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:17:50,234 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:17:50,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-12 02:17:50,234 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-12 02:17:50,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:17:50,235 INFO L85 PathProgramCache]: Analyzing trace with hash -133160774, now seen corresponding path program 1 times [2023-11-12 02:17:50,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:17:50,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754116284] [2023-11-12 02:17:50,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:17:50,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:17:50,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:50,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:17:50,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:50,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-12 02:17:50,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:50,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-12 02:17:50,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:50,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-12 02:17:50,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:50,295 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:17:50,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:17:50,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754116284] [2023-11-12 02:17:50,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754116284] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:17:50,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:17:50,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:17:50,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303893179] [2023-11-12 02:17:50,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:17:50,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:17:50,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:17:50,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:17:50,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:17:50,298 INFO L87 Difference]: Start difference. First operand 88 states and 122 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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:17:50,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:17:50,303 INFO L93 Difference]: Finished difference Result 92 states and 126 transitions. [2023-11-12 02:17:50,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:17:50,304 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 62 [2023-11-12 02:17:50,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:17:50,304 INFO L225 Difference]: With dead ends: 92 [2023-11-12 02:17:50,305 INFO L226 Difference]: Without dead ends: 0 [2023-11-12 02:17:50,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:17:50,306 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 225 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:17:50,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:17:50,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-12 02:17:50,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-12 02:17:50,307 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:17:50,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-12 02:17:50,307 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 62 [2023-11-12 02:17:50,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:17:50,308 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-12 02:17:50,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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:17:50,308 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-12 02:17:50,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-12 02:17:50,311 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2023-11-12 02:17:50,312 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2023-11-12 02:17:50,312 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2023-11-12 02:17:50,312 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2023-11-12 02:17:50,313 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2023-11-12 02:17:50,313 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2023-11-12 02:17:50,313 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2023-11-12 02:17:50,313 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2023-11-12 02:17:50,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-12 02:17:50,316 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-12 02:17:50,364 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1412 1418) the Hoare annotation is: true [2023-11-12 02:17:50,364 INFO L899 garLoopResultBuilder]: For program point printLineEXIT(lines 1412 1418) no Hoare annotation was computed. [2023-11-12 02:17:50,364 INFO L899 garLoopResultBuilder]: For program point L1414(lines 1414 1417) no Hoare annotation was computed. [2023-11-12 02:17:50,365 INFO L899 garLoopResultBuilder]: For program point L1414-2(lines 1412 1418) no Hoare annotation was computed. [2023-11-12 02:17:50,365 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1426 1429) the Hoare annotation is: true [2023-11-12 02:17:50,365 INFO L899 garLoopResultBuilder]: For program point printIntLineEXIT(lines 1426 1429) no Hoare annotation was computed. [2023-11-12 02:17:50,365 INFO L899 garLoopResultBuilder]: For program point printIntLineFINAL(lines 1426 1429) no Hoare annotation was computed. [2023-11-12 02:17:50,365 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1597) no Hoare annotation was computed. [2023-11-12 02:17:50,365 INFO L902 garLoopResultBuilder]: At program point L1654(line 1654) the Hoare annotation is: true [2023-11-12 02:17:50,366 INFO L899 garLoopResultBuilder]: For program point L1654-1(line 1654) no Hoare annotation was computed. [2023-11-12 02:17:50,366 INFO L899 garLoopResultBuilder]: For program point L1588(line 1588) no Hoare annotation was computed. [2023-11-12 02:17:50,366 INFO L899 garLoopResultBuilder]: For program point L1555(line 1555) no Hoare annotation was computed. [2023-11-12 02:17:50,366 INFO L899 garLoopResultBuilder]: For program point L1555-1(line 1555) no Hoare annotation was computed. [2023-11-12 02:17:50,366 INFO L899 garLoopResultBuilder]: For program point L1555-3(line 1555) no Hoare annotation was computed. [2023-11-12 02:17:50,366 INFO L899 garLoopResultBuilder]: For program point L1555-5(line 1555) no Hoare annotation was computed. [2023-11-12 02:17:50,366 INFO L899 garLoopResultBuilder]: For program point L1555-7(line 1555) no Hoare annotation was computed. [2023-11-12 02:17:50,367 INFO L899 garLoopResultBuilder]: For program point L1555-8(line 1555) no Hoare annotation was computed. [2023-11-12 02:17:50,367 INFO L899 garLoopResultBuilder]: For program point L1555-10(line 1555) no Hoare annotation was computed. [2023-11-12 02:17:50,367 INFO L899 garLoopResultBuilder]: For program point L1555-12(line 1555) no Hoare annotation was computed. [2023-11-12 02:17:50,367 INFO L899 garLoopResultBuilder]: For program point L1555-14(line 1555) no Hoare annotation was computed. [2023-11-12 02:17:50,367 INFO L899 garLoopResultBuilder]: For program point L1605(line 1605) no Hoare annotation was computed. [2023-11-12 02:17:50,367 INFO L899 garLoopResultBuilder]: For program point L1555-16(line 1555) no Hoare annotation was computed. [2023-11-12 02:17:50,368 INFO L899 garLoopResultBuilder]: For program point L1555-18(line 1555) no Hoare annotation was computed. [2023-11-12 02:17:50,368 INFO L899 garLoopResultBuilder]: For program point L1555-20(line 1555) no Hoare annotation was computed. [2023-11-12 02:17:50,368 INFO L899 garLoopResultBuilder]: For program point L1555-22(line 1555) no Hoare annotation was computed. [2023-11-12 02:17:50,368 INFO L899 garLoopResultBuilder]: For program point L1555-23(line 1555) no Hoare annotation was computed. [2023-11-12 02:17:50,368 INFO L899 garLoopResultBuilder]: For program point L1555-25(line 1555) no Hoare annotation was computed. [2023-11-12 02:17:50,368 INFO L899 garLoopResultBuilder]: For program point L1555-27(line 1555) no Hoare annotation was computed. [2023-11-12 02:17:50,369 INFO L899 garLoopResultBuilder]: For program point L1555-29(line 1555) no Hoare annotation was computed. [2023-11-12 02:17:50,369 INFO L899 garLoopResultBuilder]: For program point L1555-30(line 1555) no Hoare annotation was computed. [2023-11-12 02:17:50,369 INFO L895 garLoopResultBuilder]: At program point L1589(line 1589) the Hoare annotation is: false [2023-11-12 02:17:50,369 INFO L902 garLoopResultBuilder]: At program point L1672(line 1672) the Hoare annotation is: true [2023-11-12 02:17:50,369 INFO L899 garLoopResultBuilder]: For program point L1672-1(line 1672) no Hoare annotation was computed. [2023-11-12 02:17:50,369 INFO L895 garLoopResultBuilder]: At program point L1606(line 1606) the Hoare annotation is: false [2023-11-12 02:17:50,369 INFO L899 garLoopResultBuilder]: For program point L1623(lines 1623 1634) no Hoare annotation was computed. [2023-11-12 02:17:50,370 INFO L899 garLoopResultBuilder]: For program point L1557(line 1557) no Hoare annotation was computed. [2023-11-12 02:17:50,370 INFO L899 garLoopResultBuilder]: For program point L1640(lines 1640 1648) no Hoare annotation was computed. [2023-11-12 02:17:50,370 INFO L895 garLoopResultBuilder]: At program point L1574(line 1574) the Hoare annotation is: (and |ULTIMATE.start_goodB2G1_#t~switch111#1| (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) [2023-11-12 02:17:50,370 INFO L899 garLoopResultBuilder]: For program point L1657(line 1657) no Hoare annotation was computed. [2023-11-12 02:17:50,370 INFO L895 garLoopResultBuilder]: At program point L1558(line 1558) the Hoare annotation is: false [2023-11-12 02:17:50,371 INFO L902 garLoopResultBuilder]: At program point L1674(line 1674) the Hoare annotation is: true [2023-11-12 02:17:50,371 INFO L899 garLoopResultBuilder]: For program point L1674-1(line 1674) no Hoare annotation was computed. [2023-11-12 02:17:50,371 INFO L902 garLoopResultBuilder]: At program point L1658(line 1658) the Hoare annotation is: true [2023-11-12 02:17:50,371 INFO L899 garLoopResultBuilder]: For program point L1625(line 1625) no Hoare annotation was computed. [2023-11-12 02:17:50,371 INFO L899 garLoopResultBuilder]: For program point L1592(lines 1592 1608) no Hoare annotation was computed. [2023-11-12 02:17:50,371 INFO L899 garLoopResultBuilder]: For program point L1642(line 1642) no Hoare annotation was computed. [2023-11-12 02:17:50,371 INFO L899 garLoopResultBuilder]: For program point L1610(lines 1610 1635) no Hoare annotation was computed. [2023-11-12 02:17:50,372 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-12 02:17:50,372 INFO L899 garLoopResultBuilder]: For program point L1627(line 1627) no Hoare annotation was computed. [2023-11-12 02:17:50,372 INFO L899 garLoopResultBuilder]: For program point L1594(line 1594) no Hoare annotation was computed. [2023-11-12 02:17:50,372 INFO L899 garLoopResultBuilder]: For program point L1627-1(line 1627) no Hoare annotation was computed. [2023-11-12 02:17:50,372 INFO L899 garLoopResultBuilder]: For program point L1561(lines 1561 1577) no Hoare annotation was computed. [2023-11-12 02:17:50,372 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1597) no Hoare annotation was computed. [2023-11-12 02:17:50,373 INFO L895 garLoopResultBuilder]: At program point L1628(line 1628) the Hoare annotation is: (and |ULTIMATE.start_goodG2B1_#t~switch127#1| (<= 0 (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|))) [2023-11-12 02:17:50,373 INFO L899 garLoopResultBuilder]: For program point L1595(lines 1595 1603) no Hoare annotation was computed. [2023-11-12 02:17:50,373 INFO L899 garLoopResultBuilder]: For program point L1628-1(line 1628) no Hoare annotation was computed. [2023-11-12 02:17:50,373 INFO L899 garLoopResultBuilder]: For program point L1645(line 1645) no Hoare annotation was computed. [2023-11-12 02:17:50,373 INFO L899 garLoopResultBuilder]: For program point L1579(lines 1579 1609) no Hoare annotation was computed. [2023-11-12 02:17:50,374 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1653) no Hoare annotation was computed. [2023-11-12 02:17:50,374 INFO L899 garLoopResultBuilder]: For program point L1662(lines 1662 1668) no Hoare annotation was computed. [2023-11-12 02:17:50,374 INFO L899 garLoopResultBuilder]: For program point L1563(line 1563) no Hoare annotation was computed. [2023-11-12 02:17:50,374 INFO L895 garLoopResultBuilder]: At program point L1646(line 1646) the Hoare annotation is: false [2023-11-12 02:17:50,374 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 1669 1676) no Hoare annotation was computed. [2023-11-12 02:17:50,374 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1653) no Hoare annotation was computed. [2023-11-12 02:17:50,375 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1569) no Hoare annotation was computed. [2023-11-12 02:17:50,375 INFO L899 garLoopResultBuilder]: For program point L1597(line 1597) no Hoare annotation was computed. [2023-11-12 02:17:50,375 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-12 02:17:50,375 INFO L895 garLoopResultBuilder]: At program point L1564(line 1564) the Hoare annotation is: false [2023-11-12 02:17:50,375 INFO L899 garLoopResultBuilder]: For program point L1597-1(line 1597) no Hoare annotation was computed. [2023-11-12 02:17:50,375 INFO L899 garLoopResultBuilder]: For program point L1614(lines 1614 1622) no Hoare annotation was computed. [2023-11-12 02:17:50,376 INFO L899 garLoopResultBuilder]: For program point L1548(lines 1548 1578) no Hoare annotation was computed. [2023-11-12 02:17:50,376 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1569) no Hoare annotation was computed. [2023-11-12 02:17:50,376 INFO L899 garLoopResultBuilder]: For program point L1631(line 1631) no Hoare annotation was computed. [2023-11-12 02:17:50,376 INFO L895 garLoopResultBuilder]: At program point L1598(line 1598) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch125#1| (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) [2023-11-12 02:17:50,376 INFO L899 garLoopResultBuilder]: For program point L1598-1(line 1598) no Hoare annotation was computed. [2023-11-12 02:17:50,376 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-12 02:17:50,377 INFO L895 garLoopResultBuilder]: At program point L1632(line 1632) the Hoare annotation is: false [2023-11-12 02:17:50,377 INFO L899 garLoopResultBuilder]: For program point L1566(line 1566) no Hoare annotation was computed. [2023-11-12 02:17:50,377 INFO L899 garLoopResultBuilder]: For program point L1649(lines 1649 1660) no Hoare annotation was computed. [2023-11-12 02:17:50,377 INFO L899 garLoopResultBuilder]: For program point L1616(line 1616) no Hoare annotation was computed. [2023-11-12 02:17:50,377 INFO L899 garLoopResultBuilder]: For program point L1583(lines 1583 1591) no Hoare annotation was computed. [2023-11-12 02:17:50,377 INFO L899 garLoopResultBuilder]: For program point L1567(lines 1567 1575) no Hoare annotation was computed. [2023-11-12 02:17:50,377 INFO L895 garLoopResultBuilder]: At program point L1617(line 1617) the Hoare annotation is: false [2023-11-12 02:17:50,378 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-12 02:17:50,378 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1627) no Hoare annotation was computed. [2023-11-12 02:17:50,378 INFO L899 garLoopResultBuilder]: For program point L1651(line 1651) no Hoare annotation was computed. [2023-11-12 02:17:50,378 INFO L899 garLoopResultBuilder]: For program point L1585(line 1585) no Hoare annotation was computed. [2023-11-12 02:17:50,378 INFO L899 garLoopResultBuilder]: For program point L1552(lines 1552 1560) no Hoare annotation was computed. [2023-11-12 02:17:50,378 INFO L895 garLoopResultBuilder]: At program point L1602(line 1602) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch125#1| (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) [2023-11-12 02:17:50,379 INFO L899 garLoopResultBuilder]: For program point L1569(line 1569) no Hoare annotation was computed. [2023-11-12 02:17:50,379 INFO L899 garLoopResultBuilder]: For program point L1569-1(line 1569) no Hoare annotation was computed. [2023-11-12 02:17:50,379 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1627) no Hoare annotation was computed. [2023-11-12 02:17:50,379 INFO L899 garLoopResultBuilder]: For program point L1619(line 1619) no Hoare annotation was computed. [2023-11-12 02:17:50,379 INFO L899 garLoopResultBuilder]: For program point L1586(line 1586) no Hoare annotation was computed. [2023-11-12 02:17:50,379 INFO L899 garLoopResultBuilder]: For program point L1586-1(line 1586) no Hoare annotation was computed. [2023-11-12 02:17:50,380 INFO L899 garLoopResultBuilder]: For program point L1586-3(line 1586) no Hoare annotation was computed. [2023-11-12 02:17:50,380 INFO L899 garLoopResultBuilder]: For program point L1586-5(line 1586) no Hoare annotation was computed. [2023-11-12 02:17:50,380 INFO L899 garLoopResultBuilder]: For program point L1586-7(line 1586) no Hoare annotation was computed. [2023-11-12 02:17:50,380 INFO L899 garLoopResultBuilder]: For program point L1586-8(line 1586) no Hoare annotation was computed. [2023-11-12 02:17:50,380 INFO L899 garLoopResultBuilder]: For program point L1586-10(line 1586) no Hoare annotation was computed. [2023-11-12 02:17:50,380 INFO L899 garLoopResultBuilder]: For program point L1586-12(line 1586) no Hoare annotation was computed. [2023-11-12 02:17:50,380 INFO L899 garLoopResultBuilder]: For program point L1586-14(line 1586) no Hoare annotation was computed. [2023-11-12 02:17:50,381 INFO L899 garLoopResultBuilder]: For program point L1636(lines 1636 1661) no Hoare annotation was computed. [2023-11-12 02:17:50,381 INFO L895 garLoopResultBuilder]: At program point L1570(line 1570) the Hoare annotation is: (and (<= 0 (+ 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) |ULTIMATE.start_goodB2G1_#t~switch111#1| (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) [2023-11-12 02:17:50,381 INFO L899 garLoopResultBuilder]: For program point L1586-16(line 1586) no Hoare annotation was computed. [2023-11-12 02:17:50,381 INFO L899 garLoopResultBuilder]: For program point L1570-1(line 1570) no Hoare annotation was computed. [2023-11-12 02:17:50,381 INFO L899 garLoopResultBuilder]: For program point L1586-18(line 1586) no Hoare annotation was computed. [2023-11-12 02:17:50,381 INFO L899 garLoopResultBuilder]: For program point L1586-20(line 1586) no Hoare annotation was computed. [2023-11-12 02:17:50,382 INFO L899 garLoopResultBuilder]: For program point L1586-22(line 1586) no Hoare annotation was computed. [2023-11-12 02:17:50,382 INFO L899 garLoopResultBuilder]: For program point L1586-23(line 1586) no Hoare annotation was computed. [2023-11-12 02:17:50,382 INFO L899 garLoopResultBuilder]: For program point L1586-25(line 1586) no Hoare annotation was computed. [2023-11-12 02:17:50,382 INFO L899 garLoopResultBuilder]: For program point L1586-27(line 1586) no Hoare annotation was computed. [2023-11-12 02:17:50,382 INFO L899 garLoopResultBuilder]: For program point L1586-29(line 1586) no Hoare annotation was computed. [2023-11-12 02:17:50,382 INFO L899 garLoopResultBuilder]: For program point L1653(line 1653) no Hoare annotation was computed. [2023-11-12 02:17:50,383 INFO L899 garLoopResultBuilder]: For program point L1586-30(line 1586) no Hoare annotation was computed. [2023-11-12 02:17:50,383 INFO L899 garLoopResultBuilder]: For program point L1653-1(line 1653) no Hoare annotation was computed. [2023-11-12 02:17:50,383 INFO L899 garLoopResultBuilder]: For program point L1554(line 1554) no Hoare annotation was computed. [2023-11-12 02:17:50,386 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:17:50,389 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-11-12 02:17:50,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 02:17:50 BoogieIcfgContainer [2023-11-12 02:17:50,394 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-12 02:17:50,395 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-12 02:17:50,395 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-12 02:17:50,395 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-12 02:17:50,396 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:17:47" (3/4) ... [2023-11-12 02:17:50,398 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-12 02:17:50,403 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2023-11-12 02:17:50,403 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2023-11-12 02:17:50,411 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2023-11-12 02:17:50,412 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2023-11-12 02:17:50,413 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-12 02:17:50,413 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-12 02:17:50,414 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-12 02:17:50,523 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f2db595-5d1f-4fca-9582-873327ceedee/bin/uautomizer-verify-uTZkv6EMXl/witness.graphml [2023-11-12 02:17:50,523 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f2db595-5d1f-4fca-9582-873327ceedee/bin/uautomizer-verify-uTZkv6EMXl/witness.yml [2023-11-12 02:17:50,524 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-12 02:17:50,524 INFO L158 Benchmark]: Toolchain (without parser) took 5484.51ms. Allocated memory was 153.1MB in the beginning and 205.5MB in the end (delta: 52.4MB). Free memory was 109.0MB in the beginning and 112.8MB in the end (delta: -3.9MB). Peak memory consumption was 50.7MB. Max. memory is 16.1GB. [2023-11-12 02:17:50,525 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 153.1MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:17:50,525 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1512.96ms. Allocated memory was 153.1MB in the beginning and 205.5MB in the end (delta: 52.4MB). Free memory was 109.0MB in the beginning and 161.9MB in the end (delta: -53.0MB). Peak memory consumption was 70.8MB. Max. memory is 16.1GB. [2023-11-12 02:17:50,526 INFO L158 Benchmark]: Boogie Procedure Inliner took 116.92ms. Allocated memory is still 205.5MB. Free memory was 161.9MB in the beginning and 157.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-12 02:17:50,526 INFO L158 Benchmark]: Boogie Preprocessor took 81.08ms. Allocated memory is still 205.5MB. Free memory was 157.8MB in the beginning and 155.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 02:17:50,526 INFO L158 Benchmark]: RCFGBuilder took 638.79ms. Allocated memory is still 205.5MB. Free memory was 155.7MB in the beginning and 131.5MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-12 02:17:50,527 INFO L158 Benchmark]: TraceAbstraction took 2996.77ms. Allocated memory is still 205.5MB. Free memory was 131.5MB in the beginning and 120.2MB in the end (delta: 11.4MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. [2023-11-12 02:17:50,527 INFO L158 Benchmark]: Witness Printer took 129.04ms. Allocated memory is still 205.5MB. Free memory was 120.2MB in the beginning and 112.8MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-12 02:17:50,529 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.30ms. Allocated memory is still 153.1MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1512.96ms. Allocated memory was 153.1MB in the beginning and 205.5MB in the end (delta: 52.4MB). Free memory was 109.0MB in the beginning and 161.9MB in the end (delta: -53.0MB). Peak memory consumption was 70.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 116.92ms. Allocated memory is still 205.5MB. Free memory was 161.9MB in the beginning and 157.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.08ms. Allocated memory is still 205.5MB. Free memory was 157.8MB in the beginning and 155.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 638.79ms. Allocated memory is still 205.5MB. Free memory was 155.7MB in the beginning and 131.5MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 2996.77ms. Allocated memory is still 205.5MB. Free memory was 131.5MB in the beginning and 120.2MB in the end (delta: 11.4MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. * Witness Printer took 129.04ms. Allocated memory is still 205.5MB. Free memory was 120.2MB in the beginning and 112.8MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1569]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1569]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1597]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1597]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1627]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1627]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1653]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1653]: 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, 117 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 17, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 270 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 249 mSDsluCounter, 4313 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1999 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 75 IncrementalHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 2314 mSDtfsCounter, 75 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 127 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=117occurred in iteration=0, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 10 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 80 PreInvPairs, 88 NumberOfFragments, 50 HoareAnnotationTreeSize, 80 FomulaSimplifications, 12 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 18 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 697 NumberOfCodeBlocks, 697 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 680 ConstructedInterpolants, 0 QuantifiedInterpolants, 768 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 128/128 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:17:50,553 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f2db595-5d1f-4fca-9582-873327ceedee/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